{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M4GGQFU4TXYTPV6CJBG6G2SFCS","short_pith_number":"pith:M4GGQFU4","schema_version":"1.0","canonical_sha256":"670c68169c9df137d7c2484de36a4514974d71a360d450c01c275c07d68b4643","source":{"kind":"arxiv","id":"2409.14491","version":1},"attestation_state":"computed","paper":{"title":"Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Arthur Jakobsson, Jiaoyang Li, Kevin Ren, Maxim Likhachev, Rishi Veerapaneni, Samuel Kim","submitted_at":"2024-09-22T15:36:29Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of effectively finding efficient collision-free paths for a group of agents in a shared workspace. The MAPF community has largely focused on developing high-performance heuristic search methods. Recently, several works have applied various machine learning (ML) techniques to solve MAPF, usually involving sophisticated architectures, reinforcement learning techniques, and set-ups, but none using large amounts of high-quality supervised data. Our initial objective in this work was to show how simple large scale imitation learning of high-quality heu"},"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":"2409.14491","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-09-22T15:36:29Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"47c65198a1970d3361e3f1d0444855ab95ee35f458ed447de0ea23027cc7e112","abstract_canon_sha256":"7773f3ad5ac8aab9622a57dcf29a33a97d517829e22a7ce764cccbf2bcca4033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:17.643415Z","signature_b64":"Obi9ollX1Ewd0ONZdUs0a9Z7fkiHO5sAS2tMDwpbGMBJj43koUvKxm+Da6rTlbvGtp4FQ7QgCDqybHlI7wlyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670c68169c9df137d7c2484de36a4514974d71a360d450c01c275c07d68b4643","last_reissued_at":"2026-07-05T09:10:17.642829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:17.642829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Arthur Jakobsson, Jiaoyang Li, Kevin Ren, Maxim Likhachev, Rishi Veerapaneni, Samuel Kim","submitted_at":"2024-09-22T15:36:29Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of effectively finding efficient collision-free paths for a group of agents in a shared workspace. The MAPF community has largely focused on developing high-performance heuristic search methods. Recently, several works have applied various machine learning (ML) techniques to solve MAPF, usually involving sophisticated architectures, reinforcement learning techniques, and set-ups, but none using large amounts of high-quality supervised data. Our initial objective in this work was to show how simple large scale imitation learning of high-quality heu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14491","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/2409.14491/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":"2409.14491","created_at":"2026-07-05T09:10:17.642889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14491v1","created_at":"2026-07-05T09:10:17.642889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14491","created_at":"2026-07-05T09:10:17.642889+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4GGQFU4TXYT","created_at":"2026-07-05T09:10:17.642889+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4GGQFU4TXYTPV6C","created_at":"2026-07-05T09:10:17.642889+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4GGQFU4","created_at":"2026-07-05T09:10:17.642889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07637","citing_title":"Learning to Communicate Locally for Large-Scale Multi-Agent Pathfinding","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07637","citing_title":"Learning to Communicate Locally for Large-Scale Multi-Agent Pathfinding","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05943","citing_title":"MARL-GPT: Foundation Model for Multi-Agent Reinforcement Learning","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS","json":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS.json","graph_json":"https://pith.science/api/pith-number/M4GGQFU4TXYTPV6CJBG6G2SFCS/graph.json","events_json":"https://pith.science/api/pith-number/M4GGQFU4TXYTPV6CJBG6G2SFCS/events.json","paper":"https://pith.science/paper/M4GGQFU4"},"agent_actions":{"view_html":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS","download_json":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS.json","view_paper":"https://pith.science/paper/M4GGQFU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14491&json=true","fetch_graph":"https://pith.science/api/pith-number/M4GGQFU4TXYTPV6CJBG6G2SFCS/graph.json","fetch_events":"https://pith.science/api/pith-number/M4GGQFU4TXYTPV6CJBG6G2SFCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS/action/storage_attestation","attest_author":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS/action/author_attestation","sign_citation":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS/action/citation_signature","submit_replication":"https://pith.science/pith/M4GGQFU4TXYTPV6CJBG6G2SFCS/action/replication_record"}},"created_at":"2026-07-05T09:10:17.642889+00:00","updated_at":"2026-07-05T09:10:17.642889+00:00"}