{"as_of":"2026-07-17T22:21:00Z","canonical_paper_id":"1612.07545","canonical_url":"https://pith.science/paper/1612.07545/integrity","context_digest":"sha256:9d3a6cb09cb7250eb96029fb485e443f5ee4c83391faf9acb9c4f95ce3995ea0","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/1612.07545","bundle_json":"/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/bundle.json","citation_record":"/paper/1612.07545/citation-record","evidence":"/evidence","html":"/paper/1612.07545/integrity","integrity_json":"/paper/1612.07545/integrity.json","json":"/paper/1612.07545/integrity.json","legacy_integrity_json":"/pith/1612.07545/integrity.json","paper":"/paper/1612.07545","reference_changes":"/flags?citing=1612.07545"},"paper":{"arxiv_id":"1612.07545","latest_version":6,"primary_cat":"cs.CV","title":"A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search"},"pith_number":"pith:2016:XZ4CPUL2L6JMVT5HNRCLK2ZSQU","pith_short":"XZ4CPUL2L6JMVT5HNRCLK2ZSQU","record":{"arxiv_id":"1612.07545","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1612.07545. 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"}