{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ZPDFGWG2HKLOIOYEO6GTLKADAP","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":"74b87dbfe3069555b7baebfedf3847e2080f091bef7e3b0484309c6f0d5b92da","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2007-02-22T10:00:53Z","title_canon_sha256":"0283b209a2ab50917c56adb57458f13e5e32fcab1891ac99e27da499b3d05e82"},"schema_version":"1.0","source":{"id":"cs/0702124","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702124","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702124v5","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702124","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZPDFGWG2HKLO","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZPDFGWG2HKLOIOYE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZPDFGWG2","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:06e483ba9b9f7074f83e19505028a697a26f77430fc07ec96d8e5de8fbbab73e","target":"graph","created_at":"2026-05-18T04:00:49Z","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 present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a certain range. For degree sequence $(d_i)_{i=1}^n$ with maximum degree $d_{\\max}=O(m^{1/4-\\tau})$, our algorithm generates almost uniform random graphs with that degree sequence in time $O(m\\,d_{\\max})$ where $m=\\f{1}{2}\\sum_id_i$ is the number of edges in the graph and $\\tau$ is any positive constant. The fastest known algorithm for uniform generation of these graphs McKay Wormald (1990) has a running time of $O(m^2d_{\\max}^2)$. Our method also gives an independent pr","authors_text":"Amin Saberi, Jeong Han Kim, Mohsen Bayati","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2007-02-22T10:00:53Z","title":"A Sequential Algorithm for Generating Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702124","kind":"arxiv","version":5},"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:64d562727900c32da29383970613764ad4d149e1d1f8ac09a61b9a5b979f68eb","target":"record","created_at":"2026-05-18T04:00:49Z","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":"74b87dbfe3069555b7baebfedf3847e2080f091bef7e3b0484309c6f0d5b92da","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2007-02-22T10:00:53Z","title_canon_sha256":"0283b209a2ab50917c56adb57458f13e5e32fcab1891ac99e27da499b3d05e82"},"schema_version":"1.0","source":{"id":"cs/0702124","kind":"arxiv","version":5}},"canonical_sha256":"cbc65358da3a96e43b04778d35a80303d228f35ca44a98ecea0b6e2f089827ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbc65358da3a96e43b04778d35a80303d228f35ca44a98ecea0b6e2f089827ac","first_computed_at":"2026-05-18T04:00:49.791550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:49.791550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0d0T/v4yL9b4nblOOCNest1MKBP48vCZJD1VIrrAVwZ1kz0A/6BDbQpy8HUYNpsa6zrrKbeYxa1FNNJiYbTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:49.792118Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702124","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64d562727900c32da29383970613764ad4d149e1d1f8ac09a61b9a5b979f68eb","sha256:06e483ba9b9f7074f83e19505028a697a26f77430fc07ec96d8e5de8fbbab73e"],"state_sha256":"87a63766b9fd43fe44ffba4658d2918ff75937a8e378728afd973708a09b060f"}