{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HQSH3PFKYKU25PV7CJTGLEHFPO","short_pith_number":"pith:HQSH3PFK","schema_version":"1.0","canonical_sha256":"3c247dbcaac2a9aebebf12666590e57bb7baafe98f0ebd818d63cbb70e672fba","source":{"kind":"arxiv","id":"2305.02650","version":2},"attestation_state":"computed","paper":{"title":"A Constrained BA Algorithm for Rate-Distortion and Distortion-Rate Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Hao Wu, Huihui Wu, Lingyi Chen, Shitong Wu, Wenhao Ye, Wenyi Zhang","submitted_at":"2023-05-04T08:41:03Z","abstract_excerpt":"The Blahut-Arimoto (BA) algorithm has played a fundamental role in the numerical computation of rate-distortion (RD) functions. This algorithm possesses a desirable monotonic convergence property by alternatively minimizing its Lagrangian with a fixed multiplier. In this paper, we propose a novel modification of the BA algorithm, wherein the multiplier is updated through a one-dimensional root-finding step using a monotonic univariate function, efficiently implemented by Newton's method in each iteration. Consequently, the modified algorithm directly computes the RD function for a given target"},"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":"2305.02650","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-05-04T08:41:03Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"de9d93e935bb83d21b0d58e1c7376538cbbc513629c0d462e14d9b5464db8cd3","abstract_canon_sha256":"e4a195ab0845ce054b62e331c4c340d4b88f44469f2f90cf00ee812e704c2f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:47.972237Z","signature_b64":"TKtMQ8wisZRB9n3XDEMzg+lsBLFgcr2iacI8km1p4ayJEkrT03r65M1uwDtarai2+OJrJsGXjjOQ/2ZtyuCgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c247dbcaac2a9aebebf12666590e57bb7baafe98f0ebd818d63cbb70e672fba","last_reissued_at":"2026-07-05T07:34:47.971719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:47.971719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constrained BA Algorithm for Rate-Distortion and Distortion-Rate Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Hao Wu, Huihui Wu, Lingyi Chen, Shitong Wu, Wenhao Ye, Wenyi Zhang","submitted_at":"2023-05-04T08:41:03Z","abstract_excerpt":"The Blahut-Arimoto (BA) algorithm has played a fundamental role in the numerical computation of rate-distortion (RD) functions. This algorithm possesses a desirable monotonic convergence property by alternatively minimizing its Lagrangian with a fixed multiplier. In this paper, we propose a novel modification of the BA algorithm, wherein the multiplier is updated through a one-dimensional root-finding step using a monotonic univariate function, efficiently implemented by Newton's method in each iteration. Consequently, the modified algorithm directly computes the RD function for a given target"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02650","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/2305.02650/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":"2305.02650","created_at":"2026-07-05T07:34:47.971783+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02650v2","created_at":"2026-07-05T07:34:47.971783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02650","created_at":"2026-07-05T07:34:47.971783+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQSH3PFKYKU2","created_at":"2026-07-05T07:34:47.971783+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQSH3PFKYKU25PV7","created_at":"2026-07-05T07:34:47.971783+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQSH3PFK","created_at":"2026-07-05T07:34:47.971783+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":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO","json":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO.json","graph_json":"https://pith.science/api/pith-number/HQSH3PFKYKU25PV7CJTGLEHFPO/graph.json","events_json":"https://pith.science/api/pith-number/HQSH3PFKYKU25PV7CJTGLEHFPO/events.json","paper":"https://pith.science/paper/HQSH3PFK"},"agent_actions":{"view_html":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO","download_json":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO.json","view_paper":"https://pith.science/paper/HQSH3PFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02650&json=true","fetch_graph":"https://pith.science/api/pith-number/HQSH3PFKYKU25PV7CJTGLEHFPO/graph.json","fetch_events":"https://pith.science/api/pith-number/HQSH3PFKYKU25PV7CJTGLEHFPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO/action/storage_attestation","attest_author":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO/action/author_attestation","sign_citation":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO/action/citation_signature","submit_replication":"https://pith.science/pith/HQSH3PFKYKU25PV7CJTGLEHFPO/action/replication_record"}},"created_at":"2026-07-05T07:34:47.971783+00:00","updated_at":"2026-07-05T07:34:47.971783+00:00"}