{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZO42D72J3VJYNLNSDXQA5OOGTC","short_pith_number":"pith:ZO42D72J","schema_version":"1.0","canonical_sha256":"cbb9a1ff49dd5386adb21de00eb9c698927ceb064643edd8d7ee2d206746e4f4","source":{"kind":"arxiv","id":"1906.09550","version":2},"attestation_state":"computed","paper":{"title":"Reinforcement Learning-Based Trajectory Design for the Aerial Base Stations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NI"],"primary_cat":"eess.SP","authors_text":"Behzad Khamidehi, Elvino S. Sousa","submitted_at":"2019-06-23T04:08:33Z","abstract_excerpt":"In this paper, the trajectory optimization problem for a multi-aerial base station (ABS) communication network is investigated. The objective is to find the trajectory of the ABSs so that the sum-rate of the users served by each ABS is maximized. To reach this goal, along with the optimal trajectory design, optimal power and sub-channel allocation is also of great importance to support the users with the highest possible data rates. To solve this complicated problem, we divide it into two sub-problems: ABS trajectory optimization sub-problem, and joint power and sub-channel assignment sub-prob"},"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":"1906.09550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-23T04:08:33Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NI"],"title_canon_sha256":"197dedec8127396e539f63223ce84a4e05e0b3c4453fbd11d854916bcfb94c8b","abstract_canon_sha256":"cb2e9c526789540454702dae9fcc4f3ca4b7ec2de738f6fd8c483c7d8f9fe27e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:57.728015Z","signature_b64":"B334QipKefD1LU085PLMuzkcpSZqRL20XXq3Jky3dZt/ANiwIHkQLeOqpJ1Alspo6k/fylUNKWjXgfF8XFIaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbb9a1ff49dd5386adb21de00eb9c698927ceb064643edd8d7ee2d206746e4f4","last_reissued_at":"2026-05-17T23:41:57.727118Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:57.727118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning-Based Trajectory Design for the Aerial Base Stations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NI"],"primary_cat":"eess.SP","authors_text":"Behzad Khamidehi, Elvino S. Sousa","submitted_at":"2019-06-23T04:08:33Z","abstract_excerpt":"In this paper, the trajectory optimization problem for a multi-aerial base station (ABS) communication network is investigated. The objective is to find the trajectory of the ABSs so that the sum-rate of the users served by each ABS is maximized. To reach this goal, along with the optimal trajectory design, optimal power and sub-channel allocation is also of great importance to support the users with the highest possible data rates. To solve this complicated problem, we divide it into two sub-problems: ABS trajectory optimization sub-problem, and joint power and sub-channel assignment sub-prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09550","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.09550","created_at":"2026-05-17T23:41:57.727281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09550v2","created_at":"2026-05-17T23:41:57.727281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09550","created_at":"2026-05-17T23:41:57.727281+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO42D72J3VJY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO42D72J3VJYNLNS","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO42D72J","created_at":"2026-05-18T12:33:33.725879+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/ZO42D72J3VJYNLNSDXQA5OOGTC","json":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC.json","graph_json":"https://pith.science/api/pith-number/ZO42D72J3VJYNLNSDXQA5OOGTC/graph.json","events_json":"https://pith.science/api/pith-number/ZO42D72J3VJYNLNSDXQA5OOGTC/events.json","paper":"https://pith.science/paper/ZO42D72J"},"agent_actions":{"view_html":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC","download_json":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC.json","view_paper":"https://pith.science/paper/ZO42D72J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09550&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO42D72J3VJYNLNSDXQA5OOGTC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO42D72J3VJYNLNSDXQA5OOGTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC/action/storage_attestation","attest_author":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC/action/author_attestation","sign_citation":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC/action/citation_signature","submit_replication":"https://pith.science/pith/ZO42D72J3VJYNLNSDXQA5OOGTC/action/replication_record"}},"created_at":"2026-05-17T23:41:57.727281+00:00","updated_at":"2026-05-17T23:41:57.727281+00:00"}