{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6CR4C7RI3KIPEERUEET5IHNS5R","short_pith_number":"pith:6CR4C7RI","schema_version":"1.0","canonical_sha256":"f0a3c17e28da90f212342127d41db2ec595bf51fe9ca91ae893edde5c9a4696e","source":{"kind":"arxiv","id":"1504.05182","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05182","created_at":"2026-05-18T02:18:14.886002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05182v1","created_at":"2026-05-18T02:18:14.886002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05182","created_at":"2026-05-18T02:18:14.886002+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CR4C7RI3KIP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CR4C7RI3KIPEERU","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CR4C7RI","created_at":"2026-05-18T12:29:07.941421+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/6CR4C7RI3KIPEERUEET5IHNS5R","json":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R.json","graph_json":"https://pith.science/api/pith-number/6CR4C7RI3KIPEERUEET5IHNS5R/graph.json","events_json":"https://pith.science/api/pith-number/6CR4C7RI3KIPEERUEET5IHNS5R/events.json","paper":"https://pith.science/paper/6CR4C7RI"},"agent_actions":{"view_html":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R","download_json":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R.json","view_paper":"https://pith.science/paper/6CR4C7RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05182&json=true","fetch_graph":"https://pith.science/api/pith-number/6CR4C7RI3KIPEERUEET5IHNS5R/graph.json","fetch_events":"https://pith.science/api/pith-number/6CR4C7RI3KIPEERUEET5IHNS5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/action/storage_attestation","attest_author":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/action/author_attestation","sign_citation":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/action/citation_signature","submit_replication":"https://pith.science/pith/6CR4C7RI3KIPEERUEET5IHNS5R/action/replication_record"}},"created_at":"2026-05-18T02:18:14.886002+00:00","updated_at":"2026-05-18T02:18:14.886002+00:00"}