{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Z46SPM4U4KNRHGPIT32A6MBODN","short_pith_number":"pith:Z46SPM4U","canonical_record":{"source":{"id":"1505.04875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T05:00:23Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"bf9ae6ff1dd18b06764519972745524240fdd1b5153caaa23cb080416e8a80fe","abstract_canon_sha256":"2e308505aebb5baa6fc187cc3abe11fb307be4a9c22fefaad182876c6a4e0847"},"schema_version":"1.0"},"canonical_sha256":"cf3d27b394e29b1399e89ef40f302e1b647460b4017d0bf07ee024a2d6ae5044","source":{"kind":"arxiv","id":"1505.04875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04875","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04875v2","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04875","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"pith_short_12","alias_value":"Z46SPM4U4KNR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z46SPM4U4KNRHGPI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z46SPM4U","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Z46SPM4U4KNRHGPIT32A6MBODN","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T05:00:23Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"bf9ae6ff1dd18b06764519972745524240fdd1b5153caaa23cb080416e8a80fe","abstract_canon_sha256":"2e308505aebb5baa6fc187cc3abe11fb307be4a9c22fefaad182876c6a4e0847"},"schema_version":"1.0"},"canonical_sha256":"cf3d27b394e29b1399e89ef40f302e1b647460b4017d0bf07ee024a2d6ae5044","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:41.575696Z","signature_b64":"SbuXOkxmRu//fSiwD1RvZt4QipFUfo4whyoXarzJKyVz2QRUZUBYUZ2efSbL4mI40XOehuMreSUOPWZFOTllCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf3d27b394e29b1399e89ef40f302e1b647460b4017d0bf07ee024a2d6ae5044","last_reissued_at":"2026-05-18T01:57:41.575092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:41.575092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04875","source_version":2,"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-18T01:57:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKsXjeZ6EyfpC4qloqZLmD2GPDEdfBPnVJZNmeFKFoVMzk3gd8bfpPvIqwaSv7fnN+ldXiik5MK1JaBqZTmQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:37:45.763470Z"},"content_sha256":"1aef6da6dd074999db96f5a30ddba53a95834af9fbdc8b09ba8d92da28d3d2ca","schema_version":"1.0","event_id":"sha256:1aef6da6dd074999db96f5a30ddba53a95834af9fbdc8b09ba8d92da28d3d2ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Z46SPM4U4KNRHGPIT32A6MBODN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Indirect Rate-Distortion Function of a Binary i.i.d Source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.CO"],"primary_cat":"cs.IT","authors_text":"Alon Kipnis, Andrea J. Goldsmith, Stefano Rini","submitted_at":"2015-05-19T05:00:23Z","abstract_excerpt":"The indirect source-coding problem in which a Bernoulli process is compressed in a lossy manner from its noisy observations is considered. These noisy observations are obtained by passing the source sequence through a The indirect source-coding problem in which a Bernoulli process is compressed in a lossy manner from its noisy observations is considered. These noisy observations are obtained by passing the source sequence through a binary symmetric channel so that the channel crossover probability controls the amount of information available about the source realization at the encoder. We use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04875","kind":"arxiv","version":2},"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-18T01:57:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgGRkN2Npv8xJtLAdC5olzNrLhf69MbKTnv3mzp3wnLHEZPjfL3SmXKUtlu7HMcRF8WlTErAQGUdGtzbuAYIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:37:45.764054Z"},"content_sha256":"9cef717a1e6487b4f5e1d2c4a76f20f721ded36ea7d3e42f0f14309b2b6f89a6","schema_version":"1.0","event_id":"sha256:9cef717a1e6487b4f5e1d2c4a76f20f721ded36ea7d3e42f0f14309b2b6f89a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z46SPM4U4KNRHGPIT32A6MBODN/bundle.json","state_url":"https://pith.science/pith/Z46SPM4U4KNRHGPIT32A6MBODN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z46SPM4U4KNRHGPIT32A6MBODN/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-22T03:37:45Z","links":{"resolver":"https://pith.science/pith/Z46SPM4U4KNRHGPIT32A6MBODN","bundle":"https://pith.science/pith/Z46SPM4U4KNRHGPIT32A6MBODN/bundle.json","state":"https://pith.science/pith/Z46SPM4U4KNRHGPIT32A6MBODN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z46SPM4U4KNRHGPIT32A6MBODN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Z46SPM4U4KNRHGPIT32A6MBODN","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":"2e308505aebb5baa6fc187cc3abe11fb307be4a9c22fefaad182876c6a4e0847","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T05:00:23Z","title_canon_sha256":"bf9ae6ff1dd18b06764519972745524240fdd1b5153caaa23cb080416e8a80fe"},"schema_version":"1.0","source":{"id":"1505.04875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04875","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04875v2","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04875","created_at":"2026-05-18T01:57:41Z"},{"alias_kind":"pith_short_12","alias_value":"Z46SPM4U4KNR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z46SPM4U4KNRHGPI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z46SPM4U","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:9cef717a1e6487b4f5e1d2c4a76f20f721ded36ea7d3e42f0f14309b2b6f89a6","target":"graph","created_at":"2026-05-18T01:57:41Z","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":"The indirect source-coding problem in which a Bernoulli process is compressed in a lossy manner from its noisy observations is considered. These noisy observations are obtained by passing the source sequence through a The indirect source-coding problem in which a Bernoulli process is compressed in a lossy manner from its noisy observations is considered. These noisy observations are obtained by passing the source sequence through a binary symmetric channel so that the channel crossover probability controls the amount of information available about the source realization at the encoder. We use ","authors_text":"Alon Kipnis, Andrea J. Goldsmith, Stefano Rini","cross_cats":["math.IT","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T05:00:23Z","title":"Indirect Rate-Distortion Function of a Binary i.i.d Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04875","kind":"arxiv","version":2},"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:1aef6da6dd074999db96f5a30ddba53a95834af9fbdc8b09ba8d92da28d3d2ca","target":"record","created_at":"2026-05-18T01:57:41Z","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":"2e308505aebb5baa6fc187cc3abe11fb307be4a9c22fefaad182876c6a4e0847","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T05:00:23Z","title_canon_sha256":"bf9ae6ff1dd18b06764519972745524240fdd1b5153caaa23cb080416e8a80fe"},"schema_version":"1.0","source":{"id":"1505.04875","kind":"arxiv","version":2}},"canonical_sha256":"cf3d27b394e29b1399e89ef40f302e1b647460b4017d0bf07ee024a2d6ae5044","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf3d27b394e29b1399e89ef40f302e1b647460b4017d0bf07ee024a2d6ae5044","first_computed_at":"2026-05-18T01:57:41.575092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:41.575092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SbuXOkxmRu//fSiwD1RvZt4QipFUfo4whyoXarzJKyVz2QRUZUBYUZ2efSbL4mI40XOehuMreSUOPWZFOTllCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:41.575696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aef6da6dd074999db96f5a30ddba53a95834af9fbdc8b09ba8d92da28d3d2ca","sha256:9cef717a1e6487b4f5e1d2c4a76f20f721ded36ea7d3e42f0f14309b2b6f89a6"],"state_sha256":"d7eb2d012711139b7c6257c9a10ec2d29e8952b8ad9e54c31fce0807f1ce13e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UGgmTICdYchQuD89c433Xx4rKFpHgL6YgY63CscNqhzcF4Zho8/qgPltK8Dg4EuX12msjwrgJTV8ezpKB83Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:37:45.766797Z","bundle_sha256":"f4cb9947df00ae5bdc7ccbc82bd607d95378b2ceaa59dee1da2d4a73a7022091"}}