{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G7KPVD6ZCXDF3BQFK7OSB3OQ5I","short_pith_number":"pith:G7KPVD6Z","schema_version":"1.0","canonical_sha256":"37d4fa8fd915c65d860557dd20edd0ea3c467e9520bfc2efdface7d0a58a94a5","source":{"kind":"arxiv","id":"1509.08304","version":2},"attestation_state":"computed","paper":{"title":"Optimal Energy Allocation Policies for a High Altitude Flying Wireless Access Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Elif Tugce Ceran, Elif Uysal-Biyikoglu, Kemal Leblebicioglu, Tolga Girici, Tugce Erkilic","submitted_at":"2015-09-25T15:35:38Z","abstract_excerpt":"Inspired by recent industrial efforts toward high altitude flying wireless access points powered by renewable energy, an online resource allocation problem for a mobile access point (AP) travelling at high altitude is formulated. The AP allocates its resources (available energy) to maximize the total utility (reward) provided to a sequentially observed set of users demanding service. The problem is formulated as a 0/1 dynamic knapsack problem with incremental capacity over a finite time horizon, the solution of which is quite open in the literature. We address the problem through deterministic"},"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":"1509.08304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-25T15:35:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"530e890e98787bc2ad8ee625e12ade1252a3ab053e97a1b85e0a9ba45906252f","abstract_canon_sha256":"d9e439112cfc72b02f4dde4a84b30eb85c9e31f8c35dd5b28048c2c883622c38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.700519Z","signature_b64":"z0DqgMDTubqUyBVytH3zN7rbqbe5ji8R5yJBkwegHVqoZUs8N8e3QK2e73CIrBi53P15K+7jg5WhZFb2fAVKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d4fa8fd915c65d860557dd20edd0ea3c467e9520bfc2efdface7d0a58a94a5","last_reissued_at":"2026-05-18T01:30:07.699961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.699961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Energy Allocation Policies for a High Altitude Flying Wireless Access Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Elif Tugce Ceran, Elif Uysal-Biyikoglu, Kemal Leblebicioglu, Tolga Girici, Tugce Erkilic","submitted_at":"2015-09-25T15:35:38Z","abstract_excerpt":"Inspired by recent industrial efforts toward high altitude flying wireless access points powered by renewable energy, an online resource allocation problem for a mobile access point (AP) travelling at high altitude is formulated. The AP allocates its resources (available energy) to maximize the total utility (reward) provided to a sequentially observed set of users demanding service. The problem is formulated as a 0/1 dynamic knapsack problem with incremental capacity over a finite time horizon, the solution of which is quite open in the literature. We address the problem through deterministic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08304","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":"1509.08304","created_at":"2026-05-18T01:30:07.700076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08304v2","created_at":"2026-05-18T01:30:07.700076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08304","created_at":"2026-05-18T01:30:07.700076+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7KPVD6ZCXDF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7KPVD6ZCXDF3BQF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7KPVD6Z","created_at":"2026-05-18T12:29:22.688609+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/G7KPVD6ZCXDF3BQFK7OSB3OQ5I","json":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I.json","graph_json":"https://pith.science/api/pith-number/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/graph.json","events_json":"https://pith.science/api/pith-number/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/events.json","paper":"https://pith.science/paper/G7KPVD6Z"},"agent_actions":{"view_html":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I","download_json":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I.json","view_paper":"https://pith.science/paper/G7KPVD6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08304&json=true","fetch_graph":"https://pith.science/api/pith-number/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/graph.json","fetch_events":"https://pith.science/api/pith-number/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/action/storage_attestation","attest_author":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/action/author_attestation","sign_citation":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/action/citation_signature","submit_replication":"https://pith.science/pith/G7KPVD6ZCXDF3BQFK7OSB3OQ5I/action/replication_record"}},"created_at":"2026-05-18T01:30:07.700076+00:00","updated_at":"2026-05-18T01:30:07.700076+00:00"}