{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6TIT7PX67WN5NI24TL63MNF7JL","short_pith_number":"pith:6TIT7PX6","canonical_record":{"source":{"id":"1907.01700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-03T01:51:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8109608e2f04015550999b24942d56f433bb85c4c3e1812d7d271c4a4c6f7c1a","abstract_canon_sha256":"e65ecca30c230c67c3e75f0976fecab78ad5a623e5fed25db5332f6c4c0abf12"},"schema_version":"1.0"},"canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","source":{"kind":"arxiv","id":"1907.01700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01700","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01700v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01700","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"6TIT7PX67WN5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6TIT7PX67WN5NI24","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6TIT7PX6","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6TIT7PX67WN5NI24TL63MNF7JL","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-03T01:51:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8109608e2f04015550999b24942d56f433bb85c4c3e1812d7d271c4a4c6f7c1a","abstract_canon_sha256":"e65ecca30c230c67c3e75f0976fecab78ad5a623e5fed25db5332f6c4c0abf12"},"schema_version":"1.0"},"canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.441747Z","signature_b64":"Imxo5Su1wIPkgnjSD4p/H7a/PExjp67GGjgkP6rMrHnFgmUcl+U3C3VNGHoQ53bnSzPQFI87LhumtUidNmhUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","last_reissued_at":"2026-05-17T23:41:35.441103Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.441103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01700","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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtzzENmNgZZHY+TmsXN4wuHRPG2Ut3fOqot6yDPq0OdLDyKlp89aLmrFBJm/FEFyiHSz0KPOPsJ5M+TErc82AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:41.137680Z"},"content_sha256":"e057f2836e75fb7fd19c38ea33d5c4aa525f4a34e342161a09cd100c0de4527e","schema_version":"1.0","event_id":"sha256:e057f2836e75fb7fd19c38ea33d5c4aa525f4a34e342161a09cd100c0de4527e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6TIT7PX67WN5NI24TL63MNF7JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Reconfiguration of Perfect Matchings via Alternating Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Naonori Kakimura, Naoyuki Kamiyama, Takehiro Ito, Yoshio Okamoto, Yusuke Kobayashi","submitted_at":"2019-07-03T01:51:33Z","abstract_excerpt":"Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching to another given perfect matching such that the symmetric difference of each pair of consecutive perfect matchings is a single cycle. The problem is equivalent to the combinatorial shortest path problem in perfect matching polytopes. We prove that the problem is NP-hard even when a given graph is planar or bipartite, but it can be solved in pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01700","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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjDyz/MGe71iNOCxKiQFqYQlMqrgrJqa/dc3KCmIub0pBG3D/cFhqrVghEC3HRmZ2+OxdNp5lZlvQ1VOMwWMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:41.138382Z"},"content_sha256":"e1fabbde65a6dfe6346de59abd86324b76089608e3d8533cb29db1c4317f4041","schema_version":"1.0","event_id":"sha256:e1fabbde65a6dfe6346de59abd86324b76089608e3d8533cb29db1c4317f4041"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/bundle.json","state_url":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TIT7PX67WN5NI24TL63MNF7JL/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-25T23:09:41Z","links":{"resolver":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL","bundle":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/bundle.json","state":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TIT7PX67WN5NI24TL63MNF7JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6TIT7PX67WN5NI24TL63MNF7JL","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":"e65ecca30c230c67c3e75f0976fecab78ad5a623e5fed25db5332f6c4c0abf12","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-03T01:51:33Z","title_canon_sha256":"8109608e2f04015550999b24942d56f433bb85c4c3e1812d7d271c4a4c6f7c1a"},"schema_version":"1.0","source":{"id":"1907.01700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01700","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01700v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01700","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"6TIT7PX67WN5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6TIT7PX67WN5NI24","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6TIT7PX6","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e1fabbde65a6dfe6346de59abd86324b76089608e3d8533cb29db1c4317f4041","target":"graph","created_at":"2026-05-17T23:41:35Z","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":"Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching to another given perfect matching such that the symmetric difference of each pair of consecutive perfect matchings is a single cycle. The problem is equivalent to the combinatorial shortest path problem in perfect matching polytopes. We prove that the problem is NP-hard even when a given graph is planar or bipartite, but it can be solved in pol","authors_text":"Naonori Kakimura, Naoyuki Kamiyama, Takehiro Ito, Yoshio Okamoto, Yusuke Kobayashi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-03T01:51:33Z","title":"Shortest Reconfiguration of Perfect Matchings via Alternating Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01700","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:e057f2836e75fb7fd19c38ea33d5c4aa525f4a34e342161a09cd100c0de4527e","target":"record","created_at":"2026-05-17T23:41:35Z","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":"e65ecca30c230c67c3e75f0976fecab78ad5a623e5fed25db5332f6c4c0abf12","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-03T01:51:33Z","title_canon_sha256":"8109608e2f04015550999b24942d56f433bb85c4c3e1812d7d271c4a4c6f7c1a"},"schema_version":"1.0","source":{"id":"1907.01700","kind":"arxiv","version":1}},"canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","first_computed_at":"2026-05-17T23:41:35.441103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:35.441103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Imxo5Su1wIPkgnjSD4p/H7a/PExjp67GGjgkP6rMrHnFgmUcl+U3C3VNGHoQ53bnSzPQFI87LhumtUidNmhUDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:35.441747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e057f2836e75fb7fd19c38ea33d5c4aa525f4a34e342161a09cd100c0de4527e","sha256:e1fabbde65a6dfe6346de59abd86324b76089608e3d8533cb29db1c4317f4041"],"state_sha256":"2c6d02a40c8b9a09fc087a447b8cdf44e388e370e3fbd953c2427e7975859fde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7nSYbmlls7WigNAcWFOKgsjqMAY5tcoAlLZDUwN1LBBUfDvwi3uL91LYxvqVgAY+usWGZ5sHxSge2Oz+QHtHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:09:41.144819Z","bundle_sha256":"ff36ce759ee5343752a772207f115551c527d9d167092078f6015fd2dfe9c7e2"}}