{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BTREPN7ZPHXVCPQISM745X5IUM","short_pith_number":"pith:BTREPN7Z","canonical_record":{"source":{"id":"2605.16097","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T15:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"43a268a0aa2126c5c560c46fa9c75f567bfadbe25b1e35d26dd7924408d63af8","abstract_canon_sha256":"a49afa297203fa757fcd485ef102d59ce4333d66934e085f6b5239644d35883c"},"schema_version":"1.0"},"canonical_sha256":"0ce247b7f979ef513e08933fcedfa8a3004a3106606c0f27063dbb6b18d6891d","source":{"kind":"arxiv","id":"2605.16097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16097","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16097v1","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16097","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"BTREPN7ZPHXV","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_16","alias_value":"BTREPN7ZPHXVCPQI","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_8","alias_value":"BTREPN7Z","created_at":"2026-05-20T00:01:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BTREPN7ZPHXVCPQISM745X5IUM","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16097","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T15:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"43a268a0aa2126c5c560c46fa9c75f567bfadbe25b1e35d26dd7924408d63af8","abstract_canon_sha256":"a49afa297203fa757fcd485ef102d59ce4333d66934e085f6b5239644d35883c"},"schema_version":"1.0"},"canonical_sha256":"0ce247b7f979ef513e08933fcedfa8a3004a3106606c0f27063dbb6b18d6891d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:52.474051Z","signature_b64":"FOJXi2aNKaYdsD3boDt47ZGP3ETC1GUhUbyPhevCAUrtb+8o1wiyOu9lygBTuEk1xAXsZ1NqD46jsd/upn3xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce247b7f979ef513e08933fcedfa8a3004a3106606c0f27063dbb6b18d6891d","last_reissued_at":"2026-05-20T00:01:52.473352Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:52.473352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16097","source_version":1,"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-05-20T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zivO7MTf8ag3+lXJmC8SzpqYgw422AEPR6S++2paIJ7oQTMdY8A6LJdOLcnK9gmv5eurh/Ozc40Z48GelBrxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:39.273204Z"},"content_sha256":"c3a1a05f06599db70195eb4de2b5e7e268b57db8e87980f22861eaea22692190","schema_version":"1.0","event_id":"sha256:c3a1a05f06599db70195eb4de2b5e7e268b57db8e87980f22861eaea22692190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BTREPN7ZPHXVCPQISM745X5IUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Cooperative Transportation: Optimal and Efficient Task Allocation and Path Finding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths.","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Edmund R. Hunt, Nikolai W.F. Bode, Ning Zhou","submitted_at":"2026-05-15T15:52:52Z","abstract_excerpt":"Multi-robot systems are integral to modern logistics, but their capabilities are often limited to tasks executable by individual agents. This paper addresses a critical gap in existing frameworks like Multi-Agent Path Finding (MAPF) and Task Allocation and Path Finding (TAPF), which lack true cooperation for transporting large items that require multiple agents. To this end, we formalise the Cooperative Transportation Task Allocation and Path Finding (CT-TAPF) problem, which integrates team formation, task assignment, and collision-free pathfinding. We present an optimal solver, Cooperative Tr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our comprehensive empirical evaluation demonstrates three key findings: (1) the incremental expansion strategy significantly outperforms the naive combinatorial approach by successfully pruning the dominant task-allocation search space.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the incremental expansion strategy can reliably prune the task-allocation search space while preserving optimality, which is presented as a central empirical result but depends on the specific conflict-resolution heuristics chosen for the integrated CT-TAPF setting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e955011a65544d13fcc905025d943a8152c3706a7ce9214ed03ad9d059ce23d5"},"source":{"id":"2605.16097","kind":"arxiv","version":1},"verdict":{"id":"69e67347-65a7-4832-a024-d2e7795ea7b9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:25:21.173511Z","strongest_claim":"Our comprehensive empirical evaluation demonstrates three key findings: (1) the incremental expansion strategy significantly outperforms the naive combinatorial approach by successfully pruning the dominant task-allocation search space.","one_line_summary":"Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the incremental expansion strategy can reliably prune the task-allocation search space while preserving optimality, which is presented as a central empirical result but depends on the specific conflict-resolution heuristics chosen for the integrated CT-TAPF setting.","pith_extraction_headline":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16097/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T18:31:23.995343Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.751048Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:38.092702Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.491802Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4b19a5534f31aad99600e8b31ecf6deb55e53137ab16e6b58965789291d7ed3e"},"references":{"count":31,"sample":[{"doi":"","year":2024,"title":"Olukunle Amoo, Enoch Sodiya, Uchenna Umoga, and Akoh Atadoga. 2024. AI- driven Warehouse Automation: A Comprehensive Review of Systems.GSC Advanced Research and Reviews18 (Feb. 2024), 272–282. https:/","work_id":"3ba18f2a-366c-4736-b8f8-dbe20ada0657","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.24963/ijcai.2020/565","year":2020,"title":"Stuckey, Liron Cohen, Jiaoyang Li, and Sven Koenig","work_id":"40b40f1d-1d59-4073-9d65-265da8e1c3f8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1609/socs.v6i1.18343","year":2015,"title":"Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, and Eyal Shimony. 2015. ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.Proceedings of ","work_id":"7e42c54d-5930-4edb-8151-63b230578b84","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.9746/jcmsi.10.495","year":2017,"title":"Jorge Cortés and Magnus Egerstedt. 2017. Coordinated Control of Multi-Robot Systems: A Survey.SICE Journal of Control, Measurement, and System Integration (Nov. 2017). https://doi.org/10.9746/jcmsi.10","work_id":"98deda8f-5f5c-4010-8cee-ea32d1341444","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1609/icaps.v28i1.13883","year":2018,"title":"Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, Thirunarayanapu- ram Krishnamachari Satish Kumar, and Sven Koenig. 2018. Adding Heuristics to Conflict-Based Search for Multi-Agent Path ","work_id":"0781ccf6-2fc9-428d-ae3c-3cb1477606e7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"c12aeca2957600ec794e3c8a905e343f5f23332736bbada2658916425c99b444","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":"69e67347-65a7-4832-a024-d2e7795ea7b9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cs5/GRcaquS4T7t5EJuu2zMFiHXPHlmbPmUvsOakZfInKCq79B1/zToNYGftYgDVw3GLrNG164prlyD7qnDABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:39.274570Z"},"content_sha256":"7b08e9af7d09151a53b4a20b1816b4e89f26e1e67eadfe68d6f88ce99976ddcc","schema_version":"1.0","event_id":"sha256:7b08e9af7d09151a53b4a20b1816b4e89f26e1e67eadfe68d6f88ce99976ddcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTREPN7ZPHXVCPQISM745X5IUM/bundle.json","state_url":"https://pith.science/pith/BTREPN7ZPHXVCPQISM745X5IUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTREPN7ZPHXVCPQISM745X5IUM/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-05-28T23:36:39Z","links":{"resolver":"https://pith.science/pith/BTREPN7ZPHXVCPQISM745X5IUM","bundle":"https://pith.science/pith/BTREPN7ZPHXVCPQISM745X5IUM/bundle.json","state":"https://pith.science/pith/BTREPN7ZPHXVCPQISM745X5IUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTREPN7ZPHXVCPQISM745X5IUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BTREPN7ZPHXVCPQISM745X5IUM","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":"a49afa297203fa757fcd485ef102d59ce4333d66934e085f6b5239644d35883c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T15:52:52Z","title_canon_sha256":"43a268a0aa2126c5c560c46fa9c75f567bfadbe25b1e35d26dd7924408d63af8"},"schema_version":"1.0","source":{"id":"2605.16097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16097","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16097v1","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16097","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"BTREPN7ZPHXV","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_16","alias_value":"BTREPN7ZPHXVCPQI","created_at":"2026-05-20T00:01:52Z"},{"alias_kind":"pith_short_8","alias_value":"BTREPN7Z","created_at":"2026-05-20T00:01:52Z"}],"graph_snapshots":[{"event_id":"sha256:7b08e9af7d09151a53b4a20b1816b4e89f26e1e67eadfe68d6f88ce99976ddcc","target":"graph","created_at":"2026-05-20T00:01:52Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our comprehensive empirical evaluation demonstrates three key findings: (1) the incremental expansion strategy significantly outperforms the naive combinatorial approach by successfully pruning the dominant task-allocation search space."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the incremental expansion strategy can reliably prune the task-allocation search space while preserving optimality, which is presented as a central empirical result but depends on the specific conflict-resolution heuristics chosen for the integrated CT-TAPF setting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths."}],"snapshot_sha256":"e955011a65544d13fcc905025d943a8152c3706a7ce9214ed03ad9d059ce23d5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:31:23.995343Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.751048Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:38.092702Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.491802Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16097/integrity.json","findings":[],"snapshot_sha256":"4b19a5534f31aad99600e8b31ecf6deb55e53137ab16e6b58965789291d7ed3e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-robot systems are integral to modern logistics, but their capabilities are often limited to tasks executable by individual agents. This paper addresses a critical gap in existing frameworks like Multi-Agent Path Finding (MAPF) and Task Allocation and Path Finding (TAPF), which lack true cooperation for transporting large items that require multiple agents. To this end, we formalise the Cooperative Transportation Task Allocation and Path Finding (CT-TAPF) problem, which integrates team formation, task assignment, and collision-free pathfinding. We present an optimal solver, Cooperative Tr","authors_text":"Edmund R. Hunt, Nikolai W.F. Bode, Ning Zhou","cross_cats":[],"headline":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T15:52:52Z","title":"Multi-Agent Cooperative Transportation: Optimal and Efficient Task Allocation and Path Finding"},"references":{"count":31,"internal_anchors":0,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Olukunle Amoo, Enoch Sodiya, Uchenna Umoga, and Akoh Atadoga. 2024. AI- driven Warehouse Automation: A Comprehensive Review of Systems.GSC Advanced Research and Reviews18 (Feb. 2024), 272–282. https:/","work_id":"3ba18f2a-366c-4736-b8f8-dbe20ada0657","year":2024},{"cited_arxiv_id":"","doi":"10.24963/ijcai.2020/565","is_internal_anchor":false,"ref_index":2,"title":"Stuckey, Liron Cohen, Jiaoyang Li, and Sven Koenig","work_id":"40b40f1d-1d59-4073-9d65-265da8e1c3f8","year":2020},{"cited_arxiv_id":"","doi":"10.1609/socs.v6i1.18343","is_internal_anchor":false,"ref_index":3,"title":"Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, and Eyal Shimony. 2015. ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.Proceedings of ","work_id":"7e42c54d-5930-4edb-8151-63b230578b84","year":2015},{"cited_arxiv_id":"","doi":"10.9746/jcmsi.10.495","is_internal_anchor":false,"ref_index":4,"title":"Jorge Cortés and Magnus Egerstedt. 2017. Coordinated Control of Multi-Robot Systems: A Survey.SICE Journal of Control, Measurement, and System Integration (Nov. 2017). https://doi.org/10.9746/jcmsi.10","work_id":"98deda8f-5f5c-4010-8cee-ea32d1341444","year":2017},{"cited_arxiv_id":"","doi":"10.1609/icaps.v28i1.13883","is_internal_anchor":false,"ref_index":5,"title":"Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, Thirunarayanapu- ram Krishnamachari Satish Kumar, and Sven Koenig. 2018. Adding Heuristics to Conflict-Based Search for Multi-Agent Path ","work_id":"0781ccf6-2fc9-428d-ae3c-3cb1477606e7","year":2018}],"snapshot_sha256":"c12aeca2957600ec794e3c8a905e343f5f23332736bbada2658916425c99b444"},"source":{"id":"2605.16097","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:25:21.173511Z","id":"69e67347-65a7-4832-a024-d2e7795ea7b9","model_set":{"reader":"grok-4.3"},"one_line_summary":"Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The CT-TCBS algorithm with incremental expansion solves cooperative multi-robot transport by pruning the dominant search space for team assignments while integrating collision-free paths.","strongest_claim":"Our comprehensive empirical evaluation demonstrates three key findings: (1) the incremental expansion strategy significantly outperforms the naive combinatorial approach by successfully pruning the dominant task-allocation search space.","weakest_assumption":"The assumption that the incremental expansion strategy can reliably prune the task-allocation search space while preserving optimality, which is presented as a central empirical result but depends on the specific conflict-resolution heuristics chosen for the integrated CT-TAPF setting."}},"verdict_id":"69e67347-65a7-4832-a024-d2e7795ea7b9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3a1a05f06599db70195eb4de2b5e7e268b57db8e87980f22861eaea22692190","target":"record","created_at":"2026-05-20T00:01:52Z","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":"a49afa297203fa757fcd485ef102d59ce4333d66934e085f6b5239644d35883c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T15:52:52Z","title_canon_sha256":"43a268a0aa2126c5c560c46fa9c75f567bfadbe25b1e35d26dd7924408d63af8"},"schema_version":"1.0","source":{"id":"2605.16097","kind":"arxiv","version":1}},"canonical_sha256":"0ce247b7f979ef513e08933fcedfa8a3004a3106606c0f27063dbb6b18d6891d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ce247b7f979ef513e08933fcedfa8a3004a3106606c0f27063dbb6b18d6891d","first_computed_at":"2026-05-20T00:01:52.473352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:52.473352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FOJXi2aNKaYdsD3boDt47ZGP3ETC1GUhUbyPhevCAUrtb+8o1wiyOu9lygBTuEk1xAXsZ1NqD46jsd/upn3xBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:52.474051Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a1a05f06599db70195eb4de2b5e7e268b57db8e87980f22861eaea22692190","sha256:7b08e9af7d09151a53b4a20b1816b4e89f26e1e67eadfe68d6f88ce99976ddcc"],"state_sha256":"6b3c9567ba18f795f24e53dae7c31d3dc1be1fdaa767303dedddeef7b5c7c614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeNZFU09PmSRGK4t5hsvy5zm9OnOZKSJVxZycu3HqdvFY/yriA1TkkNt6Z6uxEdGCMnQckcPUY8kPC7UDRf6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:36:39.279536Z","bundle_sha256":"1a2b6e3564faa23e86a8bdc7340fb759f31fd3fbd80e3d90c8f42c012f5c772d"}}