{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CUN2Y6OYTHZ4UZIIEWAGR75WMF","short_pith_number":"pith:CUN2Y6OY","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"},"canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","source":{"kind":"arxiv","id":"1106.0895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0895","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0895v1","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0895","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"CUN2Y6OYTHZ4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CUN2Y6OYTHZ4UZII","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CUN2Y6OY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CUN2Y6OYTHZ4UZIIEWAGR75WMF","target":"record","payload":{"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"},"canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","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"},"source_kind":"arxiv","source_id":"1106.0895","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-18T04:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TckcltbgrtClJxZhjqsNAZF+S2bsFiU5FEXyxeXaufv2yxnviIoupziShfCTPC7Wx+OQzbTr6i5+CgEhjsK5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:26.920157Z"},"content_sha256":"e8250bcfe3b55ad1f2b6945bfd73efaf079d1f938df1c67078f76a30f2e19960","schema_version":"1.0","event_id":"sha256:e8250bcfe3b55ad1f2b6945bfd73efaf079d1f938df1c67078f76a30f2e19960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CUN2Y6OYTHZ4UZIIEWAGR75WMF","target":"graph","payload":{"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"},"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-18T04:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj/UNtYvLBCnqOB4HDufUe21d0Muq4kRFOTgM/d6n11uZFiTg0e5N9y1ET+Yzz2VeAyTLhXMXmiKzcRHtofDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:26.921026Z"},"content_sha256":"0dd01ee24745032e4265dfc679ce5b7545090963546f7dcab15a4df16a975f04","schema_version":"1.0","event_id":"sha256:0dd01ee24745032e4265dfc679ce5b7545090963546f7dcab15a4df16a975f04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/bundle.json","state_url":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/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-31T12:37:26Z","links":{"resolver":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF","bundle":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/bundle.json","state":"https://pith.science/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUN2Y6OYTHZ4UZIIEWAGR75WMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CUN2Y6OYTHZ4UZIIEWAGR75WMF","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":"6c5d8dd30b4ffe507f21f0cca150be3692f2a56c6bf17a922b73501881e8b662","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-05T12:44:30Z","title_canon_sha256":"77f2ba8ae71ac4254ceb2d63f6a9592b5024d62c201eb65db5741664f289db53"},"schema_version":"1.0","source":{"id":"1106.0895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0895","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0895v1","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0895","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"CUN2Y6OYTHZ4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CUN2Y6OYTHZ4UZII","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CUN2Y6OY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:0dd01ee24745032e4265dfc679ce5b7545090963546f7dcab15a4df16a975f04","target":"graph","created_at":"2026-05-18T04:20:37Z","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 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","authors_text":"Haim Permuter, Iddo Naiss","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-05T12:44:30Z","title":"Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0895","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:e8250bcfe3b55ad1f2b6945bfd73efaf079d1f938df1c67078f76a30f2e19960","target":"record","created_at":"2026-05-18T04:20:37Z","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":"6c5d8dd30b4ffe507f21f0cca150be3692f2a56c6bf17a922b73501881e8b662","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-05T12:44:30Z","title_canon_sha256":"77f2ba8ae71ac4254ceb2d63f6a9592b5024d62c201eb65db5741664f289db53"},"schema_version":"1.0","source":{"id":"1106.0895","kind":"arxiv","version":1}},"canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"151bac79d899f3ca6508258068ffb661725a23190abee10b58af79e48b0fccdc","first_computed_at":"2026-05-18T04:20:37.124378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:37.124378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"db9XK4YD60ZywspiMS8Yqt6v3SQqtoL83khZWaLuTjOi6lC+efF2RbHVnXZoXFtrqRXAmI+EXnGbs7v9CbP+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:37.125163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8250bcfe3b55ad1f2b6945bfd73efaf079d1f938df1c67078f76a30f2e19960","sha256:0dd01ee24745032e4265dfc679ce5b7545090963546f7dcab15a4df16a975f04"],"state_sha256":"18bf1a9235a3644a1a4399901a1c365dc7b4fbc5f2f1df2a69913cd6e620d654"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUlTMwEcK17gWzYnA+CWPXsghb3PsTtggqT6GTOIYkd9Dq4nWCHGRSDvJzh42l4CLbMQjFDnA/MyIuN91il5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:37:26.925374Z","bundle_sha256":"64f2b982abc188ebee5e9c681a4c39f9b69690d857987349531feece6ad1f633"}}