{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LSWUKHS5OFLN2SL7DYMJQMTUYD","short_pith_number":"pith:LSWUKHS5","schema_version":"1.0","canonical_sha256":"5cad451e5d7156dd497f1e18983274c0e1db7c0518502fe7fbf3771d3d12f8fd","source":{"kind":"arxiv","id":"0811.2853","version":2},"attestation_state":"computed","paper":{"title":"Generating Random Networks Without Short Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Andrea Montanari, Mohsen Bayati","submitted_at":"2008-11-18T08:05:26Z","abstract_excerpt":"Random graph generation is an important tool for studying large complex networks. Despite abundance of random graph models, constructing models with application-driven constraints is poorly understood. In order to advance state-of-the-art in this area, we focus on random graphs without short cycles as a stylized family of graphs, and propose the RandGraph algorithm for randomly generating them. For any constant k, when m=O(n^{1+1/[2k(k+3)]}), RandGraph generates an asymptotically uniform random graph with n vertices, m edges, and no cycle of length at most k using O(n^2m) operations. We also c"},"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":"0811.2853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-18T08:05:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"101a7c8a2af2823e78795af7bece7a42feeac06c00c4de67451e341782247e1e","abstract_canon_sha256":"9c8b2aad10c2808c90c68af95bc2bc59ea6448ef2833647693e6f2a7c2accb55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.053600Z","signature_b64":"+O4peBQlZjFPsK85BsUdw25/AGLZPSXxBKJmT+n0yXrBCjOMNsAxV9tCssRMtm6J679GxiOy1D1mEEs4a7HKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cad451e5d7156dd497f1e18983274c0e1db7c0518502fe7fbf3771d3d12f8fd","last_reissued_at":"2026-05-18T00:27:05.052936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.052936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Random Networks Without Short Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Andrea Montanari, Mohsen Bayati","submitted_at":"2008-11-18T08:05:26Z","abstract_excerpt":"Random graph generation is an important tool for studying large complex networks. Despite abundance of random graph models, constructing models with application-driven constraints is poorly understood. In order to advance state-of-the-art in this area, we focus on random graphs without short cycles as a stylized family of graphs, and propose the RandGraph algorithm for randomly generating them. For any constant k, when m=O(n^{1+1/[2k(k+3)]}), RandGraph generates an asymptotically uniform random graph with n vertices, m edges, and no cycle of length at most k using O(n^2m) operations. We also c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2853","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":"0811.2853","created_at":"2026-05-18T00:27:05.053032+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.2853v2","created_at":"2026-05-18T00:27:05.053032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2853","created_at":"2026-05-18T00:27:05.053032+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSWUKHS5OFLN","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSWUKHS5OFLN2SL7","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSWUKHS5","created_at":"2026-05-18T12:25:57.157939+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/LSWUKHS5OFLN2SL7DYMJQMTUYD","json":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD.json","graph_json":"https://pith.science/api/pith-number/LSWUKHS5OFLN2SL7DYMJQMTUYD/graph.json","events_json":"https://pith.science/api/pith-number/LSWUKHS5OFLN2SL7DYMJQMTUYD/events.json","paper":"https://pith.science/paper/LSWUKHS5"},"agent_actions":{"view_html":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD","download_json":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD.json","view_paper":"https://pith.science/paper/LSWUKHS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.2853&json=true","fetch_graph":"https://pith.science/api/pith-number/LSWUKHS5OFLN2SL7DYMJQMTUYD/graph.json","fetch_events":"https://pith.science/api/pith-number/LSWUKHS5OFLN2SL7DYMJQMTUYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD/action/storage_attestation","attest_author":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD/action/author_attestation","sign_citation":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD/action/citation_signature","submit_replication":"https://pith.science/pith/LSWUKHS5OFLN2SL7DYMJQMTUYD/action/replication_record"}},"created_at":"2026-05-18T00:27:05.053032+00:00","updated_at":"2026-05-18T00:27:05.053032+00:00"}