{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AOVTWWQS4B6KUZBSMYXSNVLINK","short_pith_number":"pith:AOVTWWQS","canonical_record":{"source":{"id":"1412.5249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T03:33:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cde9480b9dc81f14b7dbd7f108335442bf61f0d09ff35533c9c564cc25c8c50e","abstract_canon_sha256":"b3d8a25b9a0d4fea9f40034c15bf57fbfb7ce0ef86464a36be97eab7a1a9182f"},"schema_version":"1.0"},"canonical_sha256":"03ab3b5a12e07caa6432662f26d5686aa9c52c6c9517ad5c26c8e78962872b7a","source":{"kind":"arxiv","id":"1412.5249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5249","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5249v1","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5249","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"AOVTWWQS4B6K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOVTWWQS4B6KUZBS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOVTWWQS","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AOVTWWQS4B6KUZBSMYXSNVLINK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T03:33:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cde9480b9dc81f14b7dbd7f108335442bf61f0d09ff35533c9c564cc25c8c50e","abstract_canon_sha256":"b3d8a25b9a0d4fea9f40034c15bf57fbfb7ce0ef86464a36be97eab7a1a9182f"},"schema_version":"1.0"},"canonical_sha256":"03ab3b5a12e07caa6432662f26d5686aa9c52c6c9517ad5c26c8e78962872b7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:03.426408Z","signature_b64":"kg7D3K7UBnc0eFm7h8aWF/AUQcIQ8LztW6RTFeftqfFvhWsj0brSuURhNJO1ahLh2Lpu68PJdPG7+tyC7Iy0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03ab3b5a12e07caa6432662f26d5686aa9c52c6c9517ad5c26c8e78962872b7a","last_reissued_at":"2026-05-18T02:31:03.425848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:03.425848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5249","source_version":1,"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-18T02:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElzSEOg/RpzrloUm4h/aYTEmuwtSwOWkwmSNzxYL9kEQn9VUUSFzqFpux+EhZXdvQtGGYTAFpz20sc+A0lAqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:54.157595Z"},"content_sha256":"6c61cbd531487c7bff8c31dc50426bfd262f01e61a1ce1a7167c458e0eccee63","schema_version":"1.0","event_id":"sha256:6c61cbd531487c7bff8c31dc50426bfd262f01e61a1ce1a7167c458e0eccee63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AOVTWWQS4B6KUZBSMYXSNVLINK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The switch Markov chain for sampling irregular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Catherine Greenhill","submitted_at":"2014-12-17T03:33:37Z","abstract_excerpt":"The problem of efficiently sampling from a set of(undirected) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The switch chain is known to be rapidly mixing for regular degree sequences. We prove that the switch chain is rapidly mixing for any degree sequence with minimum degree at least 1 and with maximum degree $d_{\\max}$ which satisfies $3\\leq d_{\\max}\\leq \\frac{1}{4}\\, \\sqrt{M}$, where $M$ is the sum of the degrees. The mixing time bound obtained is only an order of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5249","kind":"arxiv","version":1},"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-18T02:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhhTlxtGUgHijHxPUc/AninqxKLq7NW64EG/4xIinFpr7AgSwJv1ZgkP5ynKq638z+yaiuS63ikYs9rCrtV2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:54.158335Z"},"content_sha256":"ae7c4a3ceb8b03690ec5c90567c57f7ffcbf096ebcb1d3c4ac1269be6a8c7289","schema_version":"1.0","event_id":"sha256:ae7c4a3ceb8b03690ec5c90567c57f7ffcbf096ebcb1d3c4ac1269be6a8c7289"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/bundle.json","state_url":"https://pith.science/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/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-09T03:49:54Z","links":{"resolver":"https://pith.science/pith/AOVTWWQS4B6KUZBSMYXSNVLINK","bundle":"https://pith.science/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/bundle.json","state":"https://pith.science/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOVTWWQS4B6KUZBSMYXSNVLINK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AOVTWWQS4B6KUZBSMYXSNVLINK","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":"b3d8a25b9a0d4fea9f40034c15bf57fbfb7ce0ef86464a36be97eab7a1a9182f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T03:33:37Z","title_canon_sha256":"cde9480b9dc81f14b7dbd7f108335442bf61f0d09ff35533c9c564cc25c8c50e"},"schema_version":"1.0","source":{"id":"1412.5249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5249","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5249v1","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5249","created_at":"2026-05-18T02:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"AOVTWWQS4B6K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AOVTWWQS4B6KUZBS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AOVTWWQS","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:ae7c4a3ceb8b03690ec5c90567c57f7ffcbf096ebcb1d3c4ac1269be6a8c7289","target":"graph","created_at":"2026-05-18T02:31: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":"The problem of efficiently sampling from a set of(undirected) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The switch chain is known to be rapidly mixing for regular degree sequences. We prove that the switch chain is rapidly mixing for any degree sequence with minimum degree at least 1 and with maximum degree $d_{\\max}$ which satisfies $3\\leq d_{\\max}\\leq \\frac{1}{4}\\, \\sqrt{M}$, where $M$ is the sum of the degrees. The mixing time bound obtained is only an order of ","authors_text":"Catherine Greenhill","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T03:33:37Z","title":"The switch Markov chain for sampling irregular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5249","kind":"arxiv","version":1},"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:6c61cbd531487c7bff8c31dc50426bfd262f01e61a1ce1a7167c458e0eccee63","target":"record","created_at":"2026-05-18T02:31: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":"b3d8a25b9a0d4fea9f40034c15bf57fbfb7ce0ef86464a36be97eab7a1a9182f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T03:33:37Z","title_canon_sha256":"cde9480b9dc81f14b7dbd7f108335442bf61f0d09ff35533c9c564cc25c8c50e"},"schema_version":"1.0","source":{"id":"1412.5249","kind":"arxiv","version":1}},"canonical_sha256":"03ab3b5a12e07caa6432662f26d5686aa9c52c6c9517ad5c26c8e78962872b7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03ab3b5a12e07caa6432662f26d5686aa9c52c6c9517ad5c26c8e78962872b7a","first_computed_at":"2026-05-18T02:31:03.425848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:03.425848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kg7D3K7UBnc0eFm7h8aWF/AUQcIQ8LztW6RTFeftqfFvhWsj0brSuURhNJO1ahLh2Lpu68PJdPG7+tyC7Iy0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:03.426408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c61cbd531487c7bff8c31dc50426bfd262f01e61a1ce1a7167c458e0eccee63","sha256:ae7c4a3ceb8b03690ec5c90567c57f7ffcbf096ebcb1d3c4ac1269be6a8c7289"],"state_sha256":"223e764e0c7bc87d3812e2d14054ad36751430b087afaae6aee51a37dde2fd3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Zj7l1/XGBgV4QuPvuDSlt3nTo8UMQLia67mMt8sjq2zp4koPZ22Ah4HtRlAKF2FOQriWL7xhc1D/4UgCzACCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:49:54.161989Z","bundle_sha256":"233dd1e25c817448884623a64def7680f2ac26aa9254011aeba2df8d6eb9d19e"}}