Paper Citation Record · LEDGER

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls

As of 9 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.03515.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.03515 v1

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-12T01:57:08.818406Z

measured 37 of 37 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

37 of 37 outbound references displayed

verified exact0
verified fuzzy0
unresolved37
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a8ac2edc-13b0-4985-b988-128df2343e9b · outbound

This paper cites and Indyk, P.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Indyk, P

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3062feb2-6f41-4fe9-94a2-8876f2485ab0 · outbound

This paper cites ANN-Benchmarks : A benchmarking tool for approximate nearest neighbor algorithms.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls ANN-Benchmarks : A benchmarking tool for approximate nearest neighbor algorithms

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f510c42e-9f27-42b7-835f-a92411b0f218 · outbound

This paper cites MS MARCO: A Human Generated MAchine Reading COmprehension Dataset.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls MS MARCO: A Human Generated MAchine Reading COmprehension Dataset

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aff107a4-85c2-4c77-b854-475c250be245 · outbound

This paper cites an unresolved cited work.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c23f101b-9251-4acc-9496-ae4c011675ed · outbound

This paper cites Approximate nearest neighbor search under neural similarity metric for large-scale recommendation.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Approximate nearest neighbor search under neural similarity metric for large-scale recommendation

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f615ba05-9a68-47d0-bd5f-7b76b5a576f5 · outbound

This paper cites Deep neural networks for YouTube recommendations.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Deep neural networks for YouTube recommendations

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 387e111c-b49b-4a1f-9eaa-982c9a85264b · outbound

This paper cites Approximation by superpositions of a sigmoidal function.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Approximation by superpositions of a sigmoidal function

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2945a66e-3928-43bb-af7c-539ec7ad48ae · outbound

This paper cites and Freund, Y.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Freund, Y

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bf33c94-3270-4f4f-bb19-07318c6e2ae8 · outbound

This paper cites and Sinha, K.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Sinha, K

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 956c8760-532c-46a4-8bee-667abcd5bd62 · outbound

This paper cites Deep image retrieval: Learning global representations for image search.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Deep image retrieval: Learning global representations for image search

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17252891-d6f1-48ec-af90-a561d9c356bf · outbound

This paper cites Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c14be38-84c1-4645-aed9-024c25d5c3a0 · outbound

This paper cites Learning deep structured semantic models for web search using clickthrough data.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Learning deep structured semantic models for web search using clickthrough data

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0daf305-b04f-4125-970f-e02750852830 · outbound

This paper cites Poly-encoders: Architectures and pre-training strategies for fast and accurate multi-sentence scoring.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Poly-encoders: Architectures and pre-training strategies for fast and accurate multi-sentence scoring

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b7ff3e1-60c9-402d-aad4-91f5e9ddeebf · outbound

This paper cites and Motwani, R.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Motwani, R

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8aeb0fa-338b-43d5-a8fb-90903ca98e90 · outbound

This paper cites Dense passage retrieval for open-domain question answering.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Dense passage retrieval for open-domain question answering

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20947a00-aad4-4091-a639-46b9fd04ff5b · outbound

This paper cites an unresolved cited work.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 970d14c9-8140-4f13-acb6-1065893ea0b9 · outbound

This paper cites Y., Pinkus, A., and Schocken, S.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Y., Pinkus, A., and Schocken, S

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcc60458-dd9b-4ca7-95f1-e0a293a10098 · outbound

This paper cites Trans-Encoder : unsupervised sentence-pair modelling through self- and mutual-distillations.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Trans-Encoder : unsupervised sentence-pair modelling through self- and mutual-distillations

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94b9d362-9618-43ca-863a-5670711a2463 · outbound

This paper cites Zero-shot entity linking by reading entity descriptions.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Zero-shot entity linking by reading entity descriptions

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2d4bf23-e9d4-4c7e-bb6d-67c11a2f3b8d · outbound

This paper cites TwinBERT : Distilling knowledge to twin-structured compressed BERT models for large-scale retrieval.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls TwinBERT : Distilling knowledge to twin-structured compressed BERT models for large-scale retrieval

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d906465e-a533-4269-8fda-922d27dc93ba · outbound

This paper cites Sparse, dense, and attentional representations for text retrieval.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Sparse, dense, and attentional representations for text retrieval

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72b2e64c-cac4-41c0-9ae5-742504f91603 · outbound

This paper cites an unresolved cited work.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a25e9376-f990-481c-b835-37787950f0b2 · outbound

This paper cites an unresolved cited work.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99771677-6763-4882-aa0d-ebcbcf731d82 · outbound

This paper cites Relevance Proximity Graphs for Fast Relevance Retrieval.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Relevance Proximity Graphs for Fast Relevance Retrieval

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2fd0c63-e7cb-4ccc-9290-4151c39e59b9 · outbound

This paper cites Searching in metric spaces by spatial approximation.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Searching in metric spaces by spatial approximation

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cd3311e-a25c-44b2-a9c2-9f0ce2f95d44 · outbound

This paper cites Scikit-learn: Machine learning in P ython.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Scikit-learn: Machine learning in P ython

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08474b17-4f2e-4b4f-9ad4-2451d8a53b39 · outbound

This paper cites V., and Gulin, A.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls V., and Gulin, A

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a8d4cde-7ab5-44b6-8569-737de2ea6f9a · outbound

This paper cites X., Dong, D., Wu, H., and Wang, H.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls X., Dong, D., Wu, H., and Wang, H

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82480748-26dd-4e20-863b-1610f973a72f · outbound

This paper cites and Gurevych, I.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Gurevych, I

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 314706de-6f00-45bc-ad37-03606a14b6bc · outbound

This paper cites and Prokhorenkova, L.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Prokhorenkova, L

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e33bf550-2f81-475e-929b-3ec4c2edcc53 · outbound

This paper cites Scalable zero-shot entity linking with dense entity retrieval.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Scalable zero-shot entity linking with dense entity retrieval

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ccb6adb-8037-41fa-a001-12f777b520eb · outbound

This paper cites A bi-metric framework for efficient nearest neighbor search.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls A bi-metric framework for efficient nearest neighbor search

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e84363ba-aec1-4ea8-b5e8-8ae231534742 · outbound

This paper cites Efficient nearest neighbor search for cross-encoder models using matrix factorization.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Efficient nearest neighbor search for cross-encoder models using matrix factorization

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11e7da50-216e-4e2d-aa5a-0cb0fd0b7f6f · outbound

This paper cites Efficient k-NN search with cross-encoders using adaptive multi-round CUR decomposition.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Efficient k-NN search with cross-encoders using adaptive multi-round CUR decomposition

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c23f88ad-a3cb-499a-b94e-389571fd9791 · outbound

This paper cites Adaptive retrieval and scalable indexing for k-NN search with cross-encoders.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Adaptive retrieval and scalable indexing for k-NN search with cross-encoders

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09e10b07-367b-48fe-a452-62a1b90dbe04 · outbound

This paper cites Modelling domain relationships for transfer learning on retrieval-based question answering systems in e-commerce.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls Modelling domain relationships for transfer learning on retrieval-based question answering systems in e-commerce

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1419c6e-f266-4088-b611-e6140967681c · outbound

This paper cites and Stratos, K.

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls and Stratos, K

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-12T01:57:08.818406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.