{"as_of":"2026-08-22T12:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:250680ad557808ff2aae0341404b9247311f9e3bad359cc43e7ae68f9ee15ab3","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:49:47.251754Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.11908/citation-record","integrity":"/paper/2505.11908/integrity","json":"/paper/2505.11908/citation-record.json","paper":"/paper/2505.11908"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:49:47.558002Z","title":"A neural probabilistic language model","venue":null,"work_id":"89b69b1c-ac69-4e57-b72f-a1fe6a01a703","year":2003},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.039096Z"},"links":{"citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:1e6d3c91a096068d36625186cfc588be39517821cce9f8693944fa9ef6794a33","observation_id":"84f4dd3a-f74e-42d5-b8f0-47c25e9c91fa","resolution":{"observed_at":"2026-08-15T20:49:47.564254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:49:47.069720Z","title":"Pathrag: Pruning graph-based retrieval augmented generation with relational paths, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.069720Z"},"links":{"citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:12def4a06a6bae0646e1bd40f08d5cd885eeb69a8bd0c5b84bd6ec0c931bec12","observation_id":"6f2432e1-47f3-445a-8346-032e7ee07e95","resolution":{"observed_at":"2026-08-15T20:49:47.069720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:49:47.086898Z","title":"BERT: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.086898Z"},"links":{"citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:1197832b8500bb0c5feea9495bdde19d7c75c822561d26063c0bbfb86c9c4a25","observation_id":"dda521a6-48a0-432a-bf5f-cd59d053181f","resolution":{"observed_at":"2026-08-15T20:49:47.086898Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-08-16T12:38:40.131901Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-08-15T20:49:47.097655Z","title":"From local to global: A graph rag approach to query-focused summarization, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.097655Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:d8c47e2f5032b02b7dfd03240160f2093036c84cf8063f530ae9a4679bab43c3","observation_id":"ea10046f-62bb-4789-bc4d-9860792a76cc","resolution":{"observed_at":"2026-08-15T20:49:47.097655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06713","last_updated":"2025-01-26T08:17:35Z","snapshot_observed_at":"2026-08-19T12:58:29.075737Z","submitted_at":"2025-01-12T04:44:06Z","title":"MiniRAG: Towards Extremely Simple Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06713","snapshot_observed_at":"2026-08-15T20:49:47.102455Z","title":"Minirag: Towards extremely simple retrieval-augmented generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.102455Z"},"links":{"cited_paper":"/paper/2501.06713","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:111389fb6876a52c84984131766395586778a346dc044e5a67ddf899aa116f52","observation_id":"a7ec81aa-0e0e-41c9-b9bf-06babdb5f7df","resolution":{"observed_at":"2026-08-15T20:49:47.102455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08909","last_updated":"2020-02-10T18:40:59Z","snapshot_observed_at":"2026-08-02T17:52:27.326803Z","submitted_at":"2020-02-10T18:40:59Z","title":"REALM: Retrieval-Augmented Language Model Pre-Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08909","snapshot_observed_at":"2026-08-15T20:49:47.106591Z","title":"Realm: Retrieval-augmented language model pre-training, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.106591Z"},"links":{"cited_paper":"/paper/2002.08909","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:5497e45ec7a8f2a390b17d8bc82476a9170d61245574bdc84ca710a42ff94c7b","observation_id":"2fa97f29-8938-4f65-aee7-e8cd2ab2f1e4","resolution":{"observed_at":"2026-08-15T20:49:47.106591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.01282","last_updated":"2021-02-03T09:18:34Z","snapshot_observed_at":"2026-08-18T00:05:48.019000Z","submitted_at":"2020-07-02T17:44:57Z","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.01282","snapshot_observed_at":"2026-08-15T20:49:47.111045Z","title":"Leveraging passage retrieval with generative models for open domain question answering, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.111045Z"},"links":{"cited_paper":"/paper/2007.01282","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:7f1247b23362b71590f0a6e588542045b91b3a5de45ae97e29685246e7403855","observation_id":"30e3f970-86db-40fc-a5ac-c9a3eaead4c2","resolution":{"observed_at":"2026-08-15T20:49:47.111045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.03299","snapshot_observed_at":"2026-08-15T20:49:47.114900Z","title":"Atlas: Few-shot learning with retrieval augmented language models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.114900Z"},"links":{"cited_paper":"/paper/2208.03299","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:f326d41db79f6e8746df4455b4d3a43d184afaa5d954c560c6677103b0e2ee9c","observation_id":"90492a34-2e06-4163-93d8-c03b0195f1eb","resolution":{"observed_at":"2026-08-15T20:49:47.114900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12832","last_updated":"2020-06-04T05:28:21Z","snapshot_observed_at":"2026-08-14T17:33:02.829560Z","submitted_at":"2020-04-27T14:21:03Z","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12832","snapshot_observed_at":"2026-08-15T20:49:47.169898Z","title":"Colbert: Efficient and effective passage search via contextu- alized late interaction over bert, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.169898Z"},"links":{"cited_paper":"/paper/2004.12832","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:6c5cd3c1d689ff0ecba05ee8b7769d12fb414645ac701596b954257c82394525","observation_id":"37a8fb7c-189d-491f-8700-506666d5a673","resolution":{"observed_at":"2026-08-15T20:49:47.169898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17428","last_updated":"2025-02-25T00:35:18Z","snapshot_observed_at":"2026-08-19T08:30:32.631359Z","submitted_at":"2024-05-27T17:59:45Z","title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17428","snapshot_observed_at":"2026-08-15T20:49:47.202327Z","title":"Nv-embed: Improved techniques for training llms as generalist embedding models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.202327Z"},"links":{"cited_paper":"/paper/2405.17428","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:8712ebcd6cf84e67f21ff01ad7edfe75a3818280f9cb321a2b5da779c1e853e7","observation_id":"39b5bbf1-2d88-4dc2-a516-37c1f3b1ddcf","resolution":{"observed_at":"2026-08-15T20:49:47.202327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11401","last_updated":"2021-04-12T15:42:18Z","snapshot_observed_at":"2026-08-07T05:44:30.677502Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-15T20:49:47.207165Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.207165Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:fe119e0c36ab87a4c86395c510ae5fa34875d1b0c4d0ebf4ec6a9c0634ae2669","observation_id":"9270b0fc-f5f9-43fa-807a-91490c1d8cda","resolution":{"observed_at":"2026-08-15T20:49:47.207165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-15T20:49:47.211733Z","title":"Efficient estimation of word representations in vector space, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.211733Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:ee0c148f24be67d0de173a79b8795bb1e2ac8af0965fb5183478f33e54deaf22","observation_id":"38c0224b-c87d-4c17-b936-1ae77d4a7417","resolution":{"observed_at":"2026-08-15T20:49:47.211733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01613","last_updated":"2025-02-03T22:26:56Z","snapshot_observed_at":"2026-08-21T03:10:22.262998Z","submitted_at":"2024-02-02T18:23:18Z","title":"Nomic Embed: Training a Reproducible Long Context Text Embedder","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01613","snapshot_observed_at":"2026-08-15T20:49:47.216115Z","title":"Morris, Brandon Duderstadt, and Andriy Mulyar","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.216115Z"},"links":{"cited_paper":"/paper/2402.01613","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:ecff729c8a6a4a3fcc8a350a8caf7ea586e74d25486e2ee5383492790c2b9d1e","observation_id":"c8053764-9ad6-473b-a621-d7c5e90fac1d","resolution":{"observed_at":"2026-08-15T20:49:47.216115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:49:47.219989Z","title":"GloVe: Global vectors for word representation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.219989Z"},"links":{"citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:30d580fc2b6c909df0b6ccc8fa42e5bb8ba1beef608e441c7c829484f89f76d0","observation_id":"1d452ec4-350a-454a-adda-0447f1798ed3","resolution":{"observed_at":"2026-08-15T20:49:47.219989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05365","last_updated":"2018-03-22T21:59:40Z","snapshot_observed_at":"2026-08-14T19:45:43.957260Z","submitted_at":"2018-02-15T00:05:11Z","title":"Deep contextualized word representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.05365","snapshot_observed_at":"2026-08-15T20:49:47.223490Z","title":"Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.223490Z"},"links":{"cited_paper":"/paper/1802.05365","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:4f012ab1dca58336a1c89a16905fa091736e6c15ee8e19a690b42d5577a3f57a","observation_id":"1730041c-4ee5-4c2c-a8a3-af5a5debbc82","resolution":{"observed_at":"2026-08-15T20:49:47.223490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05591","last_updated":"2025-04-09T09:09:37Z","snapshot_observed_at":"2026-08-20T04:54:19.948670Z","submitted_at":"2024-09-09T13:20:31Z","title":"MemoRAG: Boosting Long Context Processing with Global Memory-Enhanced Retrieval Augmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05591","snapshot_observed_at":"2026-08-15T20:49:47.227379Z","title":"Memorag: Boosting long context processing with global memory-enhanced retrieval augmentation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.227379Z"},"links":{"cited_paper":"/paper/2409.05591","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:5b1cbee276fb72f426bba2a7cd09dd7d7a2e1df0b9a8266501c9adeeda128049","observation_id":"c2a34f11-02eb-43ff-baf0-82d727063b74","resolution":{"observed_at":"2026-08-15T20:49:47.227379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:49:47.231331Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT- networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.231331Z"},"links":{"citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:33b3b29a08c8cf1114ea5f2b04bec3955ffea07eb1d85dacfa9a7b98cb711f06","observation_id":"edd694ff-db3d-41e5-8504-8f3801f24b73","resolution":{"observed_at":"2026-08-15T20:49:47.231331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.18059","last_updated":"2024-01-31T18:30:21Z","snapshot_observed_at":"2026-08-13T16:18:10.557988Z","submitted_at":"2024-01-31T18:30:21Z","title":"RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.18059","snapshot_observed_at":"2026-08-15T20:49:47.234951Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.234951Z"},"links":{"cited_paper":"/paper/2401.18059","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:083f7e1ad159d5ddd1267524c50d4b2338e062d169eab70f6646f41b576c6efe","observation_id":"0b4ba15f-0862-4527-912b-3628c9010c4c","resolution":{"observed_at":"2026-08-15T20:49:47.234951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.12652","last_updated":"2023-05-24T05:08:07Z","snapshot_observed_at":"2026-08-17T20:02:13.545674Z","submitted_at":"2023-01-30T04:18:09Z","title":"REPLUG: Retrieval-Augmented Black-Box Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.12652","snapshot_observed_at":"2026-08-15T20:49:47.238707Z","title":"Replug: Retrieval-augmented black-box language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.238707Z"},"links":{"cited_paper":"/paper/2301.12652","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:490c0ffd84a3c14732ecb341a455029f8cbb129f472053038d8efa28d57f21be","observation_id":"9294da6a-8fa9-44de-ac0b-179d18e0de4a","resolution":{"observed_at":"2026-08-15T20:49:47.238707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.10173","last_updated":"2024-09-19T11:21:24Z","snapshot_observed_at":"2026-08-21T22:05:38.517825Z","submitted_at":"2024-09-16T11:10:29Z","title":"jina-embeddings-v3: Multilingual Embeddings With Task LoRA","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.10173","snapshot_observed_at":"2026-08-15T20:49:47.242412Z","title":"jina-embeddings-v3: Multilingual embeddings with task lora, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.242412Z"},"links":{"cited_paper":"/paper/2409.10173","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:8fbedf7806e9f1df72f9770c230ced9e6e6f980bb06f6e46a908fd2a95ed1fd2","observation_id":"35e78d0c-cfd3-4f80-b4b4-ed934518c42b","resolution":{"observed_at":"2026-08-15T20:49:47.242412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12766","last_updated":"2025-04-23T12:52:18Z","snapshot_observed_at":"2026-08-18T08:27:14.551488Z","submitted_at":"2024-03-18T17:32:32Z","title":"NovelQA: Benchmarking Question Answering on Documents Exceeding 200K Tokens","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12766","snapshot_observed_at":"2026-08-15T20:49:47.247030Z","title":"Novelqa: Benchmarking question answering on documents exceeding 200k tokens, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.247030Z"},"links":{"cited_paper":"/paper/2403.12766","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:78920600a09efa0fc8d432aade4de4c94a45c032b08c7fb1fb0a733545305cab","observation_id":"b4c6820a-f026-4313-a1e6-3bb983fca6a7","resolution":{"observed_at":"2026-08-15T20:49:47.247030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09542","last_updated":"2024-06-26T04:48:11Z","snapshot_observed_at":"2026-08-20T19:03:56.527979Z","submitted_at":"2023-12-15T05:30:14Z","title":"Marathon: A Race Through the Realm of Long Context with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.09542","snapshot_observed_at":"2026-08-15T20:49:47.251754Z","title":"Marathon: A race through the realm of long context with large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:49:47.251754Z"},"links":{"cited_paper":"/paper/2312.09542","citing_paper":"/paper/2505.11908"},"observation_digest":"sha256:40e9b11b4456841926012e79d08a0b0cff60f037b730f9db4a5806e22d4e6b19","observation_id":"4f0fdb73-1395-4438-b685-4c22c6aa6b5a","resolution":{"observed_at":"2026-08-15T20:49:47.251754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.11908","last_updated":"2025-05-17T08:48:43Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-19T11:43:10.921318Z","submitted_at":"2025-05-17T08:48:43Z","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":22},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2505.11908."}