{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZI2237ZXGJ354SOMM6KPL7AZAF","short_pith_number":"pith:ZI2237ZX","canonical_record":{"source":{"id":"1607.00711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T00:52:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f822192fd07e30b618c1185a9a3fd607d4614c9fac52554cdbb060155176a81e","abstract_canon_sha256":"94c026aba5196d6d1fee3deb0b2eed27e15717e42303cbc2e7e0b3c41e9994b4"},"schema_version":"1.0"},"canonical_sha256":"ca35adff373277de49cc6794f5fc190157762c41f79d5684f1998b1a9ac3c8c9","source":{"kind":"arxiv","id":"1607.00711","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00711","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00711v2","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00711","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZI2237ZXGJ35","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZI2237ZXGJ354SOM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZI2237ZX","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZI2237ZXGJ354SOMM6KPL7AZAF","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T00:52:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f822192fd07e30b618c1185a9a3fd607d4614c9fac52554cdbb060155176a81e","abstract_canon_sha256":"94c026aba5196d6d1fee3deb0b2eed27e15717e42303cbc2e7e0b3c41e9994b4"},"schema_version":"1.0"},"canonical_sha256":"ca35adff373277de49cc6794f5fc190157762c41f79d5684f1998b1a9ac3c8c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.159514Z","signature_b64":"H8CBJ5o57UZqflQvXf+DlTdeo47URnRXywEudqf2II+P9EyIRMBf8T8WR4qmiHbdXBGzw7VDPrCy8KOiPDhJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca35adff373277de49cc6794f5fc190157762c41f79d5684f1998b1a9ac3c8c9","last_reissued_at":"2026-05-18T00:51:03.159045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.159045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00711","source_version":2,"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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5MnTPFeAUSTmNffMRia1kg1vA8S1Vk0dCGU6lOVsm+qFEeL201GHGqy0Qq7MdJJNNnxkkNXt3KroY6LpMKQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:53.951678Z"},"content_sha256":"4f18b9676ba8dab9e76779ebbfb39092842e5c3cb4b0aeb8f11a4413430957f8","schema_version":"1.0","event_id":"sha256:4f18b9676ba8dab9e76779ebbfb39092842e5c3cb4b0aeb8f11a4413430957f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZI2237ZXGJ354SOMM6KPL7AZAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Energy Allocation For Delay-Constrained Traffic Over Fading Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr El-Keyi, Antonious M. Girgis, Mohammed Nafie","submitted_at":"2016-07-04T00:52:21Z","abstract_excerpt":"In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over the transmission window. We derive the optimal energy allocation policy for each user that maximizes the total system throughput under two different assumptions on the channel state information. First, we consider the offline allocation problem where the channel states are known a priori before transmission. We solve a convex optimization problem to maximize t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00711","kind":"arxiv","version":2},"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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWkQdpiMWyzjeq0fT8KP0Bz6zZWubv6TVYhoDBwML7q6bl+yAknj+LLdV07qmBgyOWIozMuzfTAXEGqzOewIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:53.952467Z"},"content_sha256":"2338d84351d970746d36fc856e988b5ffcffa96de98975ac19cd4f1c04800c67","schema_version":"1.0","event_id":"sha256:2338d84351d970746d36fc856e988b5ffcffa96de98975ac19cd4f1c04800c67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/bundle.json","state_url":"https://pith.science/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/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-05-31T00:26:53Z","links":{"resolver":"https://pith.science/pith/ZI2237ZXGJ354SOMM6KPL7AZAF","bundle":"https://pith.science/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/bundle.json","state":"https://pith.science/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZI2237ZXGJ354SOMM6KPL7AZAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZI2237ZXGJ354SOMM6KPL7AZAF","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":"94c026aba5196d6d1fee3deb0b2eed27e15717e42303cbc2e7e0b3c41e9994b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T00:52:21Z","title_canon_sha256":"f822192fd07e30b618c1185a9a3fd607d4614c9fac52554cdbb060155176a81e"},"schema_version":"1.0","source":{"id":"1607.00711","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00711","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00711v2","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00711","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZI2237ZXGJ35","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZI2237ZXGJ354SOM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZI2237ZX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:2338d84351d970746d36fc856e988b5ffcffa96de98975ac19cd4f1c04800c67","target":"graph","created_at":"2026-05-18T00:51:03Z","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 consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over the transmission window. We derive the optimal energy allocation policy for each user that maximizes the total system throughput under two different assumptions on the channel state information. First, we consider the offline allocation problem where the channel states are known a priori before transmission. We solve a convex optimization problem to maximize t","authors_text":"Amr El-Keyi, Antonious M. Girgis, Mohammed Nafie","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T00:52:21Z","title":"Optimal Energy Allocation For Delay-Constrained Traffic Over Fading Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00711","kind":"arxiv","version":2},"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:4f18b9676ba8dab9e76779ebbfb39092842e5c3cb4b0aeb8f11a4413430957f8","target":"record","created_at":"2026-05-18T00:51:03Z","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":"94c026aba5196d6d1fee3deb0b2eed27e15717e42303cbc2e7e0b3c41e9994b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T00:52:21Z","title_canon_sha256":"f822192fd07e30b618c1185a9a3fd607d4614c9fac52554cdbb060155176a81e"},"schema_version":"1.0","source":{"id":"1607.00711","kind":"arxiv","version":2}},"canonical_sha256":"ca35adff373277de49cc6794f5fc190157762c41f79d5684f1998b1a9ac3c8c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca35adff373277de49cc6794f5fc190157762c41f79d5684f1998b1a9ac3c8c9","first_computed_at":"2026-05-18T00:51:03.159045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.159045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8CBJ5o57UZqflQvXf+DlTdeo47URnRXywEudqf2II+P9EyIRMBf8T8WR4qmiHbdXBGzw7VDPrCy8KOiPDhJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.159514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00711","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f18b9676ba8dab9e76779ebbfb39092842e5c3cb4b0aeb8f11a4413430957f8","sha256:2338d84351d970746d36fc856e988b5ffcffa96de98975ac19cd4f1c04800c67"],"state_sha256":"9cb997281569b75b287b35217d4a8b421652bb4781b806ff293bfd2d698089c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTxfQXgwWnI5aQkR7mGuaL8QY4WP96qVfGJV4UJ4xFotmGWz/C9RHmLzoQfCfEp/Nvwtgm44as0D9kI/rZhOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:26:53.957820Z","bundle_sha256":"1c9a1e53ed0b3a5a799ea1cca9fbc8c92074390d4ad74b9dc8788421dc21d8ae"}}