{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GJ5GYZAX3RLKORGPBGCWDT5KPK","short_pith_number":"pith:GJ5GYZAX","schema_version":"1.0","canonical_sha256":"327a6c6417dc56a744cf098561cfaa7a851a14ec8aeba1d7e98928e6db04489f","source":{"kind":"arxiv","id":"1012.1945","version":1},"attestation_state":"computed","paper":{"title":"Utility Optimal Scheduling in Energy Harvesting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longbo Huang, Michael J. Neely","submitted_at":"2010-12-09T09:03:31Z","abstract_excerpt":"In this paper, we show how to achieve close-to-optimal utility performance in energy harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of energy that can be harvested is time varying and evolves according to some probability law. We develop an \\emph{online} algorithm, called the Energy-limited Scheduling Algorithm (ESA), which jointly manages the energy and makes power allocation decisions for packet transmissions. ESA only has to keep track of the amount of energy left at the network"},"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":"1012.1945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-12-09T09:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"954ad96dac7c330b983a59b19ff5358ff48fdb9dc6c92b43b13d303d979e2a69","abstract_canon_sha256":"109c0492726c5d0f0065744cdf316703dd88b467ce3ed348b32161d117b335af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:49.308252Z","signature_b64":"7cSBMQTnxttTkb4X/p/nM3pAsokzmUyuVzu/ntJnJx3AfeHyGZ1Bxws303Yfhx7v41HaQnXUWQO7D0xvJJh3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"327a6c6417dc56a744cf098561cfaa7a851a14ec8aeba1d7e98928e6db04489f","last_reissued_at":"2026-05-18T04:33:49.307813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:49.307813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility Optimal Scheduling in Energy Harvesting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longbo Huang, Michael J. Neely","submitted_at":"2010-12-09T09:03:31Z","abstract_excerpt":"In this paper, we show how to achieve close-to-optimal utility performance in energy harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of energy that can be harvested is time varying and evolves according to some probability law. We develop an \\emph{online} algorithm, called the Energy-limited Scheduling Algorithm (ESA), which jointly manages the energy and makes power allocation decisions for packet transmissions. ESA only has to keep track of the amount of energy left at the network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1945","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":"1012.1945","created_at":"2026-05-18T04:33:49.307877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1945v1","created_at":"2026-05-18T04:33:49.307877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1945","created_at":"2026-05-18T04:33:49.307877+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJ5GYZAX3RLK","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJ5GYZAX3RLKORGP","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJ5GYZAX","created_at":"2026-05-18T12:26:07.630475+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/GJ5GYZAX3RLKORGPBGCWDT5KPK","json":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK.json","graph_json":"https://pith.science/api/pith-number/GJ5GYZAX3RLKORGPBGCWDT5KPK/graph.json","events_json":"https://pith.science/api/pith-number/GJ5GYZAX3RLKORGPBGCWDT5KPK/events.json","paper":"https://pith.science/paper/GJ5GYZAX"},"agent_actions":{"view_html":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK","download_json":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK.json","view_paper":"https://pith.science/paper/GJ5GYZAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1945&json=true","fetch_graph":"https://pith.science/api/pith-number/GJ5GYZAX3RLKORGPBGCWDT5KPK/graph.json","fetch_events":"https://pith.science/api/pith-number/GJ5GYZAX3RLKORGPBGCWDT5KPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK/action/storage_attestation","attest_author":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK/action/author_attestation","sign_citation":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK/action/citation_signature","submit_replication":"https://pith.science/pith/GJ5GYZAX3RLKORGPBGCWDT5KPK/action/replication_record"}},"created_at":"2026-05-18T04:33:49.307877+00:00","updated_at":"2026-05-18T04:33:49.307877+00:00"}