{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AGTTSW2VS7TXGEWYS2GCBV7Q6B","short_pith_number":"pith:AGTTSW2V","canonical_record":{"source":{"id":"1901.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-15T14:45:47Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"title_canon_sha256":"e182cd291faf20f4b788e4e3d96153b248892b7383065e0fdccaaa20feffc67b","abstract_canon_sha256":"de100ade3674a45da79d3d65e24ea906e2b172347e5669d8a1b7c1d8e7259ef2"},"schema_version":"1.0"},"canonical_sha256":"01a7395b5597e77312d8968c20d7f0f0436a91b17ce31da26d0e350c3612c1bb","source":{"kind":"arxiv","id":"1901.04866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04866","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04866v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04866","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"AGTTSW2VS7TX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGTTSW2VS7TXGEWY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGTTSW2V","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AGTTSW2VS7TXGEWYS2GCBV7Q6B","target":"record","payload":{"canonical_record":{"source":{"id":"1901.04866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-15T14:45:47Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"title_canon_sha256":"e182cd291faf20f4b788e4e3d96153b248892b7383065e0fdccaaa20feffc67b","abstract_canon_sha256":"de100ade3674a45da79d3d65e24ea906e2b172347e5669d8a1b7c1d8e7259ef2"},"schema_version":"1.0"},"canonical_sha256":"01a7395b5597e77312d8968c20d7f0f0436a91b17ce31da26d0e350c3612c1bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.480736Z","signature_b64":"J9XxpqaB32s0d4GqTBo6WUI69Y4JNWlzjsDm4b/QQm138OAjK9H7ziubvXMzC6kM+WqCuYsXH7zs2wAY9eUxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a7395b5597e77312d8968c20d7f0f0436a91b17ce31da26d0e350c3612c1bb","last_reissued_at":"2026-05-17T23:56:21.480051Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.480051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.04866","source_version":1,"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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4RXz2O9vcsqNkHrAIY+9gwOGq/Kp2KVGT2bneQfSDx8CD47gGuVEZVycz5UbMY9HRK+Wwo1PwAUzZ5aS5XpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:00:50.992279Z"},"content_sha256":"ab468e5f692ed97dede4c1788d562597d99e9f108c42715d2ac35796711a5c81","schema_version":"1.0","event_id":"sha256:ab468e5f692ed97dede4c1788d562597d99e9f108c42715d2ac35796711a5c81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AGTTSW2VS7TXGEWYS2GCBV7Q6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Lossless Compression with Latent Variables using Bits Back Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Barber, James Townsend, Tom Bird","submitted_at":"2019-01-15T14:45:47Z","abstract_excerpt":"Deep latent variable models have seen recent success in many data domains. Lossless compression is an application of these models which, despite having the potential to be highly useful, has yet to be implemented in a practical manner. We present `Bits Back with ANS' (BB-ANS), a scheme to perform lossless compression with latent variable models at a near optimal rate. We demonstrate this scheme by using it to compress the MNIST dataset with a variational auto-encoder model (VAE), achieving compression rates superior to standard methods with only a simple VAE. Given that the scheme is highly am"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04866","kind":"arxiv","version":1},"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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmLmIS05uh6ot6fvbyeZ+4Xgf/Y+oJ+/Qp2GAJlnfNTNHavkdBFqWBXET+4OL5p4X627JGQDBbG3GdSL8dgiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:00:50.992649Z"},"content_sha256":"0f63ef0131c0741664c4ead1dcda90b57c6cecc067a1a750a8e0a20c8e998441","schema_version":"1.0","event_id":"sha256:0f63ef0131c0741664c4ead1dcda90b57c6cecc067a1a750a8e0a20c8e998441"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/bundle.json","state_url":"https://pith.science/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/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-05-21T15:00:50Z","links":{"resolver":"https://pith.science/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B","bundle":"https://pith.science/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/bundle.json","state":"https://pith.science/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGTTSW2VS7TXGEWYS2GCBV7Q6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AGTTSW2VS7TXGEWYS2GCBV7Q6B","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":"de100ade3674a45da79d3d65e24ea906e2b172347e5669d8a1b7c1d8e7259ef2","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-15T14:45:47Z","title_canon_sha256":"e182cd291faf20f4b788e4e3d96153b248892b7383065e0fdccaaa20feffc67b"},"schema_version":"1.0","source":{"id":"1901.04866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04866","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04866v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04866","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"AGTTSW2VS7TX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGTTSW2VS7TXGEWY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGTTSW2V","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0f63ef0131c0741664c4ead1dcda90b57c6cecc067a1a750a8e0a20c8e998441","target":"graph","created_at":"2026-05-17T23:56:21Z","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":"Deep latent variable models have seen recent success in many data domains. Lossless compression is an application of these models which, despite having the potential to be highly useful, has yet to be implemented in a practical manner. We present `Bits Back with ANS' (BB-ANS), a scheme to perform lossless compression with latent variable models at a near optimal rate. We demonstrate this scheme by using it to compress the MNIST dataset with a variational auto-encoder model (VAE), achieving compression rates superior to standard methods with only a simple VAE. Given that the scheme is highly am","authors_text":"David Barber, James Townsend, Tom Bird","cross_cats":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-15T14:45:47Z","title":"Practical Lossless Compression with Latent Variables using Bits Back Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04866","kind":"arxiv","version":1},"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:ab468e5f692ed97dede4c1788d562597d99e9f108c42715d2ac35796711a5c81","target":"record","created_at":"2026-05-17T23:56:21Z","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":"de100ade3674a45da79d3d65e24ea906e2b172347e5669d8a1b7c1d8e7259ef2","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-15T14:45:47Z","title_canon_sha256":"e182cd291faf20f4b788e4e3d96153b248892b7383065e0fdccaaa20feffc67b"},"schema_version":"1.0","source":{"id":"1901.04866","kind":"arxiv","version":1}},"canonical_sha256":"01a7395b5597e77312d8968c20d7f0f0436a91b17ce31da26d0e350c3612c1bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01a7395b5597e77312d8968c20d7f0f0436a91b17ce31da26d0e350c3612c1bb","first_computed_at":"2026-05-17T23:56:21.480051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:21.480051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J9XxpqaB32s0d4GqTBo6WUI69Y4JNWlzjsDm4b/QQm138OAjK9H7ziubvXMzC6kM+WqCuYsXH7zs2wAY9eUxDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:21.480736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab468e5f692ed97dede4c1788d562597d99e9f108c42715d2ac35796711a5c81","sha256:0f63ef0131c0741664c4ead1dcda90b57c6cecc067a1a750a8e0a20c8e998441"],"state_sha256":"9a840fe4c41d4555c952f35b83f05ec617e9e5f4fc7fb0586f6c61877e2dcb55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFvv9lxmT89TPmFz9yuY7gtpRolSAkVaIlZLX4HWW9Z689Q9boNdPiYVjHkBIY+CMatpT+vWmhRHijHYsZRXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:00:50.994660Z","bundle_sha256":"cca370916218fde6ee00ff80e41c656b2b87d0614f9c2b013d6279a93d03b78d"}}