{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZGSXKFCLWEENQW4OB5PYXFFFCH","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":"2c757e0fc46e869e2248ad569f948ff2e3ccdef0b25af8f27bd1da9f657045f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T04:17:55Z","title_canon_sha256":"23ea6f1ed5adc2657cd2ad485f10bda7f0ba9ceb667c8076b89e69566d300e8c"},"schema_version":"1.0","source":{"id":"1411.5767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5767","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5767v2","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5767","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZGSXKFCLWEEN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGSXKFCLWEENQW4O","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGSXKFCL","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:bfe879fc58080cab41817d31b5ac5ed4b3bfb49f70cebb5e88c92ec5b5caae9c","target":"graph","created_at":"2026-05-18T01:37:07Z","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":"This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the reproduction also be stationary and memoryless with a given distribution. The encoder and decoder are stochastic and assumed to have access to independent common randomness. Recent work has characterized the minimum achievable coding rate at a given distortion level when unlimited common randomness is available. Here we consider the general case where the avai","authors_text":"Naci Saldi, Serdar Y\\\"uksel, Tam\\'as Linder","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T04:17:55Z","title":"Output Constrained Lossy Source Coding with Limited Common Randomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5767","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:9c459d091ae7791fef82442b52bd5a8846c423a15b17c799567f0dbea783ba56","target":"record","created_at":"2026-05-18T01:37:07Z","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":"2c757e0fc46e869e2248ad569f948ff2e3ccdef0b25af8f27bd1da9f657045f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T04:17:55Z","title_canon_sha256":"23ea6f1ed5adc2657cd2ad485f10bda7f0ba9ceb667c8076b89e69566d300e8c"},"schema_version":"1.0","source":{"id":"1411.5767","kind":"arxiv","version":2}},"canonical_sha256":"c9a575144bb108d85b8e0f5f8b94a511d33b8e39cd4e7f51353b3d53dc11aea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9a575144bb108d85b8e0f5f8b94a511d33b8e39cd4e7f51353b3d53dc11aea2","first_computed_at":"2026-05-18T01:37:07.706930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:07.706930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYFVDpduDu9p72GP/ruhKEjPVGyAeIavWyIEbLPeD3dD/z/UlH6myM+Tfzx36VFEAV00dEPuTHqC1Phtdi7zCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:07.707393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c459d091ae7791fef82442b52bd5a8846c423a15b17c799567f0dbea783ba56","sha256:bfe879fc58080cab41817d31b5ac5ed4b3bfb49f70cebb5e88c92ec5b5caae9c"],"state_sha256":"684d0d3bb277fb29971ba234ad4998fe259393adf6d45462557fbc44039d34ca"}