{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7V2BQL6WXRSQQWMJQ5PT2FG4UR","short_pith_number":"pith:7V2BQL6W","schema_version":"1.0","canonical_sha256":"fd74182fd6bc65085989875f3d14dca44410b792fd450308d5cefe8a561090ef","source":{"kind":"arxiv","id":"1812.10851","version":1},"attestation_state":"computed","paper":{"title":"A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2018-12-28T00:36:29Z","abstract_excerpt":"In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal solvers were introduced in the past decade - two prominent categories of solvers can be distinguished: search-based solvers and compilation-based solvers.\n  Search-based solvers were developed and tested for the sum-of-costs objective while the most prominent compilation-based sol"},"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.10851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-28T00:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"2734370d38252b44eb7ceb30bee6bb24ddf2030c70019365bdbbaac78daf23c3","abstract_canon_sha256":"f516166af0aaea86941288bdbde201bd840b7f3f503de605d0f9f3319ac80601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.904876Z","signature_b64":"djZ3LIovaMd5Ieo4ZLg4Zf19g/fN7MjjI7OIdMOLRyHv9aAz1G8Kko7g9qvNOZhwkTcGn9JZt+kyAQLn40xWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd74182fd6bc65085989875f3d14dca44410b792fd450308d5cefe8a561090ef","last_reissued_at":"2026-05-17T23:57:16.904464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.904464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2018-12-28T00:36:29Z","abstract_excerpt":"In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal solvers were introduced in the past decade - two prominent categories of solvers can be distinguished: search-based solvers and compilation-based solvers.\n  Search-based solvers were developed and tested for the sum-of-costs objective while the most prominent compilation-based sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10851","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.10851","created_at":"2026-05-17T23:57:16.904526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10851v1","created_at":"2026-05-17T23:57:16.904526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10851","created_at":"2026-05-17T23:57:16.904526+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V2BQL6WXRSQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V2BQL6WXRSQQWMJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V2BQL6W","created_at":"2026-05-18T12:32:11.075285+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/7V2BQL6WXRSQQWMJQ5PT2FG4UR","json":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR.json","graph_json":"https://pith.science/api/pith-number/7V2BQL6WXRSQQWMJQ5PT2FG4UR/graph.json","events_json":"https://pith.science/api/pith-number/7V2BQL6WXRSQQWMJQ5PT2FG4UR/events.json","paper":"https://pith.science/paper/7V2BQL6W"},"agent_actions":{"view_html":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR","download_json":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR.json","view_paper":"https://pith.science/paper/7V2BQL6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10851&json=true","fetch_graph":"https://pith.science/api/pith-number/7V2BQL6WXRSQQWMJQ5PT2FG4UR/graph.json","fetch_events":"https://pith.science/api/pith-number/7V2BQL6WXRSQQWMJQ5PT2FG4UR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR/action/storage_attestation","attest_author":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR/action/author_attestation","sign_citation":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR/action/citation_signature","submit_replication":"https://pith.science/pith/7V2BQL6WXRSQQWMJQ5PT2FG4UR/action/replication_record"}},"created_at":"2026-05-17T23:57:16.904526+00:00","updated_at":"2026-05-17T23:57:16.904526+00:00"}