{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UL6BZG7E7L7B3I44J57F6NXFAR","short_pith_number":"pith:UL6BZG7E","schema_version":"1.0","canonical_sha256":"a2fc1c9be4fafe1da39c4f7e5f36e504493e13e9a22a7a70d99227cd4732d76f","source":{"kind":"arxiv","id":"1512.06499","version":1},"attestation_state":"computed","paper":{"title":"On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeaki Kuzuoka","submitted_at":"2015-12-21T05:41:13Z","abstract_excerpt":"In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth Renyi entropy characterizes the optimal exponential moment of the codeword length."},"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":"1512.06499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T05:41:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60d22179831eb68f61d94d1e4d108a7b99a77815fe32bfb582baf0c88e75c962","abstract_canon_sha256":"a3b4324108e38d1ef7475ddff261087d8c496d16b15a76b7b7cad960064a2879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:00.391232Z","signature_b64":"2V80hUiOo5t/p93Y17GMYETOPIwRpNCCawstSgzF7r+70GVsxKAe4EmhiB3FTxYDJYdkVHzYNAwi5ixiNA0LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2fc1c9be4fafe1da39c4f7e5f36e504493e13e9a22a7a70d99227cd4732d76f","last_reissued_at":"2026-05-18T01:24:00.390556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:00.390556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeaki Kuzuoka","submitted_at":"2015-12-21T05:41:13Z","abstract_excerpt":"In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth Renyi entropy characterizes the optimal exponential moment of the codeword length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06499","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":"1512.06499","created_at":"2026-05-18T01:24:00.390651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06499v1","created_at":"2026-05-18T01:24:00.390651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06499","created_at":"2026-05-18T01:24:00.390651+00:00"},{"alias_kind":"pith_short_12","alias_value":"UL6BZG7E7L7B","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UL6BZG7E7L7B3I44","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UL6BZG7E","created_at":"2026-05-18T12:29:44.643036+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/UL6BZG7E7L7B3I44J57F6NXFAR","json":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR.json","graph_json":"https://pith.science/api/pith-number/UL6BZG7E7L7B3I44J57F6NXFAR/graph.json","events_json":"https://pith.science/api/pith-number/UL6BZG7E7L7B3I44J57F6NXFAR/events.json","paper":"https://pith.science/paper/UL6BZG7E"},"agent_actions":{"view_html":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR","download_json":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR.json","view_paper":"https://pith.science/paper/UL6BZG7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06499&json=true","fetch_graph":"https://pith.science/api/pith-number/UL6BZG7E7L7B3I44J57F6NXFAR/graph.json","fetch_events":"https://pith.science/api/pith-number/UL6BZG7E7L7B3I44J57F6NXFAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR/action/storage_attestation","attest_author":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR/action/author_attestation","sign_citation":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR/action/citation_signature","submit_replication":"https://pith.science/pith/UL6BZG7E7L7B3I44J57F6NXFAR/action/replication_record"}},"created_at":"2026-05-18T01:24:00.390651+00:00","updated_at":"2026-05-18T01:24:00.390651+00:00"}