{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GCI73SBVSS5DWDJ545SJH42PS4","short_pith_number":"pith:GCI73SBV","schema_version":"1.0","canonical_sha256":"3091fdc83594ba3b0d3de76493f34f97235a9568414d13e63b69236a3bb26707","source":{"kind":"arxiv","id":"2508.05890","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.05890","created_at":"2026-07-05T11:50:45.033817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05890v1","created_at":"2026-07-05T11:50:45.033817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05890","created_at":"2026-07-05T11:50:45.033817+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCI73SBVSS5D","created_at":"2026-07-05T11:50:45.033817+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCI73SBVSS5DWDJ5","created_at":"2026-07-05T11:50:45.033817+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCI73SBV","created_at":"2026-07-05T11:50:45.033817+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/GCI73SBVSS5DWDJ545SJH42PS4","json":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4.json","graph_json":"https://pith.science/api/pith-number/GCI73SBVSS5DWDJ545SJH42PS4/graph.json","events_json":"https://pith.science/api/pith-number/GCI73SBVSS5DWDJ545SJH42PS4/events.json","paper":"https://pith.science/paper/GCI73SBV"},"agent_actions":{"view_html":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4","download_json":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4.json","view_paper":"https://pith.science/paper/GCI73SBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05890&json=true","fetch_graph":"https://pith.science/api/pith-number/GCI73SBVSS5DWDJ545SJH42PS4/graph.json","fetch_events":"https://pith.science/api/pith-number/GCI73SBVSS5DWDJ545SJH42PS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/action/storage_attestation","attest_author":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/action/author_attestation","sign_citation":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/action/citation_signature","submit_replication":"https://pith.science/pith/GCI73SBVSS5DWDJ545SJH42PS4/action/replication_record"}},"created_at":"2026-07-05T11:50:45.033817+00:00","updated_at":"2026-07-05T11:50:45.033817+00:00"}