{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZA73UKVLHMKCLXFVNAR2TQO3YI","short_pith_number":"pith:ZA73UKVL","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"},"canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","source":{"kind":"arxiv","id":"1907.07631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07631","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07631v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07631","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZA73UKVLHMKC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZA73UKVLHMKCLXFV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZA73UKVL","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZA73UKVLHMKCLXFVNAR2TQO3YI","target":"record","payload":{"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"},"canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","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"},"source_kind":"arxiv","source_id":"1907.07631","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:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fo5pxwLYI/Z+UL768RXX2ESWaAb1HrapIEhW2Zw3+xLGbm8H3U+to1BW3ojbt/C5engwlMrmI0NZSVoSttLxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:35:07.610073Z"},"content_sha256":"51da925da987d6b745e71c20b19b50484d14f45f27a3d69df8c034f11d74c666","schema_version":"1.0","event_id":"sha256:51da925da987d6b745e71c20b19b50484d14f45f27a3d69df8c034f11d74c666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZA73UKVLHMKCLXFVNAR2TQO3YI","target":"graph","payload":{"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"},"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:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yd1v5cXaTCUg0CbEetKze12Q2sA5cDlKsFLZyIzT6N+15u51cHyLrblRZOfQEXC/jleE7B3jJ9tfGmJlv3MZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:35:07.610438Z"},"content_sha256":"1df9033f135158104c4b89936c04edee67fd3b5d82c90a1ab1329a24ee346deb","schema_version":"1.0","event_id":"sha256:1df9033f135158104c4b89936c04edee67fd3b5d82c90a1ab1329a24ee346deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/bundle.json","state_url":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/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-28T01:35:07Z","links":{"resolver":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI","bundle":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/bundle.json","state":"https://pith.science/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZA73UKVLHMKCLXFVNAR2TQO3YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZA73UKVLHMKCLXFVNAR2TQO3YI","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":"5444d91a1f7b9e0592ff0a76975ad80367896573b0c9349199ac5dc725d0f90f","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-11T23:50:09Z","title_canon_sha256":"3a19b876af5e848f95789a7e4febf4117bcb1b8e000fbf868e5c0e9719357d62"},"schema_version":"1.0","source":{"id":"1907.07631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07631","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07631v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07631","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZA73UKVLHMKC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZA73UKVLHMKCLXFV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZA73UKVL","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:1df9033f135158104c4b89936c04edee67fd3b5d82c90a1ab1329a24ee346deb","target":"graph","created_at":"2026-05-17T23:40:21Z","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 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","authors_text":"Pavel Surynek","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-11T23:50:09Z","title":"On the Tour Towards DPLL(MAPF) and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07631","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:51da925da987d6b745e71c20b19b50484d14f45f27a3d69df8c034f11d74c666","target":"record","created_at":"2026-05-17T23:40:21Z","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":"5444d91a1f7b9e0592ff0a76975ad80367896573b0c9349199ac5dc725d0f90f","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-11T23:50:09Z","title_canon_sha256":"3a19b876af5e848f95789a7e4febf4117bcb1b8e000fbf868e5c0e9719357d62"},"schema_version":"1.0","source":{"id":"1907.07631","kind":"arxiv","version":1}},"canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c83fba2aab3b1425dcb56823a9c1dbc2051f32df7d95b437d8db3559374b07d2","first_computed_at":"2026-05-17T23:40:21.512407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:21.512407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gRYs79079KFYyeSm53yjUWOAstjc3b+F6gEadTpgSDQXqBlvR3h0DJFiLJphHstIvbme05GC7V3aKoVWE4xDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:21.513052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51da925da987d6b745e71c20b19b50484d14f45f27a3d69df8c034f11d74c666","sha256:1df9033f135158104c4b89936c04edee67fd3b5d82c90a1ab1329a24ee346deb"],"state_sha256":"2cc697ec26ba527d111891b3540b823e7b8a984a2371cdad48a86c564e67c4ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVmJTctAucKutttF8p7cWwlczEMaWkRzwU99iGeewous/fSXg1aNIYMJ+CKuX52UoVc9zkNji0TKgvFpfs+uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:35:07.612381Z","bundle_sha256":"afdd99461a6712b7721f381f306e06621be37e2bc89a725507e609ff92e599f8"}}