{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BM5V722GNZQKO62Q2FSLHPSZQG","short_pith_number":"pith:BM5V722G","canonical_record":{"source":{"id":"1312.4798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T14:27:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"268d95e111d0869f86d283c162d54708d37bf9921fd3834a69552f8a57611250","abstract_canon_sha256":"94d104955a088c193c257fbdf02f1dd33185cd9e56fc628075bd77f20782c720"},"schema_version":"1.0"},"canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","source":{"kind":"arxiv","id":"1312.4798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4798","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4798v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4798","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"BM5V722GNZQK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BM5V722GNZQKO62Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BM5V722G","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BM5V722GNZQKO62Q2FSLHPSZQG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T14:27:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"268d95e111d0869f86d283c162d54708d37bf9921fd3834a69552f8a57611250","abstract_canon_sha256":"94d104955a088c193c257fbdf02f1dd33185cd9e56fc628075bd77f20782c720"},"schema_version":"1.0"},"canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.111687Z","signature_b64":"ZrkjkSHCBnCMbpx22Cqpfbd6mgxQp+4Ycl0bNZJOl27wE2SayikqGtaPqdwhXQmUlCRAsr6veK3bWgjCu6U6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","last_reissued_at":"2026-05-18T03:04:23.111274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.111274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4798","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXVsjBwdtth29nauJzfeurdjY956shqX4y68VJ0Z+/pS84eoeo1L65HsBtpqvRmSf/vm0enL/gGGTtyXDL+/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:13:32.367915Z"},"content_sha256":"52d168b079ebda80b5dc974e9249db930ee6f431f142221e362baccba8f31e61","schema_version":"1.0","event_id":"sha256:52d168b079ebda80b5dc974e9249db930ee6f431f142221e362baccba8f31e61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BM5V722GNZQKO62Q2FSLHPSZQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Horizon Online Lazy Scheduling with Energy Harvesting Transmitters over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baran Tan Bacinoglu, Elif Uysal-Biyikoglu","submitted_at":"2013-12-17T14:27:24Z","abstract_excerpt":"Lazy scheduling, i.e. setting transmit power and rate in response to data traffic as low as possible so as to satisfy delay constraints, is a known method for energy efficient transmission.This paper addresses an online lazy scheduling problem over finite time-slotted transmission window and introduces low-complexity heuristics which attain near-optimal performance.Particularly, this paper generalizes lazy scheduling problem for energy harvesting systems to deal with packet arrival, energy harvesting and time-varying channel processes simultaneously. The time-slotted formulation of the problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4798","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5enBUtOs85pw/vm9Wo1Eq0cmvpGuIsEu3QdxN2ghJ3jFwRTzfSZVU9EBGkht9lhwbKtbzFI1M9RIgSIPKAnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:13:32.368294Z"},"content_sha256":"86921b2f44e7adb53fdec91e88efc3678bff3420c82e79278501aed3a3f9de63","schema_version":"1.0","event_id":"sha256:86921b2f44e7adb53fdec91e88efc3678bff3420c82e79278501aed3a3f9de63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/bundle.json","state_url":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BM5V722GNZQKO62Q2FSLHPSZQG/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-10T10:13:32Z","links":{"resolver":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG","bundle":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/bundle.json","state":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BM5V722GNZQKO62Q2FSLHPSZQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BM5V722GNZQKO62Q2FSLHPSZQG","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":"94d104955a088c193c257fbdf02f1dd33185cd9e56fc628075bd77f20782c720","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T14:27:24Z","title_canon_sha256":"268d95e111d0869f86d283c162d54708d37bf9921fd3834a69552f8a57611250"},"schema_version":"1.0","source":{"id":"1312.4798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4798","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4798v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4798","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"BM5V722GNZQK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BM5V722GNZQKO62Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BM5V722G","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:86921b2f44e7adb53fdec91e88efc3678bff3420c82e79278501aed3a3f9de63","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Lazy scheduling, i.e. setting transmit power and rate in response to data traffic as low as possible so as to satisfy delay constraints, is a known method for energy efficient transmission.This paper addresses an online lazy scheduling problem over finite time-slotted transmission window and introduces low-complexity heuristics which attain near-optimal performance.Particularly, this paper generalizes lazy scheduling problem for energy harvesting systems to deal with packet arrival, energy harvesting and time-varying channel processes simultaneously. The time-slotted formulation of the problem","authors_text":"Baran Tan Bacinoglu, Elif Uysal-Biyikoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T14:27:24Z","title":"Finite Horizon Online Lazy Scheduling with Energy Harvesting Transmitters over Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4798","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:52d168b079ebda80b5dc974e9249db930ee6f431f142221e362baccba8f31e61","target":"record","created_at":"2026-05-18T03:04:23Z","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":"94d104955a088c193c257fbdf02f1dd33185cd9e56fc628075bd77f20782c720","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-17T14:27:24Z","title_canon_sha256":"268d95e111d0869f86d283c162d54708d37bf9921fd3834a69552f8a57611250"},"schema_version":"1.0","source":{"id":"1312.4798","kind":"arxiv","version":1}},"canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","first_computed_at":"2026-05-18T03:04:23.111274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.111274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZrkjkSHCBnCMbpx22Cqpfbd6mgxQp+4Ycl0bNZJOl27wE2SayikqGtaPqdwhXQmUlCRAsr6veK3bWgjCu6U6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.111687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d168b079ebda80b5dc974e9249db930ee6f431f142221e362baccba8f31e61","sha256:86921b2f44e7adb53fdec91e88efc3678bff3420c82e79278501aed3a3f9de63"],"state_sha256":"36b35dbf587d441e0c9b32ac91ecafd726ec5d97a787e48858d45f13e566fd73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Rr4/gFhmkVUy1kZUgfQ6c/8aaSnqloD3gq6Ndh2JhwM2vXf5PPYuF3UoEY97jv32skAmiUBwwfsCMGc9zQ9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:13:32.371499Z","bundle_sha256":"dc823f28cf6eb46767c2c0e5ad58f9ecda97be6678029099a2a7fa2604ebe069"}}