{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:PTTGODPEDUAEOMG4EKXRO6KYQQ","short_pith_number":"pith:PTTGODPE","canonical_record":{"source":{"id":"cs/0509015","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2005-09-06T10:58:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5dddb7fc4c2dcc670368fa9ffeaff232b1cf376a2f73181c743ba4eee32adb0a","abstract_canon_sha256":"8a676ee9c2a352660b07c9394e2bf4533b3392903404ccafd96e60260c36f8da"},"schema_version":"1.0"},"canonical_sha256":"7ce6670de41d004730dc22af1779588435442cf5f2a16f86e6fd765db82c9524","source":{"kind":"arxiv","id":"cs/0509015","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509015","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509015v4","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509015","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"PTTGODPEDUAE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"PTTGODPEDUAEOMG4","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"PTTGODPE","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:PTTGODPEDUAEOMG4EKXRO6KYQQ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0509015","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2005-09-06T10:58:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5dddb7fc4c2dcc670368fa9ffeaff232b1cf376a2f73181c743ba4eee32adb0a","abstract_canon_sha256":"8a676ee9c2a352660b07c9394e2bf4533b3392903404ccafd96e60260c36f8da"},"schema_version":"1.0"},"canonical_sha256":"7ce6670de41d004730dc22af1779588435442cf5f2a16f86e6fd765db82c9524","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:37.733437Z","signature_b64":"vi3qtOxwEJwEqYQIhRLI8+if2ZU4lucIYXsGm5vYFOZxDEc6Nd5gucPnVu/7l3Ux9BzpdpmxTAbVbdwLttpqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce6670de41d004730dc22af1779588435442cf5f2a16f86e6fd765db82c9524","last_reissued_at":"2026-05-18T01:03:37.732816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:37.732816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0509015","source_version":4,"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-05-18T01:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAMI/QKL84x0kKL0FFsmW41k0ptg2n5e3XT8QCJRwutSLJXAjsBlj4pln0BAxF0qe5xufXxolI9sc1UChgnYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:54:23.426352Z"},"content_sha256":"46a5ae0dbbbe0d56a950bae2d553ecab76d2b618d222c9c5239ed9688ab82270","schema_version":"1.0","event_id":"sha256:46a5ae0dbbbe0d56a950bae2d553ecab76d2b618d222c9c5239ed9688ab82270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:PTTGODPEDUAEOMG4EKXRO6KYQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Ahmed Belal, Amr Elmasry","submitted_at":"2005-09-06T10:58:22Z","abstract_excerpt":"A new method for constructing minimum-redundancy binary prefix codes is described. Our method does not explicitly build a Huffman tree; instead it uses a property of optimal prefix codes to compute the codeword lengths corresponding to the input weights. Let $n$ be the number of weights and $k$ be the number of distinct codeword lengths as produced by the algorithm for the optimum codes. The running time of our algorithm is $O(k \\cdot n)$. Following our previous work in \\cite{be}, no algorithm can possibly construct optimal prefix codes in $o(k \\cdot n)$ time. When the given weights are presor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509015","kind":"arxiv","version":4},"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"},"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-05-18T01:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovI7vHJETLRQORMc2FM35Z9U5JI1Zi5Aaf9YBUV0ho4/LnK/9CSa+27ljp80O7T1HkQ/FE7OWkqtEWwnKkA6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:54:23.426697Z"},"content_sha256":"a378caeb4eca48f9a64f1871940d6405f71ed0f2eaf503bad01b1e8586482bd5","schema_version":"1.0","event_id":"sha256:a378caeb4eca48f9a64f1871940d6405f71ed0f2eaf503bad01b1e8586482bd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/bundle.json","state_url":"https://pith.science/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/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-06-24T04:54:23Z","links":{"resolver":"https://pith.science/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ","bundle":"https://pith.science/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/bundle.json","state":"https://pith.science/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTTGODPEDUAEOMG4EKXRO6KYQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PTTGODPEDUAEOMG4EKXRO6KYQQ","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":"8a676ee9c2a352660b07c9394e2bf4533b3392903404ccafd96e60260c36f8da","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2005-09-06T10:58:22Z","title_canon_sha256":"5dddb7fc4c2dcc670368fa9ffeaff232b1cf376a2f73181c743ba4eee32adb0a"},"schema_version":"1.0","source":{"id":"cs/0509015","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509015","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509015v4","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509015","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"PTTGODPEDUAE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"PTTGODPEDUAEOMG4","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"PTTGODPE","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:a378caeb4eca48f9a64f1871940d6405f71ed0f2eaf503bad01b1e8586482bd5","target":"graph","created_at":"2026-05-18T01:03:37Z","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":"A new method for constructing minimum-redundancy binary prefix codes is described. Our method does not explicitly build a Huffman tree; instead it uses a property of optimal prefix codes to compute the codeword lengths corresponding to the input weights. Let $n$ be the number of weights and $k$ be the number of distinct codeword lengths as produced by the algorithm for the optimum codes. The running time of our algorithm is $O(k \\cdot n)$. Following our previous work in \\cite{be}, no algorithm can possibly construct optimal prefix codes in $o(k \\cdot n)$ time. When the given weights are presor","authors_text":"Ahmed Belal, Amr Elmasry","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2005-09-06T10:58:22Z","title":"Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509015","kind":"arxiv","version":4},"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:46a5ae0dbbbe0d56a950bae2d553ecab76d2b618d222c9c5239ed9688ab82270","target":"record","created_at":"2026-05-18T01:03:37Z","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":"8a676ee9c2a352660b07c9394e2bf4533b3392903404ccafd96e60260c36f8da","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2005-09-06T10:58:22Z","title_canon_sha256":"5dddb7fc4c2dcc670368fa9ffeaff232b1cf376a2f73181c743ba4eee32adb0a"},"schema_version":"1.0","source":{"id":"cs/0509015","kind":"arxiv","version":4}},"canonical_sha256":"7ce6670de41d004730dc22af1779588435442cf5f2a16f86e6fd765db82c9524","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ce6670de41d004730dc22af1779588435442cf5f2a16f86e6fd765db82c9524","first_computed_at":"2026-05-18T01:03:37.732816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:37.732816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vi3qtOxwEJwEqYQIhRLI8+if2ZU4lucIYXsGm5vYFOZxDEc6Nd5gucPnVu/7l3Ux9BzpdpmxTAbVbdwLttpqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:37.733437Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0509015","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46a5ae0dbbbe0d56a950bae2d553ecab76d2b618d222c9c5239ed9688ab82270","sha256:a378caeb4eca48f9a64f1871940d6405f71ed0f2eaf503bad01b1e8586482bd5"],"state_sha256":"874108960bdc9ac79d1751e453a45361d81ec2162ff51f4a7408d48df7735b0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjB18kHLLwO3gQEr8V0RnWHOYR857VmY0Joo5jRqBRH33qQOK/C7n3y+KdRSMDrVQa8c8IXFxI5DilrzDfL4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:54:23.428584Z","bundle_sha256":"c5b01ae67fce9b246a441d7a2fd9713e0789b9e531b997f61b266a6b7ec90cbb"}}