{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BDQ442J5S52Q4SGHY2FLQYMDMA","short_pith_number":"pith:BDQ442J5","schema_version":"1.0","canonical_sha256":"08e1ce693d97750e48c7c68ab8618360296fe836047fab647db0a65e3254cbf1","source":{"kind":"arxiv","id":"2605.26471","version":1},"attestation_state":"computed","paper":{"title":"Heterogeneous AAV Logistics Task Allocation: A Reinforcement Learning Enhanced Overlapping Coalition Formation Game Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jianxin Zhong, Jingliang Sun, Junzhi Li, Teng Long, Yuze Zhou, Zihan Wang","submitted_at":"2026-05-26T02:28:36Z","abstract_excerpt":"In dynamic urban logistics, the stochastic emergence of time-sensitive tasks poses a significant optimality challenge for heterogeneous AAVs logistics task allocation. To address this problem, a reinforcement learning enhanced overlapping coalition formation game approach is proposed. A dynamic task allocation model is established, where global optimality is mathematically quantified by a generalized logistics cost coupling service quality and resource consumption. To deal with the time-varying task sets induced by stochastic order arrivals, a transformer-based soft actor-critic network is des"},"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":"2605.26471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-26T02:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"9e9afb7aca663dbb53d03ef3d9d2b786fb1b0fc491630687dc9d8a415cbfb723","abstract_canon_sha256":"952c82f4919f9b01920e3474574d69af67140c94227be215752d13e9e6ea02f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:19.804444Z","signature_b64":"q1RC7nNiaOCI8y2U4DM5lDuWHXq4A6uv2YUMR5PZEpnWWW3a3TebBSptAvlS/lh26+nGt6t1qi5Gj0DvIL21Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e1ce693d97750e48c7c68ab8618360296fe836047fab647db0a65e3254cbf1","last_reissued_at":"2026-05-27T01:05:19.803613Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:19.803613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterogeneous AAV Logistics Task Allocation: A Reinforcement Learning Enhanced Overlapping Coalition Formation Game Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jianxin Zhong, Jingliang Sun, Junzhi Li, Teng Long, Yuze Zhou, Zihan Wang","submitted_at":"2026-05-26T02:28:36Z","abstract_excerpt":"In dynamic urban logistics, the stochastic emergence of time-sensitive tasks poses a significant optimality challenge for heterogeneous AAVs logistics task allocation. To address this problem, a reinforcement learning enhanced overlapping coalition formation game approach is proposed. A dynamic task allocation model is established, where global optimality is mathematically quantified by a generalized logistics cost coupling service quality and resource consumption. To deal with the time-varying task sets induced by stochastic order arrivals, a transformer-based soft actor-critic network is des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26471","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/2605.26471/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":"2605.26471","created_at":"2026-05-27T01:05:19.803744+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26471v1","created_at":"2026-05-27T01:05:19.803744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26471","created_at":"2026-05-27T01:05:19.803744+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDQ442J5S52Q","created_at":"2026-05-27T01:05:19.803744+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDQ442J5S52Q4SGH","created_at":"2026-05-27T01:05:19.803744+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDQ442J5","created_at":"2026-05-27T01:05:19.803744+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/BDQ442J5S52Q4SGHY2FLQYMDMA","json":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA.json","graph_json":"https://pith.science/api/pith-number/BDQ442J5S52Q4SGHY2FLQYMDMA/graph.json","events_json":"https://pith.science/api/pith-number/BDQ442J5S52Q4SGHY2FLQYMDMA/events.json","paper":"https://pith.science/paper/BDQ442J5"},"agent_actions":{"view_html":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA","download_json":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA.json","view_paper":"https://pith.science/paper/BDQ442J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26471&json=true","fetch_graph":"https://pith.science/api/pith-number/BDQ442J5S52Q4SGHY2FLQYMDMA/graph.json","fetch_events":"https://pith.science/api/pith-number/BDQ442J5S52Q4SGHY2FLQYMDMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA/action/storage_attestation","attest_author":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA/action/author_attestation","sign_citation":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA/action/citation_signature","submit_replication":"https://pith.science/pith/BDQ442J5S52Q4SGHY2FLQYMDMA/action/replication_record"}},"created_at":"2026-05-27T01:05:19.803744+00:00","updated_at":"2026-05-27T01:05:19.803744+00:00"}