{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VUHYSXAKJDWBXHUGTKV3PDD7FS","short_pith_number":"pith:VUHYSXAK","schema_version":"1.0","canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","source":{"kind":"arxiv","id":"1305.4558","version":1},"attestation_state":"computed","paper":{"title":"Finite-horizon Online Transmission Rate and Power Adaptation on a Communication Link with Markovian Energy Harvesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Baran Tan Bacinoglu, Elif Uysal-Biyikoglu","submitted_at":"2013-05-20T15:35:00Z","abstract_excerpt":"As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on compu"},"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":"1305.4558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-20T15:35:00Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"b921f35ce9500b7474ccc6f7250d6292139613634a06beb9fc3e6a049627272c","abstract_canon_sha256":"2f323bff9a91c8a8c40b6aac2f51182af2c96aa1edee9f2991e5c7d15b563b21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.685464Z","signature_b64":"RFEPxqC+rEdWYkbfs3iihDqoPuy7Ew7ta+jhqkDtaEyfv1fhT3vy3oIiq9jR6r133Grz3L+JoszXJuLCva3BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","last_reissued_at":"2026-05-18T03:25:16.684682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.684682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-horizon Online Transmission Rate and Power Adaptation on a Communication Link with Markovian Energy Harvesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Baran Tan Bacinoglu, Elif Uysal-Biyikoglu","submitted_at":"2013-05-20T15:35:00Z","abstract_excerpt":"As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4558","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":"1305.4558","created_at":"2026-05-18T03:25:16.684823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4558v1","created_at":"2026-05-18T03:25:16.684823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4558","created_at":"2026-05-18T03:25:16.684823+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUHYSXAKJDWB","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUHYSXAKJDWBXHUG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUHYSXAK","created_at":"2026-05-18T12:28:04.890932+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/VUHYSXAKJDWBXHUGTKV3PDD7FS","json":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS.json","graph_json":"https://pith.science/api/pith-number/VUHYSXAKJDWBXHUGTKV3PDD7FS/graph.json","events_json":"https://pith.science/api/pith-number/VUHYSXAKJDWBXHUGTKV3PDD7FS/events.json","paper":"https://pith.science/paper/VUHYSXAK"},"agent_actions":{"view_html":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS","download_json":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS.json","view_paper":"https://pith.science/paper/VUHYSXAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4558&json=true","fetch_graph":"https://pith.science/api/pith-number/VUHYSXAKJDWBXHUGTKV3PDD7FS/graph.json","fetch_events":"https://pith.science/api/pith-number/VUHYSXAKJDWBXHUGTKV3PDD7FS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/action/storage_attestation","attest_author":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/action/author_attestation","sign_citation":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/action/citation_signature","submit_replication":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/action/replication_record"}},"created_at":"2026-05-18T03:25:16.684823+00:00","updated_at":"2026-05-18T03:25:16.684823+00:00"}