{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5OMQHA2RHQ6CHI47APRLFOFVAC","short_pith_number":"pith:5OMQHA2R","schema_version":"1.0","canonical_sha256":"eb990383513c3c23a39f03e2b2b8b50094e35b345ace6ea025d2399401edfdb6","source":{"kind":"arxiv","id":"1801.08693","version":1},"attestation_state":"computed","paper":{"title":"Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming","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":"2018-01-26T07:00:18Z","abstract_excerpt":"A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-po"},"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":"1801.08693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T07:00:18Z","cross_cats_sorted":["cs.DM","math.IT","math.OC"],"title_canon_sha256":"b5f2c529bb108ece196f6225ad48acfaf40d67dfcc38259419320b9cb5d9b3c2","abstract_canon_sha256":"69235b0f8596e915cece431c327a31c2689388bc0896c2d195316b5c7bc0a0a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:03.253540Z","signature_b64":"QAwSBXS9N+9THH8LtCKvA3YF9Y8s8ljZfcMH5QH2gVxGLrkD8Kb9KplqhN4f0S/p5CpAKgT0tdFDJvfLIQqVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb990383513c3c23a39f03e2b2b8b50094e35b345ace6ea025d2399401edfdb6","last_reissued_at":"2026-05-18T00:25:03.253099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:03.253099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming","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":"2018-01-26T07:00:18Z","abstract_excerpt":"A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08693","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":""},"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":"1801.08693","created_at":"2026-05-18T00:25:03.253168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08693v1","created_at":"2026-05-18T00:25:03.253168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08693","created_at":"2026-05-18T00:25:03.253168+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OMQHA2RHQ6C","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OMQHA2RHQ6CHI47","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OMQHA2R","created_at":"2026-05-18T12:32:08.215937+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/5OMQHA2RHQ6CHI47APRLFOFVAC","json":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC.json","graph_json":"https://pith.science/api/pith-number/5OMQHA2RHQ6CHI47APRLFOFVAC/graph.json","events_json":"https://pith.science/api/pith-number/5OMQHA2RHQ6CHI47APRLFOFVAC/events.json","paper":"https://pith.science/paper/5OMQHA2R"},"agent_actions":{"view_html":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC","download_json":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC.json","view_paper":"https://pith.science/paper/5OMQHA2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08693&json=true","fetch_graph":"https://pith.science/api/pith-number/5OMQHA2RHQ6CHI47APRLFOFVAC/graph.json","fetch_events":"https://pith.science/api/pith-number/5OMQHA2RHQ6CHI47APRLFOFVAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC/action/storage_attestation","attest_author":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC/action/author_attestation","sign_citation":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC/action/citation_signature","submit_replication":"https://pith.science/pith/5OMQHA2RHQ6CHI47APRLFOFVAC/action/replication_record"}},"created_at":"2026-05-18T00:25:03.253168+00:00","updated_at":"2026-05-18T00:25:03.253168+00:00"}