{"as_of":"2026-08-14T23:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8be84355dbd006f4dc94c7f35d0e1968e38a3265a6c52e53a269fcb027545079","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:24:01.189445Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T01:16:24.628753Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering","version":1},"cited_work":{"arxiv_id":"2012.15156","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.15156","snapshot_observed_at":"2026-07-02T01:16:24.628753Z","title":"Izacard, F","venue":null,"work_id":"51472909-89b1-4282-8c27-f31a32db690a","year":2018},"citing_paper":{"arxiv_id":"2112.04426","last_updated":"2022-02-07T21:07:59Z","snapshot_observed_at":"2026-08-12T09:04:15.292379Z","submitted_at":"2021-12-08T17:32:34Z","title":"Improving language models by retrieving from trillions of tokens","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-17T12:55:41.551478Z"},"links":{"cited_paper":"/paper/2012.15156","citing_paper":"/paper/2112.04426"},"observation_digest":"sha256:f3377f298484b900d9c40c5513168ebdd4b9895b67cf17caef4e93fc308a8b83","observation_id":"1863d175-9ab3-4eba-be6e-2487bf289a53","resolution":{"observed_at":"2026-05-17T12:55:41.625899Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering","version":1},"cited_work":{"arxiv_id":"2012.15156","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.15156","snapshot_observed_at":"2026-07-02T01:16:24.628753Z","title":"Izacard, F","venue":null,"work_id":"51472909-89b1-4282-8c27-f31a32db690a","year":2018},"citing_paper":{"arxiv_id":"2112.09118","last_updated":"2022-08-29T12:17:32Z","snapshot_observed_at":"2026-08-14T13:19:21.742321Z","submitted_at":"2021-12-16T18:57:37Z","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","version":4},"reference_index":141,"source":"arxiv_source","source_observed_at":"2026-05-12T13:21:16.921001Z"},"links":{"cited_paper":"/paper/2012.15156","citing_paper":"/paper/2112.09118"},"observation_digest":"sha256:564950e9d9cfe090be2dddcbeb4e75ac599f22ead319ea71f031a2f2a3f88441","observation_id":"b02ca54e-c350-4a61-8e30-77afa9b82e6a","resolution":{"observed_at":"2026-05-12T13:21:17.175998Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering","version":1},"cited_work":{"arxiv_id":"2012.15156","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.15156","snapshot_observed_at":"2026-07-02T01:16:24.628753Z","title":"Izacard, F","venue":null,"work_id":"51472909-89b1-4282-8c27-f31a32db690a","year":2018},"citing_paper":{"arxiv_id":"2208.03299","last_updated":"2022-11-16T16:38:18Z","snapshot_observed_at":"2026-08-13T00:16:02.335397Z","submitted_at":"2022-08-05T17:39:22Z","title":"Atlas: Few-shot Learning with Retrieval Augmented Language Models","version":3},"reference_index":203,"source":"arxiv_source","source_observed_at":"2026-05-16T13:48:43.024120Z"},"links":{"cited_paper":"/paper/2012.15156","citing_paper":"/paper/2208.03299"},"observation_digest":"sha256:732b6910c68ddd50bdf055069433f734613ed9a4a95c3635390803ef83399635","observation_id":"e850a3b5-6d5c-4e74-9899-fc67a981bd60","resolution":{"observed_at":"2026-05-16T13:48:43.409569Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15156","snapshot_observed_at":"2026-08-11T11:24:01.189445Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.15540","last_updated":"2025-05-21T02:40:11Z","snapshot_observed_at":"2026-08-14T23:24:36.334619Z","submitted_at":"2024-12-20T03:58:27Z","title":"MRAG: A Modular Retrieval Framework for Time-Sensitive Question Answering","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T11:24:01.189445Z"},"links":{"cited_paper":"/paper/2012.15156","citing_paper":"/paper/2412.15540"},"observation_digest":"sha256:2b11a442f61c4fb36cdc4d062323f6c01eb1e6b5fce680f3478e1ef22afb6911","observation_id":"11b3008a-3b96-4922-a969-3e7b8d7986fb","resolution":{"observed_at":"2026-08-11T11:24:01.189445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering","version":1},"cited_work":{"arxiv_id":"2012.15156","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.15156","snapshot_observed_at":"2026-07-02T01:16:24.628753Z","title":"Izacard, F","venue":null,"work_id":"51472909-89b1-4282-8c27-f31a32db690a","year":2018},"citing_paper":{"arxiv_id":"2606.02814","last_updated":"2026-06-01T19:31:28Z","snapshot_observed_at":"2026-08-14T21:56:58.056669Z","submitted_at":"2026-06-01T19:31:28Z","title":"Do Neural Retrievers Prefer Certain Documents? Evidence of Learned Relevance Priors","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T12:20:52.807293Z"},"links":{"cited_paper":"/paper/2012.15156","citing_paper":"/paper/2606.02814"},"observation_digest":"sha256:a46357140a4cdb61598c32c198a34d52df3f630c74d6ce9c012e4ebfcfd6c692","observation_id":"bca38192-2208-4fdf-9efc-b16060ec8637","resolution":{"observed_at":"2026-07-02T01:16:24.630143Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.15156/citation-record","integrity":"/paper/2012.15156/integrity","json":"/paper/2012.15156/citation-record.json","paper":"/paper/2012.15156"},"outbound":[],"paper":{"arxiv_id":"2012.15156","last_updated":"2020-12-30T13:46:06Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T22:23:40.650075Z","submitted_at":"2020-12-30T13:46:06Z","title":"A Memory Efficient Baseline for Open Domain Question Answering"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2012.15156."}