{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:X75ONDQYAWP6ZF5F4UTEIXDEPX","short_pith_number":"pith:X75ONDQY","canonical_record":{"source":{"id":"2409.00134","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-29T12:55:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5e7c08c4da35d7b3e0c793f2c1c5131f28d4b3f11702a01920a20e0612cc96cd","abstract_canon_sha256":"2586ba0021b3af9c3de21707dc9f094f4367ea8b907f2f2fe858082adc6805c2"},"schema_version":"1.0"},"canonical_sha256":"bffae68e18059fec97a5e526445c647df9887ff0a9cce3a9d936a0780201ba56","source":{"kind":"arxiv","id":"2409.00134","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00134","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00134v5","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00134","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"X75ONDQYAWP6","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_16","alias_value":"X75ONDQYAWP6ZF5F","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_8","alias_value":"X75ONDQY","created_at":"2026-07-05T10:45:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:X75ONDQYAWP6ZF5F4UTEIXDEPX","target":"record","payload":{"canonical_record":{"source":{"id":"2409.00134","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-29T12:55:10Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5e7c08c4da35d7b3e0c793f2c1c5131f28d4b3f11702a01920a20e0612cc96cd","abstract_canon_sha256":"2586ba0021b3af9c3de21707dc9f094f4367ea8b907f2f2fe858082adc6805c2"},"schema_version":"1.0"},"canonical_sha256":"bffae68e18059fec97a5e526445c647df9887ff0a9cce3a9d936a0780201ba56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:54.801458Z","signature_b64":"eox8Ub1aqm4kDTJqAZsxvpl+W7souZ9nSjiNCovVE+x3huf5GNh4piHyJc8XnUyBDzJybBeo137wOChsvrtrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bffae68e18059fec97a5e526445c647df9887ff0a9cce3a9d936a0780201ba56","last_reissued_at":"2026-07-05T10:45:54.800962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:54.800962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.00134","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QU9h+AkM/UoIP7mt7iJv8Y9aaaZKfk8gx/yLehevQ5VHVtRWSKNaUHLg4EdGllwiClqN/LDJZN1R3+I9yYH6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:26:20.484807Z"},"content_sha256":"4007fd372adbdf57ac319ac8e77e668d7189088176bf9652bd0e17c4ae4bf524","schema_version":"1.0","event_id":"sha256:4007fd372adbdf57ac319ac8e77e668d7189088176bf9652bd0e17c4ae4bf524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:X75ONDQYAWP6ZF5F4UTEIXDEPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev","submitted_at":"2024-08-29T12:55:10Z","abstract_excerpt":"Multi-agent pathfinding (MAPF) is a problem that generally requires finding collision-free paths for multiple agents in a shared environment. Solving MAPF optimally, even under restrictive assumptions, is NP-hard, yet efficient solutions for this problem are critical for numerous applications, such as automated warehouses and transportation systems. Recently, learning-based approaches to MAPF have gained attention, particularly those leveraging deep reinforcement learning. Typically, such learning-based MAPF solvers are augmented with additional components like single-agent planning or communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00134","kind":"arxiv","version":5},"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.00134/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:45:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaKpos35xH3Gy7OtlRmvytw+VgRpSUp7P0PgryaT07Jw4Ivd1kDYcwdH1cIkp2YQRyN3/PZYlOw3W4NhqzvpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:26:20.485313Z"},"content_sha256":"be4e0cc92c28effc9d8bcd44a2c8b461733b5578041d907a3d4e85f0248f4970","schema_version":"1.0","event_id":"sha256:be4e0cc92c28effc9d8bcd44a2c8b461733b5578041d907a3d4e85f0248f4970"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/bundle.json","state_url":"https://pith.science/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T19:26:20Z","links":{"resolver":"https://pith.science/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX","bundle":"https://pith.science/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/bundle.json","state":"https://pith.science/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X75ONDQYAWP6ZF5F4UTEIXDEPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:X75ONDQYAWP6ZF5F4UTEIXDEPX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2586ba0021b3af9c3de21707dc9f094f4367ea8b907f2f2fe858082adc6805c2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-29T12:55:10Z","title_canon_sha256":"5e7c08c4da35d7b3e0c793f2c1c5131f28d4b3f11702a01920a20e0612cc96cd"},"schema_version":"1.0","source":{"id":"2409.00134","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.00134","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"2409.00134v5","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00134","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"X75ONDQYAWP6","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_16","alias_value":"X75ONDQYAWP6ZF5F","created_at":"2026-07-05T10:45:54Z"},{"alias_kind":"pith_short_8","alias_value":"X75ONDQY","created_at":"2026-07-05T10:45:54Z"}],"graph_snapshots":[{"event_id":"sha256:be4e0cc92c28effc9d8bcd44a2c8b461733b5578041d907a3d4e85f0248f4970","target":"graph","created_at":"2026-07-05T10:45:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.00134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-agent pathfinding (MAPF) is a problem that generally requires finding collision-free paths for multiple agents in a shared environment. Solving MAPF optimally, even under restrictive assumptions, is NP-hard, yet efficient solutions for this problem are critical for numerous applications, such as automated warehouses and transportation systems. Recently, learning-based approaches to MAPF have gained attention, particularly those leveraging deep reinforcement learning. Typically, such learning-based MAPF solvers are augmented with additional components like single-agent planning or communi","authors_text":"Aleksandr Panov, Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-29T12:55:10Z","title":"MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00134","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4007fd372adbdf57ac319ac8e77e668d7189088176bf9652bd0e17c4ae4bf524","target":"record","created_at":"2026-07-05T10:45:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2586ba0021b3af9c3de21707dc9f094f4367ea8b907f2f2fe858082adc6805c2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-29T12:55:10Z","title_canon_sha256":"5e7c08c4da35d7b3e0c793f2c1c5131f28d4b3f11702a01920a20e0612cc96cd"},"schema_version":"1.0","source":{"id":"2409.00134","kind":"arxiv","version":5}},"canonical_sha256":"bffae68e18059fec97a5e526445c647df9887ff0a9cce3a9d936a0780201ba56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bffae68e18059fec97a5e526445c647df9887ff0a9cce3a9d936a0780201ba56","first_computed_at":"2026-07-05T10:45:54.800962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:45:54.800962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eox8Ub1aqm4kDTJqAZsxvpl+W7souZ9nSjiNCovVE+x3huf5GNh4piHyJc8XnUyBDzJybBeo137wOChsvrtrDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:45:54.801458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.00134","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4007fd372adbdf57ac319ac8e77e668d7189088176bf9652bd0e17c4ae4bf524","sha256:be4e0cc92c28effc9d8bcd44a2c8b461733b5578041d907a3d4e85f0248f4970"],"state_sha256":"f561291e25ffcb20c8e0a69be7ba2e124a26eda780a7eea4cc048c2246042666"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOzYR7yW5d4ei/fTU9hk8oScrYL6KEbZZdG231JgnZ95dJA7wcbIKiofITLpLRo4h00QRaK1G0UjkdPg8pSmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:26:20.489706Z","bundle_sha256":"b53bee85f50356dd5728a2a41dc1f5c6db8f2a7d2e3018f104f9106ab5965d88"}}