{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:B5CF2MTAIYG3OSHZLFA264ZND6","short_pith_number":"pith:B5CF2MTA","schema_version":"1.0","canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","source":{"kind":"arxiv","id":"cs/0512105","version":2},"attestation_state":"computed","paper":{"title":"A study of the edge-switching Markov-chain method for the generation of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre O. Stauffer, Valmir C. Barbosa","submitted_at":"2005-12-29T18:37:01Z","abstract_excerpt":"We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose functioning depends on a parameter w related to the method's core operation of an edge switch. We analyze two existing heuristics for adjusting w during the generation of a graph and show that they result in a Markov chain whose stationary distribution is uniform, thus ensuring that generation occurs uniformly at random. We also introduce a novel w-adjusting heurist"},"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/0512105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2005-12-29T18:37:01Z","cross_cats_sorted":[],"title_canon_sha256":"abe1d6fb9799bee2896ee21377c4ba126b665c69d4f839340c553b14bee3e4c0","abstract_canon_sha256":"260cebcb9021423a591ddc8d8659bc3d7ca3aa9c315ad59412b6808e1b73282f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:03.446958Z","signature_b64":"zzc/9oJv4g779U8ckC8Vlm8A4FpRKgF91kYRaEiFMcsEgaCug1JIMfo3+qxOqYXUA1gKifaf2d/psppiLDCmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","last_reissued_at":"2026-05-18T04:19:03.446450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:03.446450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study of the edge-switching Markov-chain method for the generation of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre O. Stauffer, Valmir C. Barbosa","submitted_at":"2005-12-29T18:37:01Z","abstract_excerpt":"We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose functioning depends on a parameter w related to the method's core operation of an edge switch. We analyze two existing heuristics for adjusting w during the generation of a graph and show that they result in a Markov chain whose stationary distribution is uniform, thus ensuring that generation occurs uniformly at random. We also introduce a novel w-adjusting heurist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512105","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":"cs/0512105","created_at":"2026-05-18T04:19:03.446535+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512105v2","created_at":"2026-05-18T04:19:03.446535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512105","created_at":"2026-05-18T04:19:03.446535+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5CF2MTAIYG3","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5CF2MTAIYG3OSHZ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5CF2MTA","created_at":"2026-05-18T12:25:53.335082+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/B5CF2MTAIYG3OSHZLFA264ZND6","json":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6.json","graph_json":"https://pith.science/api/pith-number/B5CF2MTAIYG3OSHZLFA264ZND6/graph.json","events_json":"https://pith.science/api/pith-number/B5CF2MTAIYG3OSHZLFA264ZND6/events.json","paper":"https://pith.science/paper/B5CF2MTA"},"agent_actions":{"view_html":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6","download_json":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6.json","view_paper":"https://pith.science/paper/B5CF2MTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512105&json=true","fetch_graph":"https://pith.science/api/pith-number/B5CF2MTAIYG3OSHZLFA264ZND6/graph.json","fetch_events":"https://pith.science/api/pith-number/B5CF2MTAIYG3OSHZLFA264ZND6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/action/storage_attestation","attest_author":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/action/author_attestation","sign_citation":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/action/citation_signature","submit_replication":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/action/replication_record"}},"created_at":"2026-05-18T04:19:03.446535+00:00","updated_at":"2026-05-18T04:19:03.446535+00:00"}