{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XQW3DB5NNREQ4TP6GPDKRXIUBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c0c78c97c0a086b57df9f9187e16a5d5ccd2fd27c1bd0f98fc2ecdcfe618a9c8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T01:42:31Z","title_canon_sha256":"e2b701438c1c50a75c7310925ddc5b0e8f8b4b86a92f6feab60dcc8eddac4361"},"schema_version":"1.0","source":{"id":"1602.01532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01532","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01532v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01532","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"XQW3DB5NNREQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XQW3DB5NNREQ4TP6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XQW3DB5N","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ab00190c51a0c66fbab379d7ca144fb5c9097b910bf0374586bcc52f0b8c04f5","target":"graph","created_at":"2026-05-18T01:21:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, the optimal deployment of multiple unmanned aerial vehicles (UAVs) acting as flying base stations is investigated. Considering the downlink scenario, the goal is to minimize the total required transmit power of UAVs while satisfying the users' rate requirements. To this end, the optimal locations of UAVs as well as the cell boundaries of their coverage areas are determined. To find those optimal parameters, the problem is divided into two sub-problems that are solved iteratively. In the first sub-problem, given the cell boundaries corresponding to each UAV, the optimal locations","authors_text":"Mehdi Bennis, Merouane Debbah, Mohammad Mozaffari, Walid Saad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T01:42:31Z","title":"Optimal Transport Theory for Power-Efficient Deployment of Unmanned Aerial Vehicles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01532","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d499fdf31cac5e4fad5f33c9890a001e8f5cd4672d0e5739b6aa3cb1826cfd44","target":"record","created_at":"2026-05-18T01:21:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c0c78c97c0a086b57df9f9187e16a5d5ccd2fd27c1bd0f98fc2ecdcfe618a9c8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T01:42:31Z","title_canon_sha256":"e2b701438c1c50a75c7310925ddc5b0e8f8b4b86a92f6feab60dcc8eddac4361"},"schema_version":"1.0","source":{"id":"1602.01532","kind":"arxiv","version":1}},"canonical_sha256":"bc2db187ad6c490e4dfe33c6a8dd140c36fe646879c653c6a3a8497bdde9d9c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc2db187ad6c490e4dfe33c6a8dd140c36fe646879c653c6a3a8497bdde9d9c0","first_computed_at":"2026-05-18T01:21:18.751790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.751790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FWhTZw2QmkYuY3FHt7jZ9Ul/UoMGuoebxiQyY+PVMWCbNTgMtd57CoXC+JVN4T789jG4nFUBtid7ASdHi6NvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.752481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d499fdf31cac5e4fad5f33c9890a001e8f5cd4672d0e5739b6aa3cb1826cfd44","sha256:ab00190c51a0c66fbab379d7ca144fb5c9097b910bf0374586bcc52f0b8c04f5"],"state_sha256":"7f9ba9bc1944ba07759d4b5c83a34d07d22dafb3bfafb1f8f82a3468ce8e616f"}