Pith. sign in

Paper Citation Record · LEDGER

Low-Resource Dense Retrieval for Open-Domain Question Answering: A Comprehensive Survey

As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2208.03197.

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

pith.paper-citation-record.v1
2208.03197 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T10:21:49.662196Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-16T10:21:49.878898Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation b4443859-4aa1-4012-81a0-67a318826652 · inbound

Auto-SLURP: A Benchmark Dataset for Evaluating Multi-Agent Frameworks in Smart Personal Assistant cites this paper.

Auto-SLURP: A Benchmark Dataset for Evaluating Multi-Agent Frameworks in Smart Personal Assistant Low-Resource Dense Retrieval for Open-Domain Question Answering: A Comprehensive Survey

Reference 29

Resolution
verified exact
local_arxiv, observed 2026-08-16T10:21:49.885984Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-08-16T10:21:49.662196Z digest=sha256:218932193b1c564ec6bf66fdf813e501c24cd821167fc920690205d18798c49c

Observation bba4e395-748b-4443-9c59-b24714c17247 · inbound

The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs cites this paper.

The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs Low-Resource Dense Retrieval for Open-Domain Question Answering: A Comprehensive Survey

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T07:58:34.640782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T07:58:34.640782Z digest=sha256:fbd2da5479586f52d4d29c6d9c788d15cb2a14db788fc365dcee51c209485683