{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GV4E366C33FZSZWBUM4JNO5JJ3","short_pith_number":"pith:GV4E366C","canonical_record":{"source":{"id":"1708.06478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T02:00:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"797deaafc892a872d6002228fa1ec4e54bdfebbcb717633bed2dc24ef882d8bc","abstract_canon_sha256":"2e6f7d67d618b9c5fcd36539da3ee335e4621d12dc22562afbada0e5d4cfaa55"},"schema_version":"1.0"},"canonical_sha256":"35784dfbc2decb9966c1a33896bba94efb9088f2af52245380ccd01c7f83e401","source":{"kind":"arxiv","id":"1708.06478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06478","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06478v1","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06478","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"GV4E366C33FZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GV4E366C33FZSZWB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GV4E366C","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GV4E366C33FZSZWBUM4JNO5JJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T02:00:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"797deaafc892a872d6002228fa1ec4e54bdfebbcb717633bed2dc24ef882d8bc","abstract_canon_sha256":"2e6f7d67d618b9c5fcd36539da3ee335e4621d12dc22562afbada0e5d4cfaa55"},"schema_version":"1.0"},"canonical_sha256":"35784dfbc2decb9966c1a33896bba94efb9088f2af52245380ccd01c7f83e401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:39.353773Z","signature_b64":"HsqTXaJibWVCnWOPBo6rbOLe3nV3ZiRCgv6HgB3cQAuTZYdFr1nnRGPAcq8GKSJ3ibdWxdxgva6uddWvtBRICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35784dfbc2decb9966c1a33896bba94efb9088f2af52245380ccd01c7f83e401","last_reissued_at":"2026-05-18T00:37:39.353156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:39.353156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06478","source_version":1,"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:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2gBSDAvbUfnQa5jMDeX03cs+f8CHh/dTuvnwZ8ti3s40WzILOVVtip8Z7WSt5IWPaszouxjHlmQ99/+Ur1TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:20.267135Z"},"content_sha256":"a17323cdf57063b068171e51702bfd1f8c95f56872af1cb4c5d46a4b0af4257d","schema_version":"1.0","event_id":"sha256:a17323cdf57063b068171e51702bfd1f8c95f56872af1cb4c5d46a4b0af4257d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GV4E366C33FZSZWBUM4JNO5JJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trajectory Optimization for Completion Time Minimization in UAV-Enabled Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rui Zhang, Xiaoli Xu, Yong Zeng","submitted_at":"2017-08-22T02:00:28Z","abstract_excerpt":"This paper studies an unmanned aerial vehicle (UAV)-enabled multicasting system, where a UAV is dispatched to disseminate a common file to a number of geographically distributed ground terminals (GTs). Our objective is to design the UAV trajectory to minimize its mission completion time, while ensuring that each GT is able to successfully recover the file with a high probability required. We consider the use of practical random linear network coding (RLNC) for UAV multicasting, so that each GT is able to recover the file as long as it receives a sufficiently large number of coded packets. Howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06478","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":""},"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:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K48f0BY5KGJM3+wgX8XTIF6SY26TsVdzzrXzRXTdzr/yYJp7Fu0OedMEMBWwKyAjtkVWDQuO1/MpiIjvQ7kBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:20.267494Z"},"content_sha256":"a845c0e14e90aad7c9a9d8eb6a36b8b58793a7f17c50ba26d32507b1ff5c152c","schema_version":"1.0","event_id":"sha256:a845c0e14e90aad7c9a9d8eb6a36b8b58793a7f17c50ba26d32507b1ff5c152c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GV4E366C33FZSZWBUM4JNO5JJ3/bundle.json","state_url":"https://pith.science/pith/GV4E366C33FZSZWBUM4JNO5JJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GV4E366C33FZSZWBUM4JNO5JJ3/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-05-28T12:15:20Z","links":{"resolver":"https://pith.science/pith/GV4E366C33FZSZWBUM4JNO5JJ3","bundle":"https://pith.science/pith/GV4E366C33FZSZWBUM4JNO5JJ3/bundle.json","state":"https://pith.science/pith/GV4E366C33FZSZWBUM4JNO5JJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GV4E366C33FZSZWBUM4JNO5JJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GV4E366C33FZSZWBUM4JNO5JJ3","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":"2e6f7d67d618b9c5fcd36539da3ee335e4621d12dc22562afbada0e5d4cfaa55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T02:00:28Z","title_canon_sha256":"797deaafc892a872d6002228fa1ec4e54bdfebbcb717633bed2dc24ef882d8bc"},"schema_version":"1.0","source":{"id":"1708.06478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06478","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06478v1","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06478","created_at":"2026-05-18T00:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"GV4E366C33FZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GV4E366C33FZSZWB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GV4E366C","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:a845c0e14e90aad7c9a9d8eb6a36b8b58793a7f17c50ba26d32507b1ff5c152c","target":"graph","created_at":"2026-05-18T00:37:39Z","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":"This paper studies an unmanned aerial vehicle (UAV)-enabled multicasting system, where a UAV is dispatched to disseminate a common file to a number of geographically distributed ground terminals (GTs). Our objective is to design the UAV trajectory to minimize its mission completion time, while ensuring that each GT is able to successfully recover the file with a high probability required. We consider the use of practical random linear network coding (RLNC) for UAV multicasting, so that each GT is able to recover the file as long as it receives a sufficiently large number of coded packets. Howe","authors_text":"Rui Zhang, Xiaoli Xu, Yong Zeng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T02:00:28Z","title":"Trajectory Optimization for Completion Time Minimization in UAV-Enabled Multicasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06478","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:a17323cdf57063b068171e51702bfd1f8c95f56872af1cb4c5d46a4b0af4257d","target":"record","created_at":"2026-05-18T00:37:39Z","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":"2e6f7d67d618b9c5fcd36539da3ee335e4621d12dc22562afbada0e5d4cfaa55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T02:00:28Z","title_canon_sha256":"797deaafc892a872d6002228fa1ec4e54bdfebbcb717633bed2dc24ef882d8bc"},"schema_version":"1.0","source":{"id":"1708.06478","kind":"arxiv","version":1}},"canonical_sha256":"35784dfbc2decb9966c1a33896bba94efb9088f2af52245380ccd01c7f83e401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35784dfbc2decb9966c1a33896bba94efb9088f2af52245380ccd01c7f83e401","first_computed_at":"2026-05-18T00:37:39.353156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:39.353156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsqTXaJibWVCnWOPBo6rbOLe3nV3ZiRCgv6HgB3cQAuTZYdFr1nnRGPAcq8GKSJ3ibdWxdxgva6uddWvtBRICA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:39.353773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a17323cdf57063b068171e51702bfd1f8c95f56872af1cb4c5d46a4b0af4257d","sha256:a845c0e14e90aad7c9a9d8eb6a36b8b58793a7f17c50ba26d32507b1ff5c152c"],"state_sha256":"3560bf8b2fd480296d5fae43f501aa391f702c211893d009bb8d50ba450afeff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwnSskkI4rIprtW1vIOHm/TAHtsFKZqTHPvp48/QWGMNHR+h8p+gYRDVl9AW4jIpf/XGECKGAr7uC3AfPXkOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:20.269518Z","bundle_sha256":"2166232f63f43483e7b28cd4f181b4950803a49ee6dc77f70de0d7dacf4a0fdc"}}