The DOI matches its Crossref record.
A Decomposition Theorem for Partially Ordered Sets
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Trapnell, C., Williams, B. A., Pertea, G., Mortazavi, A., Kwan, G., van Baren, M. J., Salzberg, S. L., Wold, B. J., & Pachter, L. (2010) · Nature Biotechnology · doi:10.1038/nbt.1621 · Cited by 15,556
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
Wille, R. (1982) · Ordered Sets · doi:10.1007/978-94-009-7798-3_15 · Cited by 1,620
Blocking and anti-blocking pairs of polyhedra
Fulkerson, D. R. (1971) · Mathematical Programming · doi:10.1007/bf01584085 · Cited by 538
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Bridger: a new framework for de novo transcriptome assembly using RNA-seq data
Chang, Z., Li, G., Liu, J., Zhang, Y., Ashby, C., Liu, D., Cramer, C. L., & Huang, X. (2015) · Genome Biology · doi:10.1186/s13059-015-0596-2 · Cited by 288
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
Ford, L. R., & Fulkerson, D. R. (1957) · Canadian Journal of Mathematics · doi:10.4153/cjm-1957-024-0 · Cited by 286
Metadata
- Authors
- Dilworth, R. P.
- Venue
- The Annals of Mathematics
- Publisher
- JSTOR
- Published
- 1950-01
- Volume
- 51
- Issue
- 1
- Pages
- 161
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W4254807835
- Cited by
- 981
- References
- 0
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.