{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:JD4FPGXGEEF5A5UT727AF45TJL","short_pith_number":"pith:JD4FPGXG","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"},"canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","source":{"kind":"arxiv","id":"0804.1183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.1183","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"0804.1183v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.1183","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"JD4FPGXGEEF5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"JD4FPGXGEEF5A5UT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"JD4FPGXG","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:JD4FPGXGEEF5A5UT727AF45TJL","target":"record","payload":{"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"},"canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","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"},"source_kind":"arxiv","source_id":"0804.1183","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Il5y5V+PWGtOQEYPPAV/6Zrht7b8VumnJkgdjVMtdpD7knmR8VCE3tc+pOLNXa7OHCAzat4HwBwEXfrcCfL8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:32.352150Z"},"content_sha256":"597f1c12bc42c9d23892239154c1fcda5ec60b8067c0d5d8590286ba831a4c98","schema_version":"1.0","event_id":"sha256:597f1c12bc42c9d23892239154c1fcda5ec60b8067c0d5d8590286ba831a4c98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:JD4FPGXGEEF5A5UT727AF45TJL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0V+XZ6v02AN6K7J/mJAYqPKd6DfR+AVP2unCkuZQyZubrK1endIcV60C2zUs1qCH9V//0Xw55+WeF8CnTZ50AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:32.352889Z"},"content_sha256":"18cbb76fa486169187d7e7bd96b13723c82f303a01a5bfe5617ad07c13f52ee6","schema_version":"1.0","event_id":"sha256:18cbb76fa486169187d7e7bd96b13723c82f303a01a5bfe5617ad07c13f52ee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/bundle.json","state_url":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JD4FPGXGEEF5A5UT727AF45TJL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:16:32Z","links":{"resolver":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL","bundle":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/bundle.json","state":"https://pith.science/pith/JD4FPGXGEEF5A5UT727AF45TJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JD4FPGXGEEF5A5UT727AF45TJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:JD4FPGXGEEF5A5UT727AF45TJL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1a5598ce08192b5e1cef6d74ffb2e1b718df1bfe700936aee0604fe82ed69637","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-08T05:11:01Z","title_canon_sha256":"2fd45e591e39f724d3e523f9ef038aea5d3a61a2aff7e9c06f62d17b634a27a2"},"schema_version":"1.0","source":{"id":"0804.1183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.1183","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"0804.1183v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.1183","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"JD4FPGXGEEF5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"JD4FPGXGEEF5A5UT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"JD4FPGXG","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:18cbb76fa486169187d7e7bd96b13723c82f303a01a5bfe5617ad07c13f52ee6","target":"graph","created_at":"2026-05-18T03:55:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Jun Muramatsu, Shigeki Miyake","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-08T05:11:01Z","title":"Hash Property and Fixed-rate Universal Coding Theorems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.1183","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:597f1c12bc42c9d23892239154c1fcda5ec60b8067c0d5d8590286ba831a4c98","target":"record","created_at":"2026-05-18T03:55:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1a5598ce08192b5e1cef6d74ffb2e1b718df1bfe700936aee0604fe82ed69637","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-08T05:11:01Z","title_canon_sha256":"2fd45e591e39f724d3e523f9ef038aea5d3a61a2aff7e9c06f62d17b634a27a2"},"schema_version":"1.0","source":{"id":"0804.1183","kind":"arxiv","version":1}},"canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48f8579ae6210bd07693febe02f3b34adb609f17061ce4c91307eeea60e72aef","first_computed_at":"2026-05-18T03:55:22.315100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:22.315100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l404b7uXAta+5VsLazQ8W5qqB3X/nu7yMpKxx0NsIUKJbVWIG64ECXx51bc5ZdnCSnE3jJA+tainaePZfZVQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:22.315862Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.1183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:597f1c12bc42c9d23892239154c1fcda5ec60b8067c0d5d8590286ba831a4c98","sha256:18cbb76fa486169187d7e7bd96b13723c82f303a01a5bfe5617ad07c13f52ee6"],"state_sha256":"8cafdff5f4dc4b0dff27d812640ed1d14f1b339d8fc22576320da1708d37c58a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkoioeowBjvQ8i62vOjhqXSggRP9nc8a84IHyG9UFQInWQzww3Z5bYzWNsxui233d6LBnY3RmI8OQsCAhlNEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:16:32.356930Z","bundle_sha256":"44c33e9e4d956c6db52bdfbfd7c2cd75150a6700c87e6b018da4f3c802f52dcd"}}