{"as_of":"2026-07-15T11:47:00Z","canonical_paper_id":"CPRFYVEG","canonical_url":"https://pith.science/paper/CPRFYVEG/integrity","context_digest":"sha256:1e1526b655acc1770f3cab758131fe39425dd854136bc634901f523b0408fb8f","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/1609.07228","bundle_json":"/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/bundle.json","citation_record":"/paper/CPRFYVEG/citation-record","evidence":"/evidence","html":"/paper/CPRFYVEG/integrity","integrity_json":"/paper/CPRFYVEG/integrity.json","json":"/paper/CPRFYVEG/integrity.json","legacy_integrity_json":"/pith/CPRFYVEG/integrity.json","paper":"/paper/CPRFYVEG","reference_changes":"/flags?citing=CPRFYVEG"},"paper":{"arxiv_id":"1609.07228","latest_version":3,"primary_cat":"cs.CV","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph"},"pith_number":"pith:2016:CPRFYVEGPB3LHU3ZINFO7VGHES","pith_short":"CPRFYVEGPB3LHU3ZINFO7VGHES","record":{"arxiv_id":"1609.07228","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1609.07228. 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"}