{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KLULAKBI2LQZTORTVBADBQITJC","short_pith_number":"pith:KLULAKBI","canonical_record":{"source":{"id":"1102.2207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T19:23:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52f0ac93a750a23154ac2022a4922c60a54783f263656cbae9a54b978da64fec","abstract_canon_sha256":"f191823a5d8cc9b8d678763d60f0b535b789c4ffb4b73a6a1d02a9477d11da33"},"schema_version":"1.0"},"canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","source":{"kind":"arxiv","id":"1102.2207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2207","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2207v1","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2207","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"KLULAKBI2LQZ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLULAKBI2LQZTORT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLULAKBI","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KLULAKBI2LQZTORTVBADBQITJC","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T19:23:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"52f0ac93a750a23154ac2022a4922c60a54783f263656cbae9a54b978da64fec","abstract_canon_sha256":"f191823a5d8cc9b8d678763d60f0b535b789c4ffb4b73a6a1d02a9477d11da33"},"schema_version":"1.0"},"canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:34.063436Z","signature_b64":"EkxPiciwALUu18EG2IVuKXz1v3L6/NKL+Zjhh1F1sjufupYZZE2xPY+UnoRHAaMdhEmu5X8EGlf3IbbT8UqQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","last_reissued_at":"2026-05-18T04:29:34.063001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:34.063001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2207","source_version":1,"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-18T04:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+odl7Vnlto4Cy1+/8w27LS1vYiz+Je3MXl363iamgpTnhXHSyPGxAEO5NdX8gXlcmlCmIz0idrGwqRGLuxpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:24:20.611069Z"},"content_sha256":"a5777038709be9f64965f5132509e908ada21d85350d18574b27c533c39f44ce","schema_version":"1.0","event_id":"sha256:a5777038709be9f64965f5132509e908ada21d85350d18574b27c533c39f44ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KLULAKBI2LQZTORTVBADBQITJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossless Coding with Generalised Criteria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Farzad Rezaei, Themistoklis Charalambous","submitted_at":"2011-02-10T19:23:16Z","abstract_excerpt":"This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the average of an exponential function of the codeword length and the average redundancy. This framework encompasses as a special case several criteria previously investigated in the literature, while relations to universal coding is discussed. The coding algorithm derived is parametric resulting in re-adjusting the initial source probabilities via a weighted pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2207","kind":"arxiv","version":1},"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-18T04:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgnTLj9tP6PBBBAiZuPA2ajqiLThTT/ac0rfBdu40rzOfIKJQ2NFRuyXU+vSFarmCKUpwRdGfQt8XquWv1ETCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:24:20.611424Z"},"content_sha256":"a8b13503f94065cee1dbbe7dacd130d2447b85c9ba854b5d3f5ea7e5e0821b63","schema_version":"1.0","event_id":"sha256:a8b13503f94065cee1dbbe7dacd130d2447b85c9ba854b5d3f5ea7e5e0821b63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/bundle.json","state_url":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLULAKBI2LQZTORTVBADBQITJC/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-06-02T14:24:20Z","links":{"resolver":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC","bundle":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/bundle.json","state":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLULAKBI2LQZTORTVBADBQITJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KLULAKBI2LQZTORTVBADBQITJC","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":"f191823a5d8cc9b8d678763d60f0b535b789c4ffb4b73a6a1d02a9477d11da33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T19:23:16Z","title_canon_sha256":"52f0ac93a750a23154ac2022a4922c60a54783f263656cbae9a54b978da64fec"},"schema_version":"1.0","source":{"id":"1102.2207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2207","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2207v1","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2207","created_at":"2026-05-18T04:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"KLULAKBI2LQZ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLULAKBI2LQZTORT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLULAKBI","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a8b13503f94065cee1dbbe7dacd130d2447b85c9ba854b5d3f5ea7e5e0821b63","target":"graph","created_at":"2026-05-18T04:29:34Z","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":"This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the average of an exponential function of the codeword length and the average redundancy. This framework encompasses as a special case several criteria previously investigated in the literature, while relations to universal coding is discussed. The coding algorithm derived is parametric resulting in re-adjusting the initial source probabilities via a weighted pr","authors_text":"Charalambos D. Charalambous, Farzad Rezaei, Themistoklis Charalambous","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T19:23:16Z","title":"Lossless Coding with Generalised Criteria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2207","kind":"arxiv","version":1},"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:a5777038709be9f64965f5132509e908ada21d85350d18574b27c533c39f44ce","target":"record","created_at":"2026-05-18T04:29:34Z","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":"f191823a5d8cc9b8d678763d60f0b535b789c4ffb4b73a6a1d02a9477d11da33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T19:23:16Z","title_canon_sha256":"52f0ac93a750a23154ac2022a4922c60a54783f263656cbae9a54b978da64fec"},"schema_version":"1.0","source":{"id":"1102.2207","kind":"arxiv","version":1}},"canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","first_computed_at":"2026-05-18T04:29:34.063001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:34.063001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkxPiciwALUu18EG2IVuKXz1v3L6/NKL+Zjhh1F1sjufupYZZE2xPY+UnoRHAaMdhEmu5X8EGlf3IbbT8UqQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:34.063436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5777038709be9f64965f5132509e908ada21d85350d18574b27c533c39f44ce","sha256:a8b13503f94065cee1dbbe7dacd130d2447b85c9ba854b5d3f5ea7e5e0821b63"],"state_sha256":"ca28280fcaed43f17c0cbae3f2990997f6ff7366b4d57b6536ffcf3841c31235"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jsEAAbKBt7O0hBXq3KWLO2xOUsSZzeEz52hu6Knl8jA7LkTgmieUx50lTc/JIcblEYOGFDCgdhTzbVdyLywBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:24:20.613594Z","bundle_sha256":"2483eb0085322cb920e53ecbfb3b30171b3ba9938e2e1042822a7ffe23f991a4"}}