{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6TIT7PX67WN5NI24TL63MNF7JL","short_pith_number":"pith:6TIT7PX6","schema_version":"1.0","canonical_sha256":"f4d13fbefefd9bd6a35c9afdb634bf4acb4aadd2c1604b633a5506931134c697","source":{"kind":"arxiv","id":"1907.01700","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.01700","created_at":"2026-05-17T23:41:35.441214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01700v1","created_at":"2026-05-17T23:41:35.441214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01700","created_at":"2026-05-17T23:41:35.441214+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TIT7PX67WN5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TIT7PX67WN5NI24","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TIT7PX6","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL","json":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL.json","graph_json":"https://pith.science/api/pith-number/6TIT7PX67WN5NI24TL63MNF7JL/graph.json","events_json":"https://pith.science/api/pith-number/6TIT7PX67WN5NI24TL63MNF7JL/events.json","paper":"https://pith.science/paper/6TIT7PX6"},"agent_actions":{"view_html":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL","download_json":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL.json","view_paper":"https://pith.science/paper/6TIT7PX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01700&json=true","fetch_graph":"https://pith.science/api/pith-number/6TIT7PX67WN5NI24TL63MNF7JL/graph.json","fetch_events":"https://pith.science/api/pith-number/6TIT7PX67WN5NI24TL63MNF7JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/action/storage_attestation","attest_author":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/action/author_attestation","sign_citation":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/action/citation_signature","submit_replication":"https://pith.science/pith/6TIT7PX67WN5NI24TL63MNF7JL/action/replication_record"}},"created_at":"2026-05-17T23:41:35.441214+00:00","updated_at":"2026-05-17T23:41:35.441214+00:00"}