{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:22JGJCNB5ULL7LQNVZ5UTP2KCW","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":"9742af74294fdda22d4b6de8688b9623930aa6fe516453ac790b54069d5c312b","cross_cats_sorted":["math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-25T02:21:49Z","title_canon_sha256":"12fd3df6facce440a40744f169851359c87b579cb99f05a75a26ef6326856561"},"schema_version":"1.0","source":{"id":"1007.4294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4294","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4294v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4294","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"22JGJCNB5ULL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"22JGJCNB5ULL7LQN","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"22JGJCNB","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:c025860dcfb7a3850adc593868e1efd4f118554901b3f7d04ff1883dff99b786","target":"graph","created_at":"2026-05-18T00:59:10Z","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 optimal prefix-free machine U is a universal decoding algorithm used to define the notion of program-size complexity H(s) for a finite binary string s. Since the set of all halting inputs for U is chosen to form a prefix-free set, the optimal prefix-free machine U can be regarded as an instantaneous code for noiseless source coding scheme. In this paper, we investigate the properties of optimal prefix-free machines as instantaneous codes. In particular, we investigate the properties of the set U^{-1}(s) of codewords associated with a symbol s. Namely, we investigate the number of codewords","authors_text":"Kohtaro Tadaki","cross_cats":["math.IT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-25T02:21:49Z","title":"Properties of optimal prefix-free machines as instantaneous codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4294","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:af22495a6af8f846f2d7a2efa452f09e0dd9a61441248e6bb231ed876fd96709","target":"record","created_at":"2026-05-18T00:59:10Z","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":"9742af74294fdda22d4b6de8688b9623930aa6fe516453ac790b54069d5c312b","cross_cats_sorted":["math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-25T02:21:49Z","title_canon_sha256":"12fd3df6facce440a40744f169851359c87b579cb99f05a75a26ef6326856561"},"schema_version":"1.0","source":{"id":"1007.4294","kind":"arxiv","version":1}},"canonical_sha256":"d6926489a1ed16bfae0dae7b49bf4a15a33049a868284ea0e4478595339ad6d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6926489a1ed16bfae0dae7b49bf4a15a33049a868284ea0e4478595339ad6d0","first_computed_at":"2026-05-18T00:59:10.799512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.799512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIWNpyON0Qb5jV6DdpA2Kg9AS9yX3xMN/98zA82E8Nm1N4wNFUBC03abV8e5gsR3VrS7WzGPlnJCgxO9z0OACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.800123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af22495a6af8f846f2d7a2efa452f09e0dd9a61441248e6bb231ed876fd96709","sha256:c025860dcfb7a3850adc593868e1efd4f118554901b3f7d04ff1883dff99b786"],"state_sha256":"a52eed5a9180ae67e37bb2f32acee320cdcb34c6f8d85340e36578c02eebf670"}