{"as_of":"2026-07-14T06:58:00Z","canonical_paper_id":"2110.02027","canonical_url":"https://pith.science/paper/2110.02027/integrity","context_digest":"sha256:3af091a15afcfe39626e40d59519fb410049339dd160ae81ba6b52edadcf471f","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/2110.02027","bundle_json":"/pith/UY3N5HBBJ3EMZARVS4KM7XQOL2/bundle.json","citation_record":"/paper/2110.02027/citation-record","evidence":"/evidence","html":"/paper/2110.02027/integrity","integrity_json":"/paper/2110.02027/integrity.json","json":"/paper/2110.02027/integrity.json","legacy_integrity_json":"/pith/2110.02027/integrity.json","paper":"/paper/2110.02027","reference_changes":"/flags?citing=2110.02027"},"paper":{"arxiv_id":"2110.02027","latest_version":3,"primary_cat":"cs.AI","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning"},"pith_number":"pith:2021:UY3N5HBBJ3EMZARVS4KM7XQOL2","pith_short":"UY3N5HBBJ3EMZARVS4KM7XQOL2","record":{"arxiv_id":"2110.02027","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2110.02027. 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"}