{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H2JHYDYDJ7GMT72PFSXNJU262U","short_pith_number":"pith:H2JHYDYD","canonical_record":{"source":{"id":"1806.05165","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:47:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8e85bfbde4299a3ca279fe768347688bef3e3ce0c2962e797f747f6aea8bb2e","abstract_canon_sha256":"129e82a01377ad31f2108a0d37636e16e593d777ff14f1e6724c25912d06a1b0"},"schema_version":"1.0"},"canonical_sha256":"3e927c0f034fccc9ff4f2caed4d35ed51ad6f728be103157d1d5cd6c0f3aa035","source":{"kind":"arxiv","id":"1806.05165","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05165","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05165v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05165","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"H2JHYDYDJ7GM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H2JHYDYDJ7GMT72P","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H2JHYDYD","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H2JHYDYDJ7GMT72PFSXNJU262U","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05165","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:47:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8e85bfbde4299a3ca279fe768347688bef3e3ce0c2962e797f747f6aea8bb2e","abstract_canon_sha256":"129e82a01377ad31f2108a0d37636e16e593d777ff14f1e6724c25912d06a1b0"},"schema_version":"1.0"},"canonical_sha256":"3e927c0f034fccc9ff4f2caed4d35ed51ad6f728be103157d1d5cd6c0f3aa035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.362912Z","signature_b64":"URDb6N5NGleAO8+Xq11GfeuwLf+HvQW0ifLHqAxfDs5glxCTuij1qK5Ew1SURUoc2C9XQqMulq1WiqNI7JhsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e927c0f034fccc9ff4f2caed4d35ed51ad6f728be103157d1d5cd6c0f3aa035","last_reissued_at":"2026-05-18T00:01:43.362390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.362390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05165","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-05-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMAhlwZVGcyZSZN14kPM00wCbiYvKA0f6J669osxl5ZfLkyB/T6mdBio5hgZirnC+HaRG/aDRi6rHAGHOB+TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:44:02.032832Z"},"content_sha256":"2ed88d6882820b37563fdaf39cf1404569fdde86a6ae77c95a8c07f757e69059","schema_version":"1.0","event_id":"sha256:2ed88d6882820b37563fdaf39cf1404569fdde86a6ae77c95a8c07f757e69059"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H2JHYDYDJ7GMT72PFSXNJU262U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Communicate in UAV-aided Wireless Networks: Map-based Approaches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Gesbert, Omid Esrafilian, Rajeev Gangula","submitted_at":"2018-06-13T17:47:57Z","abstract_excerpt":"We consider a scenario where an UAV-mounted flying base station is providing data communication services to a number of radio nodes spread over the ground. We focus on the problem of resource-constrained UAV trajectory design with (i) optimal channel parameters learning and (ii) optimal data throughput as key objectives, respectively. While the problem of throughput optimized trajectories has been addressed in prior works, the formulation of an optimized trajectory to efficiently discover the propagation parameters has not yet been addressed. When it comes to the communication phase, the advan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05165","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":""},"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-05-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic9lHlnyPMrivbzTYxPheKLh7kFXMqoU2aGW3VvC2gw9iLRKpZ5NJlrF2ejsjvT/CBu+hgkicYfhTXwqrOMTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:44:02.033548Z"},"content_sha256":"1015d791dfdbe9e1678b033771d9b00d7e1f7a979d5a810db3ee4e1c0984a73c","schema_version":"1.0","event_id":"sha256:1015d791dfdbe9e1678b033771d9b00d7e1f7a979d5a810db3ee4e1c0984a73c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2JHYDYDJ7GMT72PFSXNJU262U/bundle.json","state_url":"https://pith.science/pith/H2JHYDYDJ7GMT72PFSXNJU262U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2JHYDYDJ7GMT72PFSXNJU262U/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-06-06T06:44:02Z","links":{"resolver":"https://pith.science/pith/H2JHYDYDJ7GMT72PFSXNJU262U","bundle":"https://pith.science/pith/H2JHYDYDJ7GMT72PFSXNJU262U/bundle.json","state":"https://pith.science/pith/H2JHYDYDJ7GMT72PFSXNJU262U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2JHYDYDJ7GMT72PFSXNJU262U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H2JHYDYDJ7GMT72PFSXNJU262U","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":"129e82a01377ad31f2108a0d37636e16e593d777ff14f1e6724c25912d06a1b0","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:47:57Z","title_canon_sha256":"d8e85bfbde4299a3ca279fe768347688bef3e3ce0c2962e797f747f6aea8bb2e"},"schema_version":"1.0","source":{"id":"1806.05165","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05165","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05165v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05165","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"H2JHYDYDJ7GM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H2JHYDYDJ7GMT72P","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H2JHYDYD","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:1015d791dfdbe9e1678b033771d9b00d7e1f7a979d5a810db3ee4e1c0984a73c","target":"graph","created_at":"2026-05-18T00:01:43Z","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":"We consider a scenario where an UAV-mounted flying base station is providing data communication services to a number of radio nodes spread over the ground. We focus on the problem of resource-constrained UAV trajectory design with (i) optimal channel parameters learning and (ii) optimal data throughput as key objectives, respectively. While the problem of throughput optimized trajectories has been addressed in prior works, the formulation of an optimized trajectory to efficiently discover the propagation parameters has not yet been addressed. When it comes to the communication phase, the advan","authors_text":"David Gesbert, Omid Esrafilian, Rajeev Gangula","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:47:57Z","title":"Learning to Communicate in UAV-aided Wireless Networks: Map-based Approaches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05165","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:2ed88d6882820b37563fdaf39cf1404569fdde86a6ae77c95a8c07f757e69059","target":"record","created_at":"2026-05-18T00:01:43Z","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":"129e82a01377ad31f2108a0d37636e16e593d777ff14f1e6724c25912d06a1b0","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:47:57Z","title_canon_sha256":"d8e85bfbde4299a3ca279fe768347688bef3e3ce0c2962e797f747f6aea8bb2e"},"schema_version":"1.0","source":{"id":"1806.05165","kind":"arxiv","version":2}},"canonical_sha256":"3e927c0f034fccc9ff4f2caed4d35ed51ad6f728be103157d1d5cd6c0f3aa035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e927c0f034fccc9ff4f2caed4d35ed51ad6f728be103157d1d5cd6c0f3aa035","first_computed_at":"2026-05-18T00:01:43.362390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:43.362390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URDb6N5NGleAO8+Xq11GfeuwLf+HvQW0ifLHqAxfDs5glxCTuij1qK5Ew1SURUoc2C9XQqMulq1WiqNI7JhsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:43.362912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05165","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ed88d6882820b37563fdaf39cf1404569fdde86a6ae77c95a8c07f757e69059","sha256:1015d791dfdbe9e1678b033771d9b00d7e1f7a979d5a810db3ee4e1c0984a73c"],"state_sha256":"8f13210a6a73f5becf17e765735f1ae9b4e5779bdceffecbbc9b4b747540632a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkVpA+3LDppYuqk6hIGvNd1mrKOFT9kd9hJWic03Wb0hIjqvXntHjs/ByM8IOpJNAORcSnD6gGDLgW68EvyAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:44:02.037405Z","bundle_sha256":"e8b03e94377a3381700d8187e4df5fad364c4ce51f24a93f40afbf6e40fede2d"}}