{"as_of":"2026-07-20T01:33:00Z","canonical_paper_id":"CPR5GXVS","canonical_url":"https://pith.science/paper/CPR5GXVS/integrity","context_digest":"sha256:2f8cc79df82aeccf1d64ab61e7d81ccbf9e3bb1e71593253384da069c927c791","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/2105.03868","bundle_json":"/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/bundle.json","citation_record":"/paper/CPR5GXVS/citation-record","evidence":"/evidence","html":"/paper/CPR5GXVS/integrity","integrity_json":"/paper/CPR5GXVS/integrity.json","json":"/paper/CPR5GXVS/integrity.json","legacy_integrity_json":"/pith/CPR5GXVS/integrity.json","paper":"/paper/CPR5GXVS","reference_changes":"/flags?citing=CPR5GXVS"},"paper":{"arxiv_id":"2105.03868","latest_version":1,"primary_cat":"cs.LG","title":"Non-Recursive Graph Convolutional Networks"},"pith_number":"pith:2021:CPR5GXVSORQ3OAACAIO7NX3TRL","pith_short":"CPR5GXVSORQ3OAACAIO7NX3TRL","record":{"arxiv_id":"2105.03868","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2105.03868. 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"}