{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B7X6K3O4LZN2ULKJEAE6H7LRF6","short_pith_number":"pith:B7X6K3O4","canonical_record":{"source":{"id":"1608.08367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-30T08:46:56Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"104356a3fb78024a0095cf0b890ae1ea2291aec550ea1f853f9c9afa02de8fe5","abstract_canon_sha256":"228f9d62383832700a8d1f039acbb07e21f8c80b750b167e1a3554b3ef2446d5"},"schema_version":"1.0"},"canonical_sha256":"0fefe56ddc5e5baa2d492009e3fd712f88707b8a0d148147f3d0a0d51e7ae8b4","source":{"kind":"arxiv","id":"1608.08367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08367","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08367v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08367","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"B7X6K3O4LZN2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7X6K3O4LZN2ULKJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7X6K3O4","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B7X6K3O4LZN2ULKJEAE6H7LRF6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-30T08:46:56Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"104356a3fb78024a0095cf0b890ae1ea2291aec550ea1f853f9c9afa02de8fe5","abstract_canon_sha256":"228f9d62383832700a8d1f039acbb07e21f8c80b750b167e1a3554b3ef2446d5"},"schema_version":"1.0"},"canonical_sha256":"0fefe56ddc5e5baa2d492009e3fd712f88707b8a0d148147f3d0a0d51e7ae8b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:28.298187Z","signature_b64":"JmUP57tll6a3piO8WhHWU/eO85XJHGUE8oKQHv5DwsS7KJJHQ3TEUD+eyEI45iDbjIgcSbteST8qDRHYuWMOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fefe56ddc5e5baa2d492009e3fd712f88707b8a0d148147f3d0a0d51e7ae8b4","last_reissued_at":"2026-05-18T01:06:28.297607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:28.297607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08367","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-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRUuMZBQlH+FKWlQWnRs1/RbnOsEiPE8gnLBHMmPKNQ82xE3jDzER9v9gkHCBdpMwND5+NO6M6g7+lR0/dP5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:30:39.398280Z"},"content_sha256":"1f1310da2b3d6fdff3af54f87b072a3dd49c0693f770835387fe123073177edc","schema_version":"1.0","event_id":"sha256:1f1310da2b3d6fdff3af54f87b072a3dd49c0693f770835387fe123073177edc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B7X6K3O4LZN2ULKJEAE6H7LRF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anna Ben-Hamou, Elisabeth Gassiat, Stephane Boucheron","submitted_at":"2016-08-30T08:46:56Z","abstract_excerpt":"Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a single code which is asymptotically minimax over each class in the collection? In particular, adaptive coding makes sense when there is no universal code on the union of classes in the collection. In this paper, we deal with classes of sources over an infinite alphabet, that are characterized by a dominating envelope. We provide asymptotic equivalents for the redundancy of envelope classes enjoying a regular variation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08367","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-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFKJJ36RC9PjKGw+IxAxtx61OSGfUNWpUqWuQ5sJf/O3nmbIDm76YALAmZRCQ+oUFhH6Hsl7sGHLdiYFWb0JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:30:39.398979Z"},"content_sha256":"216bc71c1f7a6b167c1d212d8638bbe16bd1fba951158a1433e90c0df35cc4f0","schema_version":"1.0","event_id":"sha256:216bc71c1f7a6b167c1d212d8638bbe16bd1fba951158a1433e90c0df35cc4f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/bundle.json","state_url":"https://pith.science/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/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-11T21:30:39Z","links":{"resolver":"https://pith.science/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6","bundle":"https://pith.science/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/bundle.json","state":"https://pith.science/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7X6K3O4LZN2ULKJEAE6H7LRF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B7X6K3O4LZN2ULKJEAE6H7LRF6","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":"228f9d62383832700a8d1f039acbb07e21f8c80b750b167e1a3554b3ef2446d5","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-30T08:46:56Z","title_canon_sha256":"104356a3fb78024a0095cf0b890ae1ea2291aec550ea1f853f9c9afa02de8fe5"},"schema_version":"1.0","source":{"id":"1608.08367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08367","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08367v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08367","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"B7X6K3O4LZN2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7X6K3O4LZN2ULKJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7X6K3O4","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:216bc71c1f7a6b167c1d212d8638bbe16bd1fba951158a1433e90c0df35cc4f0","target":"graph","created_at":"2026-05-18T01:06:28Z","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":"Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a single code which is asymptotically minimax over each class in the collection? In particular, adaptive coding makes sense when there is no universal code on the union of classes in the collection. In this paper, we deal with classes of sources over an infinite alphabet, that are characterized by a dominating envelope. We provide asymptotic equivalents for the redundancy of envelope classes enjoying a regular variation ","authors_text":"Anna Ben-Hamou, Elisabeth Gassiat, Stephane Boucheron","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-30T08:46:56Z","title":"Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08367","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:1f1310da2b3d6fdff3af54f87b072a3dd49c0693f770835387fe123073177edc","target":"record","created_at":"2026-05-18T01:06:28Z","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":"228f9d62383832700a8d1f039acbb07e21f8c80b750b167e1a3554b3ef2446d5","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-30T08:46:56Z","title_canon_sha256":"104356a3fb78024a0095cf0b890ae1ea2291aec550ea1f853f9c9afa02de8fe5"},"schema_version":"1.0","source":{"id":"1608.08367","kind":"arxiv","version":2}},"canonical_sha256":"0fefe56ddc5e5baa2d492009e3fd712f88707b8a0d148147f3d0a0d51e7ae8b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fefe56ddc5e5baa2d492009e3fd712f88707b8a0d148147f3d0a0d51e7ae8b4","first_computed_at":"2026-05-18T01:06:28.297607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:28.297607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JmUP57tll6a3piO8WhHWU/eO85XJHGUE8oKQHv5DwsS7KJJHQ3TEUD+eyEI45iDbjIgcSbteST8qDRHYuWMOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:28.298187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f1310da2b3d6fdff3af54f87b072a3dd49c0693f770835387fe123073177edc","sha256:216bc71c1f7a6b167c1d212d8638bbe16bd1fba951158a1433e90c0df35cc4f0"],"state_sha256":"abf72b27894e644d492b49be325a2ee6dca3d2389c37fefa148d7401151816c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evyGjrSu9vjCZHP9GdSGDzRCS8XejRjq0FttiGOGyLK+yjTa3wX59vweJ+44dxPpFGGgpDM81TkwNHvJM0jxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:30:39.402206Z","bundle_sha256":"9516e18e730a73af023c605c36b7964a972525f53db86f1b79f9baac656bc214"}}