{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ZPDFGWG2HKLOIOYEO6GTLKADAP","short_pith_number":"pith:ZPDFGWG2","schema_version":"1.0","canonical_sha256":"cbc65358da3a96e43b04778d35a80303d228f35ca44a98ecea0b6e2f089827ac","source":{"kind":"arxiv","id":"cs/0702124","version":5},"attestation_state":"computed","paper":{"title":"A Sequential Algorithm for Generating Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Amin Saberi, Jeong Han Kim, Mohsen Bayati","submitted_at":"2007-02-22T10:00:53Z","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"},"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":"cs/0702124","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2007-02-22T10:00:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0283b209a2ab50917c56adb57458f13e5e32fcab1891ac99e27da499b3d05e82","abstract_canon_sha256":"74b87dbfe3069555b7baebfedf3847e2080f091bef7e3b0484309c6f0d5b92da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:49.792118Z","signature_b64":"Z0d0T/v4yL9b4nblOOCNest1MKBP48vCZJD1VIrrAVwZ1kz0A/6BDbQpy8HUYNpsa6zrrKbeYxa1FNNJiYbTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc65358da3a96e43b04778d35a80303d228f35ca44a98ecea0b6e2f089827ac","last_reissued_at":"2026-05-18T04:00:49.791550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:49.791550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sequential Algorithm for Generating Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Amin Saberi, Jeong Han Kim, Mohsen Bayati","submitted_at":"2007-02-22T10:00:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702124","kind":"arxiv","version":5},"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":"cs/0702124","created_at":"2026-05-18T04:00:49.791632+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0702124v5","created_at":"2026-05-18T04:00:49.791632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702124","created_at":"2026-05-18T04:00:49.791632+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPDFGWG2HKLO","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPDFGWG2HKLOIOYE","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPDFGWG2","created_at":"2026-05-18T12:25:56.245647+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/ZPDFGWG2HKLOIOYEO6GTLKADAP","json":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP.json","graph_json":"https://pith.science/api/pith-number/ZPDFGWG2HKLOIOYEO6GTLKADAP/graph.json","events_json":"https://pith.science/api/pith-number/ZPDFGWG2HKLOIOYEO6GTLKADAP/events.json","paper":"https://pith.science/paper/ZPDFGWG2"},"agent_actions":{"view_html":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP","download_json":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP.json","view_paper":"https://pith.science/paper/ZPDFGWG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0702124&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPDFGWG2HKLOIOYEO6GTLKADAP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPDFGWG2HKLOIOYEO6GTLKADAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP/action/storage_attestation","attest_author":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP/action/author_attestation","sign_citation":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP/action/citation_signature","submit_replication":"https://pith.science/pith/ZPDFGWG2HKLOIOYEO6GTLKADAP/action/replication_record"}},"created_at":"2026-05-18T04:00:49.791632+00:00","updated_at":"2026-05-18T04:00:49.791632+00:00"}