{"as_of":"2026-07-14T15:05:00Z","canonical_paper_id":"LIMORQ3Q","canonical_url":"https://pith.science/paper/LIMORQ3Q/integrity","context_digest":"sha256:66f9715430b9ed43e9856fd45fc0b0bb6de3f292a691065a2b5beb72ba6f7ee7","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/1406.3047","bundle_json":"/pith/LIMORQ3QCODPMXLYXRMSDNUSF4/bundle.json","citation_record":"/paper/LIMORQ3Q/citation-record","evidence":"/evidence","html":"/paper/LIMORQ3Q/integrity","integrity_json":"/paper/LIMORQ3Q/integrity.json","json":"/paper/LIMORQ3Q/integrity.json","legacy_integrity_json":"/pith/LIMORQ3Q/integrity.json","paper":"/paper/LIMORQ3Q","reference_changes":"/flags?citing=LIMORQ3Q"},"paper":{"arxiv_id":"1406.3047","latest_version":2,"primary_cat":"cs.AI","title":"Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results"},"pith_number":"pith:2014:LIMORQ3QCODPMXLYXRMSDNUSF4","pith_short":"LIMORQ3QCODPMXLYXRMSDNUSF4","record":{"arxiv_id":"1406.3047","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1406.3047. 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"}