{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MN2ER5GYNZBOUFHRPGJS2K2XRC","short_pith_number":"pith:MN2ER5GY","canonical_record":{"source":{"id":"1901.05506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"e8b4897006937a0000ef908db106094c0f2813f03740e201b4c77ccc35d45ba2","abstract_canon_sha256":"86f96001056f50149e6e6b15ec0b933c853d2f6d59d92a1fc005239d370db3cc"},"schema_version":"1.0"},"canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","source":{"kind":"arxiv","id":"1901.05506","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05506","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05506v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05506","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"MN2ER5GYNZBO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MN2ER5GYNZBOUFHR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MN2ER5GY","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MN2ER5GYNZBOUFHRPGJS2K2XRC","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"e8b4897006937a0000ef908db106094c0f2813f03740e201b4c77ccc35d45ba2","abstract_canon_sha256":"86f96001056f50149e6e6b15ec0b933c853d2f6d59d92a1fc005239d370db3cc"},"schema_version":"1.0"},"canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.318947Z","signature_b64":"x78pyyrA1BpeIqSNU021YP5spjuIE8qDNVGCBSHorFv89KPmuBJD0WOA0M4mSFKI1Hdj79gECMzD55M3CaYTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","last_reissued_at":"2026-05-17T23:43:23.318264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.318264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05506","source_version":3,"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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfSR50CHLe63S1p3jWsXKfZcrWZm851BWO/EMFZ+jXf2Yq+J01nq1aTlfpfVSEfCrYmZNo6Zlg94rb63FNEBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:37:48.213613Z"},"content_sha256":"112a46443a94eb062e598ac6d3451e417a2da7e73ab31ac7f7287fc65ce06c33","schema_version":"1.0","event_id":"sha256:112a46443a94eb062e598ac6d3451e417a2da7e73ab31ac7f7287fc65ce06c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MN2ER5GYNZBOUFHRPGJS2K2XRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Pathfinding with Continuous Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anton Andreychuk, Dor Atzmon, Konstantin Yakovlev, Roni Stern","submitted_at":"2019-01-16T19:34:03Z","abstract_excerpt":"Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF was on grids, assumed agents' actions have uniform duration, and that time is discretized into timesteps. We propose a MAPF algorithm that does not rely on these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel adaptation of Safe interval path planning (SIPP), a continuous time single-agent planning algorithm, and a modified version of Conflict-based search (CBS), a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05506","kind":"arxiv","version":3},"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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ck/c5AcHDrz+JopjL9AwSzYwB+McHWDlu606Lx0mOlsM0lBOiaoWv9oRjFXv7r2tKJ4+ivHYg08liGNRAUIFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:37:48.214034Z"},"content_sha256":"cd2279684cdec13725bd5a3d3fd01303f23219c68aa76b2e49d32e0729b727e5","schema_version":"1.0","event_id":"sha256:cd2279684cdec13725bd5a3d3fd01303f23219c68aa76b2e49d32e0729b727e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/bundle.json","state_url":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/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-27T14:37:48Z","links":{"resolver":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC","bundle":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/bundle.json","state":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MN2ER5GYNZBOUFHRPGJS2K2XRC","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":"86f96001056f50149e6e6b15ec0b933c853d2f6d59d92a1fc005239d370db3cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","title_canon_sha256":"e8b4897006937a0000ef908db106094c0f2813f03740e201b4c77ccc35d45ba2"},"schema_version":"1.0","source":{"id":"1901.05506","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05506","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05506v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05506","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"MN2ER5GYNZBO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MN2ER5GYNZBOUFHR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MN2ER5GY","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:cd2279684cdec13725bd5a3d3fd01303f23219c68aa76b2e49d32e0729b727e5","target":"graph","created_at":"2026-05-17T23:43:23Z","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":"Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF was on grids, assumed agents' actions have uniform duration, and that time is discretized into timesteps. We propose a MAPF algorithm that does not rely on these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel adaptation of Safe interval path planning (SIPP), a continuous time single-agent planning algorithm, and a modified version of Conflict-based search (CBS), a s","authors_text":"Anton Andreychuk, Dor Atzmon, Konstantin Yakovlev, Roni Stern","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","title":"Multi-Agent Pathfinding with Continuous Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05506","kind":"arxiv","version":3},"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:112a46443a94eb062e598ac6d3451e417a2da7e73ab31ac7f7287fc65ce06c33","target":"record","created_at":"2026-05-17T23:43:23Z","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":"86f96001056f50149e6e6b15ec0b933c853d2f6d59d92a1fc005239d370db3cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","title_canon_sha256":"e8b4897006937a0000ef908db106094c0f2813f03740e201b4c77ccc35d45ba2"},"schema_version":"1.0","source":{"id":"1901.05506","kind":"arxiv","version":3}},"canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","first_computed_at":"2026-05-17T23:43:23.318264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:23.318264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x78pyyrA1BpeIqSNU021YP5spjuIE8qDNVGCBSHorFv89KPmuBJD0WOA0M4mSFKI1Hdj79gECMzD55M3CaYTDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:23.318947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05506","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:112a46443a94eb062e598ac6d3451e417a2da7e73ab31ac7f7287fc65ce06c33","sha256:cd2279684cdec13725bd5a3d3fd01303f23219c68aa76b2e49d32e0729b727e5"],"state_sha256":"014cadcc640e1d671098332038a80ebf08552b4bf34012eca04bddee3e6286af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VonZmEVfFE9n3pQHX8ojD8FjrpQMxciwyBX3T+55q/IxbO2d5KPoGVULfx/mJgRgpgAAOH+pcsHjQOGpvXdPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:37:48.216975Z","bundle_sha256":"80665b410e8c7b0b7131d14592cbf19608106c040ec3c598cae93cd937314377"}}