{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7CYCHFDUMRMJLXVE75PDEHUSJY","short_pith_number":"pith:7CYCHFDU","schema_version":"1.0","canonical_sha256":"f8b0239474645895dea4ff5e321e924e0a42c6032c267328c957c5d445c68acc","source":{"kind":"arxiv","id":"2212.10098","version":1},"attestation_state":"computed","paper":{"title":"A Communication Optimal Transport Approach to the Computation of Rate Distortion Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Hao Wu, Huihui Wu, Shitong Wu, Wenhao Ye, Wenyi Zhang","submitted_at":"2022-12-20T09:15:18Z","abstract_excerpt":"In this paper, we propose a new framework named Communication Optimal Transport (CommOT) for computing the rate distortion (RD) function. This work is motivated by observing the fact that the transition law and the relative entropy in communication theory can be viewed as the transport plan and the regularized objective function in the optimal transport (OT) model. However, unlike in classical OT problems, the RD function only possesses one-side marginal distribution. Hence, to maintain the OT structure, we introduce slackness variables to fulfill the other-side marginal distribution and then "},"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":"2212.10098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-20T09:15:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb927b47050b71610eeea0a695a69740920553337af995c0311e684efa3e1a18","abstract_canon_sha256":"819b8680e8d956b20eab908594b29cd8fcaaa281740d23facc05711db46ca124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:03.991432Z","signature_b64":"qbSizLKDMuHPDnMIix8QxnG25iCMM8Efh8hOqykkC53tcEAHpzoPYZHF4viiIDYKCnVPMa6JlKMGAFWMoA6jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b0239474645895dea4ff5e321e924e0a42c6032c267328c957c5d445c68acc","last_reissued_at":"2026-07-05T05:27:03.990537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:03.990537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Communication Optimal Transport Approach to the Computation of Rate Distortion Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Hao Wu, Huihui Wu, Shitong Wu, Wenhao Ye, Wenyi Zhang","submitted_at":"2022-12-20T09:15:18Z","abstract_excerpt":"In this paper, we propose a new framework named Communication Optimal Transport (CommOT) for computing the rate distortion (RD) function. This work is motivated by observing the fact that the transition law and the relative entropy in communication theory can be viewed as the transport plan and the regularized objective function in the optimal transport (OT) model. However, unlike in classical OT problems, the RD function only possesses one-side marginal distribution. Hence, to maintain the OT structure, we introduce slackness variables to fulfill the other-side marginal distribution and then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.10098","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/2212.10098/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":"2212.10098","created_at":"2026-07-05T05:27:03.990593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.10098v1","created_at":"2026-07-05T05:27:03.990593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.10098","created_at":"2026-07-05T05:27:03.990593+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CYCHFDUMRMJ","created_at":"2026-07-05T05:27:03.990593+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CYCHFDUMRMJLXVE","created_at":"2026-07-05T05:27:03.990593+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CYCHFDU","created_at":"2026-07-05T05:27:03.990593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.01202","citing_title":"Forget BIT, It is All about TOKEN: Towards Semantic Information Theory for LLMs","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY","json":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY.json","graph_json":"https://pith.science/api/pith-number/7CYCHFDUMRMJLXVE75PDEHUSJY/graph.json","events_json":"https://pith.science/api/pith-number/7CYCHFDUMRMJLXVE75PDEHUSJY/events.json","paper":"https://pith.science/paper/7CYCHFDU"},"agent_actions":{"view_html":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY","download_json":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY.json","view_paper":"https://pith.science/paper/7CYCHFDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.10098&json=true","fetch_graph":"https://pith.science/api/pith-number/7CYCHFDUMRMJLXVE75PDEHUSJY/graph.json","fetch_events":"https://pith.science/api/pith-number/7CYCHFDUMRMJLXVE75PDEHUSJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY/action/storage_attestation","attest_author":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY/action/author_attestation","sign_citation":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY/action/citation_signature","submit_replication":"https://pith.science/pith/7CYCHFDUMRMJLXVE75PDEHUSJY/action/replication_record"}},"created_at":"2026-07-05T05:27:03.990593+00:00","updated_at":"2026-07-05T05:27:03.990593+00:00"}