{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7APHQQ4CSFKCINISE6Z45VRC2L","short_pith_number":"pith:7APHQQ4C","canonical_record":{"source":{"id":"1208.1225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-06T18:04:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62af3c617fc958a7f912d45d544a3e45d5c6860ffcefc4411d9edbe76475232b","abstract_canon_sha256":"cfac548de1656d759585a9c8f12478eadec8f19ae0a53b7354b9d17d8cc563f1"},"schema_version":"1.0"},"canonical_sha256":"f81e784382915424351227b3ced622d2e76e5f94fc4b5f897d3291e6f3e3d61b","source":{"kind":"arxiv","id":"1208.1225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1225","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1225v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1225","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"7APHQQ4CSFKC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7APHQQ4CSFKCINIS","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7APHQQ4C","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7APHQQ4CSFKCINISE6Z45VRC2L","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-06T18:04:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62af3c617fc958a7f912d45d544a3e45d5c6860ffcefc4411d9edbe76475232b","abstract_canon_sha256":"cfac548de1656d759585a9c8f12478eadec8f19ae0a53b7354b9d17d8cc563f1"},"schema_version":"1.0"},"canonical_sha256":"f81e784382915424351227b3ced622d2e76e5f94fc4b5f897d3291e6f3e3d61b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.304986Z","signature_b64":"tqxpF5Dl4uoAe5BnDH6zTRU1oJQaDPr6bYJuLv8jK8iShFQLDgo5uL9XER38M8H+H6WuzgXCKv7HJRMX4bjTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f81e784382915424351227b3ced622d2e76e5f94fc4b5f897d3291e6f3e3d61b","last_reissued_at":"2026-05-18T03:49:20.304226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.304226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1225","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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39AfUmY1307R9C3y6LBnSj855taT3voBtZocQ7mJDCPMtQSYADgss/YcqLrPQcs7AueMKWLnOId7NwJ7F7U1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:21.646609Z"},"content_sha256":"38968e6eaee7449127324c52d051bf675346e50aa01ca0d92cd731dd0763a6aa","schema_version":"1.0","event_id":"sha256:38968e6eaee7449127324c52d051bf675346e50aa01ca0d92cd731dd0763a6aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7APHQQ4CSFKCINISE6Z45VRC2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average redundancy of the Shannon code for Markov sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Wojciech Szpankowski","submitted_at":"2012-08-06T18:04:54Z","abstract_excerpt":"It is known that for memoryless sources, the average and maximal redundancy of fixed-to-variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon code, to the case of a Markov source, which is considerably more involved. While this dichotomy, of convergent vs. oscillatory behavior, is well known in other cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1225","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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMpcQ4nEink6rc2IOow4EqSud6oeXqIVTbGzOK26aS6yjsU/j5eUtWEkuarj/dmxQysshgmwIWaK1ar7tQzjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:21.647281Z"},"content_sha256":"8f92487764f1925021c1d0ead01a6c71d468b1308de386d1cbe48808af5c3293","schema_version":"1.0","event_id":"sha256:8f92487764f1925021c1d0ead01a6c71d468b1308de386d1cbe48808af5c3293"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7APHQQ4CSFKCINISE6Z45VRC2L/bundle.json","state_url":"https://pith.science/pith/7APHQQ4CSFKCINISE6Z45VRC2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7APHQQ4CSFKCINISE6Z45VRC2L/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:44:21Z","links":{"resolver":"https://pith.science/pith/7APHQQ4CSFKCINISE6Z45VRC2L","bundle":"https://pith.science/pith/7APHQQ4CSFKCINISE6Z45VRC2L/bundle.json","state":"https://pith.science/pith/7APHQQ4CSFKCINISE6Z45VRC2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7APHQQ4CSFKCINISE6Z45VRC2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7APHQQ4CSFKCINISE6Z45VRC2L","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":"cfac548de1656d759585a9c8f12478eadec8f19ae0a53b7354b9d17d8cc563f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-06T18:04:54Z","title_canon_sha256":"62af3c617fc958a7f912d45d544a3e45d5c6860ffcefc4411d9edbe76475232b"},"schema_version":"1.0","source":{"id":"1208.1225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1225","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1225v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1225","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"7APHQQ4CSFKC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7APHQQ4CSFKCINIS","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7APHQQ4C","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:8f92487764f1925021c1d0ead01a6c71d468b1308de386d1cbe48808af5c3293","target":"graph","created_at":"2026-05-18T03:49:20Z","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":"It is known that for memoryless sources, the average and maximal redundancy of fixed-to-variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon code, to the case of a Markov source, which is considerably more involved. While this dichotomy, of convergent vs. oscillatory behavior, is well known in other cont","authors_text":"Neri Merhav, Wojciech Szpankowski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-06T18:04:54Z","title":"Average redundancy of the Shannon code for Markov sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1225","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:38968e6eaee7449127324c52d051bf675346e50aa01ca0d92cd731dd0763a6aa","target":"record","created_at":"2026-05-18T03:49:20Z","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":"cfac548de1656d759585a9c8f12478eadec8f19ae0a53b7354b9d17d8cc563f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-06T18:04:54Z","title_canon_sha256":"62af3c617fc958a7f912d45d544a3e45d5c6860ffcefc4411d9edbe76475232b"},"schema_version":"1.0","source":{"id":"1208.1225","kind":"arxiv","version":1}},"canonical_sha256":"f81e784382915424351227b3ced622d2e76e5f94fc4b5f897d3291e6f3e3d61b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f81e784382915424351227b3ced622d2e76e5f94fc4b5f897d3291e6f3e3d61b","first_computed_at":"2026-05-18T03:49:20.304226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.304226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqxpF5Dl4uoAe5BnDH6zTRU1oJQaDPr6bYJuLv8jK8iShFQLDgo5uL9XER38M8H+H6WuzgXCKv7HJRMX4bjTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.304986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38968e6eaee7449127324c52d051bf675346e50aa01ca0d92cd731dd0763a6aa","sha256:8f92487764f1925021c1d0ead01a6c71d468b1308de386d1cbe48808af5c3293"],"state_sha256":"8f906c483d88d31d87d78fb7d58fbb7e16f000e82aeb151674e67da74561c2f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JWAGufJ7vMQSjyB4K+FTbPUqV/PSfBj0LTMVivCj9zTKkOBN5bLxgKbkvf8HoS0Lnj5raEXqXpVkjV5YJgCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:44:21.650808Z","bundle_sha256":"ac76923e111b34369f60311fce6618d953b5647ed900d05c7d6a42c207fc4822"}}