{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UJOBH5M4QA6MBIBEFVCSAI6DF4","short_pith_number":"pith:UJOBH5M4","schema_version":"1.0","canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","source":{"kind":"arxiv","id":"cs/0511003","version":3},"attestation_state":"computed","paper":{"title":"Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2005-11-01T07:00:11Z","abstract_excerpt":"Let $P = \\{p(i)\\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a source code that is optimal in the sense of minimizing expected codeword length. For some applications, however, a source code should instead minimize one of a family of nonlinear objective functions, $\\beta$-exponential means, those of the form $\\log_a \\sum_i p(i) a^{n(i)}$, where $n(i)$ is the length of the $i$th codeword and $a$ is a positive constant. Ap"},"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/0511003","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-01T07:00:11Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"313a166d71af92036dbeed0df063a6195fafde8eac0a5cd05d95dea990ba661c","abstract_canon_sha256":"6cbeca30d69b30ab05e11a457655959b68ba5c7aef15e343b6b01de58973df92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:08.924234Z","signature_b64":"hC+dfJ+7H7M9Yc9f5C9ufXFqfpLE7IeFQpBSvXuk3rF/gchxRaz+al1GdDLG0zgddyRpgb3nf5BN0E+50PEzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","last_reissued_at":"2026-05-18T00:58:08.923513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:08.923513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2005-11-01T07:00:11Z","abstract_excerpt":"Let $P = \\{p(i)\\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a source code that is optimal in the sense of minimizing expected codeword length. For some applications, however, a source code should instead minimize one of a family of nonlinear objective functions, $\\beta$-exponential means, those of the form $\\log_a \\sum_i p(i) a^{n(i)}$, where $n(i)$ is the length of the $i$th codeword and $a$ is a positive constant. Ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511003","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":""},"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/0511003","created_at":"2026-05-18T00:58:08.923623+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0511003v3","created_at":"2026-05-18T00:58:08.923623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511003","created_at":"2026-05-18T00:58:08.923623+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJOBH5M4QA6M","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJOBH5M4QA6MBIBE","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJOBH5M4","created_at":"2026-05-18T12:25:53.939244+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/UJOBH5M4QA6MBIBEFVCSAI6DF4","json":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4.json","graph_json":"https://pith.science/api/pith-number/UJOBH5M4QA6MBIBEFVCSAI6DF4/graph.json","events_json":"https://pith.science/api/pith-number/UJOBH5M4QA6MBIBEFVCSAI6DF4/events.json","paper":"https://pith.science/paper/UJOBH5M4"},"agent_actions":{"view_html":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4","download_json":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4.json","view_paper":"https://pith.science/paper/UJOBH5M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0511003&json=true","fetch_graph":"https://pith.science/api/pith-number/UJOBH5M4QA6MBIBEFVCSAI6DF4/graph.json","fetch_events":"https://pith.science/api/pith-number/UJOBH5M4QA6MBIBEFVCSAI6DF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/action/storage_attestation","attest_author":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/action/author_attestation","sign_citation":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/action/citation_signature","submit_replication":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/action/replication_record"}},"created_at":"2026-05-18T00:58:08.923623+00:00","updated_at":"2026-05-18T00:58:08.923623+00:00"}