{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4JOLXNPGIIDL4MRCPFGEUVSC7T","short_pith_number":"pith:4JOLXNPG","canonical_record":{"source":{"id":"1202.0136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T10:19:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0859071d9fd1d290094978b2208fb7825aad4e2bc526294c38bf523790c1d92d","abstract_canon_sha256":"73118b907e475f53986eb80d7c8bbf3215922f057e624817ecd52ecf9c9fb84e"},"schema_version":"1.0"},"canonical_sha256":"e25cbbb5e64206be3222794c4a5642fcdc8bd34b914561d83e7335de12eebecb","source":{"kind":"arxiv","id":"1202.0136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0136","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0136v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0136","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"4JOLXNPGIIDL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JOLXNPGIIDL4MRC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JOLXNPG","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4JOLXNPGIIDL4MRCPFGEUVSC7T","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T10:19:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0859071d9fd1d290094978b2208fb7825aad4e2bc526294c38bf523790c1d92d","abstract_canon_sha256":"73118b907e475f53986eb80d7c8bbf3215922f057e624817ecd52ecf9c9fb84e"},"schema_version":"1.0"},"canonical_sha256":"e25cbbb5e64206be3222794c4a5642fcdc8bd34b914561d83e7335de12eebecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.668380Z","signature_b64":"o3t0/MjQtMoGyb+7iOVgbNXqoQ5ajzwRj2ByNm6XE8AjNf5Madft4f7j2pglotrm0NL2U66j0nlRV87AEG9ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25cbbb5e64206be3222794c4a5642fcdc8bd34b914561d83e7335de12eebecb","last_reissued_at":"2026-05-18T03:35:38.667591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.667591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0136","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:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYqfy3l8MdFATgQ02Z7VAVheF9cQV4PFVydlM3Vs3MYuWHtMzOHzCwhsTdahqX3A3U3/SQcONIPXFlQsOok8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:03.390590Z"},"content_sha256":"f660a2c9c0256cab1d1c7ced32c45431cd3c4daef070d350f44748b5aa922b8d","schema_version":"1.0","event_id":"sha256:f660a2c9c0256cab1d1c7ced32c45431cd3c4daef070d350f44748b5aa922b8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4JOLXNPGIIDL4MRCPFGEUVSC7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Length Lossless Coding for Variational Distance Class: An Optimal Merging Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Sergey Loyka, Themistoklis Charalambous","submitted_at":"2012-02-01T10:19:36Z","abstract_excerpt":"In this paper we consider lossless source coding for a class of sources specified by the total variational distance ball centred at a fixed nominal probability distribution. The objective is to find a minimax average length source code, where the minimizers are the codeword lengths -- real numbers for arithmetic or Shannon codes -- while the maximizers are the source distributions from the total variational distance ball. Firstly, we examine the maximization of the average codeword length by converting it into an equivalent optimization problem, and we give the optimal codeword lenghts via a w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0136","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:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIi7F4UkU/j/U9ayBMjRfKss3t/jX2ozyfaBRE/bWco03xcYvzqNnP0qzQCyW+Ijm1hAV8/xT5l9Cto1/b8NCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:03.390947Z"},"content_sha256":"9e918d89cfebfbcb6321b0cb8e222681f4a9565cbe3e569d72f21456c9f7e50c","schema_version":"1.0","event_id":"sha256:9e918d89cfebfbcb6321b0cb8e222681f4a9565cbe3e569d72f21456c9f7e50c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/bundle.json","state_url":"https://pith.science/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/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-04T06:08:03Z","links":{"resolver":"https://pith.science/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T","bundle":"https://pith.science/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/bundle.json","state":"https://pith.science/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JOLXNPGIIDL4MRCPFGEUVSC7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4JOLXNPGIIDL4MRCPFGEUVSC7T","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":"73118b907e475f53986eb80d7c8bbf3215922f057e624817ecd52ecf9c9fb84e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T10:19:36Z","title_canon_sha256":"0859071d9fd1d290094978b2208fb7825aad4e2bc526294c38bf523790c1d92d"},"schema_version":"1.0","source":{"id":"1202.0136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0136","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0136v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0136","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"4JOLXNPGIIDL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JOLXNPGIIDL4MRC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JOLXNPG","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:9e918d89cfebfbcb6321b0cb8e222681f4a9565cbe3e569d72f21456c9f7e50c","target":"graph","created_at":"2026-05-18T03:35:38Z","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":"In this paper we consider lossless source coding for a class of sources specified by the total variational distance ball centred at a fixed nominal probability distribution. The objective is to find a minimax average length source code, where the minimizers are the codeword lengths -- real numbers for arithmetic or Shannon codes -- while the maximizers are the source distributions from the total variational distance ball. Firstly, we examine the maximization of the average codeword length by converting it into an equivalent optimization problem, and we give the optimal codeword lenghts via a w","authors_text":"Charalambos D. Charalambous, Sergey Loyka, Themistoklis Charalambous","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T10:19:36Z","title":"Variable Length Lossless Coding for Variational Distance Class: An Optimal Merging Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0136","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:f660a2c9c0256cab1d1c7ced32c45431cd3c4daef070d350f44748b5aa922b8d","target":"record","created_at":"2026-05-18T03:35:38Z","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":"73118b907e475f53986eb80d7c8bbf3215922f057e624817ecd52ecf9c9fb84e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T10:19:36Z","title_canon_sha256":"0859071d9fd1d290094978b2208fb7825aad4e2bc526294c38bf523790c1d92d"},"schema_version":"1.0","source":{"id":"1202.0136","kind":"arxiv","version":2}},"canonical_sha256":"e25cbbb5e64206be3222794c4a5642fcdc8bd34b914561d83e7335de12eebecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25cbbb5e64206be3222794c4a5642fcdc8bd34b914561d83e7335de12eebecb","first_computed_at":"2026-05-18T03:35:38.667591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.667591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o3t0/MjQtMoGyb+7iOVgbNXqoQ5ajzwRj2ByNm6XE8AjNf5Madft4f7j2pglotrm0NL2U66j0nlRV87AEG9ZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.668380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f660a2c9c0256cab1d1c7ced32c45431cd3c4daef070d350f44748b5aa922b8d","sha256:9e918d89cfebfbcb6321b0cb8e222681f4a9565cbe3e569d72f21456c9f7e50c"],"state_sha256":"710c58c8aba94ec8e4b5b8476c52a22c13afdc4dbb65a8f888c88949985c3497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aAYGrTTVP0CHI+CmiVB7BBgAFB8IxUHyHCkQ/jMRAA8TTWIKbzSbOCb8O4F5z4Y2wCjArCZHU1BDNllOgCQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:08:03.393498Z","bundle_sha256":"b77f99de4e6f622933c32a9b968d36a67de7871053a9f335d8e8741f507d3305"}}