{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KX56Y6SE6UZ4EFWBFSPTEEUV76","short_pith_number":"pith:KX56Y6SE","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"},"canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","source":{"kind":"arxiv","id":"2006.09658","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09658","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09658v2","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09658","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"KX56Y6SE6UZ4","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_16","alias_value":"KX56Y6SE6UZ4EFWB","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_8","alias_value":"KX56Y6SE","created_at":"2026-07-05T01:48:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KX56Y6SE6UZ4EFWBFSPTEEUV76","target":"record","payload":{"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"},"canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","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"},"source_kind":"arxiv","source_id":"2006.09658","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:48:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHnrXkmkIXUvZydPLKE44Ra6guavncmirCDQUlmAiqZBpSpDU/jkbdEkZef2oSZKDdi6XMf8sYWqErTpyy1SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:23:04.181949Z"},"content_sha256":"601dd2bb12ac993d53eb63f842ef91584fbc60a2a6354044bafe93cd593930bf","schema_version":"1.0","event_id":"sha256:601dd2bb12ac993d53eb63f842ef91584fbc60a2a6354044bafe93cd593930bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KX56Y6SE6UZ4EFWBFSPTEEUV76","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:48:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOuOWYoY0ePpdb88oZBONHPJndf+YPpvpc2V1l6LsKtH4jYRlVrA09CEvtqupxxD43hgbI9WSbAq9qoyuq5uAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:23:04.182633Z"},"content_sha256":"ea74a1f95628260049d9ed4c87c05fab5eea47097f0546ae7d973fc54b35e57a","schema_version":"1.0","event_id":"sha256:ea74a1f95628260049d9ed4c87c05fab5eea47097f0546ae7d973fc54b35e57a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/bundle.json","state_url":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-31T23:23:04Z","links":{"resolver":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76","bundle":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/bundle.json","state":"https://pith.science/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KX56Y6SE6UZ4EFWBFSPTEEUV76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KX56Y6SE6UZ4EFWBFSPTEEUV76","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":"0c64642be88a155f17b7c3fa97f7bfb81b03ad7a40f11afd18aaa51b6096f10a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-17T04:52:05Z","title_canon_sha256":"1e3258479c1ee262af50a705358c693dee107e8207524b6d863f689bf0aa1d9b"},"schema_version":"1.0","source":{"id":"2006.09658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09658","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09658v2","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09658","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"KX56Y6SE6UZ4","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_16","alias_value":"KX56Y6SE6UZ4EFWB","created_at":"2026-07-05T01:48:28Z"},{"alias_kind":"pith_short_8","alias_value":"KX56Y6SE","created_at":"2026-07-05T01:48:28Z"}],"graph_snapshots":[{"event_id":"sha256:ea74a1f95628260049d9ed4c87c05fab5eea47097f0546ae7d973fc54b35e57a","target":"graph","created_at":"2026-07-05T01:48:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.09658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Changsheng You, Rui Zhang, Zhenyu Kang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-17T04:52:05Z","title":"3D Placement for Multi-UAV Relaying: An Iterative Gibbs-Sampling and Block Coordinate Descent Optimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09658","kind":"arxiv","version":2},"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:601dd2bb12ac993d53eb63f842ef91584fbc60a2a6354044bafe93cd593930bf","target":"record","created_at":"2026-07-05T01:48:28Z","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":"0c64642be88a155f17b7c3fa97f7bfb81b03ad7a40f11afd18aaa51b6096f10a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-17T04:52:05Z","title_canon_sha256":"1e3258479c1ee262af50a705358c693dee107e8207524b6d863f689bf0aa1d9b"},"schema_version":"1.0","source":{"id":"2006.09658","kind":"arxiv","version":2}},"canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55fbec7a44f533c216c12c9f321295ff93d3bd4eb5cbe06d5ed202b49328dd10","first_computed_at":"2026-07-05T01:48:28.169986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:48:28.169986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dNcj0jwjDPkbfQT2fOdM6axMP8P3SmhPwm0hVJaTUGqDoZDKaiO42qfnsQDzludgHHxS/PGEWhBCfRnnk4WoBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:48:28.170500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.09658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:601dd2bb12ac993d53eb63f842ef91584fbc60a2a6354044bafe93cd593930bf","sha256:ea74a1f95628260049d9ed4c87c05fab5eea47097f0546ae7d973fc54b35e57a"],"state_sha256":"a8d6dd05898d47342628e582bf1f3f68c5371e5992d987a6b6f68f7768a4612a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aunmFQBL2j5oxR3OdapvD+eGfPm4/Nb3FlzRAMglKRPY/PxVoP6O35Gs0BlZUuerDlmgWx5wO5gBTcugkPlvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T23:23:04.187178Z","bundle_sha256":"4b7304152eb57218415f7bc603bc85dd8345e604ece507dde1013ce2f5700af4"}}