{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N7XPZHRM7XICNIK4PPIG3MIHOP","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":"45cf2f984a3e5f0ca525da1c246933733c15974b16ff038a6b71b77f10385338","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-19T06:35:15Z","title_canon_sha256":"88170769da91c45c270595e710ac7306a52e482d3726fbc6b4df0760f9eeeef7"},"schema_version":"1.0","source":{"id":"1911.08111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08111","created_at":"2026-07-05T00:38:34Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08111v2","created_at":"2026-07-05T00:38:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08111","created_at":"2026-07-05T00:38:34Z"},{"alias_kind":"pith_short_12","alias_value":"N7XPZHRM7XIC","created_at":"2026-07-05T00:38:34Z"},{"alias_kind":"pith_short_16","alias_value":"N7XPZHRM7XICNIK4","created_at":"2026-07-05T00:38:34Z"},{"alias_kind":"pith_short_8","alias_value":"N7XPZHRM","created_at":"2026-07-05T00:38:34Z"}],"graph_snapshots":[{"event_id":"sha256:8cb9b7a1e35a75a7af0a26af218ab2476d1dcba132cb1f9e30253b802042b8b0","target":"graph","created_at":"2026-07-05T00:38:34Z","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/1911.08111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Unmanned aerial vehicles (UAVs) can be utilized as aerial base stations (ABSs) to assist terrestrial infrastructure for keeping wireless connectivity in various emergency scenarios. To maximize the coverage rate of N ground users (GUs) by jointly placing multiple ABSs with limited coverage range is known to be a NP-hard problem with exponential complexity in N. The problem is further complicated when the coverage range becomes irregular due to site-specific blockage (e.g., buildings) on the air-ground channel in the 3-dimensional (3D) space. To tackle this challenging problem, this paper appli","authors_text":"Jiangbin Lyu, Jin Qiu, Liqun Fu","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-19T06:35:15Z","title":"Placement Optimization of Aerial Base Stations with Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08111","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:1a3fe3869a62b3ab91491678236826fbd98167feb86c5c9c5f5c43d01c6c47df","target":"record","created_at":"2026-07-05T00:38:34Z","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":"45cf2f984a3e5f0ca525da1c246933733c15974b16ff038a6b71b77f10385338","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-19T06:35:15Z","title_canon_sha256":"88170769da91c45c270595e710ac7306a52e482d3726fbc6b4df0760f9eeeef7"},"schema_version":"1.0","source":{"id":"1911.08111","kind":"arxiv","version":2}},"canonical_sha256":"6feefc9e2cfdd026a15c7bd06db10773e46bcf150eb002c569c3c0bfd8eaac32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6feefc9e2cfdd026a15c7bd06db10773e46bcf150eb002c569c3c0bfd8eaac32","first_computed_at":"2026-07-05T00:38:34.850712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:34.850712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Ffh0Hfhgx6VIfsPbw8GCmaTaYTF6BP2DfrZYq1FiMzJ7YBjtHaOs1piESRA3WtlpDjIKquDLnNkzilveSQACg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:34.851169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a3fe3869a62b3ab91491678236826fbd98167feb86c5c9c5f5c43d01c6c47df","sha256:8cb9b7a1e35a75a7af0a26af218ab2476d1dcba132cb1f9e30253b802042b8b0"],"state_sha256":"5ff3b4466ba6a689e2843d188f88d35051987a6cbb5c1f4b90e167fe4fef58f3"}