{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JDCBK4MW5I3ZGFYY7CXZDBJ6JW","short_pith_number":"pith:JDCBK4MW","schema_version":"1.0","canonical_sha256":"48c4157196ea37931718f8af91853e4d9affa5a74b261353316c1cc2eeca0ac6","source":{"kind":"arxiv","id":"1905.06845","version":4},"attestation_state":"computed","paper":{"title":"Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variables","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":"Friso H. Kingma, Jonathan Ho, Pieter Abbeel","submitted_at":"2019-05-16T15:32:35Z","abstract_excerpt":"The bits-back argument suggests that latent variable models can be turned into lossless compression schemes. Translating the bits-back argument into efficient and practical lossless compression schemes for general latent variable models, however, is still an open problem. Bits-Back with Asymmetric Numeral Systems (BB-ANS), recently proposed by Townsend et al. (2019), makes bits-back coding practically feasible for latent variable models with one latent layer, but it is inefficient for hierarchical latent variable models. In this paper we propose Bit-Swap, a new compression scheme that generali"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.06845","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T15:32:35Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.CO","stat.ML"],"title_canon_sha256":"43ce2175569c1b8390fae5768f804ffda2dfd87f7e5fbc635b313cc085c8d6cf","abstract_canon_sha256":"a053caffdff2f8d6511b43d897fa7c16539052c954dfc8b0c7e529ef628f41f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:15.417883Z","signature_b64":"AudwLzaLcRaCj0l5c8rgd51RYeUtKafPX0qeEH7MKN5JX5ZVvgdloG9ImFLjUXY2oZ9hH0k//OCj2BYBk68zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c4157196ea37931718f8af91853e4d9affa5a74b261353316c1cc2eeca0ac6","last_reissued_at":"2026-07-05T00:09:15.417438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:15.417438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variables","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":"Friso H. Kingma, Jonathan Ho, Pieter Abbeel","submitted_at":"2019-05-16T15:32:35Z","abstract_excerpt":"The bits-back argument suggests that latent variable models can be turned into lossless compression schemes. Translating the bits-back argument into efficient and practical lossless compression schemes for general latent variable models, however, is still an open problem. Bits-Back with Asymmetric Numeral Systems (BB-ANS), recently proposed by Townsend et al. (2019), makes bits-back coding practically feasible for latent variable models with one latent layer, but it is inefficient for hierarchical latent variable models. In this paper we propose Bit-Swap, a new compression scheme that generali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06845","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/1905.06845/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.06845","created_at":"2026-07-05T00:09:15.417508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06845v4","created_at":"2026-07-05T00:09:15.417508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06845","created_at":"2026-07-05T00:09:15.417508+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDCBK4MW5I3Z","created_at":"2026-07-05T00:09:15.417508+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDCBK4MW5I3ZGFYY","created_at":"2026-07-05T00:09:15.417508+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDCBK4MW","created_at":"2026-07-05T00:09:15.417508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00687","citing_title":"Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compression","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW","json":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW.json","graph_json":"https://pith.science/api/pith-number/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/graph.json","events_json":"https://pith.science/api/pith-number/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/events.json","paper":"https://pith.science/paper/JDCBK4MW"},"agent_actions":{"view_html":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW","download_json":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW.json","view_paper":"https://pith.science/paper/JDCBK4MW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06845&json=true","fetch_graph":"https://pith.science/api/pith-number/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/graph.json","fetch_events":"https://pith.science/api/pith-number/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/action/storage_attestation","attest_author":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/action/author_attestation","sign_citation":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/action/citation_signature","submit_replication":"https://pith.science/pith/JDCBK4MW5I3ZGFYY7CXZDBJ6JW/action/replication_record"}},"created_at":"2026-07-05T00:09:15.417508+00:00","updated_at":"2026-07-05T00:09:15.417508+00:00"}