{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:C5SNXP5C7VRUVIHOMMCYGCDUY4","short_pith_number":"pith:C5SNXP5C","schema_version":"1.0","canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","source":{"kind":"arxiv","id":"2606.06686","version":1},"attestation_state":"computed","paper":{"title":"On the Hardness of Optimal Motion on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Tzvika Geft","submitted_at":"2026-06-04T20:00:05Z","abstract_excerpt":"This paper presents a simple framework that settles the complexity of Multi-Agent Path Finding (MAPF) on trees across standard objectives--distance, makespan, and flowtime--for both labeled and colored variants. In MAPF, agents occupy the vertices of a graph and must move to target vertices without collisions while optimizing a given objective. In the labeled case, the agents are distinct and have respective targets; in the colored case, agents of the same color are interchangeable. While many MAPF variants are known to be intractable, several basic cases on trees have remained open. We prove "},"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":"2606.06686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-04T20:00:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"71c46c02faedc570fc01002f3afa554b75fec57e73f1b8b09ad3689b771be5eb","abstract_canon_sha256":"5d7962fe75b373f2618089018ba5be74ed0e7eb069ffafc139cd9da953b99b37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:22.513875Z","signature_b64":"AdE/LufxIKYuVZvAHDKlzuJRBa3qCBa5zzWHYiHiJa9ILLvs2K1ZFjmuhq0chhO3ZTNl7hS9fLULVQJJxXmADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","last_reissued_at":"2026-06-08T01:04:22.513087Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:22.513087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardness of Optimal Motion on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Tzvika Geft","submitted_at":"2026-06-04T20:00:05Z","abstract_excerpt":"This paper presents a simple framework that settles the complexity of Multi-Agent Path Finding (MAPF) on trees across standard objectives--distance, makespan, and flowtime--for both labeled and colored variants. In MAPF, agents occupy the vertices of a graph and must move to target vertices without collisions while optimizing a given objective. In the labeled case, the agents are distinct and have respective targets; in the colored case, agents of the same color are interchangeable. While many MAPF variants are known to be intractable, several basic cases on trees have remained open. We prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06686","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.06686/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.06686","created_at":"2026-06-08T01:04:22.513196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06686v1","created_at":"2026-06-08T01:04:22.513196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06686","created_at":"2026-06-08T01:04:22.513196+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5SNXP5C7VRU","created_at":"2026-06-08T01:04:22.513196+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5SNXP5C7VRUVIHO","created_at":"2026-06-08T01:04:22.513196+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5SNXP5C","created_at":"2026-06-08T01:04:22.513196+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/C5SNXP5C7VRUVIHOMMCYGCDUY4","json":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4.json","graph_json":"https://pith.science/api/pith-number/C5SNXP5C7VRUVIHOMMCYGCDUY4/graph.json","events_json":"https://pith.science/api/pith-number/C5SNXP5C7VRUVIHOMMCYGCDUY4/events.json","paper":"https://pith.science/paper/C5SNXP5C"},"agent_actions":{"view_html":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4","download_json":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4.json","view_paper":"https://pith.science/paper/C5SNXP5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06686&json=true","fetch_graph":"https://pith.science/api/pith-number/C5SNXP5C7VRUVIHOMMCYGCDUY4/graph.json","fetch_events":"https://pith.science/api/pith-number/C5SNXP5C7VRUVIHOMMCYGCDUY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/action/storage_attestation","attest_author":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/action/author_attestation","sign_citation":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/action/citation_signature","submit_replication":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/action/replication_record"}},"created_at":"2026-06-08T01:04:22.513196+00:00","updated_at":"2026-06-08T01:04:22.513196+00:00"}