{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VGWLHHSR2AOTZDKLQJ54GCEL64","short_pith_number":"pith:VGWLHHSR","schema_version":"1.0","canonical_sha256":"a9acb39e51d01d3c8d4b827bc3088bf7170b31baf52108c0d0b9fa2a1e311bed","source":{"kind":"arxiv","id":"1812.05419","version":1},"attestation_state":"computed","paper":{"title":"Shortest Reconfiguration of Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Moritz M\\\"uhlenthaler, Nicolas Bousquet, Takehiro Ito, Tatsuhiko Hatanaka","submitted_at":"2018-12-13T13:32:16Z","abstract_excerpt":"Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the distance between two token configurations (resp., the corresponding matchings), which is given by the length of a shortest transformation. We give a polynomial-time algorithm for the case that at least one of the two configurations is not inclusion-wise maximal and show that otherwise, the problem admits no polynomial-time sublogarithmic-factor approximatio"},"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":"1812.05419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T13:32:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0f63145a28bf3926b511f3dc64c75503d5efb492557528f7a6cdae83ca1525e2","abstract_canon_sha256":"c6f6845be2e21d82ebb2d5d07cd17cb100cf60d39b0292cd0795282c48973c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:20.279811Z","signature_b64":"BVEKhUJjYiF8fOzTpA/TeUrbEnkdSSgq+n2DWq0aC9hkz2cS8t+/+E4XZ7m8jmEsuZ+NAW3NwXwTl0V+rFiYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9acb39e51d01d3c8d4b827bc3088bf7170b31baf52108c0d0b9fa2a1e311bed","last_reissued_at":"2026-05-17T23:58:20.279192Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:20.279192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Reconfiguration of Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Moritz M\\\"uhlenthaler, Nicolas Bousquet, Takehiro Ito, Tatsuhiko Hatanaka","submitted_at":"2018-12-13T13:32:16Z","abstract_excerpt":"Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the distance between two token configurations (resp., the corresponding matchings), which is given by the length of a shortest transformation. We give a polynomial-time algorithm for the case that at least one of the two configurations is not inclusion-wise maximal and show that otherwise, the problem admits no polynomial-time sublogarithmic-factor approximatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05419","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":"1812.05419","created_at":"2026-05-17T23:58:20.279293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05419v1","created_at":"2026-05-17T23:58:20.279293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05419","created_at":"2026-05-17T23:58:20.279293+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGWLHHSR2AOT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGWLHHSR2AOTZDKL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGWLHHSR","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.01700","citing_title":"Shortest Reconfiguration of Perfect Matchings via Alternating Cycles","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01863","citing_title":"Linear transformations between colorings in chordal graphs","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64","json":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64.json","graph_json":"https://pith.science/api/pith-number/VGWLHHSR2AOTZDKLQJ54GCEL64/graph.json","events_json":"https://pith.science/api/pith-number/VGWLHHSR2AOTZDKLQJ54GCEL64/events.json","paper":"https://pith.science/paper/VGWLHHSR"},"agent_actions":{"view_html":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64","download_json":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64.json","view_paper":"https://pith.science/paper/VGWLHHSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05419&json=true","fetch_graph":"https://pith.science/api/pith-number/VGWLHHSR2AOTZDKLQJ54GCEL64/graph.json","fetch_events":"https://pith.science/api/pith-number/VGWLHHSR2AOTZDKLQJ54GCEL64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64/action/storage_attestation","attest_author":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64/action/author_attestation","sign_citation":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64/action/citation_signature","submit_replication":"https://pith.science/pith/VGWLHHSR2AOTZDKLQJ54GCEL64/action/replication_record"}},"created_at":"2026-05-17T23:58:20.279293+00:00","updated_at":"2026-05-17T23:58:20.279293+00:00"}