{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4TYMC2WLOWNXLGZ2L6ZE6ZMNR4","short_pith_number":"pith:4TYMC2WL","schema_version":"1.0","canonical_sha256":"e4f0c16acb759b759b3a5fb24f658d8f3cd06bc7bea64dee7f11a4b2443af2d2","source":{"kind":"arxiv","id":"2406.18008","version":2},"attestation_state":"computed","paper":{"title":"Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Jingjing Qian, Jun Chen, Sadaf Salehkalaibar, Wei Yu, Wen Tong, Wuxian Shi, Yiqun Ge","submitted_at":"2024-06-26T01:38:14Z","abstract_excerpt":"This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP setting with either the Kullback-Leibler (KL) divergence or Wasserstein-2 metric as the perception loss function is examined, and it is shown that for Gaussian vector sources, jointly Gaussian reconstructions are optimal. We further demonstrate that the optimal tradeoff can be expressed as an optimization problem, which can be explicitly solved. An interesting"},"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":"2406.18008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-26T01:38:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da94a9b3c47c74baf7303a326082b7298366f599142b0850a22c6accd00c4862","abstract_canon_sha256":"39f0190e604142110bb760f64f1b7020acff00f7f8db05d836387e380dc3adbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:27.722532Z","signature_b64":"Q3U8ljiZRHh1BHx+Vy34WbET/teC8efBJGMtiCIzlR5me7AjTPCJ2RlDb5lQdKKS25fKZhYX5FVYFrDoxI1/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f0c16acb759b759b3a5fb24f658d8f3cd06bc7bea64dee7f11a4b2443af2d2","last_reissued_at":"2026-07-05T10:32:27.722034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:27.722034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Jingjing Qian, Jun Chen, Sadaf Salehkalaibar, Wei Yu, Wen Tong, Wuxian Shi, Yiqun Ge","submitted_at":"2024-06-26T01:38:14Z","abstract_excerpt":"This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP setting with either the Kullback-Leibler (KL) divergence or Wasserstein-2 metric as the perception loss function is examined, and it is shown that for Gaussian vector sources, jointly Gaussian reconstructions are optimal. We further demonstrate that the optimal tradeoff can be expressed as an optimization problem, which can be explicitly solved. An interesting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18008","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.18008/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":"2406.18008","created_at":"2026-07-05T10:32:27.722095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18008v2","created_at":"2026-07-05T10:32:27.722095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18008","created_at":"2026-07-05T10:32:27.722095+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TYMC2WLOWNX","created_at":"2026-07-05T10:32:27.722095+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TYMC2WLOWNXLGZ2","created_at":"2026-07-05T10:32:27.722095+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TYMC2WL","created_at":"2026-07-05T10:32:27.722095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19025","citing_title":"Channel-Aware Optimal Transport: A Theoretical Framework for Generative Communication","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4","json":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4.json","graph_json":"https://pith.science/api/pith-number/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/graph.json","events_json":"https://pith.science/api/pith-number/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/events.json","paper":"https://pith.science/paper/4TYMC2WL"},"agent_actions":{"view_html":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4","download_json":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4.json","view_paper":"https://pith.science/paper/4TYMC2WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18008&json=true","fetch_graph":"https://pith.science/api/pith-number/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/graph.json","fetch_events":"https://pith.science/api/pith-number/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/action/storage_attestation","attest_author":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/action/author_attestation","sign_citation":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/action/citation_signature","submit_replication":"https://pith.science/pith/4TYMC2WLOWNXLGZ2L6ZE6ZMNR4/action/replication_record"}},"created_at":"2026-07-05T10:32:27.722095+00:00","updated_at":"2026-07-05T10:32:27.722095+00:00"}