{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UQ34NTL2XRELD3S34AP2OXJZ6I","short_pith_number":"pith:UQ34NTL2","canonical_record":{"source":{"id":"1011.3722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-11-16T15:09:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e59465986422556d69396897b9bb990e7ebac2e17aaa13163982d609c15ea8f6","abstract_canon_sha256":"912784ac0955ce728ece9a0a922be60cfecd354c052531b326594c4d147001e5"},"schema_version":"1.0"},"canonical_sha256":"a437c6cd7abc48b1ee5be01fa75d39f2222db23ebfec45994c5d49871b17df96","source":{"kind":"arxiv","id":"1011.3722","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3722","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3722v2","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3722","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"UQ34NTL2XREL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UQ34NTL2XRELD3S3","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UQ34NTL2","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UQ34NTL2XRELD3S34AP2OXJZ6I","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-11-16T15:09:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e59465986422556d69396897b9bb990e7ebac2e17aaa13163982d609c15ea8f6","abstract_canon_sha256":"912784ac0955ce728ece9a0a922be60cfecd354c052531b326594c4d147001e5"},"schema_version":"1.0"},"canonical_sha256":"a437c6cd7abc48b1ee5be01fa75d39f2222db23ebfec45994c5d49871b17df96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:55.353810Z","signature_b64":"ERNH/16nFmKp9lik6bWD/+0aNbleTmmxdXXXqkF7LdcuTMz9FFpGfh/Xo+ZD9/EFIbhMl3vGJ7eONm0nblzFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a437c6cd7abc48b1ee5be01fa75d39f2222db23ebfec45994c5d49871b17df96","last_reissued_at":"2026-05-18T04:29:55.353135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:55.353135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3722","source_version":2,"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-18T04:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHYpa9kSvHj0yF1KQHO0f67VvhHiXD+Ll4tHHH55FojYDlo6xGvxgDkjHRKaCSxb/SogXjCgzQSQNcXXXmODDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:08:30.817540Z"},"content_sha256":"b3b5af9ca083f445882bd8c1e445b77317e310f0d016631c2dedb4bd5740d854","schema_version":"1.0","event_id":"sha256:b3b5af9ca083f445882bd8c1e445b77317e310f0d016631c2dedb4bd5740d854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UQ34NTL2XRELD3S34AP2OXJZ6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical mechanical analysis of a hierarchical random code ensemble in signal processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cond-mat.dis-nn","authors_text":"Kazutaka Takahashi, Koujin Takeda, Tomoyuki Obuchi","submitted_at":"2010-11-16T15:09:41Z","abstract_excerpt":"We study a random code ensemble with a hierarchical structure, which is closely related to the generalized random energy model with discrete energy values. Based on this correspondence, we analyze the hierarchical random code ensemble by using the replica method in two situations: lossy data compression and channel coding. For both the situations, the exponents of large deviation analysis characterizing the performance of the ensemble, the distortion rate of lossy data compression and the error exponent of channel coding in Gallager's formalism, are accessible by a generating function of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3722","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"},"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-18T04:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXlKhM2Q2/YkpFOlq3O/vWTS8LSlCsKhRVa/K0/J4uDEv1hQNSNWFanIttitX9igu/pLxr9q7lP7iAZysuxFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:08:30.818130Z"},"content_sha256":"1e34c7ee8cc84377841e31c9a35fea5fd34ca77872ac093e9f8d2c8b1c6d591e","schema_version":"1.0","event_id":"sha256:1e34c7ee8cc84377841e31c9a35fea5fd34ca77872ac093e9f8d2c8b1c6d591e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/bundle.json","state_url":"https://pith.science/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/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-05-25T05:08:30Z","links":{"resolver":"https://pith.science/pith/UQ34NTL2XRELD3S34AP2OXJZ6I","bundle":"https://pith.science/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/bundle.json","state":"https://pith.science/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQ34NTL2XRELD3S34AP2OXJZ6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UQ34NTL2XRELD3S34AP2OXJZ6I","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":"912784ac0955ce728ece9a0a922be60cfecd354c052531b326594c4d147001e5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-11-16T15:09:41Z","title_canon_sha256":"e59465986422556d69396897b9bb990e7ebac2e17aaa13163982d609c15ea8f6"},"schema_version":"1.0","source":{"id":"1011.3722","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3722","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3722v2","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3722","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"UQ34NTL2XREL","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UQ34NTL2XRELD3S3","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UQ34NTL2","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:1e34c7ee8cc84377841e31c9a35fea5fd34ca77872ac093e9f8d2c8b1c6d591e","target":"graph","created_at":"2026-05-18T04:29:55Z","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":"We study a random code ensemble with a hierarchical structure, which is closely related to the generalized random energy model with discrete energy values. Based on this correspondence, we analyze the hierarchical random code ensemble by using the replica method in two situations: lossy data compression and channel coding. For both the situations, the exponents of large deviation analysis characterizing the performance of the ensemble, the distortion rate of lossy data compression and the error exponent of channel coding in Gallager's formalism, are accessible by a generating function of the g","authors_text":"Kazutaka Takahashi, Koujin Takeda, Tomoyuki Obuchi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-11-16T15:09:41Z","title":"Statistical mechanical analysis of a hierarchical random code ensemble in signal processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3722","kind":"arxiv","version":2},"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:b3b5af9ca083f445882bd8c1e445b77317e310f0d016631c2dedb4bd5740d854","target":"record","created_at":"2026-05-18T04:29:55Z","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":"912784ac0955ce728ece9a0a922be60cfecd354c052531b326594c4d147001e5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-11-16T15:09:41Z","title_canon_sha256":"e59465986422556d69396897b9bb990e7ebac2e17aaa13163982d609c15ea8f6"},"schema_version":"1.0","source":{"id":"1011.3722","kind":"arxiv","version":2}},"canonical_sha256":"a437c6cd7abc48b1ee5be01fa75d39f2222db23ebfec45994c5d49871b17df96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a437c6cd7abc48b1ee5be01fa75d39f2222db23ebfec45994c5d49871b17df96","first_computed_at":"2026-05-18T04:29:55.353135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:55.353135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERNH/16nFmKp9lik6bWD/+0aNbleTmmxdXXXqkF7LdcuTMz9FFpGfh/Xo+ZD9/EFIbhMl3vGJ7eONm0nblzFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:55.353810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3722","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3b5af9ca083f445882bd8c1e445b77317e310f0d016631c2dedb4bd5740d854","sha256:1e34c7ee8cc84377841e31c9a35fea5fd34ca77872ac093e9f8d2c8b1c6d591e"],"state_sha256":"4f1cce69b39414a1bc11a9a2a3f39c49741714371d2952b6a63fdd5e2dad028f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfrlrW2Ruqfa+0qKFEgiCILh4kSLHU28vME64rSYcKlFptRwH2RK+PArBR1rh5SV4wsktvXNIPQwXOI4+yubAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:08:30.821576Z","bundle_sha256":"e4c7b9e574b499abecd4c569e47c7369ced79b4ddd460dfd2e4ef0296f93aef2"}}