{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LSWUKHS5OFLN2SL7DYMJQMTUYD","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":"9c8b2aad10c2808c90c68af95bc2bc59ea6448ef2833647693e6f2a7c2accb55","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-18T08:05:26Z","title_canon_sha256":"101a7c8a2af2823e78795af7bece7a42feeac06c00c4de67451e341782247e1e"},"schema_version":"1.0","source":{"id":"0811.2853","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2853","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2853v2","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2853","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"LSWUKHS5OFLN","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LSWUKHS5OFLN2SL7","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LSWUKHS5","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:d38eb5234d618e366c5e7510d46015483abf9bbabdf0e659ceca381be301c1cf","target":"graph","created_at":"2026-05-18T00:27:05Z","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":"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","authors_text":"Amin Saberi, Andrea Montanari, Mohsen Bayati","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-18T08:05:26Z","title":"Generating Random Networks Without Short Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2853","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:56a5168ffe14ad68ba6b4f229041768b32b05845c86de9368f5c9b0f20c74ff2","target":"record","created_at":"2026-05-18T00:27:05Z","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":"9c8b2aad10c2808c90c68af95bc2bc59ea6448ef2833647693e6f2a7c2accb55","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-18T08:05:26Z","title_canon_sha256":"101a7c8a2af2823e78795af7bece7a42feeac06c00c4de67451e341782247e1e"},"schema_version":"1.0","source":{"id":"0811.2853","kind":"arxiv","version":2}},"canonical_sha256":"5cad451e5d7156dd497f1e18983274c0e1db7c0518502fe7fbf3771d3d12f8fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cad451e5d7156dd497f1e18983274c0e1db7c0518502fe7fbf3771d3d12f8fd","first_computed_at":"2026-05-18T00:27:05.052936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:05.052936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+O4peBQlZjFPsK85BsUdw25/AGLZPSXxBKJmT+n0yXrBCjOMNsAxV9tCssRMtm6J679GxiOy1D1mEEs4a7HKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:05.053600Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.2853","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56a5168ffe14ad68ba6b4f229041768b32b05845c86de9368f5c9b0f20c74ff2","sha256:d38eb5234d618e366c5e7510d46015483abf9bbabdf0e659ceca381be301c1cf"],"state_sha256":"267deb73b64811027a6dd8daa617b4f370b50d2d1a950f6c45466e0944a81ec4"}