{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QNHRWGB352CW5ATD2K6CJV25R2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7ac5b1ec10beb0f541cb4d3a2bd9c33bb8819430e01c4c12d0ab767638aa4135","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T20:49:48Z","title_canon_sha256":"ac4afd4b53472d132a767355175086a5cc03d8b6954b9f6b56cb7eb5c874c8de"},"schema_version":"1.0","source":{"id":"1010.2516","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2516","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2516v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2516","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"QNHRWGB352CW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QNHRWGB352CW5ATD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QNHRWGB3","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:fbfdd8f588b08afff963e7b16141ae43d4c83107413cc1dd4c8270cf2a2bd833","target":"graph","created_at":"2026-05-18T04:21:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Cristiane M. Sato, Graeme Kemkes, Nicholas Wormald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T20:49:48Z","title":"Asymptotic enumeration of sparse 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2516","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf7f4875e93b1e7b62236fd1bd5af8a74dff374b1c5787c3bd05afa0280e0b3d","target":"record","created_at":"2026-05-18T04:21:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7ac5b1ec10beb0f541cb4d3a2bd9c33bb8819430e01c4c12d0ab767638aa4135","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T20:49:48Z","title_canon_sha256":"ac4afd4b53472d132a767355175086a5cc03d8b6954b9f6b56cb7eb5c874c8de"},"schema_version":"1.0","source":{"id":"1010.2516","kind":"arxiv","version":2}},"canonical_sha256":"834f1b183bee856e8263d2bc24d75d8eb37d6c344b6a44b86005f876bfb54063","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"834f1b183bee856e8263d2bc24d75d8eb37d6c344b6a44b86005f876bfb54063","first_computed_at":"2026-05-18T04:21:13.619188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:13.619188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7w5F4KjdcTMFz+c3m7ZQYVGbJ6sh5+H1BXBgHMtplVDPrI9W2DFVqeEQIpMAUmI43MPGdDyIK7Sqgdm+YLumDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:13.619930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2516","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf7f4875e93b1e7b62236fd1bd5af8a74dff374b1c5787c3bd05afa0280e0b3d","sha256:fbfdd8f588b08afff963e7b16141ae43d4c83107413cc1dd4c8270cf2a2bd833"],"state_sha256":"2fd828f1020ce0e1b1a022e0e9599195105389b54926e548927c71869d75aa86"}