{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KX56Y6SE6UZ4EFWBFSPTEEUV76","short_pith_number":"pith:KX56Y6SE","schema_version":"1.0","canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","source":{"kind":"arxiv","id":"2006.09658","version":2},"attestation_state":"computed","paper":{"title":"3D Placement for Multi-UAV Relaying: An Iterative Gibbs-Sampling and Block Coordinate Descent Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Changsheng You, Rui Zhang, Zhenyu Kang","submitted_at":"2020-06-17T04:52:05Z","abstract_excerpt":"In this paper, we consider an unmanned aerial vehicle (UAV) enabled relaying system where multiple UAVs are deployed as aerial relays to support simultaneous communications from a set of source nodes to their destination nodes on the ground. An optimization problem is formulated under practical channel models to maximize the minimum achievable expected rate among all pairs of ground nodes by jointly designing UAVs' three-dimensional (3D) placement as well as the bandwidth-and-power allocation. This problem, however, is non-convex and thus difficult to solve. As such, we propose a new method, c"},"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":"2006.09658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-17T04:52:05Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1e3258479c1ee262af50a705358c693dee107e8207524b6d863f689bf0aa1d9b","abstract_canon_sha256":"0c64642be88a155f17b7c3fa97f7bfb81b03ad7a40f11afd18aaa51b6096f10a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:28.170500Z","signature_b64":"dNcj0jwjDPkbfQT2fOdM6axMP8P3SmhPwm0hVJaTUGqDoZDKaiO42qfnsQDzludgHHxS/PGEWhBCfRnnk4WoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","last_reissued_at":"2026-07-05T01:48:28.169986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:28.169986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D Placement for Multi-UAV Relaying: An Iterative Gibbs-Sampling and Block Coordinate Descent Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Changsheng You, Rui Zhang, Zhenyu Kang","submitted_at":"2020-06-17T04:52:05Z","abstract_excerpt":"In this paper, we consider an unmanned aerial vehicle (UAV) enabled relaying system where multiple UAVs are deployed as aerial relays to support simultaneous communications from a set of source nodes to their destination nodes on the ground. An optimization problem is formulated under practical channel models to maximize the minimum achievable expected rate among all pairs of ground nodes by jointly designing UAVs' three-dimensional (3D) placement as well as the bandwidth-and-power allocation. This problem, however, is non-convex and thus difficult to solve. As such, we propose a new method, c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09658","kind":"arxiv","version":2},"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/2006.09658/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":"2006.09658","created_at":"2026-07-05T01:48:28.170041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.09658v2","created_at":"2026-07-05T01:48:28.170041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09658","created_at":"2026-07-05T01:48:28.170041+00:00"},{"alias_kind":"pith_short_12","alias_value":"KX56Y6SE6UZ4","created_at":"2026-07-05T01:48:28.170041+00:00"},{"alias_kind":"pith_short_16","alias_value":"KX56Y6SE6UZ4EFWB","created_at":"2026-07-05T01:48:28.170041+00:00"},{"alias_kind":"pith_short_8","alias_value":"KX56Y6SE","created_at":"2026-07-05T01:48:28.170041+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/KX56Y6SE6UZ4EFWBFSPTEEUV76","json":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76.json","graph_json":"https://pith.science/api/pith-number/KX56Y6SE6UZ4EFWBFSPTEEUV76/graph.json","events_json":"https://pith.science/api/pith-number/KX56Y6SE6UZ4EFWBFSPTEEUV76/events.json","paper":"https://pith.science/paper/KX56Y6SE"},"agent_actions":{"view_html":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76","download_json":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76.json","view_paper":"https://pith.science/paper/KX56Y6SE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.09658&json=true","fetch_graph":"https://pith.science/api/pith-number/KX56Y6SE6UZ4EFWBFSPTEEUV76/graph.json","fetch_events":"https://pith.science/api/pith-number/KX56Y6SE6UZ4EFWBFSPTEEUV76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/action/storage_attestation","attest_author":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/action/author_attestation","sign_citation":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/action/citation_signature","submit_replication":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/action/replication_record"}},"created_at":"2026-07-05T01:48:28.170041+00:00","updated_at":"2026-07-05T01:48:28.170041+00:00"}