{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L6UGNCTHABB4AF5M63XVVL54BR","short_pith_number":"pith:L6UGNCTH","schema_version":"1.0","canonical_sha256":"5fa8668a670043c017acf6ef5aafbc0c6267f8aebd4d9b537a4a41fa1bb4920a","source":{"kind":"arxiv","id":"2310.01207","version":1},"attestation_state":"computed","paper":{"title":"Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev, Maria Nesterova","submitted_at":"2023-10-02T13:51:32Z","abstract_excerpt":"Multi-agent Pathfinding (MAPF) problem generally asks to find a set of conflict-free paths for a set of agents confined to a graph and is typically solved in a centralized fashion.\n  Conversely, in this work, we investigate the decentralized MAPF setting, when the central controller that posses all the information on the agents' locations and goals is absent and the agents have to sequientially decide the actions on their own without having access to a full state of the environment. We focus on the practically important lifelong variant of MAPF, which involves continuously assigning new goals "},"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":"2310.01207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-10-02T13:51:32Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"f26b9feede6872f50f4d08f20bbd2d60baf4d23c6e02a64dc9b37ef15b0ddd33","abstract_canon_sha256":"62d442d263e2ce73bb7ef5dd3b079d11ce5d66ac454f08840845c3ec2bf98e32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:24.119621Z","signature_b64":"9cu/tc2IYxgM4uNfusH2oKjP7lRpkpeRGSYRsDaKgvgJ2MGpWzGv3JDBMV/JQm10uKWWHyYlZBbfP3v4CHVIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa8668a670043c017acf6ef5aafbc0c6267f8aebd4d9b537a4a41fa1bb4920a","last_reissued_at":"2026-07-05T06:56:24.119203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:24.119203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev, Maria Nesterova","submitted_at":"2023-10-02T13:51:32Z","abstract_excerpt":"Multi-agent Pathfinding (MAPF) problem generally asks to find a set of conflict-free paths for a set of agents confined to a graph and is typically solved in a centralized fashion.\n  Conversely, in this work, we investigate the decentralized MAPF setting, when the central controller that posses all the information on the agents' locations and goals is absent and the agents have to sequientially decide the actions on their own without having access to a full state of the environment. We focus on the practically important lifelong variant of MAPF, which involves continuously assigning new goals "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01207","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/2310.01207/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":"2310.01207","created_at":"2026-07-05T06:56:24.119266+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01207v1","created_at":"2026-07-05T06:56:24.119266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01207","created_at":"2026-07-05T06:56:24.119266+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6UGNCTHABB4","created_at":"2026-07-05T06:56:24.119266+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6UGNCTHABB4AF5M","created_at":"2026-07-05T06:56:24.119266+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6UGNCTH","created_at":"2026-07-05T06:56:24.119266+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":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR","json":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR.json","graph_json":"https://pith.science/api/pith-number/L6UGNCTHABB4AF5M63XVVL54BR/graph.json","events_json":"https://pith.science/api/pith-number/L6UGNCTHABB4AF5M63XVVL54BR/events.json","paper":"https://pith.science/paper/L6UGNCTH"},"agent_actions":{"view_html":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR","download_json":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR.json","view_paper":"https://pith.science/paper/L6UGNCTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01207&json=true","fetch_graph":"https://pith.science/api/pith-number/L6UGNCTHABB4AF5M63XVVL54BR/graph.json","fetch_events":"https://pith.science/api/pith-number/L6UGNCTHABB4AF5M63XVVL54BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR/action/storage_attestation","attest_author":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR/action/author_attestation","sign_citation":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR/action/citation_signature","submit_replication":"https://pith.science/pith/L6UGNCTHABB4AF5M63XVVL54BR/action/replication_record"}},"created_at":"2026-07-05T06:56:24.119266+00:00","updated_at":"2026-07-05T06:56:24.119266+00:00"}