{"as_of":"2026-07-17T20:46:00Z","canonical_paper_id":"CWVVNIIM","canonical_url":"https://pith.science/paper/CWVVNIIM/integrity","context_digest":"sha256:1e27edb28a002ef3c46c7e4079cc16e7f399772d00290b1c97de2862c4167569","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/2003.05746","bundle_json":"/pith/CWVVNIIMV76AQXGSKBO5SDGBTN/bundle.json","citation_record":"/paper/CWVVNIIM/citation-record","evidence":"/evidence","html":"/paper/CWVVNIIM/integrity","integrity_json":"/paper/CWVVNIIM/integrity.json","json":"/paper/CWVVNIIM/integrity.json","legacy_integrity_json":"/pith/CWVVNIIM/integrity.json","paper":"/paper/CWVVNIIM","reference_changes":"/flags?citing=CWVVNIIM"},"paper":{"arxiv_id":"2003.05746","latest_version":4,"primary_cat":"cs.LO","title":"Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation"},"pith_number":"pith:2020:CWVVNIIMV76AQXGSKBO5SDGBTN","pith_short":"CWVVNIIMV76AQXGSKBO5SDGBTN","record":{"arxiv_id":"2003.05746","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2003.05746. 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"}