{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L45R7WRMXGN6OLZPFD6JPDOYDI","short_pith_number":"pith:L45R7WRM","schema_version":"1.0","canonical_sha256":"5f3b1fda2cb99be72f2f28fc978dd81a1a72a9cf88d30d06b9539ce6c27678b0","source":{"kind":"arxiv","id":"1812.06356","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.06356","created_at":"2026-05-17T23:58:10.465983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06356v1","created_at":"2026-05-17T23:58:10.465983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06356","created_at":"2026-05-17T23:58:10.465983+00:00"},{"alias_kind":"pith_short_12","alias_value":"L45R7WRMXGN6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L45R7WRMXGN6OLZP","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L45R7WRM","created_at":"2026-05-18T12:32:33.847187+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/L45R7WRMXGN6OLZPFD6JPDOYDI","json":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI.json","graph_json":"https://pith.science/api/pith-number/L45R7WRMXGN6OLZPFD6JPDOYDI/graph.json","events_json":"https://pith.science/api/pith-number/L45R7WRMXGN6OLZPFD6JPDOYDI/events.json","paper":"https://pith.science/paper/L45R7WRM"},"agent_actions":{"view_html":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI","download_json":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI.json","view_paper":"https://pith.science/paper/L45R7WRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06356&json=true","fetch_graph":"https://pith.science/api/pith-number/L45R7WRMXGN6OLZPFD6JPDOYDI/graph.json","fetch_events":"https://pith.science/api/pith-number/L45R7WRMXGN6OLZPFD6JPDOYDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/action/storage_attestation","attest_author":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/action/author_attestation","sign_citation":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/action/citation_signature","submit_replication":"https://pith.science/pith/L45R7WRMXGN6OLZPFD6JPDOYDI/action/replication_record"}},"created_at":"2026-05-17T23:58:10.465983+00:00","updated_at":"2026-05-17T23:58:10.465983+00:00"}