{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:B5CF2MTAIYG3OSHZLFA264ZND6","short_pith_number":"pith:B5CF2MTA","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"},"canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","source":{"kind":"arxiv","id":"cs/0512105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512105","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512105v2","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512105","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"B5CF2MTAIYG3","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"B5CF2MTAIYG3OSHZ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"B5CF2MTA","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:B5CF2MTAIYG3OSHZLFA264ZND6","target":"record","payload":{"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"},"canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","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"},"source_kind":"arxiv","source_id":"cs/0512105","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0F3mO3u8M7s3iNKdgmWmfF6WrRbuw0rjazmCN48kUDdd+78/BpIfh0qHlbxsG/cOZZlHbq/1xlabfcUV8Z9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:29:57.734299Z"},"content_sha256":"b0eb78dcec384ad92f793ed7d650b560ebcab2574095c8a2aa047d7dacc96cd5","schema_version":"1.0","event_id":"sha256:b0eb78dcec384ad92f793ed7d650b560ebcab2574095c8a2aa047d7dacc96cd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:B5CF2MTAIYG3OSHZLFA264ZND6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVF6n7qaQAEXrh1dMzm+l32R7lDZE+OuReLhk/0UNqWVHXmej1+7IKmEOWGbBd62aLAxe2ldVKlQvg24d1MkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:29:57.734683Z"},"content_sha256":"b09dbe12db5acc333c7fd7043e78690490c717aab79439d65d541a117a6dc2c3","schema_version":"1.0","event_id":"sha256:b09dbe12db5acc333c7fd7043e78690490c717aab79439d65d541a117a6dc2c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/bundle.json","state_url":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5CF2MTAIYG3OSHZLFA264ZND6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T08:29:57Z","links":{"resolver":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6","bundle":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/bundle.json","state":"https://pith.science/pith/B5CF2MTAIYG3OSHZLFA264ZND6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5CF2MTAIYG3OSHZLFA264ZND6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:B5CF2MTAIYG3OSHZLFA264ZND6","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":"260cebcb9021423a591ddc8d8659bc3d7ca3aa9c315ad59412b6808e1b73282f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2005-12-29T18:37:01Z","title_canon_sha256":"abe1d6fb9799bee2896ee21377c4ba126b665c69d4f839340c553b14bee3e4c0"},"schema_version":"1.0","source":{"id":"cs/0512105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512105","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512105v2","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512105","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"B5CF2MTAIYG3","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"B5CF2MTAIYG3OSHZ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"B5CF2MTA","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:b09dbe12db5acc333c7fd7043e78690490c717aab79439d65d541a117a6dc2c3","target":"graph","created_at":"2026-05-18T04:19:03Z","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":"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","authors_text":"Alexandre O. Stauffer, Valmir C. Barbosa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2005-12-29T18:37:01Z","title":"A study of the edge-switching Markov-chain method for the generation of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512105","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:b0eb78dcec384ad92f793ed7d650b560ebcab2574095c8a2aa047d7dacc96cd5","target":"record","created_at":"2026-05-18T04:19:03Z","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":"260cebcb9021423a591ddc8d8659bc3d7ca3aa9c315ad59412b6808e1b73282f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2005-12-29T18:37:01Z","title_canon_sha256":"abe1d6fb9799bee2896ee21377c4ba126b665c69d4f839340c553b14bee3e4c0"},"schema_version":"1.0","source":{"id":"cs/0512105","kind":"arxiv","version":2}},"canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f445d3260460db748f95941af732d1fa43740f6f07c82f8b3426e3683efa147","first_computed_at":"2026-05-18T04:19:03.446450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:03.446450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzc/9oJv4g779U8ckC8Vlm8A4FpRKgF91kYRaEiFMcsEgaCug1JIMfo3+qxOqYXUA1gKifaf2d/psppiLDCmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:03.446958Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0512105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0eb78dcec384ad92f793ed7d650b560ebcab2574095c8a2aa047d7dacc96cd5","sha256:b09dbe12db5acc333c7fd7043e78690490c717aab79439d65d541a117a6dc2c3"],"state_sha256":"ba9b34741281a763b305adf9dc9198d8725e8f4b37af07932ece82b7b896177f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5peWHXg/7EOhdvm072dDU5YXxZ6ZYqu3co2LbfPO4+mB9x6vi6qNN1FKkh46Nawr14al4lZNDDsQ+44lIgHaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T08:29:57.736732Z","bundle_sha256":"8032b721e13ab28b249f31a6b6f648a0a2821e80370209608a9081ae1de81f25"}}