{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IELROLFOOLJ3EBY6HMBM2FRUDF","short_pith_number":"pith:IELROLFO","schema_version":"1.0","canonical_sha256":"4117172cae72d3b2071e3b02cd16341965eab84b7aa94bbb3f032ad8f4b46290","source":{"kind":"arxiv","id":"2508.00938","version":1},"attestation_state":"computed","paper":{"title":"Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.SY"],"primary_cat":"eess.SY","authors_text":"Qihui Wu, Qiuming Zhu, Sijie He, Wei Wang, Zhu Han, Ziye Jia","submitted_at":"2025-07-31T13:00:10Z","abstract_excerpt":"Due to the high flexibility and versatility, unmanned aerial vehicles (UAVs) are leveraged in various fields including surveillance and disaster rescue.However, in UAV networks, routing is vulnerable to malicious damage due to distributed topologies and high dynamics. Hence, ensuring the routing security of UAV networks is challenging. In this paper, we characterize the routing process in a time-varying UAV network with malicious nodes. Specifically, we formulate the routing problem to minimize the total delay, which is an integer linear programming and intractable to solve. Then, to tackle th"},"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.00938","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SY","submitted_at":"2025-07-31T13:00:10Z","cross_cats_sorted":["cs.AI","cs.CR","cs.SY"],"title_canon_sha256":"a90ce480a80536c96215796310383385a5715425b1c8d4cd97af96848490f546","abstract_canon_sha256":"a709a40534f786283435d60c6c44e3da9734345b721d722821febdd1703be2ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:30.122579Z","signature_b64":"ZG0TOoQiteNlxK+lTg0OrDcCcUtys4w7SlSKN9c+4M6Zer2Ayn39dYmft9/84yE5dtJ3TOpXasjE++QcEyOeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4117172cae72d3b2071e3b02cd16341965eab84b7aa94bbb3f032ad8f4b46290","last_reissued_at":"2026-07-05T11:47:30.122177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:30.122177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.SY"],"primary_cat":"eess.SY","authors_text":"Qihui Wu, Qiuming Zhu, Sijie He, Wei Wang, Zhu Han, Ziye Jia","submitted_at":"2025-07-31T13:00:10Z","abstract_excerpt":"Due to the high flexibility and versatility, unmanned aerial vehicles (UAVs) are leveraged in various fields including surveillance and disaster rescue.However, in UAV networks, routing is vulnerable to malicious damage due to distributed topologies and high dynamics. Hence, ensuring the routing security of UAV networks is challenging. In this paper, we characterize the routing process in a time-varying UAV network with malicious nodes. Specifically, we formulate the routing problem to minimize the total delay, which is an integer linear programming and intractable to solve. Then, to tackle th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00938","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.00938/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.00938","created_at":"2026-07-05T11:47:30.122233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.00938v1","created_at":"2026-07-05T11:47:30.122233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00938","created_at":"2026-07-05T11:47:30.122233+00:00"},{"alias_kind":"pith_short_12","alias_value":"IELROLFOOLJ3","created_at":"2026-07-05T11:47:30.122233+00:00"},{"alias_kind":"pith_short_16","alias_value":"IELROLFOOLJ3EBY6","created_at":"2026-07-05T11:47:30.122233+00:00"},{"alias_kind":"pith_short_8","alias_value":"IELROLFO","created_at":"2026-07-05T11:47:30.122233+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/IELROLFOOLJ3EBY6HMBM2FRUDF","json":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF.json","graph_json":"https://pith.science/api/pith-number/IELROLFOOLJ3EBY6HMBM2FRUDF/graph.json","events_json":"https://pith.science/api/pith-number/IELROLFOOLJ3EBY6HMBM2FRUDF/events.json","paper":"https://pith.science/paper/IELROLFO"},"agent_actions":{"view_html":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF","download_json":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF.json","view_paper":"https://pith.science/paper/IELROLFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.00938&json=true","fetch_graph":"https://pith.science/api/pith-number/IELROLFOOLJ3EBY6HMBM2FRUDF/graph.json","fetch_events":"https://pith.science/api/pith-number/IELROLFOOLJ3EBY6HMBM2FRUDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF/action/storage_attestation","attest_author":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF/action/author_attestation","sign_citation":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF/action/citation_signature","submit_replication":"https://pith.science/pith/IELROLFOOLJ3EBY6HMBM2FRUDF/action/replication_record"}},"created_at":"2026-07-05T11:47:30.122233+00:00","updated_at":"2026-07-05T11:47:30.122233+00:00"}