{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VUHYSXAKJDWBXHUGTKV3PDD7FS","short_pith_number":"pith:VUHYSXAK","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"},"canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","source":{"kind":"arxiv","id":"1305.4558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4558","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4558v1","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4558","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"VUHYSXAKJDWB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUHYSXAKJDWBXHUG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUHYSXAK","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VUHYSXAKJDWBXHUGTKV3PDD7FS","target":"record","payload":{"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"},"canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","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"},"source_kind":"arxiv","source_id":"1305.4558","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPIzPsPUn/BEDRjDukfN4KWlTn2Zl+QMO009SxHsNO3LC2olruuZDolbzmY4YzsbtCdkK9nhlE6rBtwoHLEIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:35:17.559839Z"},"content_sha256":"7531ab105a03c6919997ff31ba084a42408c4336a9d4c076afa052c2e39e9c5a","schema_version":"1.0","event_id":"sha256:7531ab105a03c6919997ff31ba084a42408c4336a9d4c076afa052c2e39e9c5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VUHYSXAKJDWBXHUGTKV3PDD7FS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3KkeTiueAmTL6cg/BM32L7rwhHe4yL1KqgeuZVpUiYvSoAasmkBNyhFqq/LoQ9O04mlgpBIs7yJ2JxhnQBsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:35:17.560580Z"},"content_sha256":"27e9b036924d0f308b016f66352e5447c2eb9e9b21881b33b2b1a91828e13678","schema_version":"1.0","event_id":"sha256:27e9b036924d0f308b016f66352e5447c2eb9e9b21881b33b2b1a91828e13678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/bundle.json","state_url":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T06:35:17Z","links":{"resolver":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS","bundle":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/bundle.json","state":"https://pith.science/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUHYSXAKJDWBXHUGTKV3PDD7FS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VUHYSXAKJDWBXHUGTKV3PDD7FS","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":"2f323bff9a91c8a8c40b6aac2f51182af2c96aa1edee9f2991e5c7d15b563b21","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-20T15:35:00Z","title_canon_sha256":"b921f35ce9500b7474ccc6f7250d6292139613634a06beb9fc3e6a049627272c"},"schema_version":"1.0","source":{"id":"1305.4558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4558","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4558v1","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4558","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"VUHYSXAKJDWB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUHYSXAKJDWBXHUG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUHYSXAK","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:27e9b036924d0f308b016f66352e5447c2eb9e9b21881b33b2b1a91828e13678","target":"graph","created_at":"2026-05-18T03:25:16Z","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"},"paper":{"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","authors_text":"Baran Tan Bacinoglu, Elif Uysal-Biyikoglu","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-20T15:35:00Z","title":"Finite-horizon Online Transmission Rate and Power Adaptation on a Communication Link with Markovian Energy Harvesting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4558","kind":"arxiv","version":1},"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:7531ab105a03c6919997ff31ba084a42408c4336a9d4c076afa052c2e39e9c5a","target":"record","created_at":"2026-05-18T03:25:16Z","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":"2f323bff9a91c8a8c40b6aac2f51182af2c96aa1edee9f2991e5c7d15b563b21","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-20T15:35:00Z","title_canon_sha256":"b921f35ce9500b7474ccc6f7250d6292139613634a06beb9fc3e6a049627272c"},"schema_version":"1.0","source":{"id":"1305.4558","kind":"arxiv","version":1}},"canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad0f895c0a48ec1b9e869aabb78c7f2c8f85ce949fa1db73f08e0679e4a52b0b","first_computed_at":"2026-05-18T03:25:16.684682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:16.684682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RFEPxqC+rEdWYkbfs3iihDqoPuy7Ew7ta+jhqkDtaEyfv1fhT3vy3oIiq9jR6r133Grz3L+JoszXJuLCva3BAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:16.685464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7531ab105a03c6919997ff31ba084a42408c4336a9d4c076afa052c2e39e9c5a","sha256:27e9b036924d0f308b016f66352e5447c2eb9e9b21881b33b2b1a91828e13678"],"state_sha256":"0779ee4740a92c086968f0c7221c5d6c8c549a6e3924a95e8c8eee64f0b9f654"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/DreekXx3U1khovSLaOei+jYYNSX4vHaELvBXodzidXo/wgYs/szxsBrJpX64+1FIgTGf2PxRCVuG0EsDlkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:35:17.564521Z","bundle_sha256":"3dd3ab29045a9eaf8f72c47a109e07746194ba02f6c9e5cc074b073b44b77113"}}