{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VALVEMBDITBX4EMSJ6QXEIEUVW","short_pith_number":"pith:VALVEMBD","canonical_record":{"source":{"id":"1904.06184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T12:22:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8830bf24f0582f2a4b1e296ee3eeadecacd7b834ff9e1de599a01a99504e6e32","abstract_canon_sha256":"4a783b5122f43413a34086897ac37e76e984ea9afbb9e4bd2f1dfc8805fc743e"},"schema_version":"1.0"},"canonical_sha256":"a81752302344c37e11924fa1722094ad89f9de43e44cd078f7091394d6755cf0","source":{"kind":"arxiv","id":"1904.06184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06184","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06184v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06184","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"VALVEMBDITBX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VALVEMBDITBX4EMS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VALVEMBD","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VALVEMBDITBX4EMSJ6QXEIEUVW","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T12:22:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8830bf24f0582f2a4b1e296ee3eeadecacd7b834ff9e1de599a01a99504e6e32","abstract_canon_sha256":"4a783b5122f43413a34086897ac37e76e984ea9afbb9e4bd2f1dfc8805fc743e"},"schema_version":"1.0"},"canonical_sha256":"a81752302344c37e11924fa1722094ad89f9de43e44cd078f7091394d6755cf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.874216Z","signature_b64":"koL6WYJwYvIckf+6nwno/paZk8rFc/zKJnCMc1ncGEkp/GmsR0+xwg5+tFUK+VpCOHlwuU5Ml6NZp9/uHDSuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a81752302344c37e11924fa1722094ad89f9de43e44cd078f7091394d6755cf0","last_reissued_at":"2026-05-17T23:48:43.873660Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.873660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06184","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJdXNJbI+I0yPPAUJbmTKhxSZWDXAKKEhDwlK8TF8qJ92HoMxg+abfN1YTSbwd4vzpAboBE75M37PO9/+fLHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:33:47.219670Z"},"content_sha256":"b1fb2fbf6d2ec3d7ad82fa9e50e8671f070ee1d73f1023f4de6fa59548aef494","schema_version":"1.0","event_id":"sha256:b1fb2fbf6d2ec3d7ad82fa9e50e8671f070ee1d73f1023f4de6fa59548aef494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VALVEMBDITBX4EMSJ6QXEIEUVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Perfect Matching Reconfiguration Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arnaud Mary, Kunihiro Wasa, Marc Heinrich, Marthe Bonamy, Moritz M\\\"uhlenthaler, Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi","submitted_at":"2019-04-12T12:22:24Z","abstract_excerpt":"We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of length four. We are interested in the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem is PSPACE-complete even for split graphs and for bipartite graphs of bounded bandwidth with maximum degree five. We then investigate polynomial-time solvable cases. Specifically, we prove that the problem is solvable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06184","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+NCKadrqIDkFYCf4sFsOVBcGGUMer0eX4QsMLa8Ape35hwgfGCLOVBqbqt4+fCGRiQqeO6rfIzzD+krgkIzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:33:47.220278Z"},"content_sha256":"360432b922db7218cbda3eea82944fbb146fc55e4ec3154dbd4bf1090ae7f18a","schema_version":"1.0","event_id":"sha256:360432b922db7218cbda3eea82944fbb146fc55e4ec3154dbd4bf1090ae7f18a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/bundle.json","state_url":"https://pith.science/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/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-25T22:33:47Z","links":{"resolver":"https://pith.science/pith/VALVEMBDITBX4EMSJ6QXEIEUVW","bundle":"https://pith.science/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/bundle.json","state":"https://pith.science/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VALVEMBDITBX4EMSJ6QXEIEUVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VALVEMBDITBX4EMSJ6QXEIEUVW","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":"4a783b5122f43413a34086897ac37e76e984ea9afbb9e4bd2f1dfc8805fc743e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T12:22:24Z","title_canon_sha256":"8830bf24f0582f2a4b1e296ee3eeadecacd7b834ff9e1de599a01a99504e6e32"},"schema_version":"1.0","source":{"id":"1904.06184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06184","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06184v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06184","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"VALVEMBDITBX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VALVEMBDITBX4EMS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VALVEMBD","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:360432b922db7218cbda3eea82944fbb146fc55e4ec3154dbd4bf1090ae7f18a","target":"graph","created_at":"2026-05-17T23:48:43Z","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 perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of length four. We are interested in the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem is PSPACE-complete even for split graphs and for bipartite graphs of bounded bandwidth with maximum degree five. We then investigate polynomial-time solvable cases. Specifically, we prove that the problem is solvable ","authors_text":"Arnaud Mary, Kunihiro Wasa, Marc Heinrich, Marthe Bonamy, Moritz M\\\"uhlenthaler, Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T12:22:24Z","title":"The Perfect Matching Reconfiguration Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06184","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:b1fb2fbf6d2ec3d7ad82fa9e50e8671f070ee1d73f1023f4de6fa59548aef494","target":"record","created_at":"2026-05-17T23:48:43Z","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":"4a783b5122f43413a34086897ac37e76e984ea9afbb9e4bd2f1dfc8805fc743e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-12T12:22:24Z","title_canon_sha256":"8830bf24f0582f2a4b1e296ee3eeadecacd7b834ff9e1de599a01a99504e6e32"},"schema_version":"1.0","source":{"id":"1904.06184","kind":"arxiv","version":1}},"canonical_sha256":"a81752302344c37e11924fa1722094ad89f9de43e44cd078f7091394d6755cf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a81752302344c37e11924fa1722094ad89f9de43e44cd078f7091394d6755cf0","first_computed_at":"2026-05-17T23:48:43.873660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:43.873660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"koL6WYJwYvIckf+6nwno/paZk8rFc/zKJnCMc1ncGEkp/GmsR0+xwg5+tFUK+VpCOHlwuU5Ml6NZp9/uHDSuBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:43.874216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1fb2fbf6d2ec3d7ad82fa9e50e8671f070ee1d73f1023f4de6fa59548aef494","sha256:360432b922db7218cbda3eea82944fbb146fc55e4ec3154dbd4bf1090ae7f18a"],"state_sha256":"d629e8c3625ef8dd0312777cb052c45f4e08730bee9fdcd905a84128b110313a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/DqjxXgZoeDggioHXwyMBTE3d+sMSAs9Z0SgIpIqmM3/Wi2YIxWb/4L2+oQpDAfBi8pLa4LMG9/ddhBI6gTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:33:47.223547Z","bundle_sha256":"eb9fa3e099894549ae2a768c97ec79bc53d0c88f81dbb23a21f57f280d82ed23"}}