{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZA73UKVLHMKCLXFVNAR2TQO3YI","short_pith_number":"pith:ZA73UKVL","schema_version":"1.0","canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","source":{"kind":"arxiv","id":"1907.07631","version":1},"attestation_state":"computed","paper":{"title":"On the Tour Towards DPLL(MAPF) and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2019-07-11T23:50:09Z","abstract_excerpt":"We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path finding (MAPF) solver fully integrated with the Davis-Putnam-Logemann-Loveland (DPLL) propositional satisfiability testing algorithm through satisfiability modulo theories (SMT). The task in MAPF is to navigate agents in an undirected graph in a non-colliding way so that each agent eventually reaches its unique goal vertex. At most one agent can reside in a vertex at a time. Agents can move instantaneously by traversing edges provided the movement does not result in a collision. Recently attempts to solve MAPF optimally w"},"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":"1907.07631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-11T23:50:09Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"3a19b876af5e848f95789a7e4febf4117bcb1b8e000fbf868e5c0e9719357d62","abstract_canon_sha256":"5444d91a1f7b9e0592ff0a76975ad80367896573b0c9349199ac5dc725d0f90f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.513052Z","signature_b64":"6gRYs79079KFYyeSm53yjUWOAstjc3b+F6gEadTpgSDQXqBlvR3h0DJFiLJphHstIvbme05GC7V3aKoVWE4xDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","last_reissued_at":"2026-05-17T23:40:21.512407Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.512407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Tour Towards DPLL(MAPF) and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2019-07-11T23:50:09Z","abstract_excerpt":"We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path finding (MAPF) solver fully integrated with the Davis-Putnam-Logemann-Loveland (DPLL) propositional satisfiability testing algorithm through satisfiability modulo theories (SMT). The task in MAPF is to navigate agents in an undirected graph in a non-colliding way so that each agent eventually reaches its unique goal vertex. At most one agent can reside in a vertex at a time. Agents can move instantaneously by traversing edges provided the movement does not result in a collision. Recently attempts to solve MAPF optimally w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07631","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":"1907.07631","created_at":"2026-05-17T23:40:21.512485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07631v1","created_at":"2026-05-17T23:40:21.512485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07631","created_at":"2026-05-17T23:40:21.512485+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA73UKVLHMKC","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA73UKVLHMKCLXFV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA73UKVL","created_at":"2026-05-18T12:33:33.725879+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/ZA73UKVLHMKCLXFVNAR2TQO3YI","json":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI.json","graph_json":"https://pith.science/api/pith-number/ZA73UKVLHMKCLXFVNAR2TQO3YI/graph.json","events_json":"https://pith.science/api/pith-number/ZA73UKVLHMKCLXFVNAR2TQO3YI/events.json","paper":"https://pith.science/paper/ZA73UKVL"},"agent_actions":{"view_html":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI","download_json":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI.json","view_paper":"https://pith.science/paper/ZA73UKVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07631&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA73UKVLHMKCLXFVNAR2TQO3YI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA73UKVLHMKCLXFVNAR2TQO3YI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/action/storage_attestation","attest_author":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/action/author_attestation","sign_citation":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/action/citation_signature","submit_replication":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/action/replication_record"}},"created_at":"2026-05-17T23:40:21.512485+00:00","updated_at":"2026-05-17T23:40:21.512485+00:00"}