{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O7XWHDLGU34HRSZQSPCKRJIWYQ","short_pith_number":"pith:O7XWHDLG","canonical_record":{"source":{"id":"1707.00228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"17c42eeb43af9947235d52b493ef2bc1ddd7be19dd36bd3f0766abded30d5bc3","abstract_canon_sha256":"66e812675c661aa7b7373de8556a2ba534ae5a2abf888582ca5e27ad376d96f2"},"schema_version":"1.0"},"canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","source":{"kind":"arxiv","id":"1707.00228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00228","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00228v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00228","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"O7XWHDLGU34H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7XWHDLGU34HRSZQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7XWHDLG","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O7XWHDLGU34HRSZQSPCKRJIWYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"17c42eeb43af9947235d52b493ef2bc1ddd7be19dd36bd3f0766abded30d5bc3","abstract_canon_sha256":"66e812675c661aa7b7373de8556a2ba534ae5a2abf888582ca5e27ad376d96f2"},"schema_version":"1.0"},"canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.048465Z","signature_b64":"PXaGqsFhoUQCa07onpGCT+G+34mQrboPQ0Mg0mOnwHQr0DcYB5cOR2we0O9p6hgWynSWrTisBHmowzlTtCQLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","last_reissued_at":"2026-05-18T00:41:04.047725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.047725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00228","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CsQPlETsw8CLcWGPsFWDMdWbplvne9djsHaZHTdhaF0F7HKWRVUtXeFE3vdJMPPhIWBemrm5xWGc8rPTXYnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:28:22.929715Z"},"content_sha256":"9e4fbb9e2aec0fe676f63ef1d355bbd3dd95b6ad8a53bc94772f9139114a30ee","schema_version":"1.0","event_id":"sha256:9e4fbb9e2aec0fe676f63ef1d355bbd3dd95b6ad8a53bc94772f9139114a30ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O7XWHDLGU34HRSZQSPCKRJIWYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Eli Boyarski, Pavel Surynek, Roni Stern","submitted_at":"2017-07-02T03:08:26Z","abstract_excerpt":"In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00228","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Spw1gv1KyfgxEH8cKe93eiSrEQaqBNQhrCu9MJCwBy+zyUwFb2e5GfCKaAFlyh9DO8lUKXRKaET4Y/ASlhADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:28:22.930069Z"},"content_sha256":"18217fbe77e3d5bd19735841f2a3585217fbe579297d495359831bfe51c20d80","schema_version":"1.0","event_id":"sha256:18217fbe77e3d5bd19735841f2a3585217fbe579297d495359831bfe51c20d80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/bundle.json","state_url":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/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-27T23:28:22Z","links":{"resolver":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ","bundle":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/bundle.json","state":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O7XWHDLGU34HRSZQSPCKRJIWYQ","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":"66e812675c661aa7b7373de8556a2ba534ae5a2abf888582ca5e27ad376d96f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","title_canon_sha256":"17c42eeb43af9947235d52b493ef2bc1ddd7be19dd36bd3f0766abded30d5bc3"},"schema_version":"1.0","source":{"id":"1707.00228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00228","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00228v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00228","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"O7XWHDLGU34H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O7XWHDLGU34HRSZQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O7XWHDLG","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:18217fbe77e3d5bd19735841f2a3585217fbe579297d495359831bfe51c20d80","target":"graph","created_at":"2026-05-18T00:41:04Z","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":"In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers.","authors_text":"Ariel Felner, Eli Boyarski, Pavel Surynek, Roni Stern","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","title":"Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00228","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:9e4fbb9e2aec0fe676f63ef1d355bbd3dd95b6ad8a53bc94772f9139114a30ee","target":"record","created_at":"2026-05-18T00:41:04Z","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":"66e812675c661aa7b7373de8556a2ba534ae5a2abf888582ca5e27ad376d96f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","title_canon_sha256":"17c42eeb43af9947235d52b493ef2bc1ddd7be19dd36bd3f0766abded30d5bc3"},"schema_version":"1.0","source":{"id":"1707.00228","kind":"arxiv","version":1}},"canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","first_computed_at":"2026-05-18T00:41:04.047725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:04.047725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PXaGqsFhoUQCa07onpGCT+G+34mQrboPQ0Mg0mOnwHQr0DcYB5cOR2we0O9p6hgWynSWrTisBHmowzlTtCQLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:04.048465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e4fbb9e2aec0fe676f63ef1d355bbd3dd95b6ad8a53bc94772f9139114a30ee","sha256:18217fbe77e3d5bd19735841f2a3585217fbe579297d495359831bfe51c20d80"],"state_sha256":"7f75affbb85a96ea64b70acec47dc1931cb0e74ec8400a1c3c46bcd036b97f40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbAhWcVV0I+yqGMzZv4Ln1PmMvsRlqTU3xDyK+2VwgI0HIxkZ4gdFsLLe0po5lvFsyHZJoEIARr1FgND03q2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:28:22.932154Z","bundle_sha256":"3a352071076281f041556888737e775ad6d0f0390ed57473eb28e1ebb398ba03"}}