{"as_of":"2026-07-20T11:56:00Z","canonical_paper_id":"1105.4175","canonical_url":"https://pith.science/paper/1105.4175/integrity","context_digest":"sha256:3f96e2fbe0835dd83bfb8ee40bfdd71123a24f9f66e79880414632eb93f85719","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/1105.4175","bundle_json":"/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/bundle.json","citation_record":"/paper/1105.4175/citation-record","evidence":"/evidence","html":"/paper/1105.4175/integrity","integrity_json":"/paper/1105.4175/integrity.json","json":"/paper/1105.4175/integrity.json","legacy_integrity_json":"/pith/1105.4175/integrity.json","paper":"/paper/1105.4175","reference_changes":"/flags?citing=1105.4175"},"paper":{"arxiv_id":"1105.4175","latest_version":1,"primary_cat":"cs.CC","title":"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs"},"pith_number":"pith:2011:FPPG75DJMPRBLRKVRUYVOMP4WY","pith_short":"FPPG75DJMPRBLRKVRUYVOMP4WY","record":{"arxiv_id":"1105.4175","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1105.4175. 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"}