{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MN4IK4RXEFGZM6MKFGFSXGUTTN","short_pith_number":"pith:MN4IK4RX","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"},"canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","source":{"kind":"arxiv","id":"1401.2376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2376","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2376v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2376","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"MN4IK4RXEFGZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MN4IK4RXEFGZM6MK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MN4IK4RX","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MN4IK4RXEFGZM6MKFGFSXGUTTN","target":"record","payload":{"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"},"canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","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"},"source_kind":"arxiv","source_id":"1401.2376","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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/O51m41rwkDrSEJiDtshP9kNbNvDjJs2E3bwTO0dLXuTfxG2UnOLv/PapsFnTJpSfrJFV2s0NdMjkp9wMqY+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:34:04.863204Z"},"content_sha256":"8c6b540989f5d528e512f6a0eab66d86e1c659bb93ebb13cc6a11f1e82b2255e","schema_version":"1.0","event_id":"sha256:8c6b540989f5d528e512f6a0eab66d86e1c659bb93ebb13cc6a11f1e82b2255e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MN4IK4RXEFGZM6MKFGFSXGUTTN","target":"graph","payload":{"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"},"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FymQMZVcwHVSfffF4TpPJ74pbSnuZYSQrA6FCRyEnVenYpCzSA7gMJi4E8aEMo+/Ec5oIiv+UWNmywVI6eOHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:34:04.863801Z"},"content_sha256":"2ea007e5e3c701b7a14dd6962ce32305555e115dce894ee311ad37c6576a9338","schema_version":"1.0","event_id":"sha256:2ea007e5e3c701b7a14dd6962ce32305555e115dce894ee311ad37c6576a9338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/bundle.json","state_url":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/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-07T08:34:04Z","links":{"resolver":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN","bundle":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/bundle.json","state":"https://pith.science/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MN4IK4RXEFGZM6MKFGFSXGUTTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MN4IK4RXEFGZM6MKFGFSXGUTTN","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":"68d2c28e0fc9f0b0b910ee504681c0a878870a39940920a270a2d857d6e6962a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T15:42:57Z","title_canon_sha256":"9a6b9ab15d18163001a0f3c582a19c94ad662547588f984b91d7d949336360d5"},"schema_version":"1.0","source":{"id":"1401.2376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2376","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2376v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2376","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"MN4IK4RXEFGZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MN4IK4RXEFGZM6MK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MN4IK4RX","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2ea007e5e3c701b7a14dd6962ce32305555e115dce894ee311ad37c6576a9338","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"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","authors_text":"Vaneet Aggarwal, Xiaodong Wang, Zhe Wang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T15:42:57Z","title":"Iterative Dynamic Water-filling for Fading Multiple-Access Channels with Energy Harvesting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2376","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:8c6b540989f5d528e512f6a0eab66d86e1c659bb93ebb13cc6a11f1e82b2255e","target":"record","created_at":"2026-05-18T00:38:44Z","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":"68d2c28e0fc9f0b0b910ee504681c0a878870a39940920a270a2d857d6e6962a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T15:42:57Z","title_canon_sha256":"9a6b9ab15d18163001a0f3c582a19c94ad662547588f984b91d7d949336360d5"},"schema_version":"1.0","source":{"id":"1401.2376","kind":"arxiv","version":1}},"canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6378857237214d96798a298b2b9a939b4a196cc6ae2fb653d571ccfa8232efea","first_computed_at":"2026-05-18T00:38:44.346821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.346821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KyDMxXi8arXhIae/OijXXbknLkiufk+wduTnWXtA8YapCgRp5s707RpXjA5GOm1cQCLDlLaKG15mhaf63hUADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.347449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c6b540989f5d528e512f6a0eab66d86e1c659bb93ebb13cc6a11f1e82b2255e","sha256:2ea007e5e3c701b7a14dd6962ce32305555e115dce894ee311ad37c6576a9338"],"state_sha256":"2dda8c8344e3ae1e37843253792f7ec6da7c3be026e15d5bd9b4428a8c00118d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiutfzFWJBTDuhPS5yzE8/jdjw5PD/u5KKyqKoBZ49iSFmNiegk9LN+viMYb+H15cl7mAVDHoNuXEJovdNLCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:34:04.866778Z","bundle_sha256":"f0ec78c0e714c63cabe540bed9ff50cedcdf4be79b3f7c40779e3c473bf514b3"}}