{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J6HXY6Q3CSEXYBIDENRH4NFREE","short_pith_number":"pith:J6HXY6Q3","schema_version":"1.0","canonical_sha256":"4f8f7c7a1b14897c050323627e34b12131cbc8113aa7e9fe41046aa19cca720e","source":{"kind":"arxiv","id":"2506.23793","version":1},"attestation_state":"computed","paper":{"title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev","submitted_at":"2025-06-30T12:34:31Z","abstract_excerpt":"Multi-agent pathfinding (MAPF) is a common abstraction of multi-robot trajectory planning problems, where multiple homogeneous robots simultaneously move in the shared environment. While solving MAPF optimally has been proven to be NP-hard, scalable, and efficient, solvers are vital for real-world applications like logistics, search-and-rescue, etc. To this end, decentralized suboptimal MAPF solvers that leverage machine learning have come on stage. Building on the success of the recently introduced MAPF-GPT, a pure imitation learning solver, we introduce MAPF-GPT-DDG. This novel approach effe"},"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":"2506.23793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-30T12:34:31Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"8ed9b4fcd2b65ecaf523925cf88fca8fcac0a5ccd81444d631631de1c02c16b9","abstract_canon_sha256":"988bb82ff16f1b8d2bb5e44fcda164d80884c565d17e0b812fbd4601aa674564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:28.053309Z","signature_b64":"oLuajKJdTtrmfzotDulvtSj61xOv/NOsMZWPBNy0tv/dWOtaQcQflWj7jb+tTaupO8YLEikYx0rz/OydxvvZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8f7c7a1b14897c050323627e34b12131cbc8113aa7e9fe41046aa19cca720e","last_reissued_at":"2026-07-05T11:29:28.052815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:28.052815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev","submitted_at":"2025-06-30T12:34:31Z","abstract_excerpt":"Multi-agent pathfinding (MAPF) is a common abstraction of multi-robot trajectory planning problems, where multiple homogeneous robots simultaneously move in the shared environment. While solving MAPF optimally has been proven to be NP-hard, scalable, and efficient, solvers are vital for real-world applications like logistics, search-and-rescue, etc. To this end, decentralized suboptimal MAPF solvers that leverage machine learning have come on stage. Building on the success of the recently introduced MAPF-GPT, a pure imitation learning solver, we introduce MAPF-GPT-DDG. This novel approach effe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23793","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/2506.23793/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":"2506.23793","created_at":"2026-07-05T11:29:28.052875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23793v1","created_at":"2026-07-05T11:29:28.052875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23793","created_at":"2026-07-05T11:29:28.052875+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6HXY6Q3CSEX","created_at":"2026-07-05T11:29:28.052875+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6HXY6Q3CSEXYBID","created_at":"2026-07-05T11:29:28.052875+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6HXY6Q3","created_at":"2026-07-05T11:29:28.052875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE","json":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE.json","graph_json":"https://pith.science/api/pith-number/J6HXY6Q3CSEXYBIDENRH4NFREE/graph.json","events_json":"https://pith.science/api/pith-number/J6HXY6Q3CSEXYBIDENRH4NFREE/events.json","paper":"https://pith.science/paper/J6HXY6Q3"},"agent_actions":{"view_html":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE","download_json":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE.json","view_paper":"https://pith.science/paper/J6HXY6Q3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23793&json=true","fetch_graph":"https://pith.science/api/pith-number/J6HXY6Q3CSEXYBIDENRH4NFREE/graph.json","fetch_events":"https://pith.science/api/pith-number/J6HXY6Q3CSEXYBIDENRH4NFREE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE/action/storage_attestation","attest_author":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE/action/author_attestation","sign_citation":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE/action/citation_signature","submit_replication":"https://pith.science/pith/J6HXY6Q3CSEXYBIDENRH4NFREE/action/replication_record"}},"created_at":"2026-07-05T11:29:28.052875+00:00","updated_at":"2026-07-05T11:29:28.052875+00:00"}