{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KLULAKBI2LQZTORTVBADBQITJC","short_pith_number":"pith:KLULAKBI","schema_version":"1.0","canonical_sha256":"52e8b02828d2e199ba33a84030c11348b0560d5965a4b5875d74423731335563","source":{"kind":"arxiv","id":"1102.2207","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.2207","created_at":"2026-05-18T04:29:34.063068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2207v1","created_at":"2026-05-18T04:29:34.063068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2207","created_at":"2026-05-18T04:29:34.063068+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLULAKBI2LQZ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLULAKBI2LQZTORT","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLULAKBI","created_at":"2026-05-18T12:26:32.869790+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/KLULAKBI2LQZTORTVBADBQITJC","json":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC.json","graph_json":"https://pith.science/api/pith-number/KLULAKBI2LQZTORTVBADBQITJC/graph.json","events_json":"https://pith.science/api/pith-number/KLULAKBI2LQZTORTVBADBQITJC/events.json","paper":"https://pith.science/paper/KLULAKBI"},"agent_actions":{"view_html":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC","download_json":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC.json","view_paper":"https://pith.science/paper/KLULAKBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2207&json=true","fetch_graph":"https://pith.science/api/pith-number/KLULAKBI2LQZTORTVBADBQITJC/graph.json","fetch_events":"https://pith.science/api/pith-number/KLULAKBI2LQZTORTVBADBQITJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/action/storage_attestation","attest_author":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/action/author_attestation","sign_citation":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/action/citation_signature","submit_replication":"https://pith.science/pith/KLULAKBI2LQZTORTVBADBQITJC/action/replication_record"}},"created_at":"2026-05-18T04:29:34.063068+00:00","updated_at":"2026-05-18T04:29:34.063068+00:00"}