{"as_of":"2026-07-17T11:54:00Z","canonical_paper_id":"QK2AFH2Y","canonical_url":"https://pith.science/paper/QK2AFH2Y/integrity","context_digest":"sha256:b464b52270bd347e3c89f1df20c138c0e9d9b3ea5e7785b5c50ad67a19541b40","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/2206.02369","bundle_json":"/pith/QK2AFH2YEUGU26MDRPMHAAIQ5H/bundle.json","citation_record":"/paper/QK2AFH2Y/citation-record","evidence":"/evidence","html":"/paper/QK2AFH2Y/integrity","integrity_json":"/paper/QK2AFH2Y/integrity.json","json":"/paper/QK2AFH2Y/integrity.json","legacy_integrity_json":"/pith/QK2AFH2Y/integrity.json","paper":"/paper/QK2AFH2Y","reference_changes":"/flags?citing=QK2AFH2Y"},"paper":{"arxiv_id":"2206.02369","latest_version":2,"primary_cat":"cs.CL","title":"Learning to Break the Loop: Analyzing and Mitigating Repetitions for Neural Text Generation"},"pith_number":"pith:2022:QK2AFH2YEUGU26MDRPMHAAIQ5H","pith_short":"QK2AFH2YEUGU26MDRPMHAAIQ5H","record":{"arxiv_id":"2206.02369","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2206.02369. 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"}