{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:XAAVKEWWCUGIV2QC7C27WAB6Z6","short_pith_number":"pith:XAAVKEWW","schema_version":"1.0","canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","source":{"kind":"arxiv","id":"cs/0508084","version":5},"attestation_state":"computed","paper":{"title":"Source Coding for Quasiarithmetic Penalties","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2005-08-18T20:29:04Z","abstract_excerpt":"Huffman coding finds a prefix code that minimizes mean codeword length for a given probability distribution over a finite number of items. Campbell generalized the Huffman problem to a family of problems in which the goal is to minimize not mean codeword length but rather a generalized mean known as a quasiarithmetic or quasilinear mean. Such generalized means have a number of diverse applications, including applications in queueing. Several quasiarithmetic-mean problems have novel simple redundancy bounds in terms of a generalized entropy. A related property involves the existence of optimal "},"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/0508084","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-18T20:29:04Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"ec12db4e49e43441f6fbe4048bf3922c1e35a4f943811f8085ac67f246996368","abstract_canon_sha256":"58d14ac1b48f42244a6c3fcccf1df20817adf23327e63ae9b92290a444ba8e38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:00.464896Z","signature_b64":"bfnigFsmSkj1wtq1xJBOGJRmH9EBmplzZjlGcwqp35tksT6yfGNg3iGtQkqRveFo6jvoiUwYDF2V5VVEIFxRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","last_reissued_at":"2026-07-04T15:03:00.464497Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:00.464497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Source Coding for Quasiarithmetic Penalties","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2005-08-18T20:29:04Z","abstract_excerpt":"Huffman coding finds a prefix code that minimizes mean codeword length for a given probability distribution over a finite number of items. Campbell generalized the Huffman problem to a family of problems in which the goal is to minimize not mean codeword length but rather a generalized mean known as a quasiarithmetic or quasilinear mean. Such generalized means have a number of diverse applications, including applications in queueing. Several quasiarithmetic-mean problems have novel simple redundancy bounds in terms of a generalized entropy. A related property involves the existence of optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508084","kind":"arxiv","version":5},"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/0508084/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/0508084","created_at":"2026-07-04T15:03:00.464562+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508084v5","created_at":"2026-07-04T15:03:00.464562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508084","created_at":"2026-07-04T15:03:00.464562+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAAVKEWWCUGI","created_at":"2026-07-04T15:03:00.464562+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAAVKEWWCUGIV2QC","created_at":"2026-07-04T15:03:00.464562+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAAVKEWW","created_at":"2026-07-04T15:03:00.464562+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/XAAVKEWWCUGIV2QC7C27WAB6Z6","json":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6.json","graph_json":"https://pith.science/api/pith-number/XAAVKEWWCUGIV2QC7C27WAB6Z6/graph.json","events_json":"https://pith.science/api/pith-number/XAAVKEWWCUGIV2QC7C27WAB6Z6/events.json","paper":"https://pith.science/paper/XAAVKEWW"},"agent_actions":{"view_html":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6","download_json":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6.json","view_paper":"https://pith.science/paper/XAAVKEWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508084&json=true","fetch_graph":"https://pith.science/api/pith-number/XAAVKEWWCUGIV2QC7C27WAB6Z6/graph.json","fetch_events":"https://pith.science/api/pith-number/XAAVKEWWCUGIV2QC7C27WAB6Z6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/action/storage_attestation","attest_author":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/action/author_attestation","sign_citation":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/action/citation_signature","submit_replication":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/action/replication_record"}},"created_at":"2026-07-04T15:03:00.464562+00:00","updated_at":"2026-07-04T15:03:00.464562+00:00"}