{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q6P3MJ3XQMWPCNMF2ELLWUARXT","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":"7d6062935d5f8e4b64368ecc6bb3c4092eaf45df80fa0c59fec1d1a8dd07960c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-18T15:24:57Z","title_canon_sha256":"afdf13b9eb86d2742e237f05c9ad8e5ddbe4cb78a7c92048547ac4c978a9b2ab"},"schema_version":"1.0","source":{"id":"1902.06610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06610","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06610v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06610","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"Q6P3MJ3XQMWP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"Q6P3MJ3XQMWPCNMF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"Q6P3MJ3X","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e344f58b6004b9d875ccfe4013cdc55c699a12a910f4f51e6afe07fb330a98c3","target":"graph","created_at":"2026-05-17T23:53:08Z","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 problem of trajectory design of unmanned aerial vehicles (UAVs) for maximizing the number of satisfied users is studied in a UAV based cellular network where the UAV works as a flying base station that serves users, and the user indicates its satisfaction in terms of completion of its data request within an allowable maximum waiting time. The trajectory design is formulated as an optimization problem whose goal is to maximize the number of satisfied users. To solve this problem, a machine learning framework based on double Q-learning algorithm is proposed. The algorithm enab","authors_text":"Changchuan Yin, Mingzhe Chen, Xuanlin Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-18T15:24:57Z","title":"Optimized Trajectory Design in UAV Based Cellular Networks for 3D Users: A Double Q-Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06610","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:4a026f8b839dee5f0e41728c9915a2c10e7ed927bc1af4a5edf896a06cb06fa2","target":"record","created_at":"2026-05-17T23:53:08Z","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":"7d6062935d5f8e4b64368ecc6bb3c4092eaf45df80fa0c59fec1d1a8dd07960c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-18T15:24:57Z","title_canon_sha256":"afdf13b9eb86d2742e237f05c9ad8e5ddbe4cb78a7c92048547ac4c978a9b2ab"},"schema_version":"1.0","source":{"id":"1902.06610","kind":"arxiv","version":2}},"canonical_sha256":"879fb62777832cf13585d116bb5011bcecbe15412d4a2e5f92b1c8d35df03b36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"879fb62777832cf13585d116bb5011bcecbe15412d4a2e5f92b1c8d35df03b36","first_computed_at":"2026-05-17T23:53:08.634360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:08.634360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UB8/AXoG5JOE03ArUV3WCSmqMNsB1zcuTmSHEmToAY/HvraiisTBqLNloHFKkeO9oJeLXSx9Imp8RW8rvBYnDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:08.634943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a026f8b839dee5f0e41728c9915a2c10e7ed927bc1af4a5edf896a06cb06fa2","sha256:e344f58b6004b9d875ccfe4013cdc55c699a12a910f4f51e6afe07fb330a98c3"],"state_sha256":"09270b529f3b008be12b33957db247c8f5baec0a510f3313de4d35786655f9fe"}