{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:IRLHIPI6YTREU7N2WINPK3MITV","short_pith_number":"pith:IRLHIPI6","schema_version":"1.0","canonical_sha256":"4456743d1ec4e24a7dbab21af56d889d58423e2e2e59248f9c4a77e76b2c6115","source":{"kind":"arxiv","id":"0801.3878","version":2},"attestation_state":"computed","paper":{"title":"Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Muramatsu, Shigeki Miyake","submitted_at":"2008-01-25T05:13:11Z","abstract_excerpt":"The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and maximal-likelihood (ML) coding. These problems are the Slepian-Wolf problem, the Gel'fand-Pinsker problem, the Wyner-Ziv problem, and the One-helps-one problem (source coding with partial side information at the decoder). To this end, the notion of a hash property for an ensemble of functions is introduced and it is proved that an ensemble of $q$-ary sparse matrices satisfies the hash property. Based on this property, "},"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":"0801.3878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-25T05:13:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f468e2d22aa3a6571546d86f74a3169e772088f2513176359a821e5fd311a6e","abstract_canon_sha256":"1612c71ca4f23bf439ac917be2304c0f14204f42a4df35e4adcbdd454d7ef81e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:36.939566Z","signature_b64":"UzLVFSoKywXMnLPsMFuJH1quU0m4alWzUxjbYz0dRd756CVctSmef5Ea8iEWs3MqELU7eqHnDKHGY/0YOpXIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4456743d1ec4e24a7dbab21af56d889d58423e2e2e59248f9c4a77e76b2c6115","last_reissued_at":"2026-05-18T03:35:36.938806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:36.938806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Muramatsu, Shigeki Miyake","submitted_at":"2008-01-25T05:13:11Z","abstract_excerpt":"The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and maximal-likelihood (ML) coding. These problems are the Slepian-Wolf problem, the Gel'fand-Pinsker problem, the Wyner-Ziv problem, and the One-helps-one problem (source coding with partial side information at the decoder). To this end, the notion of a hash property for an ensemble of functions is introduced and it is proved that an ensemble of $q$-ary sparse matrices satisfies the hash property. Based on this property, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3878","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":"0801.3878","created_at":"2026-05-18T03:35:36.938908+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.3878v2","created_at":"2026-05-18T03:35:36.938908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3878","created_at":"2026-05-18T03:35:36.938908+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRLHIPI6YTRE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRLHIPI6YTREU7N2","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRLHIPI6","created_at":"2026-05-18T12:25:57.157939+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/IRLHIPI6YTREU7N2WINPK3MITV","json":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV.json","graph_json":"https://pith.science/api/pith-number/IRLHIPI6YTREU7N2WINPK3MITV/graph.json","events_json":"https://pith.science/api/pith-number/IRLHIPI6YTREU7N2WINPK3MITV/events.json","paper":"https://pith.science/paper/IRLHIPI6"},"agent_actions":{"view_html":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV","download_json":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV.json","view_paper":"https://pith.science/paper/IRLHIPI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.3878&json=true","fetch_graph":"https://pith.science/api/pith-number/IRLHIPI6YTREU7N2WINPK3MITV/graph.json","fetch_events":"https://pith.science/api/pith-number/IRLHIPI6YTREU7N2WINPK3MITV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV/action/storage_attestation","attest_author":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV/action/author_attestation","sign_citation":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV/action/citation_signature","submit_replication":"https://pith.science/pith/IRLHIPI6YTREU7N2WINPK3MITV/action/replication_record"}},"created_at":"2026-05-18T03:35:36.938908+00:00","updated_at":"2026-05-18T03:35:36.938908+00:00"}