{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C6TA5QTVHM3WMUG5F57IA46PPE","short_pith_number":"pith:C6TA5QTV","canonical_record":{"source":{"id":"1605.01182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T08:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bfbb74e02e882010ee3a91b489096e80fd0bd252ef08b4f277cda4147328e1b","abstract_canon_sha256":"ca31348634422aca32109aa15001c00b4447f1731d5b8749d27f4921a4adc2e9"},"schema_version":"1.0"},"canonical_sha256":"17a60ec2753b376650dd2f7e8073cf793580949e8384d7c965100e91dd88dcca","source":{"kind":"arxiv","id":"1605.01182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01182","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01182v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01182","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"C6TA5QTVHM3W","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C6TA5QTVHM3WMUG5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C6TA5QTV","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C6TA5QTVHM3WMUG5F57IA46PPE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T08:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bfbb74e02e882010ee3a91b489096e80fd0bd252ef08b4f277cda4147328e1b","abstract_canon_sha256":"ca31348634422aca32109aa15001c00b4447f1731d5b8749d27f4921a4adc2e9"},"schema_version":"1.0"},"canonical_sha256":"17a60ec2753b376650dd2f7e8073cf793580949e8384d7c965100e91dd88dcca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:37.590769Z","signature_b64":"eiT48qxyEUKj/s+4dEQG8ObctnWhuWq7UxB/lBU+ssRxoGE80W2rWCyXtcwjoWz5nUIzgXa8VvULpGc3RLjHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17a60ec2753b376650dd2f7e8073cf793580949e8384d7c965100e91dd88dcca","last_reissued_at":"2026-05-18T01:15:37.590025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:37.590025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01182","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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+j1tCTcoGtoa0JX/aj7mB1AtjKyGrQGQLPYWHir5q4QxTVdfBNv60ILGIqb0WSBWhzwiAqPJ2QWHOuRWLg+qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:07.141285Z"},"content_sha256":"80cc2457a5890711748dadef846782fb5293ba3be394637fb2233501ce6c98cf","schema_version":"1.0","event_id":"sha256:80cc2457a5890711748dadef846782fb5293ba3be394637fb2233501ce6c98cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C6TA5QTVHM3WMUG5F57IA46PPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On empirical cumulant generating functions of code lengths for individual sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2016-05-04T08:35:45Z","abstract_excerpt":"We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the empirical average of the exponentiated code length. Since the probabilistic CGF is minimized in terms of the R\\'enyi entropy of the source, one of the motivations of this study is to derive an individual-sequence analogue of the R\\'enyi entropy, in the same way that the FS compressibility is the individual-sequence counterpart of the Shannon ent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01182","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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONzITcEtRHQvMKA2LTLHkHjaoAzQ3lh8ODaEVNUFSJ9oyV7m2V6uQ2aBj4LJvyrz+8S90m/lGl29tTCrOCoDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:07.141776Z"},"content_sha256":"9e0326b53c9ca6968af88d7229567eebb922737d30482780d812a4b27164c788","schema_version":"1.0","event_id":"sha256:9e0326b53c9ca6968af88d7229567eebb922737d30482780d812a4b27164c788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6TA5QTVHM3WMUG5F57IA46PPE/bundle.json","state_url":"https://pith.science/pith/C6TA5QTVHM3WMUG5F57IA46PPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6TA5QTVHM3WMUG5F57IA46PPE/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-27T13:45:07Z","links":{"resolver":"https://pith.science/pith/C6TA5QTVHM3WMUG5F57IA46PPE","bundle":"https://pith.science/pith/C6TA5QTVHM3WMUG5F57IA46PPE/bundle.json","state":"https://pith.science/pith/C6TA5QTVHM3WMUG5F57IA46PPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6TA5QTVHM3WMUG5F57IA46PPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C6TA5QTVHM3WMUG5F57IA46PPE","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":"ca31348634422aca32109aa15001c00b4447f1731d5b8749d27f4921a4adc2e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T08:35:45Z","title_canon_sha256":"3bfbb74e02e882010ee3a91b489096e80fd0bd252ef08b4f277cda4147328e1b"},"schema_version":"1.0","source":{"id":"1605.01182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01182","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01182v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01182","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"C6TA5QTVHM3W","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C6TA5QTVHM3WMUG5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C6TA5QTV","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:9e0326b53c9ca6968af88d7229567eebb922737d30482780d812a4b27164c788","target":"graph","created_at":"2026-05-18T01:15:37Z","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 consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the empirical average of the exponentiated code length. Since the probabilistic CGF is minimized in terms of the R\\'enyi entropy of the source, one of the motivations of this study is to derive an individual-sequence analogue of the R\\'enyi entropy, in the same way that the FS compressibility is the individual-sequence counterpart of the Shannon ent","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T08:35:45Z","title":"On empirical cumulant generating functions of code lengths for individual sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01182","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:80cc2457a5890711748dadef846782fb5293ba3be394637fb2233501ce6c98cf","target":"record","created_at":"2026-05-18T01:15:37Z","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":"ca31348634422aca32109aa15001c00b4447f1731d5b8749d27f4921a4adc2e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-04T08:35:45Z","title_canon_sha256":"3bfbb74e02e882010ee3a91b489096e80fd0bd252ef08b4f277cda4147328e1b"},"schema_version":"1.0","source":{"id":"1605.01182","kind":"arxiv","version":1}},"canonical_sha256":"17a60ec2753b376650dd2f7e8073cf793580949e8384d7c965100e91dd88dcca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17a60ec2753b376650dd2f7e8073cf793580949e8384d7c965100e91dd88dcca","first_computed_at":"2026-05-18T01:15:37.590025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:37.590025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eiT48qxyEUKj/s+4dEQG8ObctnWhuWq7UxB/lBU+ssRxoGE80W2rWCyXtcwjoWz5nUIzgXa8VvULpGc3RLjHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:37.590769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80cc2457a5890711748dadef846782fb5293ba3be394637fb2233501ce6c98cf","sha256:9e0326b53c9ca6968af88d7229567eebb922737d30482780d812a4b27164c788"],"state_sha256":"35d9852e5001612b7f4edd937be782247a7cb47581171c39aed0af572e7dfc98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbujUm3cxK2pDODK2qNQegAUSD0cWn9dT7QmLisYJBIOMjwzg4AO/KsUlc47lWsd+8D0pKzVXIaMRGGAtsR2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:45:07.144774Z","bundle_sha256":"62b2f2cdcf03c85bd47e0a45f6eb7be02c8f82966e6e6b873bcee642f7c2ed9d"}}