{"as_of":"2026-07-16T04:06:00Z","canonical_paper_id":"RUGDMCXA","canonical_url":"https://pith.science/paper/RUGDMCXA/integrity","context_digest":"sha256:e5e1746183fd897e2b2acc0b82ca1f432c6078877666176769f203e48b0e304b","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/1508.02028","bundle_json":"/pith/RUGDMCXAC67OMTUC774BNEB47Y/bundle.json","citation_record":"/paper/RUGDMCXA/citation-record","evidence":"/evidence","html":"/paper/RUGDMCXA/integrity","integrity_json":"/paper/RUGDMCXA/integrity.json","json":"/paper/RUGDMCXA/integrity.json","legacy_integrity_json":"/pith/RUGDMCXA/integrity.json","paper":"/paper/RUGDMCXA","reference_changes":"/flags?citing=RUGDMCXA"},"paper":{"arxiv_id":"1508.02028","latest_version":1,"primary_cat":"cs.IT","title":"Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning"},"pith_number":"pith:2015:RUGDMCXAC67OMTUC774BNEB47Y","pith_short":"RUGDMCXAC67OMTUC774BNEB47Y","record":{"arxiv_id":"1508.02028","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1508.02028. 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"}