{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MOCPKREW7ZL5K5NTQAN7QGES22","short_pith_number":"pith:MOCPKREW","canonical_record":{"source":{"id":"2106.06438","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-11T14:49:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f32e327ee0b437255a97edf18e55bc394b34a469c4f628205797ddb042e2a122","abstract_canon_sha256":"69f4fa0e31f9cf5b65a73a2d3a8beff70a248f539d1377193bb8fc7284c006c9"},"schema_version":"1.0"},"canonical_sha256":"6384f54496fe57d575b3801bf81892d6ac68b4e63a10a54a4888159c57cc9484","source":{"kind":"arxiv","id":"2106.06438","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06438","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06438v4","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06438","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_12","alias_value":"MOCPKREW7ZL5","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_16","alias_value":"MOCPKREW7ZL5K5NT","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_8","alias_value":"MOCPKREW","created_at":"2026-07-05T04:37:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MOCPKREW7ZL5K5NTQAN7QGES22","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06438","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-11T14:49:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f32e327ee0b437255a97edf18e55bc394b34a469c4f628205797ddb042e2a122","abstract_canon_sha256":"69f4fa0e31f9cf5b65a73a2d3a8beff70a248f539d1377193bb8fc7284c006c9"},"schema_version":"1.0"},"canonical_sha256":"6384f54496fe57d575b3801bf81892d6ac68b4e63a10a54a4888159c57cc9484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:01.919617Z","signature_b64":"mT2UEmz/oX0uddOnbKG0t6cYIcBSD+A7xGxayCTeG2rvvh7z4ZGvpex5u0LzxF1W7D8IiFRYEDkonD1yaD0hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6384f54496fe57d575b3801bf81892d6ac68b4e63a10a54a4888159c57cc9484","last_reissued_at":"2026-07-05T04:37:01.919188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:01.919188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06438","source_version":4,"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-07-05T04:37:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQe1Rexu5B3JCjV1ObPg1ZH/K8RCuQPhB6SdeutoR1tELxRAfSoof+mlp200J95Q4fNdVeAFGUg/7e/dHIo8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T04:22:02.782035Z"},"content_sha256":"6a0ed20ccf41400868022469e84abf582d582f1c2ab064cac99e852783e23a16","schema_version":"1.0","event_id":"sha256:6a0ed20ccf41400868022469e84abf582d582f1c2ab064cac99e852783e23a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MOCPKREW7ZL5K5NTQAN7QGES22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encoding of probability distributions for Asymmetric Numeral Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jarek Duda","submitted_at":"2021-06-11T14:49:54Z","abstract_excerpt":"Many data compressors regularly encode probability distributions for entropy coding - requiring minimal description length type of optimizations. Canonical prefix/Huffman coding usually just writes lengths of bit sequences, this way approximating probabilities with powers-of-2. Operating on more accurate probabilities usually allows for better compression ratios, and is possible e.g. using arithmetic coding and Asymmetric Numeral Systems family. Especially the multiplication-free tabled variant of the latter (tANS) builds automaton often replacing Huffman coding due to better compression at si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06438","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06438/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:37:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OImf/m7OaRPyfXAZIMsJHI+3wh5BKp7VRFDfUC2sliFU2JoIvDNJciQzuRGPcxKJI4Wnz55bUPNi+V26V6qUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T04:22:02.782548Z"},"content_sha256":"b5446fc45f1f11fbe3195fd927a04d022c632423ff51961db69d8a22057bedb5","schema_version":"1.0","event_id":"sha256:b5446fc45f1f11fbe3195fd927a04d022c632423ff51961db69d8a22057bedb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOCPKREW7ZL5K5NTQAN7QGES22/bundle.json","state_url":"https://pith.science/pith/MOCPKREW7ZL5K5NTQAN7QGES22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOCPKREW7ZL5K5NTQAN7QGES22/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-08-24T04:22:02Z","links":{"resolver":"https://pith.science/pith/MOCPKREW7ZL5K5NTQAN7QGES22","bundle":"https://pith.science/pith/MOCPKREW7ZL5K5NTQAN7QGES22/bundle.json","state":"https://pith.science/pith/MOCPKREW7ZL5K5NTQAN7QGES22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOCPKREW7ZL5K5NTQAN7QGES22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MOCPKREW7ZL5K5NTQAN7QGES22","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":"69f4fa0e31f9cf5b65a73a2d3a8beff70a248f539d1377193bb8fc7284c006c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-11T14:49:54Z","title_canon_sha256":"f32e327ee0b437255a97edf18e55bc394b34a469c4f628205797ddb042e2a122"},"schema_version":"1.0","source":{"id":"2106.06438","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06438","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06438v4","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06438","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_12","alias_value":"MOCPKREW7ZL5","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_16","alias_value":"MOCPKREW7ZL5K5NT","created_at":"2026-07-05T04:37:01Z"},{"alias_kind":"pith_short_8","alias_value":"MOCPKREW","created_at":"2026-07-05T04:37:01Z"}],"graph_snapshots":[{"event_id":"sha256:b5446fc45f1f11fbe3195fd927a04d022c632423ff51961db69d8a22057bedb5","target":"graph","created_at":"2026-07-05T04:37:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.06438/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many data compressors regularly encode probability distributions for entropy coding - requiring minimal description length type of optimizations. Canonical prefix/Huffman coding usually just writes lengths of bit sequences, this way approximating probabilities with powers-of-2. Operating on more accurate probabilities usually allows for better compression ratios, and is possible e.g. using arithmetic coding and Asymmetric Numeral Systems family. Especially the multiplication-free tabled variant of the latter (tANS) builds automaton often replacing Huffman coding due to better compression at si","authors_text":"Jarek Duda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-11T14:49:54Z","title":"Encoding of probability distributions for Asymmetric Numeral Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06438","kind":"arxiv","version":4},"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:6a0ed20ccf41400868022469e84abf582d582f1c2ab064cac99e852783e23a16","target":"record","created_at":"2026-07-05T04:37:01Z","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":"69f4fa0e31f9cf5b65a73a2d3a8beff70a248f539d1377193bb8fc7284c006c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-11T14:49:54Z","title_canon_sha256":"f32e327ee0b437255a97edf18e55bc394b34a469c4f628205797ddb042e2a122"},"schema_version":"1.0","source":{"id":"2106.06438","kind":"arxiv","version":4}},"canonical_sha256":"6384f54496fe57d575b3801bf81892d6ac68b4e63a10a54a4888159c57cc9484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6384f54496fe57d575b3801bf81892d6ac68b4e63a10a54a4888159c57cc9484","first_computed_at":"2026-07-05T04:37:01.919188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:37:01.919188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mT2UEmz/oX0uddOnbKG0t6cYIcBSD+A7xGxayCTeG2rvvh7z4ZGvpex5u0LzxF1W7D8IiFRYEDkonD1yaD0hCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:37:01.919617Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06438","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0ed20ccf41400868022469e84abf582d582f1c2ab064cac99e852783e23a16","sha256:b5446fc45f1f11fbe3195fd927a04d022c632423ff51961db69d8a22057bedb5"],"state_sha256":"f9f6af4eb6e53594ebc2a5703da8fdc9215f61e67166f75003be336fde14d906"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+ox2RAbN9K4yrwxZgB2FjPNRms8jSm7QY4gxefOOn1+3xUSdTfG9YEz3DloEaadZlh0BlA0DutTEeZsRXwPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T04:22:02.788775Z","bundle_sha256":"bdd1b66694dbf4ae9644914eaad77e3d7979029482318d342a8512d187adc4f1"}}