{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6CR4C7RI3KIPEERUEET5IHNS5R","short_pith_number":"pith:6CR4C7RI","canonical_record":{"source":{"id":"1504.05182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:00:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f1dcae18ddf5b0f4e237492dd927254cb872310e8414f51d8989931691684b9","abstract_canon_sha256":"7d8c74146bb107dafb89fcdeb37164c27810556d513b947da320a441f8db07fa"},"schema_version":"1.0"},"canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","source":{"kind":"arxiv","id":"1504.05182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05182","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05182v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05182","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"6CR4C7RI3KIP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6CR4C7RI3KIPEERU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6CR4C7RI","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6CR4C7RI3KIPEERUEET5IHNS5R","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:00:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f1dcae18ddf5b0f4e237492dd927254cb872310e8414f51d8989931691684b9","abstract_canon_sha256":"7d8c74146bb107dafb89fcdeb37164c27810556d513b947da320a441f8db07fa"},"schema_version":"1.0"},"canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.886441Z","signature_b64":"5PoWEyMH8XgaIJu1devWW7Vgb+MkTx1hKZ6WC/lWXPkmt4wv674jiGbBphi8c5mpedmSvbCiAaJPif/JavjdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","last_reissued_at":"2026-05-18T02:18:14.885928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.885928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05182","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUo/UFuQ0QOssl9AdkYtvdkjT4dQlZ5DsqQcegbj+tjXTR8vzOvhcETtL6x/88zXvuH9LGaol1uc4kZIAFPNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:47.096519Z"},"content_sha256":"68e931f3e3c748764d167fe3c36a17581199cbb96e4bc96edb6f78e5ffd96860","schema_version":"1.0","event_id":"sha256:68e931f3e3c748764d167fe3c36a17581199cbb96e4bc96edb6f78e5ffd96860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6CR4C7RI3KIPEERUEET5IHNS5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Geometric Analysis of the AWGN channel with a $(\\sigma, \\rho)$-Power Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Varun Jog, Venkat Anantharam","submitted_at":"2015-04-20T20:00:21Z","abstract_excerpt":"In this paper, we consider the AWGN channel with a power constraint called the $(\\sigma, \\rho)$-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of $\\sigma + k \\rho$ on the total power of any $k\\geq 1$ consecutive transmitted symbols. Such a channel has infinite memory and evaluating its exact capacity is a difficult task. Consequently, we establish an $n$-letter capacity expression and seek bounds for the same. We obtain a lower bound on capacity by considering the volume of ${\\cal S}_n(\\sigma, \\rho) \\subseteq \\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05182","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV7wetxWsCXa356UEMeA9aILQZzMuLhELEN9Jujq5b1D6QrnKqLtNfglxgtdFYebz0cb5ipydMCvh18HgUgYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:47.096896Z"},"content_sha256":"20345780d8288b1f07ec06f924fd7db0b435d3e1f1181ef6304051e669e5d4e5","schema_version":"1.0","event_id":"sha256:20345780d8288b1f07ec06f924fd7db0b435d3e1f1181ef6304051e669e5d4e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/bundle.json","state_url":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CR4C7RI3KIPEERUEET5IHNS5R/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-31T09:58:47Z","links":{"resolver":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R","bundle":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/bundle.json","state":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CR4C7RI3KIPEERUEET5IHNS5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6CR4C7RI3KIPEERUEET5IHNS5R","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":"7d8c74146bb107dafb89fcdeb37164c27810556d513b947da320a441f8db07fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:00:21Z","title_canon_sha256":"7f1dcae18ddf5b0f4e237492dd927254cb872310e8414f51d8989931691684b9"},"schema_version":"1.0","source":{"id":"1504.05182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05182","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05182v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05182","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"6CR4C7RI3KIP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6CR4C7RI3KIPEERU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6CR4C7RI","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:20345780d8288b1f07ec06f924fd7db0b435d3e1f1181ef6304051e669e5d4e5","target":"graph","created_at":"2026-05-18T02:18:14Z","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 the AWGN channel with a power constraint called the $(\\sigma, \\rho)$-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of $\\sigma + k \\rho$ on the total power of any $k\\geq 1$ consecutive transmitted symbols. Such a channel has infinite memory and evaluating its exact capacity is a difficult task. Consequently, we establish an $n$-letter capacity expression and seek bounds for the same. We obtain a lower bound on capacity by considering the volume of ${\\cal S}_n(\\sigma, \\rho) \\subseteq \\m","authors_text":"Varun Jog, Venkat Anantharam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:00:21Z","title":"A Geometric Analysis of the AWGN channel with a $(\\sigma, \\rho)$-Power Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05182","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:68e931f3e3c748764d167fe3c36a17581199cbb96e4bc96edb6f78e5ffd96860","target":"record","created_at":"2026-05-18T02:18:14Z","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":"7d8c74146bb107dafb89fcdeb37164c27810556d513b947da320a441f8db07fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T20:00:21Z","title_canon_sha256":"7f1dcae18ddf5b0f4e237492dd927254cb872310e8414f51d8989931691684b9"},"schema_version":"1.0","source":{"id":"1504.05182","kind":"arxiv","version":1}},"canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","first_computed_at":"2026-05-18T02:18:14.885928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.885928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PoWEyMH8XgaIJu1devWW7Vgb+MkTx1hKZ6WC/lWXPkmt4wv674jiGbBphi8c5mpedmSvbCiAaJPif/JavjdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.886441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e931f3e3c748764d167fe3c36a17581199cbb96e4bc96edb6f78e5ffd96860","sha256:20345780d8288b1f07ec06f924fd7db0b435d3e1f1181ef6304051e669e5d4e5"],"state_sha256":"059e8b01934af865aa9916c210e4b9fde6accf2ce3a82a7ba3bd7f7aa632427f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQsOydmXQyrOkKppMrMCfMtwHjNmHfpBq7tzGgrPuR6lyA42G/97JDltJJ3/dWCO+zyFqjjvRenOClvAkuIICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:47.099054Z","bundle_sha256":"fbb0af7bb64e461f77dd0844171bdb13a5866d77e0c491f41a43da7fc3aba1d7"}}