The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Counting unlabeled acyclic digraphs
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Theory of Groups of Finite Order
Burnside, W. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139237253 · Cited by 1,040
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
Pólya, G. (1937) · Acta Mathematica · doi:10.1007/bf02546665 · Cited by 1,009
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-10826-4 · Cited by 834
Introduction to Combinatorial Mathematics.
Moon, J. W., Dantzig, G., & Liu, C. L. (1971) · The American Mathematical Monthly · doi:10.2307/2317652 · Cited by 606
Combinatorial Mathematics and Its Applications.
O., I. (1970) · Journal of the American Statistical Association · doi:10.2307/2284618 · Cited by 544
New Directions in the Theory of Graphs
Harary, F. (1973) · Academic Press eBooks · Cited by 314
Cited by
LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLE
Lam, W., & Bacchus, F. (1994) · Computational Intelligence · doi:10.1111/j.1467-8640.1994.tb00166.x · Cited by 758
A characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425
A Survey of IoT Applications in Blockchain Systems: Architecture, Consensus, and Traffic Modeling
Lao, L., Li, Z., Hou, S., Xiao, B., Guo, S., & Yang, Y. (2021) · ACM Computing Surveys · doi:10.1145/3372136 · Cited by 304
Quantum computing at the frontiers of biological sciences
Emani, P. S., Warrell, J., Anticevic, A., Bekiranov, S., Gandal, M., McConnell, M. J., Sapiro, G., Aspuru-Guzik, A., Baker, J. T., Bastiani, M., et al. (2021) · Nature Methods · doi:10.1038/s41592-020-01004-3 · Cited by 163
Formalizing Neurath’s ship: approximate algorithms for online causal learning.
Bramley, N. R., Dayan, P., Griffiths, T. L., & Lagnado, D. A. (2017) · Psychological Review · doi:10.1037/rev0000061 · Cited by 136
Metadata
- Authors
- Robinson, R. W.
- Venue
- Lecture Notes in Mathematics
- Publisher
- Springer Berlin Heidelberg
- Published
- 1977
- Pages
- 28-43
- ISSN
- 0075-8434 (ISSN-L)
- 1617-9692
- OpenAlex
- W2076753758
- Cited by
- 368
- References
- 6
- FWCI
- 0.00
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Counting unlabeled acyclic digraphs. https://app.cochat.ai/papers/10.1007/bfb0069178
- The paper
- Robinson, R. W. (1977). Counting unlabeled acyclic digraphs. Lecture Notes in Mathematics. https://doi.org/10.1007/bfb0069178
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.
