{"as_of":"2026-07-21T12:03:00Z","canonical_paper_id":"VCEKFILA","canonical_url":"https://pith.science/paper/VCEKFILA/integrity","context_digest":"sha256:2de7b492d4701321e7f2ef9ea99ee2d1096ce36972d91d461679c441bd7c61f9","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/1801.03623","bundle_json":"/pith/VCEKFILAZZSR6GWKAEM7PQUYUW/bundle.json","citation_record":"/paper/VCEKFILA/citation-record","evidence":"/evidence","html":"/paper/VCEKFILA/integrity","integrity_json":"/paper/VCEKFILA/integrity.json","json":"/paper/VCEKFILA/integrity.json","legacy_integrity_json":"/pith/VCEKFILA/integrity.json","paper":"/paper/VCEKFILA","reference_changes":"/flags?citing=VCEKFILA"},"paper":{"arxiv_id":"1801.03623","latest_version":1,"primary_cat":"cs.IT","title":"Optimal locally repairable codes of distance $3$ and $4$ via cyclic codes"},"pith_number":"pith:2018:VCEKFILAZZSR6GWKAEM7PQUYUW","pith_short":"VCEKFILAZZSR6GWKAEM7PQUYUW","record":{"arxiv_id":"1801.03623","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1801.03623. 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"}