{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HMLSEXKOUCRD253R2WTIKYF55W","short_pith_number":"pith:HMLSEXKO","canonical_record":{"source":{"id":"1906.03992","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-06-10T14:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"38b677ed671d84407cd97480f1fab8f74b290b5ce5b4e3b3795bbcd314db1f76","abstract_canon_sha256":"3e47574a244f80b41381ddc5f658b1a938c47873bd6b8db9b9b20d6269f4c484"},"schema_version":"1.0"},"canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","source":{"kind":"arxiv","id":"1906.03992","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03992","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03992v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03992","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"HMLSEXKOUCRD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMLSEXKOUCRD253R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMLSEXKO","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HMLSEXKOUCRD253R2WTIKYF55W","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03992","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-06-10T14:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"38b677ed671d84407cd97480f1fab8f74b290b5ce5b4e3b3795bbcd314db1f76","abstract_canon_sha256":"3e47574a244f80b41381ddc5f658b1a938c47873bd6b8db9b9b20d6269f4c484"},"schema_version":"1.0"},"canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.073393Z","signature_b64":"Qhh7VhfJi1c7lgOC2Z7mYNeODtj6rZ46Ri59NGyiNGfikZl+oLTEU/i2Hx3YUhcL2tQ5aCFiUiSMGMfO3fx4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","last_reissued_at":"2026-05-17T23:43:14.072918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.072918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03992","source_version":2,"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:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/iipMu7fq46YlhTcXnnhYwyqSwv3u7RvpJSIp6LduMnjtGNfxyKSe8y3hKFqouHz1i7djwjXPZcod0nbP+BCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:47:55.330734Z"},"content_sha256":"d3ac98ffd4461a2569260f4f68bea8e5a3f299d40162fc9a92460806c90703df","schema_version":"1.0","event_id":"sha256:d3ac98ffd4461a2569260f4f68bea8e5a3f299d40162fc9a92460806c90703df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HMLSEXKOUCRD253R2WTIKYF55W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Algorithm Selection In Multi-agent Pathfinding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Carlos Hernandez, Devon Sigurdson, Sven Koenig, Vadim Bulitko, William Yeoh","submitted_at":"2019-06-10T14:10:49Z","abstract_excerpt":"In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms, including Windowed Hierarchical Cooperative A*, Flow Annotated Replanning, and Bounded Multi-Agent A*. It is often the case that there is no a single algorithm that dominates all MAPF instances. Therefore, in this paper, we investigate the use of deep learning to automatically select the best MAPF algorithm from a portfolio of algorithms for a given MAPF problem instance. Empirical results show that our automatic alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03992","kind":"arxiv","version":2},"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:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAjncT156N+hi743ZNNbK8ek7z1E7nw1UVHbHsbWkMLZKdeteiRmmLkt6VMSs/WYbPtr2q0Xzr9jLpyrBDXYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:47:55.331114Z"},"content_sha256":"351194244a167adfbd16cc125212388d1dc297330c2f0292634d38ae2fdbec3f","schema_version":"1.0","event_id":"sha256:351194244a167adfbd16cc125212388d1dc297330c2f0292634d38ae2fdbec3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/bundle.json","state_url":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMLSEXKOUCRD253R2WTIKYF55W/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-06-06T02:47:55Z","links":{"resolver":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W","bundle":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/bundle.json","state":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMLSEXKOUCRD253R2WTIKYF55W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HMLSEXKOUCRD253R2WTIKYF55W","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":"3e47574a244f80b41381ddc5f658b1a938c47873bd6b8db9b9b20d6269f4c484","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-06-10T14:10:49Z","title_canon_sha256":"38b677ed671d84407cd97480f1fab8f74b290b5ce5b4e3b3795bbcd314db1f76"},"schema_version":"1.0","source":{"id":"1906.03992","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03992","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03992v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03992","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"HMLSEXKOUCRD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMLSEXKOUCRD253R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMLSEXKO","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:351194244a167adfbd16cc125212388d1dc297330c2f0292634d38ae2fdbec3f","target":"graph","created_at":"2026-05-17T23:43:14Z","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 a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms, including Windowed Hierarchical Cooperative A*, Flow Annotated Replanning, and Bounded Multi-Agent A*. It is often the case that there is no a single algorithm that dominates all MAPF instances. Therefore, in this paper, we investigate the use of deep learning to automatically select the best MAPF algorithm from a portfolio of algorithms for a given MAPF problem instance. Empirical results show that our automatic alg","authors_text":"Carlos Hernandez, Devon Sigurdson, Sven Koenig, Vadim Bulitko, William Yeoh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-06-10T14:10:49Z","title":"Automatic Algorithm Selection In Multi-agent Pathfinding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03992","kind":"arxiv","version":2},"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:d3ac98ffd4461a2569260f4f68bea8e5a3f299d40162fc9a92460806c90703df","target":"record","created_at":"2026-05-17T23:43:14Z","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":"3e47574a244f80b41381ddc5f658b1a938c47873bd6b8db9b9b20d6269f4c484","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2019-06-10T14:10:49Z","title_canon_sha256":"38b677ed671d84407cd97480f1fab8f74b290b5ce5b4e3b3795bbcd314db1f76"},"schema_version":"1.0","source":{"id":"1906.03992","kind":"arxiv","version":2}},"canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","first_computed_at":"2026-05-17T23:43:14.072918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:14.072918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qhh7VhfJi1c7lgOC2Z7mYNeODtj6rZ46Ri59NGyiNGfikZl+oLTEU/i2Hx3YUhcL2tQ5aCFiUiSMGMfO3fx4CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:14.073393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03992","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3ac98ffd4461a2569260f4f68bea8e5a3f299d40162fc9a92460806c90703df","sha256:351194244a167adfbd16cc125212388d1dc297330c2f0292634d38ae2fdbec3f"],"state_sha256":"49bcb33ceaae24d8ba721cd4fbfc4966c64376ef1cf909770be45f8956b2d331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWcgtxuQpx+FdkMY+iJnKTTYdHzwQg7qdJSrSxRM5nLBE+RBqWQGF8pn0yXV7/C2DecIdW8lS0N08g+Hu3LtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:47:55.334025Z","bundle_sha256":"107c4f2197831234f1a7f90ab84ed82781ca429917f56dd7efcf9f0b873c5a00"}}