{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GAQUEZDW5V3GRD2OLC25KEKJWT","short_pith_number":"pith:GAQUEZDW","schema_version":"1.0","canonical_sha256":"3021426476ed76688f4e58b5d51149b4faa21badf2f58dd2f45a19a01666bf4e","source":{"kind":"arxiv","id":"2202.04147","version":1},"attestation_state":"computed","paper":{"title":"The Rate-Distortion-Perception Tradeoff: The Role of Common Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner","submitted_at":"2022-02-08T21:14:57Z","abstract_excerpt":"A rate-distortion-perception (RDP) tradeoff has recently been proposed by Blau and Michaeli and also Matsumoto. Focusing on the case of perfect realism, which coincides with the problem of distribution-preserving lossy compression studied by Li et al., a coding theorem for the RDP tradeoff that allows for a specified amount of common randomness between the encoder and decoder is provided. The existing RDP tradeoff is recovered by allowing for the amount of common randomness to be infinite. The quadratic Gaussian case is examined in detail."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2202.04147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-08T21:14:57Z","cross_cats_sorted":["cs.LG","eess.IV","math.IT"],"title_canon_sha256":"9c14b23d8886673c46b3ba43d56e9819fb2921364fb345d4fc70d208f378faae","abstract_canon_sha256":"9e96bd206eb4783ced6d8f525c552058e0688add428f5a03188dd43b82bed3a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:34.125997Z","signature_b64":"jCncj+fbbh6SHqdDIKsRBphQak5uCmYm6jHoffPJ1B+7O+KYI6tXhHtzM/yeYvL6qjLB2uwCAIQSQqIuZ/9DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3021426476ed76688f4e58b5d51149b4faa21badf2f58dd2f45a19a01666bf4e","last_reissued_at":"2026-07-05T03:55:34.125476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:34.125476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rate-Distortion-Perception Tradeoff: The Role of Common Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner","submitted_at":"2022-02-08T21:14:57Z","abstract_excerpt":"A rate-distortion-perception (RDP) tradeoff has recently been proposed by Blau and Michaeli and also Matsumoto. Focusing on the case of perfect realism, which coincides with the problem of distribution-preserving lossy compression studied by Li et al., a coding theorem for the RDP tradeoff that allows for a specified amount of common randomness between the encoder and decoder is provided. The existing RDP tradeoff is recovered by allowing for the amount of common randomness to be infinite. The quadratic Gaussian case is examined in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.04147","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.04147/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.04147","created_at":"2026-07-05T03:55:34.125540+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.04147v1","created_at":"2026-07-05T03:55:34.125540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.04147","created_at":"2026-07-05T03:55:34.125540+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAQUEZDW5V3G","created_at":"2026-07-05T03:55:34.125540+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAQUEZDW5V3GRD2O","created_at":"2026-07-05T03:55:34.125540+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAQUEZDW","created_at":"2026-07-05T03:55:34.125540+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13366","citing_title":"Dual-Constrained Diffusion Image Compression for Operational Rate-Distortion-Perception Optimization","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2603.04005","citing_title":"Training-Free Rate-Distortion-Perception Traversal With Diffusion","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2602.14481","citing_title":"On the Rate-Distortion-Complexity Tradeoff for Semantic Communication","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09921","citing_title":"R\\'enyi Rate-Distortion-Perception-Privacy Tradeoff under Indirect Observation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20245","citing_title":"Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19515","citing_title":"Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT","json":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT.json","graph_json":"https://pith.science/api/pith-number/GAQUEZDW5V3GRD2OLC25KEKJWT/graph.json","events_json":"https://pith.science/api/pith-number/GAQUEZDW5V3GRD2OLC25KEKJWT/events.json","paper":"https://pith.science/paper/GAQUEZDW"},"agent_actions":{"view_html":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT","download_json":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT.json","view_paper":"https://pith.science/paper/GAQUEZDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.04147&json=true","fetch_graph":"https://pith.science/api/pith-number/GAQUEZDW5V3GRD2OLC25KEKJWT/graph.json","fetch_events":"https://pith.science/api/pith-number/GAQUEZDW5V3GRD2OLC25KEKJWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT/action/storage_attestation","attest_author":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT/action/author_attestation","sign_citation":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT/action/citation_signature","submit_replication":"https://pith.science/pith/GAQUEZDW5V3GRD2OLC25KEKJWT/action/replication_record"}},"created_at":"2026-07-05T03:55:34.125540+00:00","updated_at":"2026-07-05T03:55:34.125540+00:00"}