{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SYTXB5MPWSXXEDYWADRCZQFSRP","short_pith_number":"pith:SYTXB5MP","canonical_record":{"source":{"id":"1401.3905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"baa58b1d92a96c62c7f17dcec1135e4294af2a5a481da75f9b752174e5cb5fd4","abstract_canon_sha256":"4c3476038bd7a1da71a581bda6329a9e2c1251a790a6c0f940390245db614717"},"schema_version":"1.0"},"canonical_sha256":"962770f58fb4af720f1600e22cc0b28beaeaed050e313eb7f452de8ffdcb9760","source":{"kind":"arxiv","id":"1401.3905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3905","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3905v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3905","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"SYTXB5MPWSXX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SYTXB5MPWSXXEDYW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SYTXB5MP","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SYTXB5MPWSXXEDYWADRCZQFSRP","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"baa58b1d92a96c62c7f17dcec1135e4294af2a5a481da75f9b752174e5cb5fd4","abstract_canon_sha256":"4c3476038bd7a1da71a581bda6329a9e2c1251a790a6c0f940390245db614717"},"schema_version":"1.0"},"canonical_sha256":"962770f58fb4af720f1600e22cc0b28beaeaed050e313eb7f452de8ffdcb9760","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.092111Z","signature_b64":"zG2TP6hOb0NQhtLRzGO06FEajt00HTcHnIt1v5FQEK2xQjdyze69fmORlfrj07eMiy29pruky+GBcEkInRr8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962770f58fb4af720f1600e22cc0b28beaeaed050e313eb7f452de8ffdcb9760","last_reissued_at":"2026-05-18T03:02:06.091481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.091481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3905","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-05-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIUa5y8iri1iTw14s7tGTzDqO8gsbH8swz9VqJ/Lsj3UOLnqtNzjnXSAMgBPXrGf/KI2e/d5Fa/7tpfy8aD3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:35:03.682079Z"},"content_sha256":"c20c1619407a7394eda93dd2b0ff21b7d35f9cad6dee51c03016a04635fd7567","schema_version":"1.0","event_id":"sha256:c20c1619407a7394eda93dd2b0ff21b7d35f9cad6dee51c03016a04635fd7567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SYTXB5MPWSXXEDYWADRCZQFSRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adi Botea, Ko-Hsin Cindy Wang","submitted_at":"2014-01-16T05:21:59Z","abstract_excerpt":"Multi-agent path planning is a challenging problem with numerous real-life applications.  Running a centralized search such as A* in the combined state space of all units is complete and cost-optimal, but scales poorly, as the state space size is exponential in the number of mobile units.  Traditional decentralized approaches, such as FAR and  WHCA*, are faster and more scalable, being based on problem decomposition.  However, such methods are incomplete and provide no guarantees with respect to the running time or the solution quality.  They are not necessarily able to tell in a reasonable ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3905","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"},"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s59gDNIVSBx0ApanL3D74TvtYEVF0lM1oXb8GTp9KkWxU+6AbbfhpPpCCbPs4E0LhKUwn+G8VzWSXaxbzmq6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:35:03.682693Z"},"content_sha256":"78d879f44095bac6ec9fd3399c3fbb75ad3f6dbf143384f490c55359dce78554","schema_version":"1.0","event_id":"sha256:78d879f44095bac6ec9fd3399c3fbb75ad3f6dbf143384f490c55359dce78554"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/bundle.json","state_url":"https://pith.science/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/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-06-08T15:35:03Z","links":{"resolver":"https://pith.science/pith/SYTXB5MPWSXXEDYWADRCZQFSRP","bundle":"https://pith.science/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/bundle.json","state":"https://pith.science/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYTXB5MPWSXXEDYWADRCZQFSRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SYTXB5MPWSXXEDYWADRCZQFSRP","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":"4c3476038bd7a1da71a581bda6329a9e2c1251a790a6c0f940390245db614717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:21:59Z","title_canon_sha256":"baa58b1d92a96c62c7f17dcec1135e4294af2a5a481da75f9b752174e5cb5fd4"},"schema_version":"1.0","source":{"id":"1401.3905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3905","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3905v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3905","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"SYTXB5MPWSXX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SYTXB5MPWSXXEDYW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SYTXB5MP","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:78d879f44095bac6ec9fd3399c3fbb75ad3f6dbf143384f490c55359dce78554","target":"graph","created_at":"2026-05-18T03:02:06Z","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 path planning is a challenging problem with numerous real-life applications.  Running a centralized search such as A* in the combined state space of all units is complete and cost-optimal, but scales poorly, as the state space size is exponential in the number of mobile units.  Traditional decentralized approaches, such as FAR and  WHCA*, are faster and more scalable, being based on problem decomposition.  However, such methods are incomplete and provide no guarantees with respect to the running time or the solution quality.  They are not necessarily able to tell in a reasonable ti","authors_text":"Adi Botea, Ko-Hsin Cindy Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:21:59Z","title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3905","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:c20c1619407a7394eda93dd2b0ff21b7d35f9cad6dee51c03016a04635fd7567","target":"record","created_at":"2026-05-18T03:02:06Z","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":"4c3476038bd7a1da71a581bda6329a9e2c1251a790a6c0f940390245db614717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:21:59Z","title_canon_sha256":"baa58b1d92a96c62c7f17dcec1135e4294af2a5a481da75f9b752174e5cb5fd4"},"schema_version":"1.0","source":{"id":"1401.3905","kind":"arxiv","version":1}},"canonical_sha256":"962770f58fb4af720f1600e22cc0b28beaeaed050e313eb7f452de8ffdcb9760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"962770f58fb4af720f1600e22cc0b28beaeaed050e313eb7f452de8ffdcb9760","first_computed_at":"2026-05-18T03:02:06.091481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.091481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zG2TP6hOb0NQhtLRzGO06FEajt00HTcHnIt1v5FQEK2xQjdyze69fmORlfrj07eMiy29pruky+GBcEkInRr8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.092111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c20c1619407a7394eda93dd2b0ff21b7d35f9cad6dee51c03016a04635fd7567","sha256:78d879f44095bac6ec9fd3399c3fbb75ad3f6dbf143384f490c55359dce78554"],"state_sha256":"16ed8611427f49725f800acd18877715475d8dc3014f89717ee6fb5500d93d81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SbOXaoCRzRM06NVSClcutxx8edhwgkwY8QmWiJGrk2amahP+AULWXEx05oXEJJphFmGnYUl2hJFJZPbDUJLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:35:03.686158Z","bundle_sha256":"cc89df215a42b2aa3d06303848cfc00a2a725727677f6e430a7b8a64bebb487a"}}