{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GXYJDVFYV6SW7JADRBEBBIVUI4","short_pith_number":"pith:GXYJDVFY","schema_version":"1.0","canonical_sha256":"35f091d4b8afa56fa403884810a2b44728c28c2bab58a07425998f3ba6d307a4","source":{"kind":"arxiv","id":"1006.5271","version":3},"attestation_state":"computed","paper":{"title":"Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property","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":"2010-06-28T06:36:54Z","abstract_excerpt":"The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore, extensions to the multiple source coding and multiple output broadcast channel coding are investigated."},"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":"1006.5271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-28T06:36:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d9c6eff1e23c9b2037e7d2edfc980d2bf059fc6b2b85a5cb2dffd9f4b7ec42d","abstract_canon_sha256":"5617de7701df0863085895f833a974cef13c6027daffd730c40769820708db45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:36.868389Z","signature_b64":"5YRzbWrl00tt0SG6fKBpckmwbxN5sYgHb78zNlITOfbz9Oxo/eBN2KmGJpEV9g3jPO3VyAUQqwNnOVUZ/X0iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35f091d4b8afa56fa403884810a2b44728c28c2bab58a07425998f3ba6d307a4","last_reissued_at":"2026-05-18T03:35:36.867540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:36.867540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property","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":"2010-06-28T06:36:54Z","abstract_excerpt":"The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore, extensions to the multiple source coding and multiple output broadcast channel coding are investigated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5271","kind":"arxiv","version":3},"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":"1006.5271","created_at":"2026-05-18T03:35:36.867691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.5271v3","created_at":"2026-05-18T03:35:36.867691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5271","created_at":"2026-05-18T03:35:36.867691+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXYJDVFYV6SW","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXYJDVFYV6SW7JAD","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXYJDVFY","created_at":"2026-05-18T12:26:07.630475+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/GXYJDVFYV6SW7JADRBEBBIVUI4","json":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4.json","graph_json":"https://pith.science/api/pith-number/GXYJDVFYV6SW7JADRBEBBIVUI4/graph.json","events_json":"https://pith.science/api/pith-number/GXYJDVFYV6SW7JADRBEBBIVUI4/events.json","paper":"https://pith.science/paper/GXYJDVFY"},"agent_actions":{"view_html":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4","download_json":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4.json","view_paper":"https://pith.science/paper/GXYJDVFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.5271&json=true","fetch_graph":"https://pith.science/api/pith-number/GXYJDVFYV6SW7JADRBEBBIVUI4/graph.json","fetch_events":"https://pith.science/api/pith-number/GXYJDVFYV6SW7JADRBEBBIVUI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4/action/storage_attestation","attest_author":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4/action/author_attestation","sign_citation":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4/action/citation_signature","submit_replication":"https://pith.science/pith/GXYJDVFYV6SW7JADRBEBBIVUI4/action/replication_record"}},"created_at":"2026-05-18T03:35:36.867691+00:00","updated_at":"2026-05-18T03:35:36.867691+00:00"}