Paper Integrity Record · LEDGER
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space
As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2201.06553. No listed check completed, so this record makes no findings claim.
This is a record of named checks, not a clean-status claim or a paper verdict.
Coverage vector
No checks are listed for this paper yet.
Listed checks
No checks are listed for this paper yet.
Observations
No checks are listed for this paper yet.
Methods and limits
Each listed check names the surface it examined. A skipped, failed, partial, unavailable, not collected, not requested, or withheld check says nothing about what a completed check would have returned.
- Only checks with status completed enter the claim sentence numerator.
- Findings appear only from completed checks and only within the scope printed for that check.
- Severity labels describe one observation row. They do not roll up into a paper judgment.