{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ARE7UNPNQOT23Q6OYRAB74SYJY","short_pith_number":"pith:ARE7UNPN","canonical_record":{"source":{"id":"0809.0949","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T05:14:10Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"7bb8e70e818db1dc62af8e3fc4b1bd150173d9b9d575912905107dc5931deb64","abstract_canon_sha256":"aaa6c987c02e343eb73105610189abdfcf127de1e7e7dab0aa51ef7d93e8cf46"},"schema_version":"1.0"},"canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","source":{"kind":"arxiv","id":"0809.0949","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.0949","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"0809.0949v3","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0949","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"ARE7UNPNQOT2","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_16","alias_value":"ARE7UNPNQOT23Q6O","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_8","alias_value":"ARE7UNPN","created_at":"2026-07-04T15:42:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ARE7UNPNQOT23Q6OYRAB74SYJY","target":"record","payload":{"canonical_record":{"source":{"id":"0809.0949","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T05:14:10Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"7bb8e70e818db1dc62af8e3fc4b1bd150173d9b9d575912905107dc5931deb64","abstract_canon_sha256":"aaa6c987c02e343eb73105610189abdfcf127de1e7e7dab0aa51ef7d93e8cf46"},"schema_version":"1.0"},"canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:42:14.444551Z","signature_b64":"zGVOAHH7/qURGFgBkoZVY1+R+fAIMd/SUvcpw8NHYM7aCR860V4y0rHCggO5m7AokRJNTMR0Cqqvirc2KvrsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","last_reissued_at":"2026-07-04T15:42:14.444120Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:42:14.444120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.0949","source_version":3,"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-07-04T15:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXiARiAT+74LZvCVc+50zGnUqISS/ABGBk86xfSM2mOcQ9Sxamkn8kltp1soCytk89+GYZGiNuD9F5SxBXYIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:59:31.079132Z"},"content_sha256":"02d97b2f90f43374a882cd860739d7b1df3a859f17a9c5ad30626903f9cccc1f","schema_version":"1.0","event_id":"sha256:02d97b2f90f43374a882cd860739d7b1df3a859f17a9c5ad30626903f9cccc1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ARE7UNPNQOT23Q6OYRAB74SYJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Implementation of the Generalized Tunstall Code Generation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2008-09-05T05:14:10Z","abstract_excerpt":"A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which require a (suboptimal) generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1+(log s)/D) n) time and O(n) space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0949","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0809.0949/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMENjXirf2dm8jlurYeMy88YFw8ZZnJKRf60chb/56ldvsdiIGOWIUMkPAYDiaiRyUi4pY/jGqsG//9sR/X2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:59:31.079529Z"},"content_sha256":"38f6da168e2185728b087a6e18751c96de84aebdd13383c70c06d620d16609c1","schema_version":"1.0","event_id":"sha256:38f6da168e2185728b087a6e18751c96de84aebdd13383c70c06d620d16609c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/bundle.json","state_url":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/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-07-04T18:59:31Z","links":{"resolver":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY","bundle":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/bundle.json","state":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ARE7UNPNQOT23Q6OYRAB74SYJY","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":"aaa6c987c02e343eb73105610189abdfcf127de1e7e7dab0aa51ef7d93e8cf46","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T05:14:10Z","title_canon_sha256":"7bb8e70e818db1dc62af8e3fc4b1bd150173d9b9d575912905107dc5931deb64"},"schema_version":"1.0","source":{"id":"0809.0949","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.0949","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"0809.0949v3","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0949","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"ARE7UNPNQOT2","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_16","alias_value":"ARE7UNPNQOT23Q6O","created_at":"2026-07-04T15:42:14Z"},{"alias_kind":"pith_short_8","alias_value":"ARE7UNPN","created_at":"2026-07-04T15:42:14Z"}],"graph_snapshots":[{"event_id":"sha256:38f6da168e2185728b087a6e18751c96de84aebdd13383c70c06d620d16609c1","target":"graph","created_at":"2026-07-04T15:42:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0809.0949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which require a (suboptimal) generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1+(log s)/D) n) time and O(n) space.","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T05:14:10Z","title":"Efficient Implementation of the Generalized Tunstall Code Generation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0949","kind":"arxiv","version":3},"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:02d97b2f90f43374a882cd860739d7b1df3a859f17a9c5ad30626903f9cccc1f","target":"record","created_at":"2026-07-04T15:42:14Z","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":"aaa6c987c02e343eb73105610189abdfcf127de1e7e7dab0aa51ef7d93e8cf46","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T05:14:10Z","title_canon_sha256":"7bb8e70e818db1dc62af8e3fc4b1bd150173d9b9d575912905107dc5931deb64"},"schema_version":"1.0","source":{"id":"0809.0949","kind":"arxiv","version":3}},"canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","first_computed_at":"2026-07-04T15:42:14.444120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:42:14.444120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zGVOAHH7/qURGFgBkoZVY1+R+fAIMd/SUvcpw8NHYM7aCR860V4y0rHCggO5m7AokRJNTMR0Cqqvirc2KvrsAg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:42:14.444551Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.0949","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02d97b2f90f43374a882cd860739d7b1df3a859f17a9c5ad30626903f9cccc1f","sha256:38f6da168e2185728b087a6e18751c96de84aebdd13383c70c06d620d16609c1"],"state_sha256":"110769515a57aa8644dfe50ed270f0b382c2cd58f6fd3da09c30e3803f921676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdOBHmzy+uENoPdvCGP+geCbCvajg5M76tPrIykwDNPSDM7uUjqyubnN02f70tyGsPR+++vEi2FzID1hOQkEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:59:31.081644Z","bundle_sha256":"49f102f7e8e3061faf527cd9548150c4489b92af32a8c6308561884858742def"}}