{"as_of":"2026-07-17T01:32:00Z","canonical_paper_id":"BJRWTHG3","canonical_url":"https://pith.science/paper/BJRWTHG3/integrity","context_digest":"sha256:a2417a8afc841b9b74e11826ae9d40c451d824402b2db75f9026033ce76fc579","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/1806.11301","bundle_json":"/pith/BJRWTHG3ZQKQJKGUHC6U4PYE7W/bundle.json","citation_record":"/paper/BJRWTHG3/citation-record","evidence":"/evidence","html":"/paper/BJRWTHG3/integrity","integrity_json":"/paper/BJRWTHG3/integrity.json","json":"/paper/BJRWTHG3/integrity.json","legacy_integrity_json":"/pith/BJRWTHG3/integrity.json","paper":"/paper/BJRWTHG3","reference_changes":"/flags?citing=BJRWTHG3"},"paper":{"arxiv_id":"1806.11301","latest_version":1,"primary_cat":"cs.IT","title":"A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes"},"pith_number":"pith:2018:BJRWTHG3ZQKQJKGUHC6U4PYE7W","pith_short":"BJRWTHG3ZQKQJKGUHC6U4PYE7W","record":{"arxiv_id":"1806.11301","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1806.11301. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}