{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:3S4XYUMGDAOWPHQNFZV6HGAVLL","short_pith_number":"pith:3S4XYUMG","schema_version":"1.0","canonical_sha256":"dcb97c5186181d679e0d2e6be398155ad1f31a24dbaba0ed2839edd7948a39ca","source":{"kind":"arxiv","id":"cs/0205049","version":1},"attestation_state":"computed","paper":{"title":"Prefix Codes: Equiprobable Words, Unequal Letter Costs","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mordecai Golin, Neal E. Young","submitted_at":"2002-05-18T19:05:55Z","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).]"},"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":"cs/0205049","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"83153c1103604cb0aa31caaf0bbbdec40f0203f0d33ae04db124b6551db56723","abstract_canon_sha256":"feae8e8268b45f5a609bcc22a1180492346a784cf77f85a2767678f8e4b192c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.892420Z","signature_b64":"6+z4R0VcZwUUt2nzqgus4U/FRyxLVqxNGD/Z2EYRkgGUJn5uUqgHNhq7gFkSueM1ulrTEDd7xAu8S6m38pKfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcb97c5186181d679e0d2e6be398155ad1f31a24dbaba0ed2839edd7948a39ca","last_reissued_at":"2026-05-18T01:59:53.891788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.891788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prefix Codes: Equiprobable Words, Unequal Letter Costs","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mordecai Golin, Neal E. Young","submitted_at":"2002-05-18T19:05:55Z","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).]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205049","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205049","created_at":"2026-05-18T01:59:53.891909+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205049v1","created_at":"2026-05-18T01:59:53.891909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205049","created_at":"2026-05-18T01:59:53.891909+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S4XYUMGDAOW","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S4XYUMGDAOWPHQN","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S4XYUMG","created_at":"2026-05-18T12:25:50.845339+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/3S4XYUMGDAOWPHQNFZV6HGAVLL","json":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL.json","graph_json":"https://pith.science/api/pith-number/3S4XYUMGDAOWPHQNFZV6HGAVLL/graph.json","events_json":"https://pith.science/api/pith-number/3S4XYUMGDAOWPHQNFZV6HGAVLL/events.json","paper":"https://pith.science/paper/3S4XYUMG"},"agent_actions":{"view_html":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL","download_json":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL.json","view_paper":"https://pith.science/paper/3S4XYUMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205049&json=true","fetch_graph":"https://pith.science/api/pith-number/3S4XYUMGDAOWPHQNFZV6HGAVLL/graph.json","fetch_events":"https://pith.science/api/pith-number/3S4XYUMGDAOWPHQNFZV6HGAVLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL/action/storage_attestation","attest_author":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL/action/author_attestation","sign_citation":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL/action/citation_signature","submit_replication":"https://pith.science/pith/3S4XYUMGDAOWPHQNFZV6HGAVLL/action/replication_record"}},"created_at":"2026-05-18T01:59:53.891909+00:00","updated_at":"2026-05-18T01:59:53.891909+00:00"}