{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IHQBFVCC75L7WFF56EUPGFZPGK","short_pith_number":"pith:IHQBFVCC","canonical_record":{"source":{"id":"1701.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-14T00:54:22Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4fdf5b8c524c168e120d7ee2a48e281d7931b58efea2a57ab288267a3efcd912","abstract_canon_sha256":"afb77b4e664d66e5ff6a676397a15c884581aa0a714fc9eb0c877261cd2a46ee"},"schema_version":"1.0"},"canonical_sha256":"41e012d442ff57fb14bdf128f3172f32936a3a665ee0b4272be29296df338c57","source":{"kind":"arxiv","id":"1701.03856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03856","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03856v2","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03856","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"IHQBFVCC75L7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHQBFVCC75L7WFF5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHQBFVCC","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IHQBFVCC75L7WFF56EUPGFZPGK","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-14T00:54:22Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4fdf5b8c524c168e120d7ee2a48e281d7931b58efea2a57ab288267a3efcd912","abstract_canon_sha256":"afb77b4e664d66e5ff6a676397a15c884581aa0a714fc9eb0c877261cd2a46ee"},"schema_version":"1.0"},"canonical_sha256":"41e012d442ff57fb14bdf128f3172f32936a3a665ee0b4272be29296df338c57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:22.149096Z","signature_b64":"mYg6K1G7zXZlTtl65kz3+AKghIaMsDGdQJ3q6fqDuelRamaQjq5PyBlxek/Y8xZgfHK3PkqoB3H2Dcfglc+ZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e012d442ff57fb14bdf128f3172f32936a3a665ee0b4272be29296df338c57","last_reissued_at":"2026-05-18T00:13:22.148345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:22.148345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03856","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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBHJ1Hv2W1DyuUmo7MN1gDJnkRmfUAwKS/oD/lPNRUPks2l6h3xRKcmBEKmAQ46bP5acNgegpi2dWcClcrhoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:52.226806Z"},"content_sha256":"550e4762f5fa46e13cd2bf22bada3b4fc6b50ee8de4c0eed60fd3e013fdf58bb","schema_version":"1.0","event_id":"sha256:550e4762f5fa46e13cd2bf22bada3b4fc6b50ee8de4c0eed60fd3e013fdf58bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IHQBFVCC75L7WFF56EUPGFZPGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The flip Markov chain for connected regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew Handley, Catherine Greenhill, Colin Cooper, Martin Dyer","submitted_at":"2017-01-14T00:54:22Z","abstract_excerpt":"Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call the flip chain, and prove that the flip chain converges rapidly to the uniform distribution over connected $2r$-regular graphs with $n$ vertices, where $n\\geq 8$ and $r = r(n)\\geq 2$. Formally, we prove that the distribution of the flip chain will be within $\\varepsilon$ of uniform in total variation distance after $\\text{poly}(n,r,\\log(\\varepsilon^{-1}))$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03856","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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tSKMYFRBrslcreh6P0CK0oITnytbTEN4RXhBBR6OBQLO9hswCUmIoKX7IVPHRwI54AuBkgHG1B0nbmIk+9nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:52.227156Z"},"content_sha256":"8186883cf281ca42d6a6d4beec1d426564217d948bc0c714bb56fc512b88fb7d","schema_version":"1.0","event_id":"sha256:8186883cf281ca42d6a6d4beec1d426564217d948bc0c714bb56fc512b88fb7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHQBFVCC75L7WFF56EUPGFZPGK/bundle.json","state_url":"https://pith.science/pith/IHQBFVCC75L7WFF56EUPGFZPGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHQBFVCC75L7WFF56EUPGFZPGK/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-04T09:22:52Z","links":{"resolver":"https://pith.science/pith/IHQBFVCC75L7WFF56EUPGFZPGK","bundle":"https://pith.science/pith/IHQBFVCC75L7WFF56EUPGFZPGK/bundle.json","state":"https://pith.science/pith/IHQBFVCC75L7WFF56EUPGFZPGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHQBFVCC75L7WFF56EUPGFZPGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IHQBFVCC75L7WFF56EUPGFZPGK","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":"afb77b4e664d66e5ff6a676397a15c884581aa0a714fc9eb0c877261cd2a46ee","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-14T00:54:22Z","title_canon_sha256":"4fdf5b8c524c168e120d7ee2a48e281d7931b58efea2a57ab288267a3efcd912"},"schema_version":"1.0","source":{"id":"1701.03856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03856","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03856v2","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03856","created_at":"2026-05-18T00:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"IHQBFVCC75L7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHQBFVCC75L7WFF5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHQBFVCC","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:8186883cf281ca42d6a6d4beec1d426564217d948bc0c714bb56fc512b88fb7d","target":"graph","created_at":"2026-05-18T00:13:22Z","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":"Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call the flip chain, and prove that the flip chain converges rapidly to the uniform distribution over connected $2r$-regular graphs with $n$ vertices, where $n\\geq 8$ and $r = r(n)\\geq 2$. Formally, we prove that the distribution of the flip chain will be within $\\varepsilon$ of uniform in total variation distance after $\\text{poly}(n,r,\\log(\\varepsilon^{-1}))$ ","authors_text":"Andrew Handley, Catherine Greenhill, Colin Cooper, Martin Dyer","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-14T00:54:22Z","title":"The flip Markov chain for connected regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03856","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:550e4762f5fa46e13cd2bf22bada3b4fc6b50ee8de4c0eed60fd3e013fdf58bb","target":"record","created_at":"2026-05-18T00:13:22Z","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":"afb77b4e664d66e5ff6a676397a15c884581aa0a714fc9eb0c877261cd2a46ee","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-14T00:54:22Z","title_canon_sha256":"4fdf5b8c524c168e120d7ee2a48e281d7931b58efea2a57ab288267a3efcd912"},"schema_version":"1.0","source":{"id":"1701.03856","kind":"arxiv","version":2}},"canonical_sha256":"41e012d442ff57fb14bdf128f3172f32936a3a665ee0b4272be29296df338c57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41e012d442ff57fb14bdf128f3172f32936a3a665ee0b4272be29296df338c57","first_computed_at":"2026-05-18T00:13:22.148345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:22.148345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mYg6K1G7zXZlTtl65kz3+AKghIaMsDGdQJ3q6fqDuelRamaQjq5PyBlxek/Y8xZgfHK3PkqoB3H2Dcfglc+ZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:22.149096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:550e4762f5fa46e13cd2bf22bada3b4fc6b50ee8de4c0eed60fd3e013fdf58bb","sha256:8186883cf281ca42d6a6d4beec1d426564217d948bc0c714bb56fc512b88fb7d"],"state_sha256":"f3c7ebc7bff2e053e85186325302de63a8b0c8ef6a87d4903a4d6ae964ad4c26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8GGpIh0wJyHwYp/p7u1b73VnuQGZoxMx+7RINK7Vf34AgCKPeuSpJvZf4Ww5dRES49hA5G42NiHe7GpsyOvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:22:52.229625Z","bundle_sha256":"a89fa6fef0672d40303d78824307803a2705b1845afdc5037fb8e837c3fb711f"}}