{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BM5V722GNZQKO62Q2FSLHPSZQG","short_pith_number":"pith:BM5V722G","schema_version":"1.0","canonical_sha256":"0b3b5feb466e60a77b50d164b3be5981ba3dbf0a5541a4170d39f54e4f637e36","source":{"kind":"arxiv","id":"1312.4798","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.4798","created_at":"2026-05-18T03:04:23.111346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4798v1","created_at":"2026-05-18T03:04:23.111346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4798","created_at":"2026-05-18T03:04:23.111346+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM5V722GNZQK","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM5V722GNZQKO62Q","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM5V722G","created_at":"2026-05-18T12:27:40.988391+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/BM5V722GNZQKO62Q2FSLHPSZQG","json":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG.json","graph_json":"https://pith.science/api/pith-number/BM5V722GNZQKO62Q2FSLHPSZQG/graph.json","events_json":"https://pith.science/api/pith-number/BM5V722GNZQKO62Q2FSLHPSZQG/events.json","paper":"https://pith.science/paper/BM5V722G"},"agent_actions":{"view_html":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG","download_json":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG.json","view_paper":"https://pith.science/paper/BM5V722G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4798&json=true","fetch_graph":"https://pith.science/api/pith-number/BM5V722GNZQKO62Q2FSLHPSZQG/graph.json","fetch_events":"https://pith.science/api/pith-number/BM5V722GNZQKO62Q2FSLHPSZQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/action/storage_attestation","attest_author":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/action/author_attestation","sign_citation":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/action/citation_signature","submit_replication":"https://pith.science/pith/BM5V722GNZQKO62Q2FSLHPSZQG/action/replication_record"}},"created_at":"2026-05-18T03:04:23.111346+00:00","updated_at":"2026-05-18T03:04:23.111346+00:00"}