{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:JD4FPGXGEEF5A5UT727AF45TJL","short_pith_number":"pith:JD4FPGXG","schema_version":"1.0","canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","source":{"kind":"arxiv","id":"0804.1183","version":1},"attestation_state":"computed","paper":{"title":"Hash Property and Fixed-rate Universal Coding Theorems","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-04-08T05:11:01Z","abstract_excerpt":"The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed-rate lossless universal source coding problem and the fixed-rate universal channel coding problem. Since an ensemble of sparse matrices satisfies the hash property requirement, it is proved that we can construct universal codes by using sparse matrices."},"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":"0804.1183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-08T05:11:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2fd45e591e39f724d3e523f9ef038aea5d3a61a2aff7e9c06f62d17b634a27a2","abstract_canon_sha256":"1a5598ce08192b5e1cef6d74ffb2e1b718df1bfe700936aee0604fe82ed69637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.315862Z","signature_b64":"l404b7uXAta+5VsLazQ8W5qqB3X/nu7yMpKxx0NsIUKJbVWIG64ECXx51bc5ZdnCSnE3jJA+tainaePZfZVQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","last_reissued_at":"2026-05-18T03:55:22.315100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.315100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hash Property and Fixed-rate Universal Coding Theorems","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-04-08T05:11:01Z","abstract_excerpt":"The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed-rate lossless universal source coding problem and the fixed-rate universal channel coding problem. Since an ensemble of sparse matrices satisfies the hash property requirement, it is proved that we can construct universal codes by using sparse matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.1183","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":"0804.1183","created_at":"2026-05-18T03:55:22.315223+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.1183v1","created_at":"2026-05-18T03:55:22.315223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.1183","created_at":"2026-05-18T03:55:22.315223+00:00"},{"alias_kind":"pith_short_12","alias_value":"JD4FPGXGEEF5","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"JD4FPGXGEEF5A5UT","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"JD4FPGXG","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/JD4FPGXGEEF5A5UT727AF45TJL","json":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL.json","graph_json":"https://pith.science/api/pith-number/JD4FPGXGEEF5A5UT727AF45TJL/graph.json","events_json":"https://pith.science/api/pith-number/JD4FPGXGEEF5A5UT727AF45TJL/events.json","paper":"https://pith.science/paper/JD4FPGXG"},"agent_actions":{"view_html":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL","download_json":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL.json","view_paper":"https://pith.science/paper/JD4FPGXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.1183&json=true","fetch_graph":"https://pith.science/api/pith-number/JD4FPGXGEEF5A5UT727AF45TJL/graph.json","fetch_events":"https://pith.science/api/pith-number/JD4FPGXGEEF5A5UT727AF45TJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/action/storage_attestation","attest_author":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/action/author_attestation","sign_citation":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/action/citation_signature","submit_replication":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/action/replication_record"}},"created_at":"2026-05-18T03:55:22.315223+00:00","updated_at":"2026-05-18T03:55:22.315223+00:00"}