{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:THG5MINI6KXQ7A766EYZ4OFHDT","short_pith_number":"pith:THG5MINI","schema_version":"1.0","canonical_sha256":"99cdd621a8f2af0f83fef1319e38a71ccc93acffb04e6e6e1e5a7c8e0be347c2","source":{"kind":"arxiv","id":"2111.00965","version":1},"attestation_state":"computed","paper":{"title":"iFlow: Numerically Invertible Flows for Efficient Lossless Compression via a Uniform Coder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ning Kang, Shifeng Zhang, Tom Ryder, Zhenguo Li","submitted_at":"2021-11-01T14:15:58Z","abstract_excerpt":"It was estimated that the world produced $59 ZB$ ($5.9 \\times 10^{13} GB$) of data in 2020, resulting in the enormous costs of both data storage and transmission. Fortunately, recent advances in deep generative models have spearheaded a new class of so-called \"neural compression\" algorithms, which significantly outperform traditional codecs in terms of compression ratio. Unfortunately, the application of neural compression garners little commercial interest due to its limited bandwidth; therefore, developing highly efficient frameworks is of critical practical importance. In this paper, we dis"},"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":"2111.00965","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-01T14:15:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fb385318a1f072e2bf210d8590221450dc2d990c90e9d8ab6068b6711154ba35","abstract_canon_sha256":"dbe8d2dd45686e1de96baf0ca1a65952c91af11549c8a067108124101835147c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:52.036578Z","signature_b64":"nhjp/O+OwHe3LS7bdk2gAHxws7a+y8wcYgOPcMagVCq/4GUZHQNp+1VcxUAyKs563RgYAaZZkvLscpXkiDsmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99cdd621a8f2af0f83fef1319e38a71ccc93acffb04e6e6e1e5a7c8e0be347c2","last_reissued_at":"2026-07-05T03:27:52.036139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:52.036139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"iFlow: Numerically Invertible Flows for Efficient Lossless Compression via a Uniform Coder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ning Kang, Shifeng Zhang, Tom Ryder, Zhenguo Li","submitted_at":"2021-11-01T14:15:58Z","abstract_excerpt":"It was estimated that the world produced $59 ZB$ ($5.9 \\times 10^{13} GB$) of data in 2020, resulting in the enormous costs of both data storage and transmission. Fortunately, recent advances in deep generative models have spearheaded a new class of so-called \"neural compression\" algorithms, which significantly outperform traditional codecs in terms of compression ratio. Unfortunately, the application of neural compression garners little commercial interest due to its limited bandwidth; therefore, developing highly efficient frameworks is of critical practical importance. In this paper, we dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.00965/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":"2111.00965","created_at":"2026-07-05T03:27:52.036198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00965v1","created_at":"2026-07-05T03:27:52.036198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00965","created_at":"2026-07-05T03:27:52.036198+00:00"},{"alias_kind":"pith_short_12","alias_value":"THG5MINI6KXQ","created_at":"2026-07-05T03:27:52.036198+00:00"},{"alias_kind":"pith_short_16","alias_value":"THG5MINI6KXQ7A76","created_at":"2026-07-05T03:27:52.036198+00:00"},{"alias_kind":"pith_short_8","alias_value":"THG5MINI","created_at":"2026-07-05T03:27:52.036198+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":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT","json":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT.json","graph_json":"https://pith.science/api/pith-number/THG5MINI6KXQ7A766EYZ4OFHDT/graph.json","events_json":"https://pith.science/api/pith-number/THG5MINI6KXQ7A766EYZ4OFHDT/events.json","paper":"https://pith.science/paper/THG5MINI"},"agent_actions":{"view_html":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT","download_json":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT.json","view_paper":"https://pith.science/paper/THG5MINI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00965&json=true","fetch_graph":"https://pith.science/api/pith-number/THG5MINI6KXQ7A766EYZ4OFHDT/graph.json","fetch_events":"https://pith.science/api/pith-number/THG5MINI6KXQ7A766EYZ4OFHDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT/action/storage_attestation","attest_author":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT/action/author_attestation","sign_citation":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT/action/citation_signature","submit_replication":"https://pith.science/pith/THG5MINI6KXQ7A766EYZ4OFHDT/action/replication_record"}},"created_at":"2026-07-05T03:27:52.036198+00:00","updated_at":"2026-07-05T03:27:52.036198+00:00"}