{"as_of":"2026-07-19T19:44:00Z","canonical_paper_id":"1811.09142","canonical_url":"https://pith.science/paper/1811.09142/integrity","context_digest":"sha256:0f480faf5006236b5aec2cfc4975ced5314eadf5dfa357374327ea01ded8b20c","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/1811.09142","bundle_json":"/pith/O5TFEECIDAKND453YJMO5CCEKN/bundle.json","citation_record":"/paper/1811.09142/citation-record","evidence":"/evidence","html":"/paper/1811.09142/integrity","integrity_json":"/paper/1811.09142/integrity.json","json":"/paper/1811.09142/integrity.json","legacy_integrity_json":"/pith/1811.09142/integrity.json","paper":"/paper/1811.09142","reference_changes":"/flags?citing=1811.09142"},"paper":{"arxiv_id":"1811.09142","latest_version":2,"primary_cat":"cs.IT","title":"Construction of optimal locally recoverable codes and connection with hypergraph"},"pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","pith_short":"O5TFEECIDAKND453YJMO5CCEKN","record":{"arxiv_id":"1811.09142","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1811.09142. 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"}