{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L45R7WRMXGN6OLZPFD6JPDOYDI","short_pith_number":"pith:L45R7WRM","canonical_record":{"source":{"id":"1812.06356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-15T21:00:17Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"783a8a881aae9e81061088ab6e54332717618c7e7d10da93462c047984f47449","abstract_canon_sha256":"6d574de933252193ac8448174888c698f57359cf2927c40a13605eefe5d5a9cc"},"schema_version":"1.0"},"canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","source":{"kind":"arxiv","id":"1812.06356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06356","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06356v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06356","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"L45R7WRMXGN6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L45R7WRMXGN6OLZP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L45R7WRM","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L45R7WRMXGN6OLZPFD6JPDOYDI","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-15T21:00:17Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"783a8a881aae9e81061088ab6e54332717618c7e7d10da93462c047984f47449","abstract_canon_sha256":"6d574de933252193ac8448174888c698f57359cf2927c40a13605eefe5d5a9cc"},"schema_version":"1.0"},"canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.466410Z","signature_b64":"EGdWXGG5dcjhXydHomR8KzrurQcD8jMaCmybcR3iWS9juE9mq2Oi8SsrPEmHItRXJd3TJLPn+wkJbJjwbaEmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","last_reissued_at":"2026-05-17T23:58:10.465912Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.465912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06356","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5igDX27O0VfRrNEpLhYNjWIYihamdpB43Vrz6TM1fPhsh7x09SMb4br2aeahzBqUd2Whqk1HvdcpXtw/xvwEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:38:44.666151Z"},"content_sha256":"460c243981c639a2020dc2a6952257171f893a97a2bafa527572fac16cb88f16","schema_version":"1.0","event_id":"sha256:460c243981c639a2020dc2a6952257171f893a97a2bafa527572fac16cb88f16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L45R7WRMXGN6OLZPFD6JPDOYDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Searching with Consistent Prioritization for Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Daniel Harabor, Hang Ma, Jiaoyang Li, Peter J. Stuckey, Sven Koenig","submitted_at":"2018-12-15T21:00:17Z","abstract_excerpt":"We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06356","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U89NQNG4oxkR+hI0ASuSLBJLVHibyr0kScWBIbR1YKyX4+Xb46xpYYqQ9XtYjjwjIVQVVq+/3d0fqJvwGylwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:38:44.666817Z"},"content_sha256":"84952a6fa34cbd306904f86ae73c739214cedd7a6951e22ca53ab91990fd6f2d","schema_version":"1.0","event_id":"sha256:84952a6fa34cbd306904f86ae73c739214cedd7a6951e22ca53ab91990fd6f2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/bundle.json","state_url":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/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-26T15:38:44Z","links":{"resolver":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI","bundle":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/bundle.json","state":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L45R7WRMXGN6OLZPFD6JPDOYDI","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":"6d574de933252193ac8448174888c698f57359cf2927c40a13605eefe5d5a9cc","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-15T21:00:17Z","title_canon_sha256":"783a8a881aae9e81061088ab6e54332717618c7e7d10da93462c047984f47449"},"schema_version":"1.0","source":{"id":"1812.06356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06356","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06356v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06356","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"L45R7WRMXGN6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L45R7WRMXGN6OLZP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L45R7WRM","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:84952a6fa34cbd306904f86ae73c739214cedd7a6951e22ca53ab91990fd6f2d","target":"graph","created_at":"2026-05-17T23:58:10Z","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":"We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore th","authors_text":"Daniel Harabor, Hang Ma, Jiaoyang Li, Peter J. Stuckey, Sven Koenig","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-15T21:00:17Z","title":"Searching with Consistent Prioritization for Multi-Agent Path Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06356","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:460c243981c639a2020dc2a6952257171f893a97a2bafa527572fac16cb88f16","target":"record","created_at":"2026-05-17T23:58:10Z","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":"6d574de933252193ac8448174888c698f57359cf2927c40a13605eefe5d5a9cc","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-15T21:00:17Z","title_canon_sha256":"783a8a881aae9e81061088ab6e54332717618c7e7d10da93462c047984f47449"},"schema_version":"1.0","source":{"id":"1812.06356","kind":"arxiv","version":1}},"canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","first_computed_at":"2026-05-17T23:58:10.465912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.465912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EGdWXGG5dcjhXydHomR8KzrurQcD8jMaCmybcR3iWS9juE9mq2Oi8SsrPEmHItRXJd3TJLPn+wkJbJjwbaEmDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.466410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:460c243981c639a2020dc2a6952257171f893a97a2bafa527572fac16cb88f16","sha256:84952a6fa34cbd306904f86ae73c739214cedd7a6951e22ca53ab91990fd6f2d"],"state_sha256":"a56c1a20e549e76c45df315c53911add126dfa539924a046102c718cfa50fcfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBybRh5wQqA64UFuOFOXhiU/Fm1rv1sGlazgGBlADvq7Ti2kxoXS+G+pFur9PZq8tGX6hcWh8wHVEzrtncbCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:38:44.669634Z","bundle_sha256":"309589f3650e6ce7f9142b13dbb3ac6f831aa9d5b465c1a493be6f074f66eda6"}}