{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HMLSEXKOUCRD253R2WTIKYF55W","short_pith_number":"pith:HMLSEXKO","schema_version":"1.0","canonical_sha256":"3b17225d4ea0a23d7771d5a68560bded8f9210866e41a703f3af05b31f4b498b","source":{"kind":"arxiv","id":"1906.03992","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03992","created_at":"2026-05-17T23:43:14.072985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03992v2","created_at":"2026-05-17T23:43:14.072985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03992","created_at":"2026-05-17T23:43:14.072985+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMLSEXKOUCRD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMLSEXKOUCRD253R","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMLSEXKO","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19219","citing_title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W","json":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W.json","graph_json":"https://pith.science/api/pith-number/HMLSEXKOUCRD253R2WTIKYF55W/graph.json","events_json":"https://pith.science/api/pith-number/HMLSEXKOUCRD253R2WTIKYF55W/events.json","paper":"https://pith.science/paper/HMLSEXKO"},"agent_actions":{"view_html":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W","download_json":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W.json","view_paper":"https://pith.science/paper/HMLSEXKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03992&json=true","fetch_graph":"https://pith.science/api/pith-number/HMLSEXKOUCRD253R2WTIKYF55W/graph.json","fetch_events":"https://pith.science/api/pith-number/HMLSEXKOUCRD253R2WTIKYF55W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/action/storage_attestation","attest_author":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/action/author_attestation","sign_citation":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/action/citation_signature","submit_replication":"https://pith.science/pith/HMLSEXKOUCRD253R2WTIKYF55W/action/replication_record"}},"created_at":"2026-05-17T23:43:14.072985+00:00","updated_at":"2026-05-17T23:43:14.072985+00:00"}