{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KNTAOAJDCAMKEBLMS2TEFLEGY2","short_pith_number":"pith:KNTAOAJD","schema_version":"1.0","canonical_sha256":"53660701231018a2056c96a642ac86c6a6d9766ba11c8bee1b068880c047be03","source":{"kind":"arxiv","id":"2410.02122","version":1},"attestation_state":"computed","paper":{"title":"Resource Allocation Based on Optimal Transport Theory in ISAC-Enabled Multi-UAV Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Lixin Li, Qinghe Du, Wei Liang, Wensheng Lin, Yufeng Zheng, Zhu Han","submitted_at":"2024-10-03T01:01:29Z","abstract_excerpt":"This paper investigates the resource allocation optimization for cooperative communication with non-cooperative localization in integrated sensing and communications (ISAC)-enabled multi-unmanned aerial vehicle (UAV) cooperative networks. Our goal is to maximize the weighted sum of the system's average sum rate and the localization quality of service (QoS) by jointly optimizing cell association, communication power allocation, and sensing power allocation. Since the formulated problem is a mixed-integer nonconvex problem, we propose the alternating iteration algorithm based on optimal transpor"},"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":"2410.02122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-10-03T01:01:29Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"63c8d1c88ad936931e178f7f94bf69af5dc91177e1f723fafc218ec7cf62a7bf","abstract_canon_sha256":"119d8fb3789aefa8c72128db47d73e31c4609e960c33f5e17fe94a0541ab24b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:00.461932Z","signature_b64":"iPuBeiiDogJR1a6iqpZrXmrRwp01Y83r27Hv98LLmQ6ivjaQa6rixzqivxOdo1nj8qFSPBf1yHEgxtYkAVJeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53660701231018a2056c96a642ac86c6a6d9766ba11c8bee1b068880c047be03","last_reissued_at":"2026-07-05T09:15:00.461553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:00.461553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation Based on Optimal Transport Theory in ISAC-Enabled Multi-UAV Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.NI","authors_text":"Lixin Li, Qinghe Du, Wei Liang, Wensheng Lin, Yufeng Zheng, Zhu Han","submitted_at":"2024-10-03T01:01:29Z","abstract_excerpt":"This paper investigates the resource allocation optimization for cooperative communication with non-cooperative localization in integrated sensing and communications (ISAC)-enabled multi-unmanned aerial vehicle (UAV) cooperative networks. Our goal is to maximize the weighted sum of the system's average sum rate and the localization quality of service (QoS) by jointly optimizing cell association, communication power allocation, and sensing power allocation. Since the formulated problem is a mixed-integer nonconvex problem, we propose the alternating iteration algorithm based on optimal transpor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02122","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/2410.02122/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":"2410.02122","created_at":"2026-07-05T09:15:00.461609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02122v1","created_at":"2026-07-05T09:15:00.461609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02122","created_at":"2026-07-05T09:15:00.461609+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNTAOAJDCAMK","created_at":"2026-07-05T09:15:00.461609+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNTAOAJDCAMKEBLM","created_at":"2026-07-05T09:15:00.461609+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNTAOAJD","created_at":"2026-07-05T09:15:00.461609+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/KNTAOAJDCAMKEBLMS2TEFLEGY2","json":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2.json","graph_json":"https://pith.science/api/pith-number/KNTAOAJDCAMKEBLMS2TEFLEGY2/graph.json","events_json":"https://pith.science/api/pith-number/KNTAOAJDCAMKEBLMS2TEFLEGY2/events.json","paper":"https://pith.science/paper/KNTAOAJD"},"agent_actions":{"view_html":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2","download_json":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2.json","view_paper":"https://pith.science/paper/KNTAOAJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02122&json=true","fetch_graph":"https://pith.science/api/pith-number/KNTAOAJDCAMKEBLMS2TEFLEGY2/graph.json","fetch_events":"https://pith.science/api/pith-number/KNTAOAJDCAMKEBLMS2TEFLEGY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2/action/storage_attestation","attest_author":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2/action/author_attestation","sign_citation":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2/action/citation_signature","submit_replication":"https://pith.science/pith/KNTAOAJDCAMKEBLMS2TEFLEGY2/action/replication_record"}},"created_at":"2026-07-05T09:15:00.461609+00:00","updated_at":"2026-07-05T09:15:00.461609+00:00"}