{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CB26NFGZS3CTMV4J2NAGFJJ646","short_pith_number":"pith:CB26NFGZ","schema_version":"1.0","canonical_sha256":"1075e694d996c5365789d34062a53ee79b062fd1425b5e65f4ca028c94ff658d","source":{"kind":"arxiv","id":"2411.18230","version":1},"attestation_state":"computed","paper":{"title":"Dependency-Aware CAV Task Scheduling via Diffusion-Based Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Wen Wu, Xiang Cheng, Ying Wang, Zhi Mao","submitted_at":"2024-11-27T11:07:31Z","abstract_excerpt":"In this paper, we propose a novel dependency-aware task scheduling strategy for dynamic unmanned aerial vehicle-assisted connected autonomous vehicles (CAVs). Specifically, different computation tasks of CAVs consisting of multiple dependency subtasks are judiciously assigned to nearby CAVs or the base station for promptly completing tasks. Therefore, we formulate a joint scheduling priority and subtask assignment optimization problem with the objective of minimizing the average task completion time. The problem aims at improving the long-term system performance, which is reformulated as a Mar"},"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":"2411.18230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-27T11:07:31Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"bedceb23c2306b29f55e97049f71ce21b2dfe1da2e537c94234b014549cc0378","abstract_canon_sha256":"8006f070316aff7ea5c293b082ff94faeacdf80d8fb203ac273c012c0e746593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:13.588612Z","signature_b64":"kcFuj948RClCElWx4SpZhrv1J5AFoyNZEV4WZKnoE17gRX3HrKuVQWzSR86Sj1rRBJ/0bv6alAtpzXnvmXoMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1075e694d996c5365789d34062a53ee79b062fd1425b5e65f4ca028c94ff658d","last_reissued_at":"2026-07-05T09:41:13.588089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:13.588089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dependency-Aware CAV Task Scheduling via Diffusion-Based Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Wen Wu, Xiang Cheng, Ying Wang, Zhi Mao","submitted_at":"2024-11-27T11:07:31Z","abstract_excerpt":"In this paper, we propose a novel dependency-aware task scheduling strategy for dynamic unmanned aerial vehicle-assisted connected autonomous vehicles (CAVs). Specifically, different computation tasks of CAVs consisting of multiple dependency subtasks are judiciously assigned to nearby CAVs or the base station for promptly completing tasks. Therefore, we formulate a joint scheduling priority and subtask assignment optimization problem with the objective of minimizing the average task completion time. The problem aims at improving the long-term system performance, which is reformulated as a Mar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18230","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/2411.18230/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":"2411.18230","created_at":"2026-07-05T09:41:13.588156+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18230v1","created_at":"2026-07-05T09:41:13.588156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18230","created_at":"2026-07-05T09:41:13.588156+00:00"},{"alias_kind":"pith_short_12","alias_value":"CB26NFGZS3CT","created_at":"2026-07-05T09:41:13.588156+00:00"},{"alias_kind":"pith_short_16","alias_value":"CB26NFGZS3CTMV4J","created_at":"2026-07-05T09:41:13.588156+00:00"},{"alias_kind":"pith_short_8","alias_value":"CB26NFGZ","created_at":"2026-07-05T09:41:13.588156+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.01589","citing_title":"Censored Sampling for Topology Design: Guiding Diffusion with Human Preferences","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646","json":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646.json","graph_json":"https://pith.science/api/pith-number/CB26NFGZS3CTMV4J2NAGFJJ646/graph.json","events_json":"https://pith.science/api/pith-number/CB26NFGZS3CTMV4J2NAGFJJ646/events.json","paper":"https://pith.science/paper/CB26NFGZ"},"agent_actions":{"view_html":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646","download_json":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646.json","view_paper":"https://pith.science/paper/CB26NFGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18230&json=true","fetch_graph":"https://pith.science/api/pith-number/CB26NFGZS3CTMV4J2NAGFJJ646/graph.json","fetch_events":"https://pith.science/api/pith-number/CB26NFGZS3CTMV4J2NAGFJJ646/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646/action/storage_attestation","attest_author":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646/action/author_attestation","sign_citation":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646/action/citation_signature","submit_replication":"https://pith.science/pith/CB26NFGZS3CTMV4J2NAGFJJ646/action/replication_record"}},"created_at":"2026-07-05T09:41:13.588156+00:00","updated_at":"2026-07-05T09:41:13.588156+00:00"}