{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:54QTUVDDR5ZSQLSCLURBHIX534","short_pith_number":"pith:54QTUVDD","schema_version":"1.0","canonical_sha256":"ef213a54638f73282e425d2213a2fddf2bddcf28480e97e409ffb9745ed6256c","source":{"kind":"arxiv","id":"1801.04559","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Enumeration of Graph Classes with Many Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konstantinos Panagiotou, Leon Ramzews","submitted_at":"2018-01-14T14:12:24Z","abstract_excerpt":"We consider graph classes $\\mathcal G$ in which every graph has components in a class $\\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\\lvert\\mathcal{G}_{n,N}\\rvert$, the number of graphs in $\\mathcal{G}$ with $n$ vertices and $N:=\\lfloor\\lambda n\\rfloor$ components, where $\\lambda\\in(0,1)$. Assuming that the number of graphs with $n$ vertices in $\\mathcal{C}$ satisfies \\begin{align*} \\lvert \\mathcal{C}_n\\rvert\\sim b n^{-(1+\\alpha)}\\rho^{-n}n!, \\quad n\\to \\infty \\end{align*} for some $b,\\rho>0$ and $\\alpha>1$ -- a property commonly encountered in graph enu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.04559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T14:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"581088215f3e551710dd0f4d6d07828fca597211dd3266651e21724a65e0ae21","abstract_canon_sha256":"33fd8c2c7549388549fcb1efe0025680a1100a6933587018b0877ab6b790e4df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:50.637361Z","signature_b64":"/1WR6LPAHWCgzrzyOS7rbmvPKhT53eLm05+4j8NARR/dz/t1gHzxr+3eML5PheTfszU/d2zFfZ4boEZ3jCn8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef213a54638f73282e425d2213a2fddf2bddcf28480e97e409ffb9745ed6256c","last_reissued_at":"2026-05-18T00:25:50.636706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:50.636706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Enumeration of Graph Classes with Many Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konstantinos Panagiotou, Leon Ramzews","submitted_at":"2018-01-14T14:12:24Z","abstract_excerpt":"We consider graph classes $\\mathcal G$ in which every graph has components in a class $\\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\\lvert\\mathcal{G}_{n,N}\\rvert$, the number of graphs in $\\mathcal{G}$ with $n$ vertices and $N:=\\lfloor\\lambda n\\rfloor$ components, where $\\lambda\\in(0,1)$. Assuming that the number of graphs with $n$ vertices in $\\mathcal{C}$ satisfies \\begin{align*} \\lvert \\mathcal{C}_n\\rvert\\sim b n^{-(1+\\alpha)}\\rho^{-n}n!, \\quad n\\to \\infty \\end{align*} for some $b,\\rho>0$ and $\\alpha>1$ -- a property commonly encountered in graph enu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04559","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04559","created_at":"2026-05-18T00:25:50.636790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04559v1","created_at":"2026-05-18T00:25:50.636790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04559","created_at":"2026-05-18T00:25:50.636790+00:00"},{"alias_kind":"pith_short_12","alias_value":"54QTUVDDR5ZS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"54QTUVDDR5ZSQLSC","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"54QTUVDD","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534","json":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534.json","graph_json":"https://pith.science/api/pith-number/54QTUVDDR5ZSQLSCLURBHIX534/graph.json","events_json":"https://pith.science/api/pith-number/54QTUVDDR5ZSQLSCLURBHIX534/events.json","paper":"https://pith.science/paper/54QTUVDD"},"agent_actions":{"view_html":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534","download_json":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534.json","view_paper":"https://pith.science/paper/54QTUVDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/54QTUVDDR5ZSQLSCLURBHIX534/graph.json","fetch_events":"https://pith.science/api/pith-number/54QTUVDDR5ZSQLSCLURBHIX534/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534/action/storage_attestation","attest_author":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534/action/author_attestation","sign_citation":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534/action/citation_signature","submit_replication":"https://pith.science/pith/54QTUVDDR5ZSQLSCLURBHIX534/action/replication_record"}},"created_at":"2026-05-18T00:25:50.636790+00:00","updated_at":"2026-05-18T00:25:50.636790+00:00"}