{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:25CA4GUEB7O66BRFPMXDMQCJ5F","short_pith_number":"pith:25CA4GUE","schema_version":"1.0","canonical_sha256":"d7440e1a840fddef06257b2e364049e9645b686c68f278f07bf95f2402533714","source":{"kind":"arxiv","id":"2409.02388","version":1},"attestation_state":"computed","paper":{"title":"Gaussian Rate-Distortion-Perception Coding and Entropy-Constrained Scalar Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Lei Yu, Liangyan Li, Li Xie, Zhongshan Zhang","submitted_at":"2024-09-04T02:31:53Z","abstract_excerpt":"This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the squared Wasserstein-2 distance-based perception measure, recently established by Xie et al. These bounds are shown to be nondegenerate in the sense that they cannot be deduced from each other via a refined version of Talagrand's transportation inequality. On the other hand, an improved lower bound is established when the perception measure is given by the squ"},"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":"2409.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-09-04T02:31:53Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"36c313256e9d79d7fa8d4caaa3189213e45ed0884c4e1726266fafac79c1b948","abstract_canon_sha256":"920118edc1c3502a9aebdd93d160c0eb55b7e852a5b23c3b015ee3c8b3396db6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:46.638343Z","signature_b64":"mYeL+IqrvHw4hSIpWwCswBW3vk0Y/yLOymyBHQRm2Af/t7Yu0V0V9I/7I/sevVC0r0XD0F4Jbp7t7UH4NtFuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7440e1a840fddef06257b2e364049e9645b686c68f278f07bf95f2402533714","last_reissued_at":"2026-07-05T09:02:46.637853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:46.637853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Rate-Distortion-Perception Coding and Entropy-Constrained Scalar Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Lei Yu, Liangyan Li, Li Xie, Zhongshan Zhang","submitted_at":"2024-09-04T02:31:53Z","abstract_excerpt":"This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the squared Wasserstein-2 distance-based perception measure, recently established by Xie et al. These bounds are shown to be nondegenerate in the sense that they cannot be deduced from each other via a refined version of Talagrand's transportation inequality. On the other hand, an improved lower bound is established when the perception measure is given by the squ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02388","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/2409.02388/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":"2409.02388","created_at":"2026-07-05T09:02:46.637922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02388v1","created_at":"2026-07-05T09:02:46.637922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02388","created_at":"2026-07-05T09:02:46.637922+00:00"},{"alias_kind":"pith_short_12","alias_value":"25CA4GUEB7O6","created_at":"2026-07-05T09:02:46.637922+00:00"},{"alias_kind":"pith_short_16","alias_value":"25CA4GUEB7O66BRF","created_at":"2026-07-05T09:02:46.637922+00:00"},{"alias_kind":"pith_short_8","alias_value":"25CA4GUE","created_at":"2026-07-05T09:02:46.637922+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":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F","json":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F.json","graph_json":"https://pith.science/api/pith-number/25CA4GUEB7O66BRFPMXDMQCJ5F/graph.json","events_json":"https://pith.science/api/pith-number/25CA4GUEB7O66BRFPMXDMQCJ5F/events.json","paper":"https://pith.science/paper/25CA4GUE"},"agent_actions":{"view_html":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F","download_json":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F.json","view_paper":"https://pith.science/paper/25CA4GUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02388&json=true","fetch_graph":"https://pith.science/api/pith-number/25CA4GUEB7O66BRFPMXDMQCJ5F/graph.json","fetch_events":"https://pith.science/api/pith-number/25CA4GUEB7O66BRFPMXDMQCJ5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F/action/storage_attestation","attest_author":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F/action/author_attestation","sign_citation":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F/action/citation_signature","submit_replication":"https://pith.science/pith/25CA4GUEB7O66BRFPMXDMQCJ5F/action/replication_record"}},"created_at":"2026-07-05T09:02:46.637922+00:00","updated_at":"2026-07-05T09:02:46.637922+00:00"}