Proximity is measured over citations between two papers we both hold, weighted by how heavily one leans on the other, and is symmetric — it does not distinguish citing from being cited. Authors without a profile here are skipped, and a genuinely close colleague can be missing simply because their work is not in our arXiv corpus. Method: docs/06-citations-pipeline.md.
Papers
(1 of 3)
Fast Interpretable Greedy-Tree Sums
published2025 · Proceedings of the National Academy of Sciences · 9 citations · first circulated 2022
with Yan Shuo Tan, Chandan Singh, Keyan Nasseri, James Duncan, Omer Ronen, M. B. Epland, Aaron E. Kornblith, Bin Yu, Matthew Epland, Aaron Kornblith
Assembled from arXiv and OpenAlex. Duplicate records for the same paper are merged, and the published version is shown where we could identify one. Corrections welcome.