{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MN4IK4RXEFGZM6MKFGFSXGUTTN","short_pith_number":"pith:MN4IK4RX","schema_version":"1.0","canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","source":{"kind":"arxiv","id":"1401.2376","version":1},"attestation_state":"computed","paper":{"title":"Iterative Dynamic Water-filling for Fading Multiple-Access Channels with Energy Harvesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Vaneet Aggarwal, Xiaodong Wang, Zhe Wang","submitted_at":"2014-01-10T15:42:57Z","abstract_excerpt":"In this paper, we develop optimal energy scheduling algorithms for $N$-user fading multiple-access channels with energy harvesting to maximize the channel sum-rate, assuming that the side information of both the channel states and energy harvesting states for $K$ time slots is known {\\em a priori}, and the battery capacity and the maximum energy consumption in each time slot are bounded. The problem is formulated as a convex optimization problem with ${\\cal O}(NK)$ constraints making it hard to solve using a general convex solver since the computational complexity of a generic convex solver is"},"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":"1401.2376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T15:42:57Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9a6b9ab15d18163001a0f3c582a19c94ad662547588f984b91d7d949336360d5","abstract_canon_sha256":"68d2c28e0fc9f0b0b910ee504681c0a878870a39940920a270a2d857d6e6962a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.347449Z","signature_b64":"KyDMxXi8arXhIae/OijXXbknLkiufk+wduTnWXtA8YapCgRp5s707RpXjA5GOm1cQCLDlLaKG15mhaf63hUADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","last_reissued_at":"2026-05-18T00:38:44.346821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.346821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Dynamic Water-filling for Fading Multiple-Access Channels with Energy Harvesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Vaneet Aggarwal, Xiaodong Wang, Zhe Wang","submitted_at":"2014-01-10T15:42:57Z","abstract_excerpt":"In this paper, we develop optimal energy scheduling algorithms for $N$-user fading multiple-access channels with energy harvesting to maximize the channel sum-rate, assuming that the side information of both the channel states and energy harvesting states for $K$ time slots is known {\\em a priori}, and the battery capacity and the maximum energy consumption in each time slot are bounded. The problem is formulated as a convex optimization problem with ${\\cal O}(NK)$ constraints making it hard to solve using a general convex solver since the computational complexity of a generic convex solver is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2376","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":"1401.2376","created_at":"2026-05-18T00:38:44.346904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2376v1","created_at":"2026-05-18T00:38:44.346904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2376","created_at":"2026-05-18T00:38:44.346904+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN4IK4RXEFGZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN4IK4RXEFGZM6MK","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN4IK4RX","created_at":"2026-05-18T12:28:38.356838+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/MN4IK4RXEFGZM6MKFGFSXGUTTN","json":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN.json","graph_json":"https://pith.science/api/pith-number/MN4IK4RXEFGZM6MKFGFSXGUTTN/graph.json","events_json":"https://pith.science/api/pith-number/MN4IK4RXEFGZM6MKFGFSXGUTTN/events.json","paper":"https://pith.science/paper/MN4IK4RX"},"agent_actions":{"view_html":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN","download_json":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN.json","view_paper":"https://pith.science/paper/MN4IK4RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2376&json=true","fetch_graph":"https://pith.science/api/pith-number/MN4IK4RXEFGZM6MKFGFSXGUTTN/graph.json","fetch_events":"https://pith.science/api/pith-number/MN4IK4RXEFGZM6MKFGFSXGUTTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/action/storage_attestation","attest_author":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/action/author_attestation","sign_citation":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/action/citation_signature","submit_replication":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/action/replication_record"}},"created_at":"2026-05-18T00:38:44.346904+00:00","updated_at":"2026-05-18T00:38:44.346904+00:00"}