{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:VEUVCBRZQAEH3DJOO4FEUMOX2G","short_pith_number":"pith:VEUVCBRZ","schema_version":"1.0","canonical_sha256":"a92951063980087d8d2e770a4a31d7d1b874f451436e9d1b487054b21ea6ee13","source":{"kind":"arxiv","id":"cond-mat/0312028","version":2},"attestation_state":"computed","paper":{"title":"On the uniform generation of random graphs with prescribed degree sequences","license":"","headline":"","cross_cats":["q-bio.MN"],"primary_cat":"cond-mat.stat-mech","authors_text":"M. E. J. Newman, N. Kashtan, R. Milo, S. Itzkovitz, U. Alon","submitted_at":"2003-12-01T18:49:09Z","abstract_excerpt":"Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we briefly review two existing methods for the generation of random graphs with arbitrary degree sequences, which we call the ``switching'' and ``matching'' methods, and present a new method based on the ``go with the winners'' Monte Carlo method. The matching method may suffer from nonuniform sampling, while the switching method has no general theoretical boun"},"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":"cond-mat/0312028","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-12-01T18:49:09Z","cross_cats_sorted":["q-bio.MN"],"title_canon_sha256":"1b7e721a348120ee583332ca86d9193291ebdcdec6237e61d7fcb1c1163c1bed","abstract_canon_sha256":"5fb1ae15d2a0c873940b0a866047f18c65b2f97a968eb9f96e38925a47667436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:20:42.680909Z","signature_b64":"mOr0ueDRtZD8uXa18FJyJAfes+YarkepKdgsoGaox5sHnWkpwGA04F6QW223Qb4ET0B0EFdJSw+qq4qbijNhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a92951063980087d8d2e770a4a31d7d1b874f451436e9d1b487054b21ea6ee13","last_reissued_at":"2026-07-04T14:20:42.680511Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:20:42.680511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the uniform generation of random graphs with prescribed degree sequences","license":"","headline":"","cross_cats":["q-bio.MN"],"primary_cat":"cond-mat.stat-mech","authors_text":"M. E. J. Newman, N. Kashtan, R. Milo, S. Itzkovitz, U. Alon","submitted_at":"2003-12-01T18:49:09Z","abstract_excerpt":"Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we briefly review two existing methods for the generation of random graphs with arbitrary degree sequences, which we call the ``switching'' and ``matching'' methods, and present a new method based on the ``go with the winners'' Monte Carlo method. The matching method may suffer from nonuniform sampling, while the switching method has no general theoretical boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0312028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0312028/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cond-mat/0312028","created_at":"2026-07-04T14:20:42.680580+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0312028v2","created_at":"2026-07-04T14:20:42.680580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0312028","created_at":"2026-07-04T14:20:42.680580+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEUVCBRZQAEH","created_at":"2026-07-04T14:20:42.680580+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEUVCBRZQAEH3DJO","created_at":"2026-07-04T14:20:42.680580+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEUVCBRZ","created_at":"2026-07-04T14:20:42.680580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16365","citing_title":"A collaborative constrained graph diffusion model for the generation of realistic synthetic molecules","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G","json":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G.json","graph_json":"https://pith.science/api/pith-number/VEUVCBRZQAEH3DJOO4FEUMOX2G/graph.json","events_json":"https://pith.science/api/pith-number/VEUVCBRZQAEH3DJOO4FEUMOX2G/events.json","paper":"https://pith.science/paper/VEUVCBRZ"},"agent_actions":{"view_html":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G","download_json":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G.json","view_paper":"https://pith.science/paper/VEUVCBRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0312028&json=true","fetch_graph":"https://pith.science/api/pith-number/VEUVCBRZQAEH3DJOO4FEUMOX2G/graph.json","fetch_events":"https://pith.science/api/pith-number/VEUVCBRZQAEH3DJOO4FEUMOX2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G/action/storage_attestation","attest_author":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G/action/author_attestation","sign_citation":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G/action/citation_signature","submit_replication":"https://pith.science/pith/VEUVCBRZQAEH3DJOO4FEUMOX2G/action/replication_record"}},"created_at":"2026-07-04T14:20:42.680580+00:00","updated_at":"2026-07-04T14:20:42.680580+00:00"}