{"as_of":"2026-08-13T12:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e154bc7a28523dd92b2c0275a1bd9a16e9d5c67d6dfbc45a2c9c3ff03d6b56b0","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T09:33:16.602136Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2601.13744/citation-record","integrity":"/paper/2601.13744/integrity","json":"/paper/2601.13744/citation-record.json","paper":"/paper/2601.13744"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:33:14.406165Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.406165Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:8c1266e81c1cfae3af48d8416aa9b6059ffe5bfa1c5956ee943c469c18a0c935","observation_id":"1d15b810-d192-4f3f-820e-b70fcbb1359b","resolution":{"observed_at":"2026-08-03T09:33:14.406165Z","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-03T09:33:14.465280Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.465280Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:465561db1db1e2db83c2f51339db1578b29b35943d87371127f24d6055a8d087","observation_id":"b23354c4-44d3-4342-ab1d-695c924a7e76","resolution":{"observed_at":"2026-08-03T09:33:14.465280Z","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-03T09:33:14.593094Z","title":"Lectures on the Nearest Neighbor Method","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.593094Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:410f55820d9a5b9b95eb33aa113fa53b0aec92433c33e8e8d59ac9de5917d871","observation_id":"a3bcb52e-3c35-4fb6-a2c9-c687b1b521ce","resolution":{"observed_at":"2026-08-03T09:33:14.593094Z","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-03T09:33:14.704868Z","title":"Improving language models by retrieving from trillions of tokens","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.704868Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:0001b45a652fa810a2f4a7cd5c0635a5e7f72fb109ccf3412aefb9be9aaffe09","observation_id":"28c8e218-97e3-4d2b-91ed-6e845578994c","resolution":{"observed_at":"2026-08-03T09:33:14.704868Z","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-03T09:33:14.882210Z","title":"Switch transformers: S caling to trillion parameter models with simple and efficient sparsity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.882210Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:1ac3fccc3b32c112c02e331df7d42f3d7f02100533fdd676a3d3e2ea48b0571a","observation_id":"e3783f8b-24e1-495a-b75d-7a64544c7e39","resolution":{"observed_at":"2026-08-03T09:33:14.882210Z","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-03T09:33:14.994751Z","title":"Unbounded cache model for online language modeling with open vocabulary","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:14.994751Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:68088700b4cb41563f5e1e79f78511275b29808a9690ac2ecf6eff47c3bbaaf6","observation_id":"4ea9af6c-30f7-43bc-b463-d4b28de8af5d","resolution":{"observed_at":"2026-08-03T09:33:14.994751Z","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-03T09:33:15.074755Z","title":"A Distribution-Free Theory of Nonparametric Regression","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.074755Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:cee6f8e2442644175bbb46fd1a490807e225bce2d3eeda171963fa65c5419fa8","observation_id":"1d736c87-c5d4-41b7-aa46-bd95435b54c9","resolution":{"observed_at":"2026-08-03T09:33:15.074755Z","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-03T09:33:15.194758Z","title":"Atlas : F ew-shot learning with retrieval augmented language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.194758Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:a360f5a8ba1571d356c2ad70d28e14610f212d360d0136fab405409eea4d7a14","observation_id":"8703f56f-7710-4d71-ad90-eb892586153d","resolution":{"observed_at":"2026-08-03T09:33:15.194758Z","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-03T09:33:15.355257Z","title":"Jacobs, Michael I","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.355257Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:b4aaa5129b62d68c9e0ceb8af932c5825492086d054ca6a530fd0a472b937119","observation_id":"41dfbf60-a086-45b2-9447-3a0595d5d24c","resolution":{"observed_at":"2026-08-03T09:33:15.355257Z","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-03T09:33:15.455766Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.455766Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:2f08427fb5ab831817fa485839924987013cb49d88c7c32c9926a4d429215dbd","observation_id":"28596172-5b10-43f4-97a7-a836be898049","resolution":{"observed_at":"2026-08-03T09:33:15.455766Z","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-03T09:33:15.534756Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.534756Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:736aba33b3e14dfb7241975ec6274569f6d60a5e62296b94de236a4d82f3c490","observation_id":"ec261291-445f-4ff2-a7dc-bfcd9140d2e9","resolution":{"observed_at":"2026-08-03T09:33:15.534756Z","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-03T09:33:15.664754Z","title":"Generalization through memorization: N earest neighbor language models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.664754Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:647960e5f84071cc4f6a03b384c3c5617270c54f146c7e0690d059f05e7568d2","observation_id":"a8f03ff9-c7d0-47ed-a2c1-6c11ac0950a5","resolution":{"observed_at":"2026-08-03T09:33:15.664754Z","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-03T09:33:15.794779Z","title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.794779Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:43e0e074b491d7680f16f19b565fdf507a64c81b1334856dc63c240ab77a26da","observation_id":"6bff7bf7-3825-4918-89f7-ee40b5649cb2","resolution":{"observed_at":"2026-08-03T09:33:15.794779Z","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-03T09:33:15.914752Z","title":"Self C heck GPT : Z ero-resource black-box hallucination detection for generative large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.914752Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:8f9d64729215fb5e5429c6e02b8e836f1cd055d1c9a39630e726e545aed79fc7","observation_id":"30ecaf15-08e2-412e-ad5b-5d0b945e6b6a","resolution":{"observed_at":"2026-08-03T09:33:15.914752Z","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-03T09:33:15.994750Z","title":"FA ct S core: Fine-grained atomic evaluation of factual precision in long form text generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:15.994750Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:aa36b9fe3a5cd0e9af86ab470759ebca96de157cfc5fd9b71d6e4f4a158a9da6","observation_id":"666e79cf-52a3-4880-8e4a-3cc261e81714","resolution":{"observed_at":"2026-08-03T09:33:15.994750Z","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-03T09:33:16.084866Z","title":"Outrageously large neural networks: T he sparsely-gated mixture-of-experts layer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.084866Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:491434bd56de12f02fbad5ddbe8cdec5e497bff0732aac84ca5b068a8c1728a2","observation_id":"bd7db5df-d490-4230-9710-6216bbaf4dfa","resolution":{"observed_at":"2026-08-03T09:33:16.084866Z","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-03T09:33:16.191386Z","title":"REPLUG : Retrieval-augmented black-box language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.191386Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:e682bf4d7dd6682e32d93bb281047d9a008f61521655b72f298b88d34073535f","observation_id":"5ffcd092-2285-4379-bacc-b77d81ed3d38","resolution":{"observed_at":"2026-08-03T09:33:16.191386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.21160","last_updated":"2025-07-25T04:29:49Z","snapshot_observed_at":"2026-08-06T14:28:05.211200Z","submitted_at":"2025-07-25T04:29:49Z","title":"Handling Out-of-Distribution Data: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.21160","snapshot_observed_at":"2026-08-03T09:33:16.304785Z","title":"Handling out-of-distribution data: A survey","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.304785Z"},"links":{"cited_paper":"/paper/2507.21160","citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:78be459d260b72e9f95d7ee7f56ba5e1c9fa2ae5fbb7e6cccd054dd43fdbf1e2","observation_id":"5c4245cc-d6be-4c99-9c7a-b284b880684e","resolution":{"observed_at":"2026-08-03T09:33:16.304785Z","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-03T09:33:16.372872Z","title":"Calibrating large language models using their generations only","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.372872Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:d346394c3ec3547a0c6419face3913f1a573eedb77e2d2eaf529b9c6d9fc186e","observation_id":"988719f7-428d-4d2f-9716-cbfee11624e7","resolution":{"observed_at":"2026-08-03T09:33:16.372872Z","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-03T09:33:16.479541Z","title":"Xu, Uri Alon, and Graham Neubig","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.479541Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:3d2020770513ea0552e2cc77287432d4c773a72fe0d4ba6c0fe7113cb3741745","observation_id":"3a7e160b-e0bf-4120-946f-b7f9036ee32c","resolution":{"observed_at":"2026-08-03T09:33:16.479541Z","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-03T09:33:16.602136Z","title":"Domain generalization: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T09:33:16.602136Z"},"links":{"citing_paper":"/paper/2601.13744"},"observation_digest":"sha256:c6b9edd6196ce241753d971ccc36fc062c7f8ac775d0fb1f286f4ed597fae4ce","observation_id":"adfe2628-239d-482a-a2d6-e46f0c33d785","resolution":{"observed_at":"2026-08-03T09:33:16.602136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.13744","last_updated":"2026-07-10T12:24:04Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-12T02:59:47.899419Z","submitted_at":"2026-01-20T09:01:04Z","title":"A Note on k-NN Gating in RAG"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2601.13744."}