{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:3S4XYUMGDAOWPHQNFZV6HGAVLL","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":"feae8e8268b45f5a609bcc22a1180492346a784cf77f85a2767678f8e4b192c8","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:05:55Z","title_canon_sha256":"83153c1103604cb0aa31caaf0bbbdec40f0203f0d33ae04db124b6551db56723"},"schema_version":"1.0","source":{"id":"cs/0205049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205049","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205049v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205049","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"3S4XYUMGDAOW","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"3S4XYUMGDAOWPHQN","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"3S4XYUMG","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:562adecd6a70807630adb1cd1d3b2fd1325743f79dcc35860c4e03f1b1016dd1","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability. [See also ``Huffman Coding with Unequal Letter Costs'' (2002).]","authors_text":"Mordecai Golin, Neal E. Young","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:05:55Z","title":"Prefix Codes: Equiprobable Words, Unequal Letter Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205049","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:11a243c818096dcc7617ad4c958e27569f597317d432048c26059d57b38d862f","target":"record","created_at":"2026-05-18T01:59:53Z","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":"feae8e8268b45f5a609bcc22a1180492346a784cf77f85a2767678f8e4b192c8","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:05:55Z","title_canon_sha256":"83153c1103604cb0aa31caaf0bbbdec40f0203f0d33ae04db124b6551db56723"},"schema_version":"1.0","source":{"id":"cs/0205049","kind":"arxiv","version":1}},"canonical_sha256":"dcb97c5186181d679e0d2e6be398155ad1f31a24dbaba0ed2839edd7948a39ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcb97c5186181d679e0d2e6be398155ad1f31a24dbaba0ed2839edd7948a39ca","first_computed_at":"2026-05-18T01:59:53.891788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.891788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6+z4R0VcZwUUt2nzqgus4U/FRyxLVqxNGD/Z2EYRkgGUJn5uUqgHNhq7gFkSueM1ulrTEDd7xAu8S6m38pKfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.892420Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11a243c818096dcc7617ad4c958e27569f597317d432048c26059d57b38d862f","sha256:562adecd6a70807630adb1cd1d3b2fd1325743f79dcc35860c4e03f1b1016dd1"],"state_sha256":"c1378a76b1aea1ba6171ea6586e3447da82661f33ede7f61800d578b7cf58048"}