{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HLPIVL74MB5FLBZ7CAAVXYUEO4","short_pith_number":"pith:HLPIVL74","canonical_record":{"source":{"id":"1701.07101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T23:03:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"495ba2d76049a0d031a9a0d6c680c93c1fd182f37ffe59402815909a920ef7a0","abstract_canon_sha256":"fc10f80bce6e0bc3fdbd0b9ee1fd13011abe17ec2767c28b7ca03d90b5181a8c"},"schema_version":"1.0"},"canonical_sha256":"3ade8aaffc607a55873f10015be2847725f926e13aef1d9789da32f3eeb312ac","source":{"kind":"arxiv","id":"1701.07101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07101","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07101v2","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07101","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"HLPIVL74MB5F","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HLPIVL74MB5FLBZ7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HLPIVL74","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HLPIVL74MB5FLBZ7CAAVXYUEO4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T23:03:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"495ba2d76049a0d031a9a0d6c680c93c1fd182f37ffe59402815909a920ef7a0","abstract_canon_sha256":"fc10f80bce6e0bc3fdbd0b9ee1fd13011abe17ec2767c28b7ca03d90b5181a8c"},"schema_version":"1.0"},"canonical_sha256":"3ade8aaffc607a55873f10015be2847725f926e13aef1d9789da32f3eeb312ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:34.925196Z","signature_b64":"YpUUE2fIsHXZYTzWnHWuNUycYK8GSKWtN0V66hrbcIus7w5YynNidPjlljm6k5bb2AMFotxIp/k1Q/W7Djb+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ade8aaffc607a55873f10015be2847725f926e13aef1d9789da32f3eeb312ac","last_reissued_at":"2026-05-18T00:35:34.924687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:34.924687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07101","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-18T00:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Uir0kPXTnMqcUDfqS7/oOf8U1dneD3T97T3Z15GX+9C4r8xw0iZwkJXuY3iUdy+nub1chpHokICPB/PHSuaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:28:15.327994Z"},"content_sha256":"a3c7719290747dcbccb816467db65078e2c02859edcb822cdbfa43ad357bc7e9","schema_version":"1.0","event_id":"sha256:a3c7719290747dcbccb816467db65078e2c02859edcb822cdbfa43ad357bc7e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HLPIVL74MB5FLBZ7CAAVXYUEO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The switch Markov chain for sampling irregular graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Catherine Greenhill, Matteo Sfragara","submitted_at":"2017-01-24T23:03:49Z","abstract_excerpt":"The problem of efficiently sampling from a set of (undirected, or directed) 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, both in the undirected and directed setting.\n  We prove that the switch chain for undirected graphs 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}{3}\\, \\sqrt{M}$, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07101","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-18T00:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ovKUUV9THuA2aL1iC7lKkkalSkl8AapVCJSlSxuYukal9LPUX53jcamAFezloUVq+zmAZL17Z8jZYpNc5ScBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:28:15.328750Z"},"content_sha256":"b1f0bf7427ea800c33eae9bf987a19ff7ff4bdd1e840b1555d6154b1718d3aca","schema_version":"1.0","event_id":"sha256:b1f0bf7427ea800c33eae9bf987a19ff7ff4bdd1e840b1555d6154b1718d3aca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/bundle.json","state_url":"https://pith.science/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/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-08T20:28:15Z","links":{"resolver":"https://pith.science/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4","bundle":"https://pith.science/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/bundle.json","state":"https://pith.science/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLPIVL74MB5FLBZ7CAAVXYUEO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HLPIVL74MB5FLBZ7CAAVXYUEO4","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":"fc10f80bce6e0bc3fdbd0b9ee1fd13011abe17ec2767c28b7ca03d90b5181a8c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T23:03:49Z","title_canon_sha256":"495ba2d76049a0d031a9a0d6c680c93c1fd182f37ffe59402815909a920ef7a0"},"schema_version":"1.0","source":{"id":"1701.07101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07101","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07101v2","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07101","created_at":"2026-05-18T00:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"HLPIVL74MB5F","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HLPIVL74MB5FLBZ7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HLPIVL74","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:b1f0bf7427ea800c33eae9bf987a19ff7ff4bdd1e840b1555d6154b1718d3aca","target":"graph","created_at":"2026-05-18T00:35:34Z","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, or directed) 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, both in the undirected and directed setting.\n  We prove that the switch chain for undirected graphs 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}{3}\\, \\sqrt{M}$, where","authors_text":"Catherine Greenhill, Matteo Sfragara","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T23:03:49Z","title":"The switch Markov chain for sampling irregular graphs and digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07101","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:a3c7719290747dcbccb816467db65078e2c02859edcb822cdbfa43ad357bc7e9","target":"record","created_at":"2026-05-18T00:35:34Z","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":"fc10f80bce6e0bc3fdbd0b9ee1fd13011abe17ec2767c28b7ca03d90b5181a8c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T23:03:49Z","title_canon_sha256":"495ba2d76049a0d031a9a0d6c680c93c1fd182f37ffe59402815909a920ef7a0"},"schema_version":"1.0","source":{"id":"1701.07101","kind":"arxiv","version":2}},"canonical_sha256":"3ade8aaffc607a55873f10015be2847725f926e13aef1d9789da32f3eeb312ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ade8aaffc607a55873f10015be2847725f926e13aef1d9789da32f3eeb312ac","first_computed_at":"2026-05-18T00:35:34.924687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:34.924687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YpUUE2fIsHXZYTzWnHWuNUycYK8GSKWtN0V66hrbcIus7w5YynNidPjlljm6k5bb2AMFotxIp/k1Q/W7Djb+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:34.925196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3c7719290747dcbccb816467db65078e2c02859edcb822cdbfa43ad357bc7e9","sha256:b1f0bf7427ea800c33eae9bf987a19ff7ff4bdd1e840b1555d6154b1718d3aca"],"state_sha256":"09df8484ceaf854b5a5643d5511375e3d26e36b2ae07e072cfa9dfd6aeed876b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvgbWTjcQua9uaDKufFZbHpRoV2jLVYvVydeB1tG+Tg7v3TJJPkzHEyLcLZc8rFilyGG7U3LztiI/Zg5ea3+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:28:15.332750Z","bundle_sha256":"e5bacb354abc71d1aa5e5187134343bbebe32331ca75bf6ed429a037321af15f"}}