{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VSZWTRPOKFTQGTVCOR7NMMPDBJ","short_pith_number":"pith:VSZWTRPO","schema_version":"1.0","canonical_sha256":"acb369c5ee5167034ea2747ed631e30a43bafa0f92106f710ce5f005c504d72d","source":{"kind":"arxiv","id":"1608.03165","version":2},"attestation_state":"computed","paper":{"title":"Linear Programming based Converses for Finite Blocklength Lossy Joint Source-Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ankur A. Kulkarni, Sharu Theresa Jose","submitted_at":"2016-08-10T13:28:44Z","abstract_excerpt":"A linear programming (LP) based framework is presented for obtaining converses for finite blocklength lossy joint source-channel coding problems. The framework applies for any loss criterion, generalizes certain previously known converses, and also extends to multi-terminal settings. The finite blocklength problem is posed equivalently as a nonconvex optimization problem and using a lift-and-project-like method, a close but tractable LP relaxation of this problem is derived. Lower bounds on the original problem are obtained by the construction of feasible points for the dual of the LP relaxati"},"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":"1608.03165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-10T13:28:44Z","cross_cats_sorted":["cs.DM","math.IT","math.OC"],"title_canon_sha256":"481a0533836ccf4e1d531ba4ce6d26f4940ee0e91cd748676ede34a21cea40b0","abstract_canon_sha256":"5aff11d51a926dd66c9e450844f4e0361bc827957e0fa9d3700e9f98b6eb83f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:06.454784Z","signature_b64":"CYTPRi0Kax3TtByUiOHK9g74QbPeCBHS4COikl6Uf1aoNAOFVfy0kvz3aSe1oZ71cRBYkX+bp/VrjVMZU78HDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acb369c5ee5167034ea2747ed631e30a43bafa0f92106f710ce5f005c504d72d","last_reissued_at":"2026-05-18T00:45:06.454348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:06.454348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming based Converses for Finite Blocklength Lossy Joint Source-Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ankur A. Kulkarni, Sharu Theresa Jose","submitted_at":"2016-08-10T13:28:44Z","abstract_excerpt":"A linear programming (LP) based framework is presented for obtaining converses for finite blocklength lossy joint source-channel coding problems. The framework applies for any loss criterion, generalizes certain previously known converses, and also extends to multi-terminal settings. The finite blocklength problem is posed equivalently as a nonconvex optimization problem and using a lift-and-project-like method, a close but tractable LP relaxation of this problem is derived. Lower bounds on the original problem are obtained by the construction of feasible points for the dual of the LP relaxati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03165","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":""},"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":"1608.03165","created_at":"2026-05-18T00:45:06.454423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03165v2","created_at":"2026-05-18T00:45:06.454423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03165","created_at":"2026-05-18T00:45:06.454423+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSZWTRPOKFTQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSZWTRPOKFTQGTVC","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSZWTRPO","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ","json":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ.json","graph_json":"https://pith.science/api/pith-number/VSZWTRPOKFTQGTVCOR7NMMPDBJ/graph.json","events_json":"https://pith.science/api/pith-number/VSZWTRPOKFTQGTVCOR7NMMPDBJ/events.json","paper":"https://pith.science/paper/VSZWTRPO"},"agent_actions":{"view_html":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ","download_json":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ.json","view_paper":"https://pith.science/paper/VSZWTRPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03165&json=true","fetch_graph":"https://pith.science/api/pith-number/VSZWTRPOKFTQGTVCOR7NMMPDBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VSZWTRPOKFTQGTVCOR7NMMPDBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ/action/storage_attestation","attest_author":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ/action/author_attestation","sign_citation":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ/action/citation_signature","submit_replication":"https://pith.science/pith/VSZWTRPOKFTQGTVCOR7NMMPDBJ/action/replication_record"}},"created_at":"2026-05-18T00:45:06.454423+00:00","updated_at":"2026-05-18T00:45:06.454423+00:00"}