{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JF7A3PNENKBOUXLFBC4HDP5BAX","short_pith_number":"pith:JF7A3PNE","schema_version":"1.0","canonical_sha256":"497e0dbda46a82ea5d6508b871bfa105fc81734489d5dba3eda1ee2d27b13895","source":{"kind":"arxiv","id":"2306.12141","version":3},"attestation_state":"computed","paper":{"title":"Recoil: Parallel rANS Decoding with Decoder-Adaptive Scalability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Fangzheng Lin, Heming Sun, Jiro Katto, Kasidis Arunruangsirilert","submitted_at":"2023-06-21T09:38:28Z","abstract_excerpt":"Entropy coding is essential to data compression, image and video coding, etc. The Range variant of Asymmetric Numeral Systems (rANS) is a modern entropy coder, featuring superior speed and compression rate. As rANS is not designed for parallel execution, the conventional approach to parallel rANS partitions the input symbol sequence and encodes partitions with independent codecs, and more partitions bring extra overhead. This approach is found in state-of-the-art implementations such as DietGPU. It is unsuitable for content-delivery applications, as the parallelism is wasted if the decoder can"},"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":"2306.12141","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-06-21T09:38:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3d06af1250f59cedf1e1904b41cd26a9344f3c978127af425e2aedc90402f6ea","abstract_canon_sha256":"b484bb940e6ab6c85d8e3cb311d9df3ea246df3518feb7af602fb532cb032618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:31.203845Z","signature_b64":"ICrCb2JK/pVkbWtLyvu8bdk2itMboCOlIuTt2+pdcxNmAUsRbU9ZxmGSisdlSiMz8zBjskwPTSqcC8NCCfOXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497e0dbda46a82ea5d6508b871bfa105fc81734489d5dba3eda1ee2d27b13895","last_reissued_at":"2026-07-05T06:24:31.203441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:31.203441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recoil: Parallel rANS Decoding with Decoder-Adaptive Scalability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Fangzheng Lin, Heming Sun, Jiro Katto, Kasidis Arunruangsirilert","submitted_at":"2023-06-21T09:38:28Z","abstract_excerpt":"Entropy coding is essential to data compression, image and video coding, etc. The Range variant of Asymmetric Numeral Systems (rANS) is a modern entropy coder, featuring superior speed and compression rate. As rANS is not designed for parallel execution, the conventional approach to parallel rANS partitions the input symbol sequence and encodes partitions with independent codecs, and more partitions bring extra overhead. This approach is found in state-of-the-art implementations such as DietGPU. It is unsuitable for content-delivery applications, as the parallelism is wasted if the decoder can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12141","kind":"arxiv","version":3},"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/2306.12141/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":"2306.12141","created_at":"2026-07-05T06:24:31.203497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12141v3","created_at":"2026-07-05T06:24:31.203497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12141","created_at":"2026-07-05T06:24:31.203497+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF7A3PNENKBO","created_at":"2026-07-05T06:24:31.203497+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF7A3PNENKBOUXLF","created_at":"2026-07-05T06:24:31.203497+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF7A3PNE","created_at":"2026-07-05T06:24:31.203497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24531","citing_title":"Unified Position-Invariant Random Access Through Two Compression Layers via Absolute-Offset Coordinates: A Bit-Perfect Device-Resident Proof","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX","json":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX.json","graph_json":"https://pith.science/api/pith-number/JF7A3PNENKBOUXLFBC4HDP5BAX/graph.json","events_json":"https://pith.science/api/pith-number/JF7A3PNENKBOUXLFBC4HDP5BAX/events.json","paper":"https://pith.science/paper/JF7A3PNE"},"agent_actions":{"view_html":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX","download_json":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX.json","view_paper":"https://pith.science/paper/JF7A3PNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12141&json=true","fetch_graph":"https://pith.science/api/pith-number/JF7A3PNENKBOUXLFBC4HDP5BAX/graph.json","fetch_events":"https://pith.science/api/pith-number/JF7A3PNENKBOUXLFBC4HDP5BAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX/action/storage_attestation","attest_author":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX/action/author_attestation","sign_citation":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX/action/citation_signature","submit_replication":"https://pith.science/pith/JF7A3PNENKBOUXLFBC4HDP5BAX/action/replication_record"}},"created_at":"2026-07-05T06:24:31.203497+00:00","updated_at":"2026-07-05T06:24:31.203497+00:00"}