{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:C5SNXP5C7VRUVIHOMMCYGCDUY4","short_pith_number":"pith:C5SNXP5C","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"},"canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","source":{"kind":"arxiv","id":"2606.06686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06686","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06686v1","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06686","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"C5SNXP5C7VRU","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_16","alias_value":"C5SNXP5C7VRUVIHO","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_8","alias_value":"C5SNXP5C","created_at":"2026-06-08T01:04:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:C5SNXP5C7VRUVIHOMMCYGCDUY4","target":"record","payload":{"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"},"canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","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"},"source_kind":"arxiv","source_id":"2606.06686","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-06-08T01:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMB/iXTBi00MyvkiZzDHXnk15qLBsRJcc3lLzupoG+bKnq72Or7pW7BDGfXDjXge8l3GcMniRuX2itQtj+TuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:24:43.723329Z"},"content_sha256":"6ae6f541541750ce9262e00416e891050c6aff1195ecf442babf9e856264a903","schema_version":"1.0","event_id":"sha256:6ae6f541541750ce9262e00416e891050c6aff1195ecf442babf9e856264a903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:C5SNXP5C7VRUVIHOMMCYGCDUY4","target":"graph","payload":{"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"},"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-06-08T01:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZzZs0isIWUAAkyMF4kckFRI9dEOpyD+pHI8CuJCSEIIWua5iSIKWW4aTGoKREPGDOJUTizgnBIz3YQcrPVoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:24:43.723715Z"},"content_sha256":"0893ed3526841f085eff478baa6e0f7e2f467e1915ba68efeaeeac0962ea1606","schema_version":"1.0","event_id":"sha256:0893ed3526841f085eff478baa6e0f7e2f467e1915ba68efeaeeac0962ea1606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/bundle.json","state_url":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/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-07-03T19:24:43Z","links":{"resolver":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4","bundle":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/bundle.json","state":"https://pith.science/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5SNXP5C7VRUVIHOMMCYGCDUY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C5SNXP5C7VRUVIHOMMCYGCDUY4","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":"5d7962fe75b373f2618089018ba5be74ed0e7eb069ffafc139cd9da953b99b37","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-04T20:00:05Z","title_canon_sha256":"71c46c02faedc570fc01002f3afa554b75fec57e73f1b8b09ad3689b771be5eb"},"schema_version":"1.0","source":{"id":"2606.06686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06686","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06686v1","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06686","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"C5SNXP5C7VRU","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_16","alias_value":"C5SNXP5C7VRUVIHO","created_at":"2026-06-08T01:04:22Z"},{"alias_kind":"pith_short_8","alias_value":"C5SNXP5C","created_at":"2026-06-08T01:04:22Z"}],"graph_snapshots":[{"event_id":"sha256:0893ed3526841f085eff478baa6e0f7e2f467e1915ba68efeaeeac0962ea1606","target":"graph","created_at":"2026-06-08T01:04:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.06686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Tzvika Geft","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06686","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:6ae6f541541750ce9262e00416e891050c6aff1195ecf442babf9e856264a903","target":"record","created_at":"2026-06-08T01:04:22Z","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":"5d7962fe75b373f2618089018ba5be74ed0e7eb069ffafc139cd9da953b99b37","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-04T20:00:05Z","title_canon_sha256":"71c46c02faedc570fc01002f3afa554b75fec57e73f1b8b09ad3689b771be5eb"},"schema_version":"1.0","source":{"id":"2606.06686","kind":"arxiv","version":1}},"canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1764dbbfa2fd634aa0ee6305830874c736a0cf4f0654dc627fdc0cc5018d2ef4","first_computed_at":"2026-06-08T01:04:22.513087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:22.513087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AdE/LufxIKYuVZvAHDKlzuJRBa3qCBa5zzWHYiHiJa9ILLvs2K1ZFjmuhq0chhO3ZTNl7hS9fLULVQJJxXmADQ==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:22.513875Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae6f541541750ce9262e00416e891050c6aff1195ecf442babf9e856264a903","sha256:0893ed3526841f085eff478baa6e0f7e2f467e1915ba68efeaeeac0962ea1606"],"state_sha256":"e738e9400b29d714344807934b7047c8cf23c05a3b7f5a17d3e0d105d0669e8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IAtnKIR9nhFFk+65RbKx0ZRr+gsWEqgtsfPVIIbB318UW6jBEpVkRx7aPSgIQrFv++w7QhxYfyoKpJMzvudCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:24:43.725783Z","bundle_sha256":"4901f8f37707c045c06233bde2657bd1c30c56685836e4ca54871af4af89615f"}}