{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JBE6UMIZSN576UESZR6MAWUHGX","short_pith_number":"pith:JBE6UMIZ","schema_version":"1.0","canonical_sha256":"4849ea3119937bff5092cc7cc05a8735d8a51f3039b34a0904a5d78272766cb9","source":{"kind":"arxiv","id":"2109.14695","version":1},"attestation_state":"computed","paper":{"title":"Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Howie Choset, Lakshay Virmani, Sivakumar Rathinam, Zhongqiang Ren","submitted_at":"2021-09-29T20:01:04Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple agents from their respective start to goal locations. MAPF is challenging as the joint configuration space grows exponentially with respect to the number of agents. Among MAPF planners, search-based methods, such as CBS and M*, effectively bypass the curse of dimensionality by employing a dynamically-coupled strategy: agents are planned in a fully decoupled manner at first, where potential conflicts between agents are ignored; and then agents either follow their individual plans or are coupled together for planning to resol"},"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":"2109.14695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-29T20:01:04Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"b627dea81dba1a4e4485bbf041e2c97ea6e0f39918d9c925188a132731ab505e","abstract_canon_sha256":"22f3e6fdbe4cc0e01ed97ffdce0a14af83535d9f77151ccb9f10b07d05b97b0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:43.475583Z","signature_b64":"NgX56bYs8Oyd5T3jcuq6rc1EQh4X2DB6G/mUPR4REMPEKlr+Uh2w+eYcFQ7ssciVoWBgq4udiYStZo0lFAFmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4849ea3119937bff5092cc7cc05a8735d8a51f3039b34a0904a5d78272766cb9","last_reissued_at":"2026-07-05T03:18:43.475161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:43.475161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Howie Choset, Lakshay Virmani, Sivakumar Rathinam, Zhongqiang Ren","submitted_at":"2021-09-29T20:01:04Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple agents from their respective start to goal locations. MAPF is challenging as the joint configuration space grows exponentially with respect to the number of agents. Among MAPF planners, search-based methods, such as CBS and M*, effectively bypass the curse of dimensionality by employing a dynamically-coupled strategy: agents are planned in a fully decoupled manner at first, where potential conflicts between agents are ignored; and then agents either follow their individual plans or are coupled together for planning to resol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.14695","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.14695/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.14695","created_at":"2026-07-05T03:18:43.475217+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.14695v1","created_at":"2026-07-05T03:18:43.475217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.14695","created_at":"2026-07-05T03:18:43.475217+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBE6UMIZSN57","created_at":"2026-07-05T03:18:43.475217+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBE6UMIZSN576UES","created_at":"2026-07-05T03:18:43.475217+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBE6UMIZ","created_at":"2026-07-05T03:18:43.475217+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04905","citing_title":"PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX","json":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX.json","graph_json":"https://pith.science/api/pith-number/JBE6UMIZSN576UESZR6MAWUHGX/graph.json","events_json":"https://pith.science/api/pith-number/JBE6UMIZSN576UESZR6MAWUHGX/events.json","paper":"https://pith.science/paper/JBE6UMIZ"},"agent_actions":{"view_html":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX","download_json":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX.json","view_paper":"https://pith.science/paper/JBE6UMIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.14695&json=true","fetch_graph":"https://pith.science/api/pith-number/JBE6UMIZSN576UESZR6MAWUHGX/graph.json","fetch_events":"https://pith.science/api/pith-number/JBE6UMIZSN576UESZR6MAWUHGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX/action/storage_attestation","attest_author":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX/action/author_attestation","sign_citation":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX/action/citation_signature","submit_replication":"https://pith.science/pith/JBE6UMIZSN576UESZR6MAWUHGX/action/replication_record"}},"created_at":"2026-07-05T03:18:43.475217+00:00","updated_at":"2026-07-05T03:18:43.475217+00:00"}