{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:AENJCJ5JSBABZ6EJZ33MYKFODV","short_pith_number":"pith:AENJCJ5J","schema_version":"1.0","canonical_sha256":"011a9127a990401cf889cef6cc28ae1d5ed97eeb0cb486ee0e65906451da6085","source":{"kind":"arxiv","id":"cs/0701011","version":2},"attestation_state":"computed","paper":{"title":"Infinite-Alphabet Prefix Codes Optimal for $\\beta$-Exponential Penalties","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2007-01-03T03:39:46Z","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/0701011","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-03T03:39:46Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"0032b932dfaad638ec47e44385c79ba43f0572c8557f0476075a40c077b8a7d3","abstract_canon_sha256":"33dcde7e85b902918569bcc0a2ef77fed2ee49785866dbab490d815dab19aba3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:54.803941Z","signature_b64":"qS9GqF9QQbXR6iLVKxX9R23SqpYB8Ak6Owygi/BY1YZS4qENH3al44nyb3JeguyFgUiIIQytru4IWa/eFXY2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011a9127a990401cf889cef6cc28ae1d5ed97eeb0cb486ee0e65906451da6085","last_reissued_at":"2026-07-04T15:02:54.803526Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:54.803526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite-Alphabet Prefix Codes Optimal for $\\beta$-Exponential Penalties","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2007-01-03T03:39:46Z","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/0701011","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0701011/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/0701011","created_at":"2026-07-04T15:02:54.803583+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701011v2","created_at":"2026-07-04T15:02:54.803583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701011","created_at":"2026-07-04T15:02:54.803583+00:00"},{"alias_kind":"pith_short_12","alias_value":"AENJCJ5JSBAB","created_at":"2026-07-04T15:02:54.803583+00:00"},{"alias_kind":"pith_short_16","alias_value":"AENJCJ5JSBABZ6EJ","created_at":"2026-07-04T15:02:54.803583+00:00"},{"alias_kind":"pith_short_8","alias_value":"AENJCJ5J","created_at":"2026-07-04T15:02:54.803583+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/AENJCJ5JSBABZ6EJZ33MYKFODV","json":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV.json","graph_json":"https://pith.science/api/pith-number/AENJCJ5JSBABZ6EJZ33MYKFODV/graph.json","events_json":"https://pith.science/api/pith-number/AENJCJ5JSBABZ6EJZ33MYKFODV/events.json","paper":"https://pith.science/paper/AENJCJ5J"},"agent_actions":{"view_html":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV","download_json":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV.json","view_paper":"https://pith.science/paper/AENJCJ5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701011&json=true","fetch_graph":"https://pith.science/api/pith-number/AENJCJ5JSBABZ6EJZ33MYKFODV/graph.json","fetch_events":"https://pith.science/api/pith-number/AENJCJ5JSBABZ6EJZ33MYKFODV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV/action/storage_attestation","attest_author":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV/action/author_attestation","sign_citation":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV/action/citation_signature","submit_replication":"https://pith.science/pith/AENJCJ5JSBABZ6EJZ33MYKFODV/action/replication_record"}},"created_at":"2026-07-04T15:02:54.803583+00:00","updated_at":"2026-07-04T15:02:54.803583+00:00"}