{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EUMIXTOUQIICKVAWFJWPQAGJQG","short_pith_number":"pith:EUMIXTOU","schema_version":"1.0","canonical_sha256":"25188bcdd482102554162a6cf800c981ac503bcee8784684295147b2c1768d1c","source":{"kind":"arxiv","id":"2407.14931","version":3},"attestation_state":"computed","paper":{"title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.LG","authors_text":"Aleksandr Panov, Alexander Chernyavskiy, Alexey Skrynnik, Anatolii Borzilov, Anton Andreychuk, Konstantin Yakovlev","submitted_at":"2024-07-20T16:37:21Z","abstract_excerpt":"Multi-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments, typically involving a small number of agents and full observability. Moreover, a range of crucial robotics-related tasks, such as multi-robot pathfinding, which have traditionally been approached with classical non-learnable methods (e.g., heuristic search), are now being suggested for solution using learning-based or hybrid methods. However, in this domain, it remains difficult, if not impossible, to conduct a fair comparison between "},"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":"2407.14931","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-20T16:37:21Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"ea1793033f1f78d4c3472f68eff7a6517904f9c222cae54b585429a0f6a8fc39","abstract_canon_sha256":"b543270edcf049b8e57155ad977e249aa4905db0dd12c07c87ed4d9886f769a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:53.995733Z","signature_b64":"qS9YWiJU2Gl0M4PRawQ2/pQb7JRoXmgRTRRY9qHG2ocUbnk7NTieY4XPakEUFX0NohDwc5TI4YsED0O3pfjtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25188bcdd482102554162a6cf800c981ac503bcee8784684295147b2c1768d1c","last_reissued_at":"2026-07-05T10:45:53.995200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:53.995200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.LG","authors_text":"Aleksandr Panov, Alexander Chernyavskiy, Alexey Skrynnik, Anatolii Borzilov, Anton Andreychuk, Konstantin Yakovlev","submitted_at":"2024-07-20T16:37:21Z","abstract_excerpt":"Multi-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments, typically involving a small number of agents and full observability. Moreover, a range of crucial robotics-related tasks, such as multi-robot pathfinding, which have traditionally been approached with classical non-learnable methods (e.g., heuristic search), are now being suggested for solution using learning-based or hybrid methods. However, in this domain, it remains difficult, if not impossible, to conduct a fair comparison between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14931","kind":"arxiv","version":3},"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/2407.14931/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":"2407.14931","created_at":"2026-07-05T10:45:53.995263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14931v3","created_at":"2026-07-05T10:45:53.995263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14931","created_at":"2026-07-05T10:45:53.995263+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUMIXTOUQIIC","created_at":"2026-07-05T10:45:53.995263+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUMIXTOUQIICKVAW","created_at":"2026-07-05T10:45:53.995263+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUMIXTOU","created_at":"2026-07-05T10:45:53.995263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20929","citing_title":"STEAM: A Training-Free Congestion-Aware Enhancement Framework for Decentralized Multi-Agent Path Finding","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20857","citing_title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG","json":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG.json","graph_json":"https://pith.science/api/pith-number/EUMIXTOUQIICKVAWFJWPQAGJQG/graph.json","events_json":"https://pith.science/api/pith-number/EUMIXTOUQIICKVAWFJWPQAGJQG/events.json","paper":"https://pith.science/paper/EUMIXTOU"},"agent_actions":{"view_html":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG","download_json":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG.json","view_paper":"https://pith.science/paper/EUMIXTOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14931&json=true","fetch_graph":"https://pith.science/api/pith-number/EUMIXTOUQIICKVAWFJWPQAGJQG/graph.json","fetch_events":"https://pith.science/api/pith-number/EUMIXTOUQIICKVAWFJWPQAGJQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG/action/storage_attestation","attest_author":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG/action/author_attestation","sign_citation":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG/action/citation_signature","submit_replication":"https://pith.science/pith/EUMIXTOUQIICKVAWFJWPQAGJQG/action/replication_record"}},"created_at":"2026-07-05T10:45:53.995263+00:00","updated_at":"2026-07-05T10:45:53.995263+00:00"}