{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KTDJGJRDOUCEB2SXXBKRVJ662K","short_pith_number":"pith:KTDJGJRD","schema_version":"1.0","canonical_sha256":"54c6932623750440ea57b8551aa7ded29882352acbb109f369365a39cad7faa8","source":{"kind":"arxiv","id":"1210.6719","version":1},"attestation_state":"computed","paper":{"title":"Construction of Multiple Access Channel Codes 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":"2012-10-25T01:34:37Z","abstract_excerpt":"The aim of this paper is to introduce the construction of codes for a general discrete stationary memoryless multiple access channel based on the the notion of the hash property. Since an ensemble of sparse matrices has a hash property, we can use sparse matrices for code construction. Our approach has a potential advantage compared to the conventional random coding because it is expected that we can use some approximation algorithms by using the sparse structure of codes."},"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":"1210.6719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-25T01:34:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a2923e51ea3be3f5e5c001e1880623834e7e5bb44b8cd76936c8562f176d679","abstract_canon_sha256":"45620d4c0c673d0c60a05550152da42ba34d5bc057d8177eeb3271c9b960007f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.303739Z","signature_b64":"pfBKklEI80w9SBaMG7BZY/zlf1TgqQc5Hdu1qi607NTurMYVaalmF/Y3F66qS0cX8N6e6WdE8slqfhLJT4rXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c6932623750440ea57b8551aa7ded29882352acbb109f369365a39cad7faa8","last_reissued_at":"2026-05-18T03:42:23.303103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.303103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Multiple Access Channel Codes 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":"2012-10-25T01:34:37Z","abstract_excerpt":"The aim of this paper is to introduce the construction of codes for a general discrete stationary memoryless multiple access channel based on the the notion of the hash property. Since an ensemble of sparse matrices has a hash property, we can use sparse matrices for code construction. Our approach has a potential advantage compared to the conventional random coding because it is expected that we can use some approximation algorithms by using the sparse structure of codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6719","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":"1210.6719","created_at":"2026-05-18T03:42:23.303203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6719v1","created_at":"2026-05-18T03:42:23.303203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6719","created_at":"2026-05-18T03:42:23.303203+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTDJGJRDOUCE","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTDJGJRDOUCEB2SX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTDJGJRD","created_at":"2026-05-18T12:27:11.947152+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/KTDJGJRDOUCEB2SXXBKRVJ662K","json":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K.json","graph_json":"https://pith.science/api/pith-number/KTDJGJRDOUCEB2SXXBKRVJ662K/graph.json","events_json":"https://pith.science/api/pith-number/KTDJGJRDOUCEB2SXXBKRVJ662K/events.json","paper":"https://pith.science/paper/KTDJGJRD"},"agent_actions":{"view_html":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K","download_json":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K.json","view_paper":"https://pith.science/paper/KTDJGJRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6719&json=true","fetch_graph":"https://pith.science/api/pith-number/KTDJGJRDOUCEB2SXXBKRVJ662K/graph.json","fetch_events":"https://pith.science/api/pith-number/KTDJGJRDOUCEB2SXXBKRVJ662K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K/action/storage_attestation","attest_author":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K/action/author_attestation","sign_citation":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K/action/citation_signature","submit_replication":"https://pith.science/pith/KTDJGJRDOUCEB2SXXBKRVJ662K/action/replication_record"}},"created_at":"2026-05-18T03:42:23.303203+00:00","updated_at":"2026-05-18T03:42:23.303203+00:00"}