{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QNHRWGB352CW5ATD2K6CJV25R2","short_pith_number":"pith:QNHRWGB3","schema_version":"1.0","canonical_sha256":"834f1b183bee856e8263d2bc24d75d8eb37d6c344b6a44b86005f876bfb54063","source":{"kind":"arxiv","id":"1010.2516","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic enumeration of sparse 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Graeme Kemkes, Nicholas Wormald","submitted_at":"2010-10-12T20:49:48Z","abstract_excerpt":"We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\\to\\infty$ and $m=O(n\\log n)$ as $n\\to\\infty$. This is the entire range of $m$ not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2-edge-connectedness is treated similarly. We also obtain formulae for the number of 2-connected graphs with given degree sequence for most (`typical') sequences. Our main result solves a problem of Wright from 1983."},"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":"1010.2516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T20:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"ac4afd4b53472d132a767355175086a5cc03d8b6954b9f6b56cb7eb5c874c8de","abstract_canon_sha256":"7ac5b1ec10beb0f541cb4d3a2bd9c33bb8819430e01c4c12d0ab767638aa4135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.619930Z","signature_b64":"7w5F4KjdcTMFz+c3m7ZQYVGbJ6sh5+H1BXBgHMtplVDPrI9W2DFVqeEQIpMAUmI43MPGdDyIK7Sqgdm+YLumDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834f1b183bee856e8263d2bc24d75d8eb37d6c344b6a44b86005f876bfb54063","last_reissued_at":"2026-05-18T04:21:13.619188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.619188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of sparse 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Graeme Kemkes, Nicholas Wormald","submitted_at":"2010-10-12T20:49:48Z","abstract_excerpt":"We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\\to\\infty$ and $m=O(n\\log n)$ as $n\\to\\infty$. This is the entire range of $m$ not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2-edge-connectedness is treated similarly. We also obtain formulae for the number of 2-connected graphs with given degree sequence for most (`typical') sequences. Our main result solves a problem of Wright from 1983."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2516","kind":"arxiv","version":2},"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":"1010.2516","created_at":"2026-05-18T04:21:13.619298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2516v2","created_at":"2026-05-18T04:21:13.619298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2516","created_at":"2026-05-18T04:21:13.619298+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNHRWGB352CW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNHRWGB352CW5ATD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNHRWGB3","created_at":"2026-05-18T12:26:12.377268+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/QNHRWGB352CW5ATD2K6CJV25R2","json":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2.json","graph_json":"https://pith.science/api/pith-number/QNHRWGB352CW5ATD2K6CJV25R2/graph.json","events_json":"https://pith.science/api/pith-number/QNHRWGB352CW5ATD2K6CJV25R2/events.json","paper":"https://pith.science/paper/QNHRWGB3"},"agent_actions":{"view_html":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2","download_json":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2.json","view_paper":"https://pith.science/paper/QNHRWGB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2516&json=true","fetch_graph":"https://pith.science/api/pith-number/QNHRWGB352CW5ATD2K6CJV25R2/graph.json","fetch_events":"https://pith.science/api/pith-number/QNHRWGB352CW5ATD2K6CJV25R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2/action/storage_attestation","attest_author":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2/action/author_attestation","sign_citation":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2/action/citation_signature","submit_replication":"https://pith.science/pith/QNHRWGB352CW5ATD2K6CJV25R2/action/replication_record"}},"created_at":"2026-05-18T04:21:13.619298+00:00","updated_at":"2026-05-18T04:21:13.619298+00:00"}