{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OPVOE2LJO5G6TKGRB3MHXLMK45","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":"4daf93b9cc62b9aad524b65b56b719d568927832230ca0a22f4d06844db4f0dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-21T01:21:41Z","title_canon_sha256":"c9dda4e580630d98361c7dfa4576e07550d258560199cf8a5a26bef1a29cf257"},"schema_version":"1.0","source":{"id":"1303.5134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5134","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5134v1","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5134","created_at":"2026-05-18T03:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"OPVOE2LJO5G6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OPVOE2LJO5G6TKGR","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OPVOE2LJ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b544e16aaba3221408dd1f42ce7d2b35c1fc19ef1eba9aa00bb4af75e742fa89","target":"graph","created_at":"2026-05-18T03:30: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"},"paper":{"abstract_excerpt":"Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either $n$ \"children\" vertices connecting to it, or 0 children. Vertices with 0 children are called \\textit{leaves}. We let $h_n(q)$ represent the total number of $n$-ary Huffman trees with $q$ leaves. In this paper, we use a recursive method to generate upper and lower bounds on $h_n(q)$ and get $h_2(q) \\approx (0.1418532)(1.7941471)^q+(0.0612410)(1.","authors_text":"Angeline Rao, Jian Shen, Yezhou Feng, Ying Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-21T01:21:41Z","title":"Bounds on the Number of Huffman and Binary-Ternary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5134","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:26de7471d8090a26744ad9660179658cb7481f183ca0553ebc5831cf3c50c853","target":"record","created_at":"2026-05-18T03:30: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":"4daf93b9cc62b9aad524b65b56b719d568927832230ca0a22f4d06844db4f0dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-21T01:21:41Z","title_canon_sha256":"c9dda4e580630d98361c7dfa4576e07550d258560199cf8a5a26bef1a29cf257"},"schema_version":"1.0","source":{"id":"1303.5134","kind":"arxiv","version":1}},"canonical_sha256":"73eae26969774de9a8d10ed87bad8ae754a3a01c4b021bdd61951934834b5a21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73eae26969774de9a8d10ed87bad8ae754a3a01c4b021bdd61951934834b5a21","first_computed_at":"2026-05-18T03:30:14.416894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:14.416894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s1B8FDyKKPEIOpkPbta7HWh/q6/vlze8THX8K8ehWizPJE3YiN0PP1ZkJqF+/lRhuw0msTf//CiCgFq62OxaBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:14.417710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26de7471d8090a26744ad9660179658cb7481f183ca0553ebc5831cf3c50c853","sha256:b544e16aaba3221408dd1f42ce7d2b35c1fc19ef1eba9aa00bb4af75e742fa89"],"state_sha256":"62d0db5640e758a1cd21b5bbb2b2432537d7144cd3d68b30e716ce4593d6d4bd"}