{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LGU7I57FAOZ53TSDNDERBA5RZH","short_pith_number":"pith:LGU7I57F","canonical_record":{"source":{"id":"2201.01741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-05T18:04:42Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"daae1a6ef0a61c948d55e5fa7e5487fd455b73dbbc6dd71132513c5fe8a8fb97","abstract_canon_sha256":"e0724c65aa7cacf72f0a531851e790d1e298f4e05691fa116247b68df8ad429c"},"schema_version":"1.0"},"canonical_sha256":"59a9f477e503b3ddce4368c91083b1c9fa75dc65d00e26509bd1a1c4b67e3eed","source":{"kind":"arxiv","id":"2201.01741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.01741","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"2201.01741v2","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.01741","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"LGU7I57FAOZ5","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_16","alias_value":"LGU7I57FAOZ53TSD","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_8","alias_value":"LGU7I57F","created_at":"2026-07-05T03:47:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LGU7I57FAOZ53TSDNDERBA5RZH","target":"record","payload":{"canonical_record":{"source":{"id":"2201.01741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-05T18:04:42Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"daae1a6ef0a61c948d55e5fa7e5487fd455b73dbbc6dd71132513c5fe8a8fb97","abstract_canon_sha256":"e0724c65aa7cacf72f0a531851e790d1e298f4e05691fa116247b68df8ad429c"},"schema_version":"1.0"},"canonical_sha256":"59a9f477e503b3ddce4368c91083b1c9fa75dc65d00e26509bd1a1c4b67e3eed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:03.841710Z","signature_b64":"5AJ/pWQjF9RvuRIGeoqg2miG2mH28riZgqPTU1qjHUAufCy/2M/n5NvKa7AqH8x4j6qiNTi60dZOPULM7qSrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a9f477e503b3ddce4368c91083b1c9fa75dc65d00e26509bd1a1c4b67e3eed","last_reissued_at":"2026-07-05T03:47:03.841252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:03.841252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.01741","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-07-05T03:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSF3WYHt83GSkU0j70qtA+eRgwkt+sulbORS/bg6tXNLoMcVfc+NXpZWv/kNJEDOHxhS2i7izr77s43bRRpKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:51:33.142085Z"},"content_sha256":"a3d96e180217d0d7ea570bc3b78bfac129e97a3fae37b103389feda592745147","schema_version":"1.0","event_id":"sha256:a3d96e180217d0d7ea570bc3b78bfac129e97a3fae37b103389feda592745147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LGU7I57FAOZ53TSDNDERBA5RZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding Entropy Coding With Asymmetric Numeral Systems (ANS): a Statistician's Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Robert Bamler","submitted_at":"2022-01-05T18:04:42Z","abstract_excerpt":"Entropy coding is the backbone data compression. Novel machine-learning based compression methods often use a new entropy coder called Asymmetric Numeral Systems (ANS) [Duda et al., 2015], which provides very close to optimal bitrates and simplifies [Townsend et al., 2019] advanced compression techniques such as bits-back coding. However, researchers with a background in machine learning often struggle to understand how ANS works, which prevents them from exploiting its full versatility. This paper is meant as an educational resource to make ANS more approachable by presenting it from a new pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.01741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.01741/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-05T03:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NC2TrHfiLEi9N5XvFPpmwVHphmKi6QIHGR4MnnUYGdpQhqF/4D0cJXe9CRfOSQHKi1exBoeB7tUPsOz99nEJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:51:33.142580Z"},"content_sha256":"cd0285642c3f6fdb2e546fee520701d7623b27d66ba7986655b07256367d7d0b","schema_version":"1.0","event_id":"sha256:cd0285642c3f6fdb2e546fee520701d7623b27d66ba7986655b07256367d7d0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGU7I57FAOZ53TSDNDERBA5RZH/bundle.json","state_url":"https://pith.science/pith/LGU7I57FAOZ53TSDNDERBA5RZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGU7I57FAOZ53TSDNDERBA5RZH/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-08T11:51:33Z","links":{"resolver":"https://pith.science/pith/LGU7I57FAOZ53TSDNDERBA5RZH","bundle":"https://pith.science/pith/LGU7I57FAOZ53TSDNDERBA5RZH/bundle.json","state":"https://pith.science/pith/LGU7I57FAOZ53TSDNDERBA5RZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGU7I57FAOZ53TSDNDERBA5RZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LGU7I57FAOZ53TSDNDERBA5RZH","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":"e0724c65aa7cacf72f0a531851e790d1e298f4e05691fa116247b68df8ad429c","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-05T18:04:42Z","title_canon_sha256":"daae1a6ef0a61c948d55e5fa7e5487fd455b73dbbc6dd71132513c5fe8a8fb97"},"schema_version":"1.0","source":{"id":"2201.01741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.01741","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"2201.01741v2","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.01741","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"LGU7I57FAOZ5","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_16","alias_value":"LGU7I57FAOZ53TSD","created_at":"2026-07-05T03:47:03Z"},{"alias_kind":"pith_short_8","alias_value":"LGU7I57F","created_at":"2026-07-05T03:47:03Z"}],"graph_snapshots":[{"event_id":"sha256:cd0285642c3f6fdb2e546fee520701d7623b27d66ba7986655b07256367d7d0b","target":"graph","created_at":"2026-07-05T03:47:03Z","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/2201.01741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Entropy coding is the backbone data compression. Novel machine-learning based compression methods often use a new entropy coder called Asymmetric Numeral Systems (ANS) [Duda et al., 2015], which provides very close to optimal bitrates and simplifies [Townsend et al., 2019] advanced compression techniques such as bits-back coding. However, researchers with a background in machine learning often struggle to understand how ANS works, which prevents them from exploiting its full versatility. This paper is meant as an educational resource to make ANS more approachable by presenting it from a new pe","authors_text":"Robert Bamler","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-05T18:04:42Z","title":"Understanding Entropy Coding With Asymmetric Numeral Systems (ANS): a Statistician's Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.01741","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:a3d96e180217d0d7ea570bc3b78bfac129e97a3fae37b103389feda592745147","target":"record","created_at":"2026-07-05T03:47:03Z","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":"e0724c65aa7cacf72f0a531851e790d1e298f4e05691fa116247b68df8ad429c","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-05T18:04:42Z","title_canon_sha256":"daae1a6ef0a61c948d55e5fa7e5487fd455b73dbbc6dd71132513c5fe8a8fb97"},"schema_version":"1.0","source":{"id":"2201.01741","kind":"arxiv","version":2}},"canonical_sha256":"59a9f477e503b3ddce4368c91083b1c9fa75dc65d00e26509bd1a1c4b67e3eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59a9f477e503b3ddce4368c91083b1c9fa75dc65d00e26509bd1a1c4b67e3eed","first_computed_at":"2026-07-05T03:47:03.841252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:47:03.841252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5AJ/pWQjF9RvuRIGeoqg2miG2mH28riZgqPTU1qjHUAufCy/2M/n5NvKa7AqH8x4j6qiNTi60dZOPULM7qSrBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:47:03.841710Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.01741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d96e180217d0d7ea570bc3b78bfac129e97a3fae37b103389feda592745147","sha256:cd0285642c3f6fdb2e546fee520701d7623b27d66ba7986655b07256367d7d0b"],"state_sha256":"07f2b2d06dde56f8428ddaba3b301e07ff26a7d894853c35f09f6b38778ec024"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eBk7GFp93j7G4bEO7yiQYCW45e1abEseQwEOSziINeuJUHVv76i2ehPlxzyrGqdzr77ttKItOBPhGNwuI7HBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:51:33.147048Z","bundle_sha256":"763d7c47da147c511f012e0bdb389258fc977af6e96f0d695d84a02579bb5e96"}}