{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5XVOEMH2V32XW2MBLTKTM7UZOX","short_pith_number":"pith:5XVOEMH2","canonical_record":{"source":{"id":"1112.1715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T22:08:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"139ef5ccb6eab675278bc964ed7cc12d8890711cbcbaf1774221fe219f19b22c","abstract_canon_sha256":"d8176534bf40b70e69fd29a57e3e71b49a004d9070dc388c189a83887dcf96d3"},"schema_version":"1.0"},"canonical_sha256":"edeae230faaef57b69815cd5367e9975cea2a18cd9802b5aa52127b2f7e6471e","source":{"kind":"arxiv","id":"1112.1715","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1715","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1715v2","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1715","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"5XVOEMH2V32X","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5XVOEMH2V32XW2MB","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5XVOEMH2","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5XVOEMH2V32XW2MBLTKTM7UZOX","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T22:08:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"139ef5ccb6eab675278bc964ed7cc12d8890711cbcbaf1774221fe219f19b22c","abstract_canon_sha256":"d8176534bf40b70e69fd29a57e3e71b49a004d9070dc388c189a83887dcf96d3"},"schema_version":"1.0"},"canonical_sha256":"edeae230faaef57b69815cd5367e9975cea2a18cd9802b5aa52127b2f7e6471e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.814114Z","signature_b64":"ndUAWkCWCFMNknqcoqNa5UaVIoeTimkkDAhruUDekF4teDQ6N1lWmhkAK7XG1iU1nX3DDFph/H21DlYdO6MgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edeae230faaef57b69815cd5367e9975cea2a18cd9802b5aa52127b2f7e6471e","last_reissued_at":"2026-05-18T03:48:35.813663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.813663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1715","source_version":2,"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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/T3AWbGs9p0QZurZPCCuz6+l+zdl6S79Efn/vcik/RH2yD78+FP4L8gp9/Jdqg/grHBHcWRxPQTG1A6RDlfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:38.783386Z"},"content_sha256":"6250de8e4d41c77e1902cf7e757f454a36f964e8945b2cebc2dd100567e54786","schema_version":"1.0","event_id":"sha256:6250de8e4d41c77e1902cf7e757f454a36f964e8945b2cebc2dd100567e54786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5XVOEMH2V32XW2MBLTKTM7UZOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Merging Algorithms for Lossless Codes with Generalized 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-12-07T22:08:01Z","abstract_excerpt":"This paper presents lossless prefix codes optimized with respect to a pay-off criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are based on a new coding algorithm which transforms the initial source probability vector into a new probability vector according to a merging rule. The coding algorithm is equivalent to a partition of the source alphabet into disjoint sets on which a new transformed probability vector is defined as a function of the initial source probability vector and a scalar parameter. The p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1715","kind":"arxiv","version":2},"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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZopq/C3D0yGnUuox7Kx33WCIL8wv/nzISHK1uYeNbtAIIM3HIBAt+3I3FTPRCmGki32FyBHbRDZHNfUsh/CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:38.783734Z"},"content_sha256":"30d1dea381a7fc44fe5890ec020a56555253d966525240ce46bea7a50a61a327","schema_version":"1.0","event_id":"sha256:30d1dea381a7fc44fe5890ec020a56555253d966525240ce46bea7a50a61a327"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/bundle.json","state_url":"https://pith.science/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/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-02T12:18:38Z","links":{"resolver":"https://pith.science/pith/5XVOEMH2V32XW2MBLTKTM7UZOX","bundle":"https://pith.science/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/bundle.json","state":"https://pith.science/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XVOEMH2V32XW2MBLTKTM7UZOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5XVOEMH2V32XW2MBLTKTM7UZOX","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":"d8176534bf40b70e69fd29a57e3e71b49a004d9070dc388c189a83887dcf96d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T22:08:01Z","title_canon_sha256":"139ef5ccb6eab675278bc964ed7cc12d8890711cbcbaf1774221fe219f19b22c"},"schema_version":"1.0","source":{"id":"1112.1715","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1715","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1715v2","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1715","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"5XVOEMH2V32X","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5XVOEMH2V32XW2MB","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5XVOEMH2","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:30d1dea381a7fc44fe5890ec020a56555253d966525240ce46bea7a50a61a327","target":"graph","created_at":"2026-05-18T03:48:35Z","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 lossless prefix codes optimized with respect to a pay-off criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are based on a new coding algorithm which transforms the initial source probability vector into a new probability vector according to a merging rule. The coding algorithm is equivalent to a partition of the source alphabet into disjoint sets on which a new transformed probability vector is defined as a function of the initial source probability vector and a scalar parameter. The p","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-12-07T22:08:01Z","title":"Optimal Merging Algorithms for Lossless Codes with Generalized Criteria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1715","kind":"arxiv","version":2},"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:6250de8e4d41c77e1902cf7e757f454a36f964e8945b2cebc2dd100567e54786","target":"record","created_at":"2026-05-18T03:48:35Z","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":"d8176534bf40b70e69fd29a57e3e71b49a004d9070dc388c189a83887dcf96d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T22:08:01Z","title_canon_sha256":"139ef5ccb6eab675278bc964ed7cc12d8890711cbcbaf1774221fe219f19b22c"},"schema_version":"1.0","source":{"id":"1112.1715","kind":"arxiv","version":2}},"canonical_sha256":"edeae230faaef57b69815cd5367e9975cea2a18cd9802b5aa52127b2f7e6471e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edeae230faaef57b69815cd5367e9975cea2a18cd9802b5aa52127b2f7e6471e","first_computed_at":"2026-05-18T03:48:35.813663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:35.813663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ndUAWkCWCFMNknqcoqNa5UaVIoeTimkkDAhruUDekF4teDQ6N1lWmhkAK7XG1iU1nX3DDFph/H21DlYdO6MgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:35.814114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1715","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6250de8e4d41c77e1902cf7e757f454a36f964e8945b2cebc2dd100567e54786","sha256:30d1dea381a7fc44fe5890ec020a56555253d966525240ce46bea7a50a61a327"],"state_sha256":"ecbcaca7af2fe6345740faa5ec0afab0dc06eaa96ec35d127feebb4636238c4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3Tzee6+dB5ysOc/tqWCZDv/waL2s5fjEa/pkiDenSqYhk+0L/aXzOlLHtYDk9KKoZMk5N49y6n+sTlNvp8vCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:18:38.785666Z","bundle_sha256":"d559a879b5cfb951373557e8d1dc7a44ce6b05587d2c0e7ec7bec6f29060220f"}}