{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R2HHSD7WCAKVKWT3ODDCP6CMRC","short_pith_number":"pith:R2HHSD7W","schema_version":"1.0","canonical_sha256":"8e8e790ff61015555a7b70c627f84c8880f0f0e41893623c65278afc759598e9","source":{"kind":"arxiv","id":"1709.05235","version":1},"attestation_state":"computed","paper":{"title":"3D Placement of an Unmanned Aerial Vehicle Base Station for Maximum Coverage of Users with Different QoS Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr El-Keyi, Halim Yanikomeroglu, Mohamed Alzenad","submitted_at":"2017-09-15T14:41:16Z","abstract_excerpt":"The need for a rapid-to-deploy solution for providing wireless cellular services can be realized by unmanned aerial vehicle base stations (UAV-BSs). To the best of our knowledge, this letter is the first in literature that studies a novel 3D UAV-BS placement that maximizes the number of covered users with different Quality-of-Service requirements. We model the placement problem as a multiple circles placement problem and propose an optimal placement algorithm that utilizes an exhaustive search (ES) over a one-dimensional parameter in a closed region. We also propose a low-complexity algorithm,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.05235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-15T14:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5c196e9361d9a3d8969dbab7992e60434a51b8c9759abce218883b81d221d5f4","abstract_canon_sha256":"1147c8ca45094d6b3038354493b24f790b53069e9060b242a4c7aff25e10b36e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.299769Z","signature_b64":"G1opw/bkc8HzFdxhBxrMWPA6S4EG95CG2WJ/1wNaUt1Dom24ehVsI2Vi+lZpeSDSGN9Wl1zZd7C4YCSnJrCJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e8e790ff61015555a7b70c627f84c8880f0f0e41893623c65278afc759598e9","last_reissued_at":"2026-05-18T00:35:06.299139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.299139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D Placement of an Unmanned Aerial Vehicle Base Station for Maximum Coverage of Users with Different QoS Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr El-Keyi, Halim Yanikomeroglu, Mohamed Alzenad","submitted_at":"2017-09-15T14:41:16Z","abstract_excerpt":"The need for a rapid-to-deploy solution for providing wireless cellular services can be realized by unmanned aerial vehicle base stations (UAV-BSs). To the best of our knowledge, this letter is the first in literature that studies a novel 3D UAV-BS placement that maximizes the number of covered users with different Quality-of-Service requirements. We model the placement problem as a multiple circles placement problem and propose an optimal placement algorithm that utilizes an exhaustive search (ES) over a one-dimensional parameter in a closed region. We also propose a low-complexity algorithm,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05235","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.05235","created_at":"2026-05-18T00:35:06.299229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05235v1","created_at":"2026-05-18T00:35:06.299229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05235","created_at":"2026-05-18T00:35:06.299229+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2HHSD7WCAKV","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2HHSD7WCAKVKWT3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2HHSD7W","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC","json":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC.json","graph_json":"https://pith.science/api/pith-number/R2HHSD7WCAKVKWT3ODDCP6CMRC/graph.json","events_json":"https://pith.science/api/pith-number/R2HHSD7WCAKVKWT3ODDCP6CMRC/events.json","paper":"https://pith.science/paper/R2HHSD7W"},"agent_actions":{"view_html":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC","download_json":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC.json","view_paper":"https://pith.science/paper/R2HHSD7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05235&json=true","fetch_graph":"https://pith.science/api/pith-number/R2HHSD7WCAKVKWT3ODDCP6CMRC/graph.json","fetch_events":"https://pith.science/api/pith-number/R2HHSD7WCAKVKWT3ODDCP6CMRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC/action/storage_attestation","attest_author":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC/action/author_attestation","sign_citation":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC/action/citation_signature","submit_replication":"https://pith.science/pith/R2HHSD7WCAKVKWT3ODDCP6CMRC/action/replication_record"}},"created_at":"2026-05-18T00:35:06.299229+00:00","updated_at":"2026-05-18T00:35:06.299229+00:00"}