{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FXO5HIGFEXJ534NBUYQCKYQD5A","short_pith_number":"pith:FXO5HIGF","canonical_record":{"source":{"id":"1105.4989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-25T10:32:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27ac1d0be376b76b613316534f93b44b1e3356b6fa8d8f0e471a6b7f304b7310","abstract_canon_sha256":"0678bf20845d3d84b38138901d254934a8f33ee6dffcc1cd9e135589fe7f190e"},"schema_version":"1.0"},"canonical_sha256":"2dddd3a0c525d3ddf1a1a620256203e828f2053c46af3e7b791a984e007c3e11","source":{"kind":"arxiv","id":"1105.4989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4989","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4989v1","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4989","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"FXO5HIGFEXJ5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXO5HIGFEXJ534NB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXO5HIGF","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FXO5HIGFEXJ534NBUYQCKYQD5A","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-25T10:32:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27ac1d0be376b76b613316534f93b44b1e3356b6fa8d8f0e471a6b7f304b7310","abstract_canon_sha256":"0678bf20845d3d84b38138901d254934a8f33ee6dffcc1cd9e135589fe7f190e"},"schema_version":"1.0"},"canonical_sha256":"2dddd3a0c525d3ddf1a1a620256203e828f2053c46af3e7b791a984e007c3e11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:20.960179Z","signature_b64":"ljGib6G6sOF5A7YVdSXEiO7W7GeMl1A7XVjyz8kUqMkc43+ATYz5J0Y3rsPHBFutAXvnZPQcYtHMPJzSrrOhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dddd3a0c525d3ddf1a1a620256203e828f2053c46af3e7b791a984e007c3e11","last_reissued_at":"2026-05-18T04:21:20.959750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:20.959750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4989","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:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Utz+GWRKJJfDhvayZ5a932ePTnqkX71WiWRE1zuvY/R8+QeohH7sphOjyvPK+tfx1HO539qpkynI+82SY2mlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:34:44.950043Z"},"content_sha256":"72fead537019ab320a93c00b83cabd015e8ae0875c4f9c9fdb974ebe308143a7","schema_version":"1.0","event_id":"sha256:72fead537019ab320a93c00b83cabd015e8ae0875c4f9c9fdb974ebe308143a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FXO5HIGFEXJ534NBUYQCKYQD5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Refinement using a Gaussian Test Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jan Ostergaard, Ram Zamir","submitted_at":"2011-05-25T10:32:20Z","abstract_excerpt":"The additive rate-distortion function (ARDF) was developed in order to universally bound the rate loss in the Wyner-Ziv problem, and has since then been instrumental in e.g., bounding the rate loss in successive refinements, universal quantization, and other multi-terminal source coding settings. The ARDF is defined as the minimum mutual information over an additive test channel followed by estimation. In the limit of high resolution, the ADRF coincides with the true RDF for many sources and fidelity criterions. In the other extreme, i.e., the limit of low resolutions, the behavior of the ARDF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4989","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:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+GANeNtZCM27fJLoQrp5zwaiXN+ubAGsvoYcWrop/0+ftjwt/dQP2ne/nWhh3ehFrcf8QQd17pyeVZRPehbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:34:44.950409Z"},"content_sha256":"ddcaaffb716dfc62dcbfd5dc45efed0c16a15266d815c707382deaae1fdf2f97","schema_version":"1.0","event_id":"sha256:ddcaaffb716dfc62dcbfd5dc45efed0c16a15266d815c707382deaae1fdf2f97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/bundle.json","state_url":"https://pith.science/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/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-06-22T15:34:44Z","links":{"resolver":"https://pith.science/pith/FXO5HIGFEXJ534NBUYQCKYQD5A","bundle":"https://pith.science/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/bundle.json","state":"https://pith.science/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXO5HIGFEXJ534NBUYQCKYQD5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FXO5HIGFEXJ534NBUYQCKYQD5A","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":"0678bf20845d3d84b38138901d254934a8f33ee6dffcc1cd9e135589fe7f190e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-25T10:32:20Z","title_canon_sha256":"27ac1d0be376b76b613316534f93b44b1e3356b6fa8d8f0e471a6b7f304b7310"},"schema_version":"1.0","source":{"id":"1105.4989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4989","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4989v1","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4989","created_at":"2026-05-18T04:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"FXO5HIGFEXJ5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXO5HIGFEXJ534NB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXO5HIGF","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:ddcaaffb716dfc62dcbfd5dc45efed0c16a15266d815c707382deaae1fdf2f97","target":"graph","created_at":"2026-05-18T04:21:20Z","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 additive rate-distortion function (ARDF) was developed in order to universally bound the rate loss in the Wyner-Ziv problem, and has since then been instrumental in e.g., bounding the rate loss in successive refinements, universal quantization, and other multi-terminal source coding settings. The ARDF is defined as the minimum mutual information over an additive test channel followed by estimation. In the limit of high resolution, the ADRF coincides with the true RDF for many sources and fidelity criterions. In the other extreme, i.e., the limit of low resolutions, the behavior of the ARDF","authors_text":"Jan Ostergaard, Ram Zamir","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-25T10:32:20Z","title":"Incremental Refinement using a Gaussian Test Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4989","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:72fead537019ab320a93c00b83cabd015e8ae0875c4f9c9fdb974ebe308143a7","target":"record","created_at":"2026-05-18T04:21:20Z","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":"0678bf20845d3d84b38138901d254934a8f33ee6dffcc1cd9e135589fe7f190e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-25T10:32:20Z","title_canon_sha256":"27ac1d0be376b76b613316534f93b44b1e3356b6fa8d8f0e471a6b7f304b7310"},"schema_version":"1.0","source":{"id":"1105.4989","kind":"arxiv","version":1}},"canonical_sha256":"2dddd3a0c525d3ddf1a1a620256203e828f2053c46af3e7b791a984e007c3e11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dddd3a0c525d3ddf1a1a620256203e828f2053c46af3e7b791a984e007c3e11","first_computed_at":"2026-05-18T04:21:20.959750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:20.959750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ljGib6G6sOF5A7YVdSXEiO7W7GeMl1A7XVjyz8kUqMkc43+ATYz5J0Y3rsPHBFutAXvnZPQcYtHMPJzSrrOhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:20.960179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72fead537019ab320a93c00b83cabd015e8ae0875c4f9c9fdb974ebe308143a7","sha256:ddcaaffb716dfc62dcbfd5dc45efed0c16a15266d815c707382deaae1fdf2f97"],"state_sha256":"476f95708d371a3cbb3725832f5c944bd5b562e75ea96c21c16685e4a951c03c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIxreJrLuTOQwss4F8eBsl+4F3K6f6PY+jEhfMkGq88gT7bj2UWwvbPBb152rXNcJMC6REDD0qZrqad6HWIxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:34:44.952386Z","bundle_sha256":"7853dcb7a0273e2ec00b26951045d67cd6260129dff215e7c73750d4e7c07dfd"}}