{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GCI73SBVSS5DWDJ545SJH42PS4","short_pith_number":"pith:GCI73SBV","canonical_record":{"source":{"id":"2508.05890","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-08-07T22:43:22Z","cross_cats_sorted":[],"title_canon_sha256":"f1c4324c9638f51b609ae03765412a49bb182685324fcc75d7ac6184399695d8","abstract_canon_sha256":"45b3f24601ca157f83eb0b41c295cd55ee13fccb1c03f11e0f2c032fa38cdc01"},"schema_version":"1.0"},"canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","source":{"kind":"arxiv","id":"2508.05890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05890","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05890v1","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05890","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_12","alias_value":"GCI73SBVSS5D","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCI73SBVSS5DWDJ5","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCI73SBV","created_at":"2026-07-05T11:50:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GCI73SBVSS5DWDJ545SJH42PS4","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05890","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-08-07T22:43:22Z","cross_cats_sorted":[],"title_canon_sha256":"f1c4324c9638f51b609ae03765412a49bb182685324fcc75d7ac6184399695d8","abstract_canon_sha256":"45b3f24601ca157f83eb0b41c295cd55ee13fccb1c03f11e0f2c032fa38cdc01"},"schema_version":"1.0"},"canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:45.034231Z","signature_b64":"dHgTEWUC8v+WjjmgY+td9FmtZwvMX5Vha1cNDUUWcLdOajP/0FmyqLfcDvitHWrVoY6bOnm+pNfq3u/lmBzvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","last_reissued_at":"2026-07-05T11:50:45.033744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:45.033744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05890","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-07-05T11:50:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YFHaVbgoFjqqghTyGFurGINxnjGEJC+s13E2qiV/pvYOhpqut2gaCgqZmpTu7u6gsIE6iDkJOjwHplMSDWRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:45:27.293679Z"},"content_sha256":"8ca0b017524865b8314244d13a58567326cdf273a7f01b0e28b36f023816e189","schema_version":"1.0","event_id":"sha256:8ca0b017524865b8314244d13a58567326cdf273a7f01b0e28b36f023816e189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GCI73SBVSS5DWDJ545SJH42PS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Yue Zhang, Zhe Chen","submitted_at":"2025-08-07T22:43:22Z","abstract_excerpt":"We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online methods either rely on simple heuristics, which result in poor decisions, or employ complex reasoning, which suffers from limited scalability under real-time constraints. In this work, we focus on the task assignment subproblem and formulate it as a minimum-cost flow over the environment graph. This eliminates the need for pairwise distance computations and allows agents to be simultaneously assigned to tasks and routed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05890","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/2508.05890/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-05T11:50:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vfB0aLOpYB4+Cqs2cnFlG0TX2I+ePRsaq9YEHAYeIyk8nfCT9wqP+kIEipuGh2dRT6e6YwKAWYHTtNU3+m3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:45:27.294609Z"},"content_sha256":"1617d3ba2ea25d49c49a56ffd26654256ed99a812c81fc01c7b604377d9ecc3b","schema_version":"1.0","event_id":"sha256:1617d3ba2ea25d49c49a56ffd26654256ed99a812c81fc01c7b604377d9ecc3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/bundle.json","state_url":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCI73SBVSS5DWDJ545SJH42PS4/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-05T19:45:27Z","links":{"resolver":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4","bundle":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/bundle.json","state":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCI73SBVSS5DWDJ545SJH42PS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GCI73SBVSS5DWDJ545SJH42PS4","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":"45b3f24601ca157f83eb0b41c295cd55ee13fccb1c03f11e0f2c032fa38cdc01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-08-07T22:43:22Z","title_canon_sha256":"f1c4324c9638f51b609ae03765412a49bb182685324fcc75d7ac6184399695d8"},"schema_version":"1.0","source":{"id":"2508.05890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05890","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05890v1","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05890","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_12","alias_value":"GCI73SBVSS5D","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCI73SBVSS5DWDJ5","created_at":"2026-07-05T11:50:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCI73SBV","created_at":"2026-07-05T11:50:45Z"}],"graph_snapshots":[{"event_id":"sha256:1617d3ba2ea25d49c49a56ffd26654256ed99a812c81fc01c7b604377d9ecc3b","target":"graph","created_at":"2026-07-05T11:50:45Z","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/2508.05890/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online methods either rely on simple heuristics, which result in poor decisions, or employ complex reasoning, which suffers from limited scalability under real-time constraints. In this work, we focus on the task assignment subproblem and formulate it as a minimum-cost flow over the environment graph. This eliminates the need for pairwise distance computations and allows agents to be simultaneously assigned to tasks and routed","authors_text":"Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Yue Zhang, Zhe Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-08-07T22:43:22Z","title":"Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05890","kind":"arxiv","version":1},"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:8ca0b017524865b8314244d13a58567326cdf273a7f01b0e28b36f023816e189","target":"record","created_at":"2026-07-05T11:50:45Z","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":"45b3f24601ca157f83eb0b41c295cd55ee13fccb1c03f11e0f2c032fa38cdc01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-08-07T22:43:22Z","title_canon_sha256":"f1c4324c9638f51b609ae03765412a49bb182685324fcc75d7ac6184399695d8"},"schema_version":"1.0","source":{"id":"2508.05890","kind":"arxiv","version":1}},"canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","first_computed_at":"2026-07-05T11:50:45.033744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:45.033744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dHgTEWUC8v+WjjmgY+td9FmtZwvMX5Vha1cNDUUWcLdOajP/0FmyqLfcDvitHWrVoY6bOnm+pNfq3u/lmBzvCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:45.034231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ca0b017524865b8314244d13a58567326cdf273a7f01b0e28b36f023816e189","sha256:1617d3ba2ea25d49c49a56ffd26654256ed99a812c81fc01c7b604377d9ecc3b"],"state_sha256":"78eaf3021f448ea9baae07e8630052144b1e3bc79a9f492154efe1f312e558a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oc/hQN3cZ73U7SV2I5VfxQOncnUmbSSKheiRPU7UR4+oxVPw6poCJg+9CCL/8rNdjeuuQLBnOHZSfQyoqJBuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:45:27.302629Z","bundle_sha256":"d420ad22f9382cabf5bd3881e5dc7350d00fa9b8045536e558270fd92226a604"}}