{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LQVH3ZT7I4IYRHRTUWNN5BT63D","short_pith_number":"pith:LQVH3ZT7","canonical_record":{"source":{"id":"0901.3820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T10:23:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68ff81ef4abcd7be528d6aa4506fd79159ce1d4ac8cb2bfa1d5d7235d3cd9293","abstract_canon_sha256":"5040ed5c1ec33313c373a941be71314702b594f81510128611d6f7b487d19045"},"schema_version":"1.0"},"canonical_sha256":"5c2a7de67f4711889e33a59ade867ed8ee219cec78e9bb615a1526f77126df2d","source":{"kind":"arxiv","id":"0901.3820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3820","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3820v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3820","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LQVH3ZT7I4IY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LQVH3ZT7I4IYRHRT","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LQVH3ZT7","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LQVH3ZT7I4IYRHRTUWNN5BT63D","target":"record","payload":{"canonical_record":{"source":{"id":"0901.3820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T10:23:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68ff81ef4abcd7be528d6aa4506fd79159ce1d4ac8cb2bfa1d5d7235d3cd9293","abstract_canon_sha256":"5040ed5c1ec33313c373a941be71314702b594f81510128611d6f7b487d19045"},"schema_version":"1.0"},"canonical_sha256":"5c2a7de67f4711889e33a59ade867ed8ee219cec78e9bb615a1526f77126df2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.481877Z","signature_b64":"+byuQ8FU3nVFcFaQPgcRFKdNG3X22KcEK0h7rdtmugxSn/dak41Tm35tJA0CY+xSQH0NAlkVZGYxmUV8GYP8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c2a7de67f4711889e33a59ade867ed8ee219cec78e9bb615a1526f77126df2d","last_reissued_at":"2026-05-18T00:59:11.481120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.481120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.3820","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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wp2xnG3n4akAuczsczAm5LgMFLNL/YT5cVLID+p3fBEBeu5ey10vnq6MyD1fPIcUOq3eT81Ux/JA7zv0kakJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:49:23.181791Z"},"content_sha256":"b6e998656de9253fc47fbcd85f900e59243d37ad75d83926b35faa5877c81cc2","schema_version":"1.0","event_id":"sha256:b6e998656de9253fc47fbcd85f900e59243d37ad75d83926b35faa5877c81cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LQVH3ZT7I4IYRHRTUWNN5BT63D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the rate distortion function of Bernoulli Gaussian sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Chang","submitted_at":"2009-01-24T10:23:44Z","abstract_excerpt":"In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\\sim N(0,1)$. We use a new technique in the derivation of the lower bound in which we establish the duality between channel coding and lossy source coding in the strong sense. We improve the lower bound on the rate distortion function over the best known lower bound by $p\\log_2\\frac{1}{p}$ if distortion $D$ is small. This has some interesting implications on sparse signals where $p$ is small since the known gap between the lower and up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3820","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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaRGqRJMXSTh+sHtGSpewOs9hcE4Z4xlnP5vdzLXRy4Vx41SgviEZvXnRzwS2l9wsKdTqXjLFwoBhCfSVTiZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:49:23.182296Z"},"content_sha256":"9be2206196650d95f1be91b5fc580e6ffbaabcf0580871d40288f168c5a77b36","schema_version":"1.0","event_id":"sha256:9be2206196650d95f1be91b5fc580e6ffbaabcf0580871d40288f168c5a77b36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/bundle.json","state_url":"https://pith.science/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/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-25T03:49:23Z","links":{"resolver":"https://pith.science/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D","bundle":"https://pith.science/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/bundle.json","state":"https://pith.science/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQVH3ZT7I4IYRHRTUWNN5BT63D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LQVH3ZT7I4IYRHRTUWNN5BT63D","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":"5040ed5c1ec33313c373a941be71314702b594f81510128611d6f7b487d19045","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T10:23:44Z","title_canon_sha256":"68ff81ef4abcd7be528d6aa4506fd79159ce1d4ac8cb2bfa1d5d7235d3cd9293"},"schema_version":"1.0","source":{"id":"0901.3820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3820","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3820v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3820","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LQVH3ZT7I4IY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LQVH3ZT7I4IYRHRT","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LQVH3ZT7","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:9be2206196650d95f1be91b5fc580e6ffbaabcf0580871d40288f168c5a77b36","target":"graph","created_at":"2026-05-18T00:59:11Z","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 study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\\sim N(0,1)$. We use a new technique in the derivation of the lower bound in which we establish the duality between channel coding and lossy source coding in the strong sense. We improve the lower bound on the rate distortion function over the best known lower bound by $p\\log_2\\frac{1}{p}$ if distortion $D$ is small. This has some interesting implications on sparse signals where $p$ is small since the known gap between the lower and up","authors_text":"Cheng Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T10:23:44Z","title":"On the rate distortion function of Bernoulli Gaussian sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3820","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:b6e998656de9253fc47fbcd85f900e59243d37ad75d83926b35faa5877c81cc2","target":"record","created_at":"2026-05-18T00:59:11Z","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":"5040ed5c1ec33313c373a941be71314702b594f81510128611d6f7b487d19045","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T10:23:44Z","title_canon_sha256":"68ff81ef4abcd7be528d6aa4506fd79159ce1d4ac8cb2bfa1d5d7235d3cd9293"},"schema_version":"1.0","source":{"id":"0901.3820","kind":"arxiv","version":1}},"canonical_sha256":"5c2a7de67f4711889e33a59ade867ed8ee219cec78e9bb615a1526f77126df2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c2a7de67f4711889e33a59ade867ed8ee219cec78e9bb615a1526f77126df2d","first_computed_at":"2026-05-18T00:59:11.481120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.481120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+byuQ8FU3nVFcFaQPgcRFKdNG3X22KcEK0h7rdtmugxSn/dak41Tm35tJA0CY+xSQH0NAlkVZGYxmUV8GYP8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.481877Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.3820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6e998656de9253fc47fbcd85f900e59243d37ad75d83926b35faa5877c81cc2","sha256:9be2206196650d95f1be91b5fc580e6ffbaabcf0580871d40288f168c5a77b36"],"state_sha256":"26cfccb0df783a7ca4c63fb347dda9f7fa1e58a978ed613e7c21e66ceb09b619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kt7qXwVi+7iktSjs4phFLPk7eQrmmF1KcMuJGGsro35BBG+/FkJZKF0wNxN6fiVa2j3WYWK7Wvf3GzF6w0+cDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:49:23.186024Z","bundle_sha256":"42ede81b20b5312fc5d8159bc56fe85e5c128f0be7d11581c2a6f9fa28492f18"}}