{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VZDXURDDA2WUD7TI6SZEQ4IPNQ","short_pith_number":"pith:VZDXURDD","canonical_record":{"source":{"id":"1705.05790","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-16T16:22:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6fe70d71e439d4c649b55a396fc15a2f61eecb87c535924676d9fb9e929ae249","abstract_canon_sha256":"6d527d90fa92288f4e4e02180a5e47b4da4854b1031bb4f8a2b6910b1c42cf79"},"schema_version":"1.0"},"canonical_sha256":"ae477a446306ad41fe68f4b248710f6c2765fe616298327db08e39dba88376e0","source":{"kind":"arxiv","id":"1705.05790","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05790","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05790v4","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05790","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"VZDXURDDA2WU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VZDXURDDA2WUD7TI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VZDXURDD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VZDXURDDA2WUD7TI6SZEQ4IPNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05790","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-16T16:22:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6fe70d71e439d4c649b55a396fc15a2f61eecb87c535924676d9fb9e929ae249","abstract_canon_sha256":"6d527d90fa92288f4e4e02180a5e47b4da4854b1031bb4f8a2b6910b1c42cf79"},"schema_version":"1.0"},"canonical_sha256":"ae477a446306ad41fe68f4b248710f6c2765fe616298327db08e39dba88376e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.881592Z","signature_b64":"tD8xOn87ufh3/IRAproiLiOLdbNwXj/mV+rVAcLEXgz6O8B7GIabrZHjn3OJytzylW4uThsRBgMNEWkrQshhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae477a446306ad41fe68f4b248710f6c2765fe616298327db08e39dba88376e0","last_reissued_at":"2026-05-18T00:22:39.881171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.881171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05790","source_version":4,"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MB2hbg+WS7U16SDq/dxHTwBOSRvdgmbWPb8QTaHOV251dEQrdpHng1Ej2TL/yvPibaSVuWgvajFy8CWgBGulCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:51:27.429661Z"},"content_sha256":"ff2cdb40a42ac9e5ed2e955d6ad1cc8a03f2edcbab7a8c1b3489b052defe86a2","schema_version":"1.0","event_id":"sha256:ff2cdb40a42ac9e5ed2e955d6ad1cc8a03f2edcbab7a8c1b3489b052defe86a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VZDXURDDA2WUD7TI6SZEQ4IPNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting perfect matchings and the switch chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Haiko M\\\"uller, Martin Dyer","submitted_at":"2017-05-16T16:22:14Z","abstract_excerpt":"We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham and Holmes. We determine the largest hereditary class for which the chain is ergodic, and define a large new hereditary class of graphs for which it is rapidly mixing. We go on to show that the chain has exponential mixing time for a slightly larger class. We also examine the question of ergodicity of the switch chain in a arbitrary graph. Finally, we give exact counting algorithms for three classe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05790","kind":"arxiv","version":4},"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7XRwVTn/5HIvLCn4CiyOFIL8qUjTbPFgit6a+O1GVW1oZFQPtbvqbUT5QIgzdfWVLMxbDCt+qrboX9NCJDODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:51:27.430013Z"},"content_sha256":"139fd8e209a7997f9dfbc1a2fcd79c0e8d9ff4e364fab220b6a0a405c92eb4ec","schema_version":"1.0","event_id":"sha256:139fd8e209a7997f9dfbc1a2fcd79c0e8d9ff4e364fab220b6a0a405c92eb4ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/bundle.json","state_url":"https://pith.science/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/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-05-31T01:51:27Z","links":{"resolver":"https://pith.science/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ","bundle":"https://pith.science/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/bundle.json","state":"https://pith.science/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZDXURDDA2WUD7TI6SZEQ4IPNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VZDXURDDA2WUD7TI6SZEQ4IPNQ","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":"6d527d90fa92288f4e4e02180a5e47b4da4854b1031bb4f8a2b6910b1c42cf79","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-16T16:22:14Z","title_canon_sha256":"6fe70d71e439d4c649b55a396fc15a2f61eecb87c535924676d9fb9e929ae249"},"schema_version":"1.0","source":{"id":"1705.05790","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05790","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05790v4","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05790","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"VZDXURDDA2WU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VZDXURDDA2WUD7TI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VZDXURDD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:139fd8e209a7997f9dfbc1a2fcd79c0e8d9ff4e364fab220b6a0a405c92eb4ec","target":"graph","created_at":"2026-05-18T00:22:39Z","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 examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham and Holmes. We determine the largest hereditary class for which the chain is ergodic, and define a large new hereditary class of graphs for which it is rapidly mixing. We go on to show that the chain has exponential mixing time for a slightly larger class. We also examine the question of ergodicity of the switch chain in a arbitrary graph. Finally, we give exact counting algorithms for three classe","authors_text":"Haiko M\\\"uller, Martin Dyer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-16T16:22:14Z","title":"Counting perfect matchings and the switch chain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05790","kind":"arxiv","version":4},"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:ff2cdb40a42ac9e5ed2e955d6ad1cc8a03f2edcbab7a8c1b3489b052defe86a2","target":"record","created_at":"2026-05-18T00:22:39Z","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":"6d527d90fa92288f4e4e02180a5e47b4da4854b1031bb4f8a2b6910b1c42cf79","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-16T16:22:14Z","title_canon_sha256":"6fe70d71e439d4c649b55a396fc15a2f61eecb87c535924676d9fb9e929ae249"},"schema_version":"1.0","source":{"id":"1705.05790","kind":"arxiv","version":4}},"canonical_sha256":"ae477a446306ad41fe68f4b248710f6c2765fe616298327db08e39dba88376e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae477a446306ad41fe68f4b248710f6c2765fe616298327db08e39dba88376e0","first_computed_at":"2026-05-18T00:22:39.881171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.881171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tD8xOn87ufh3/IRAproiLiOLdbNwXj/mV+rVAcLEXgz6O8B7GIabrZHjn3OJytzylW4uThsRBgMNEWkrQshhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.881592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05790","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff2cdb40a42ac9e5ed2e955d6ad1cc8a03f2edcbab7a8c1b3489b052defe86a2","sha256:139fd8e209a7997f9dfbc1a2fcd79c0e8d9ff4e364fab220b6a0a405c92eb4ec"],"state_sha256":"368c14c429639f511f2e0142285765bed310e441507998a6283a23757c6ceb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfuU1vDeNpRIZPeQe/1FE/NEoHs3sgHCaHklnGrDGSORnsnkwWvnI5qnZqcile7L03rV1a9xWjKGW45R+UvyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:51:27.432151Z","bundle_sha256":"2ec33e666e47c5cb452d713559ef0b6d3c6e0b4313126e037dbd6dbe301eb375"}}