{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CUN2Y6OYTHZ4UZIIEWAGR75WMF","short_pith_number":"pith:CUN2Y6OY","schema_version":"1.0","canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","source":{"kind":"arxiv","id":"1106.0895","version":1},"attestation_state":"computed","paper":{"title":"Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim Permuter, Iddo Naiss","submitted_at":"2011-06-05T12:44:30Z","abstract_excerpt":"In this paper we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate distortion. We show that, for ergodic and stationary sources, the rate {align} R_n(D)=\\frac{1}{n}\\min I(\\hat{X}^n\\rightarrow X^n){align} is achievable for any $n$, where the minimization is taken over the transition conditioning probability $p(\\hat{x}^n|x^n)$ such that $\\ex{}{d(X^n,\\hat{X}^n)}\\leq D$. The limit of $R_n(D)$ exists and is the feed-forward rate disto"},"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":"1106.0895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-05T12:44:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77f2ba8ae71ac4254ceb2d63f6a9592b5024d62c201eb65db5741664f289db53","abstract_canon_sha256":"6c5d8dd30b4ffe507f21f0cca150be3692f2a56c6bf17a922b73501881e8b662"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:37.125163Z","signature_b64":"db9XK4YD60ZywspiMS8Yqt6v3SQqtoL83khZWaLuTjOi6lC+efF2RbHVnXZoXFtrqRXAmI+EXnGbs7v9CbP+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","last_reissued_at":"2026-05-18T04:20:37.124378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:37.124378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim Permuter, Iddo Naiss","submitted_at":"2011-06-05T12:44:30Z","abstract_excerpt":"In this paper we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate distortion. We show that, for ergodic and stationary sources, the rate {align} R_n(D)=\\frac{1}{n}\\min I(\\hat{X}^n\\rightarrow X^n){align} is achievable for any $n$, where the minimization is taken over the transition conditioning probability $p(\\hat{x}^n|x^n)$ such that $\\ex{}{d(X^n,\\hat{X}^n)}\\leq D$. The limit of $R_n(D)$ exists and is the feed-forward rate disto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0895","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":"1106.0895","created_at":"2026-05-18T04:20:37.124480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0895v1","created_at":"2026-05-18T04:20:37.124480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0895","created_at":"2026-05-18T04:20:37.124480+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUN2Y6OYTHZ4","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUN2Y6OYTHZ4UZII","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUN2Y6OY","created_at":"2026-05-18T12:26:26.731475+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/CUN2Y6OYTHZ4UZIIEWAGR75WMF","json":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF.json","graph_json":"https://pith.science/api/pith-number/CUN2Y6OYTHZ4UZIIEWAGR75WMF/graph.json","events_json":"https://pith.science/api/pith-number/CUN2Y6OYTHZ4UZIIEWAGR75WMF/events.json","paper":"https://pith.science/paper/CUN2Y6OY"},"agent_actions":{"view_html":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF","download_json":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF.json","view_paper":"https://pith.science/paper/CUN2Y6OY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0895&json=true","fetch_graph":"https://pith.science/api/pith-number/CUN2Y6OYTHZ4UZIIEWAGR75WMF/graph.json","fetch_events":"https://pith.science/api/pith-number/CUN2Y6OYTHZ4UZIIEWAGR75WMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/action/storage_attestation","attest_author":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/action/author_attestation","sign_citation":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/action/citation_signature","submit_replication":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/action/replication_record"}},"created_at":"2026-05-18T04:20:37.124480+00:00","updated_at":"2026-05-18T04:20:37.124480+00:00"}