{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:UJOBH5M4QA6MBIBEFVCSAI6DF4","short_pith_number":"pith:UJOBH5M4","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"},"canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","source":{"kind":"arxiv","id":"cs/0511003","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511003","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511003v3","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511003","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"UJOBH5M4QA6M","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UJOBH5M4QA6MBIBE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UJOBH5M4","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:UJOBH5M4QA6MBIBEFVCSAI6DF4","target":"record","payload":{"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"},"canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","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"},"source_kind":"arxiv","source_id":"cs/0511003","source_version":3,"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-18T00:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjbtH7RQj0eKoKN79jJ8SGOwafJRFGf3uRXyDjb8BAuUOUpZ4jIbFIQYNdDB8gceyGXNR8nYpK1cIC2GPT8cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:06:26.131486Z"},"content_sha256":"53e019945f5cd79b04d8e59f93198aab065264e933770ce8e7d5d33f41e52688","schema_version":"1.0","event_id":"sha256:53e019945f5cd79b04d8e59f93198aab065264e933770ce8e7d5d33f41e52688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:UJOBH5M4QA6MBIBEFVCSAI6DF4","target":"graph","payload":{"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"},"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-18T00:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoJfLxC3k589C43pPek9PQjmEC+Gk1y0iXzofvQHBUFtQl6oanw37pNuTyILeHXOReCzHogbc4DnD8DM/qpjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:06:26.131829Z"},"content_sha256":"a85332786022a04b07f4c86402a9975728caf9e1e318202b295d8129da1310e1","schema_version":"1.0","event_id":"sha256:a85332786022a04b07f4c86402a9975728caf9e1e318202b295d8129da1310e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/bundle.json","state_url":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/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-07-04T22:06:26Z","links":{"resolver":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4","bundle":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/bundle.json","state":"https://pith.science/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJOBH5M4QA6MBIBEFVCSAI6DF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:UJOBH5M4QA6MBIBEFVCSAI6DF4","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":"6cbeca30d69b30ab05e11a457655959b68ba5c7aef15e343b6b01de58973df92","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-01T07:00:11Z","title_canon_sha256":"313a166d71af92036dbeed0df063a6195fafde8eac0a5cd05d95dea990ba661c"},"schema_version":"1.0","source":{"id":"cs/0511003","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511003","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511003v3","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511003","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"UJOBH5M4QA6M","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UJOBH5M4QA6MBIBE","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UJOBH5M4","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:a85332786022a04b07f4c86402a9975728caf9e1e318202b295d8129da1310e1","target":"graph","created_at":"2026-05-18T00:58:08Z","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":"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","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-11-01T07:00:11Z","title":"Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511003","kind":"arxiv","version":3},"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:53e019945f5cd79b04d8e59f93198aab065264e933770ce8e7d5d33f41e52688","target":"record","created_at":"2026-05-18T00:58:08Z","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":"6cbeca30d69b30ab05e11a457655959b68ba5c7aef15e343b6b01de58973df92","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-01T07:00:11Z","title_canon_sha256":"313a166d71af92036dbeed0df063a6195fafde8eac0a5cd05d95dea990ba661c"},"schema_version":"1.0","source":{"id":"cs/0511003","kind":"arxiv","version":3}},"canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a25c13f59c803cc0a0242d452023c32f39c865a76acfe265ce83c9ffb4bbaec6","first_computed_at":"2026-05-18T00:58:08.923513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:08.923513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hC+dfJ+7H7M9Yc9f5C9ufXFqfpLE7IeFQpBSvXuk3rF/gchxRaz+al1GdDLG0zgddyRpgb3nf5BN0E+50PEzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:08.924234Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0511003","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53e019945f5cd79b04d8e59f93198aab065264e933770ce8e7d5d33f41e52688","sha256:a85332786022a04b07f4c86402a9975728caf9e1e318202b295d8129da1310e1"],"state_sha256":"8e16254f6cda5c3d3b11fca027ca77f41dbdfc8de109e80efc3a63a718aca279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aF7Emiwvt+ZZ2y1AcYPxDVMf2RTYyYEI5LD5/PUwrmX8EdSzCHNMWItxQSXxP0WLkAzPKlrdKWNR96RIKl1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:06:26.133701Z","bundle_sha256":"8b6a2a773640d540e06599f863c83875020064b31d339f32d910c41231b9cc95"}}