{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:ARE7UNPNQOT23Q6OYRAB74SYJY","short_pith_number":"pith:ARE7UNPN","schema_version":"1.0","canonical_sha256":"0449fa35ed83a7adc3cec4401ff2584e3b0f22a4f705fafe5fbba142eb12b521","source":{"kind":"arxiv","id":"0809.0949","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0809.0949","created_at":"2026-07-04T15:42:14.444189+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.0949v3","created_at":"2026-07-04T15:42:14.444189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0949","created_at":"2026-07-04T15:42:14.444189+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARE7UNPNQOT2","created_at":"2026-07-04T15:42:14.444189+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARE7UNPNQOT23Q6O","created_at":"2026-07-04T15:42:14.444189+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARE7UNPN","created_at":"2026-07-04T15:42:14.444189+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/ARE7UNPNQOT23Q6OYRAB74SYJY","json":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY.json","graph_json":"https://pith.science/api/pith-number/ARE7UNPNQOT23Q6OYRAB74SYJY/graph.json","events_json":"https://pith.science/api/pith-number/ARE7UNPNQOT23Q6OYRAB74SYJY/events.json","paper":"https://pith.science/paper/ARE7UNPN"},"agent_actions":{"view_html":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY","download_json":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY.json","view_paper":"https://pith.science/paper/ARE7UNPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.0949&json=true","fetch_graph":"https://pith.science/api/pith-number/ARE7UNPNQOT23Q6OYRAB74SYJY/graph.json","fetch_events":"https://pith.science/api/pith-number/ARE7UNPNQOT23Q6OYRAB74SYJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/action/storage_attestation","attest_author":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/action/author_attestation","sign_citation":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/action/citation_signature","submit_replication":"https://pith.science/pith/ARE7UNPNQOT23Q6OYRAB74SYJY/action/replication_record"}},"created_at":"2026-07-04T15:42:14.444189+00:00","updated_at":"2026-07-04T15:42:14.444189+00:00"}