{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:XAAVKEWWCUGIV2QC7C27WAB6Z6","short_pith_number":"pith:XAAVKEWW","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"},"canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","source":{"kind":"arxiv","id":"cs/0508084","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508084","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508084v5","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508084","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"XAAVKEWWCUGI","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"XAAVKEWWCUGIV2QC","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"XAAVKEWW","created_at":"2026-07-04T15:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:XAAVKEWWCUGIV2QC7C27WAB6Z6","target":"record","payload":{"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"},"canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","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"},"source_kind":"arxiv","source_id":"cs/0508084","source_version":5,"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNdA7KqfY84bx1I960Av29B1FREa2pR/yUCdM/d0knVFy59L+B3XpMmhvEW5LKh+ZwvdIPLe2ABgeTFh9tQwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:58:56.205508Z"},"content_sha256":"9e4d5246fa7459f34894c44f882d98412350031b22d43bef9431d0da96173931","schema_version":"1.0","event_id":"sha256:9e4d5246fa7459f34894c44f882d98412350031b22d43bef9431d0da96173931"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:XAAVKEWWCUGIV2QC7C27WAB6Z6","target":"graph","payload":{"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"},"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-07-04T15:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoDpAy1XtIinPZVHfgykJz3JFeK3+c1pJO8a+3a2DaZzGTY8a/ASgJiNvkXJj8w17KOmowWJdBfX0ocKnRzDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:58:56.205875Z"},"content_sha256":"71ade520453499f135ab559b13219715ddef33bd0a442cd4779c180068edf370","schema_version":"1.0","event_id":"sha256:71ade520453499f135ab559b13219715ddef33bd0a442cd4779c180068edf370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/bundle.json","state_url":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/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-04T20:58:56Z","links":{"resolver":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6","bundle":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/bundle.json","state":"https://pith.science/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAAVKEWWCUGIV2QC7C27WAB6Z6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:XAAVKEWWCUGIV2QC7C27WAB6Z6","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":"58d14ac1b48f42244a6c3fcccf1df20817adf23327e63ae9b92290a444ba8e38","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-18T20:29:04Z","title_canon_sha256":"ec12db4e49e43441f6fbe4048bf3922c1e35a4f943811f8085ac67f246996368"},"schema_version":"1.0","source":{"id":"cs/0508084","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508084","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508084v5","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508084","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"XAAVKEWWCUGI","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"XAAVKEWWCUGIV2QC","created_at":"2026-07-04T15:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"XAAVKEWW","created_at":"2026-07-04T15:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:71ade520453499f135ab559b13219715ddef33bd0a442cd4779c180068edf370","target":"graph","created_at":"2026-07-04T15:03:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0508084/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-08-18T20:29:04Z","title":"Source Coding for Quasiarithmetic Penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508084","kind":"arxiv","version":5},"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:9e4d5246fa7459f34894c44f882d98412350031b22d43bef9431d0da96173931","target":"record","created_at":"2026-07-04T15:03:00Z","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":"58d14ac1b48f42244a6c3fcccf1df20817adf23327e63ae9b92290a444ba8e38","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-18T20:29:04Z","title_canon_sha256":"ec12db4e49e43441f6fbe4048bf3922c1e35a4f943811f8085ac67f246996368"},"schema_version":"1.0","source":{"id":"cs/0508084","kind":"arxiv","version":5}},"canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8015512d6150c8aea02f8b5fb003ecfb1e333c3f44ffce27d12ecd7dc55c602","first_computed_at":"2026-07-04T15:03:00.464497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:00.464497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bfnigFsmSkj1wtq1xJBOGJRmH9EBmplzZjlGcwqp35tksT6yfGNg3iGtQkqRveFo6jvoiUwYDF2V5VVEIFxRAg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:00.464896Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508084","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e4d5246fa7459f34894c44f882d98412350031b22d43bef9431d0da96173931","sha256:71ade520453499f135ab559b13219715ddef33bd0a442cd4779c180068edf370"],"state_sha256":"82e9f2c90425d4e0f529a98b7dbf9cb082e9b7099de8d50cd3f82028d79f8353"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIY6qRK4oypIxYReAQBPMyMTyXcv8OlfYWcSUO5xjIonE6wjPVL8K6g8c5QtTyEEHt0xCBaAWTxrEE0rnugXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:58:56.207747Z","bundle_sha256":"3c0952a787e74e6131f80111aab15cf28bd543adf8d30beb6f366a4c8ef820cd"}}