{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6X7ZOIX3U7XURPJEATICJKI3VF","short_pith_number":"pith:6X7ZOIX3","schema_version":"1.0","canonical_sha256":"f5ff9722fba7ef48bd2404d024a91ba9514522f76078229d264768c98cc3654c","source":{"kind":"arxiv","id":"1707.03619","version":4},"attestation_state":"computed","paper":{"title":"A unified approach to source and message compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anurag Anshu, Naqueeb Ahmad Warsi, Rahul Jain","submitted_at":"2017-07-12T09:56:26Z","abstract_excerpt":"We study the problem of source and message compression in the one-shot setting for the point-to-point and multi-party scenarios (with and without side information). We derive achievability results for these tasks in a unified manner, using the techniques of convex-split, which was introduced in [Anshu,Devabathini and Jain 2014] and position-based decoding introduced in [Anshu, Jain and Warsi 2017], which in turn uses hypothesis testing between distributions. These results are in terms of smooth max divergence and smooth hypothesis testing divergence. As a by-product of the tasks studied in thi"},"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":"1707.03619","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T09:56:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c24473204a4f3312a6131e793e91a458bd97c8de6c67896708f57edd045fc60","abstract_canon_sha256":"c341e79077f84cd939394701c463dbca2fcf0414293a0647116e05d048f93c1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:04.888456Z","signature_b64":"BBNUH4z5n39VGTkB66JIeGbR770ZJqLpL/iBG5gJI3DPKImmh83MeZj+Yhj26t80rlzVzbprwPvfEVsXo61DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5ff9722fba7ef48bd2404d024a91ba9514522f76078229d264768c98cc3654c","last_reissued_at":"2026-05-17T23:44:04.887983Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:04.887983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified approach to source and message compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anurag Anshu, Naqueeb Ahmad Warsi, Rahul Jain","submitted_at":"2017-07-12T09:56:26Z","abstract_excerpt":"We study the problem of source and message compression in the one-shot setting for the point-to-point and multi-party scenarios (with and without side information). We derive achievability results for these tasks in a unified manner, using the techniques of convex-split, which was introduced in [Anshu,Devabathini and Jain 2014] and position-based decoding introduced in [Anshu, Jain and Warsi 2017], which in turn uses hypothesis testing between distributions. These results are in terms of smooth max divergence and smooth hypothesis testing divergence. As a by-product of the tasks studied in thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03619","kind":"arxiv","version":4},"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":"1707.03619","created_at":"2026-05-17T23:44:04.888052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03619v4","created_at":"2026-05-17T23:44:04.888052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03619","created_at":"2026-05-17T23:44:04.888052+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X7ZOIX3U7XU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X7ZOIX3U7XURPJE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X7ZOIX3","created_at":"2026-05-18T12:31:03.183658+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/6X7ZOIX3U7XURPJEATICJKI3VF","json":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF.json","graph_json":"https://pith.science/api/pith-number/6X7ZOIX3U7XURPJEATICJKI3VF/graph.json","events_json":"https://pith.science/api/pith-number/6X7ZOIX3U7XURPJEATICJKI3VF/events.json","paper":"https://pith.science/paper/6X7ZOIX3"},"agent_actions":{"view_html":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF","download_json":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF.json","view_paper":"https://pith.science/paper/6X7ZOIX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03619&json=true","fetch_graph":"https://pith.science/api/pith-number/6X7ZOIX3U7XURPJEATICJKI3VF/graph.json","fetch_events":"https://pith.science/api/pith-number/6X7ZOIX3U7XURPJEATICJKI3VF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF/action/storage_attestation","attest_author":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF/action/author_attestation","sign_citation":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF/action/citation_signature","submit_replication":"https://pith.science/pith/6X7ZOIX3U7XURPJEATICJKI3VF/action/replication_record"}},"created_at":"2026-05-17T23:44:04.888052+00:00","updated_at":"2026-05-17T23:44:04.888052+00:00"}