{"as_of":"2026-08-09T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8b70ce47ad866dfc5bc56740779b24ed2060e9b205aab70f55847e3e891a105","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:21:26.830290Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.20753","doi":"10.48550/arxiv.2410.20753","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planxrag: Planning-guided retrieval augmented generation","venue":"arXiv (Cornell University)","work_id":"d4cb9453-e97b-43c7-a239-ec164268ca4f","year":2024},"citing_paper":{"arxiv_id":"2501.05366","last_updated":"2025-01-09T16:48:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-09T16:48:17Z","title":"Search-o1: Agentic Search-Enhanced Large Reasoning Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-13T17:36:27.515468Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2501.05366"},"observation_digest":"sha256:5ecc2a87a2223fa8f5f13488921bb1fc867bdee93097327fb1ac6e06501daff1","observation_id":"e57b2967-44fc-482e-b416-2458edcc1de3","resolution":{"observed_at":"2026-05-13T17:36:27.590488Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-07T15:21:26.830290Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15444","last_updated":"2025-05-21T12:25:12Z","snapshot_observed_at":"2026-08-07T15:15:23.161477Z","submitted_at":"2025-05-21T12:25:12Z","title":"Single LLM, Multiple Roles: A Unified Retrieval-Augmented Generation Framework Using Role-Specific Token Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:21:26.830290Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2505.15444"},"observation_digest":"sha256:8fc718da2eeb736b0fd025e23465f0033951c28f59f86775341f8dd38359144f","observation_id":"8f0dc097-8ae3-4640-85e2-9b54dec04316","resolution":{"observed_at":"2026-08-07T15:21:26.830290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-07T12:12:51.978169Z","title":"Plan-rag: Planning-guided retrieval augm ented generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00232","last_updated":"2025-05-30T21:10:30Z","snapshot_observed_at":"2026-08-08T00:22:39.492708Z","submitted_at":"2025-05-30T21:10:30Z","title":"ComposeRAG: A Modular and Composable RAG for Corpus-Grounded Multi-Hop Question Answering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:12:51.978169Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2506.00232"},"observation_digest":"sha256:16b13601983aa5e6414219bccfc136f2eb4a8d37002d7bcd096797fd764b118d","observation_id":"64e53bab-6ce5-4f47-b39d-cc26eed7f705","resolution":{"observed_at":"2026-08-07T12:12:51.978169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-06T22:31:39.518596Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21384","last_updated":"2025-06-26T15:35:12Z","snapshot_observed_at":"2026-08-07T20:42:59.691167Z","submitted_at":"2025-06-26T15:35:12Z","title":"Leveraging LLM-Assisted Query Understanding for Live Retrieval-Augmented Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:31:39.518596Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2506.21384"},"observation_digest":"sha256:3092b74ad94ba6dd7a0682c5fbbeb1566d192facdfb89d38fb3e7137ac453e76","observation_id":"d4d32c64-aaae-4d0d-a684-b9ea5b55dd4f","resolution":{"observed_at":"2026-08-06T22:31:39.518596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-03T23:33:49.599997Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.05385","last_updated":"2026-07-23T06:36:18Z","snapshot_observed_at":"2026-08-07T22:51:42.589401Z","submitted_at":"2025-11-07T16:08:34Z","title":"TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T23:33:49.599997Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2511.05385"},"observation_digest":"sha256:efbf24e662f6a48ea9c598bd07fc4cd2cf1efd871af2c75735520d527dd5045d","observation_id":"2b50acf1-8300-40fe-873a-24841e9b2aaa","resolution":{"observed_at":"2026-08-03T23:33:49.599997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.20753","doi":"10.48550/arxiv.2410.20753","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planxrag: Planning-guided retrieval augmented generation","venue":"arXiv (Cornell University)","work_id":"d4cb9453-e97b-43c7-a239-ec164268ca4f","year":2024},"citing_paper":{"arxiv_id":"2606.01240","last_updated":"2026-05-31T13:42:36Z","snapshot_observed_at":"2026-08-02T06:51:34.323150Z","submitted_at":"2026-05-31T13:42:36Z","title":"Efficient RAG with Intent-Aware Retrieval and Semantics-Preserving Chunking","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T17:38:21.242007Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2606.01240"},"observation_digest":"sha256:a7fae3dea72c86f4c4b47ed9ab41a5d2bc113a03a0436a645b1b4d13994019de","observation_id":"8a9b642c-766f-4612-83ce-d8cce8d7a3d6","resolution":{"observed_at":"2026-07-01T20:56:13.826799Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.20753","doi":"10.48550/arxiv.2410.20753","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planxrag: Planning-guided retrieval augmented generation","venue":"arXiv (Cornell University)","work_id":"d4cb9453-e97b-43c7-a239-ec164268ca4f","year":2024},"citing_paper":{"arxiv_id":"2606.10921","last_updated":"2026-08-06T08:44:18Z","snapshot_observed_at":"2026-08-09T08:10:02.707755Z","submitted_at":"2026-06-09T14:29:06Z","title":"Trace Only What You Need: Structure-Aware On-Demand Hypergraph Memory for Long-Document Question Answering","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T13:21:15.148141Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2606.10921"},"observation_digest":"sha256:7252240dcf27cd12a50796a6d4a4767c5a5d3e4af8cc7d0bf6325dc10fadb5c0","observation_id":"72af89a6-2848-4223-9a26-b56b318de842","resolution":{"observed_at":"2026-07-03T05:17:40.157045Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.20753","doi":"10.48550/arxiv.2410.20753","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planxrag: Planning-guided retrieval augmented generation","venue":"arXiv (Cornell University)","work_id":"d4cb9453-e97b-43c7-a239-ec164268ca4f","year":2024},"citing_paper":{"arxiv_id":"2606.22681","last_updated":"2026-06-21T21:46:41Z","snapshot_observed_at":"2026-08-01T21:45:47.385301Z","submitted_at":"2026-06-21T21:46:41Z","title":"Only Ask What You Don't Know: Grounded Delta Planning for Efficient Multi-step RAG","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T10:10:16.661082Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2606.22681"},"observation_digest":"sha256:f2b129e9b201efd3ebb0fee9ea51493dec520b503a5ffbd49fbc9f1dbb57caa8","observation_id":"649c821d-c9c0-4191-9c0f-a8e7d77e7459","resolution":{"observed_at":"2026-07-04T09:19:44.019606Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":"2410.20753","doi":"10.48550/arxiv.2410.20753","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planxrag: Planning-guided retrieval augmented generation","venue":"arXiv (Cornell University)","work_id":"d4cb9453-e97b-43c7-a239-ec164268ca4f","year":2024},"citing_paper":{"arxiv_id":"2606.22681","last_updated":"2026-06-21T21:46:41Z","snapshot_observed_at":"2026-08-01T21:45:47.385301Z","submitted_at":"2026-06-21T21:46:41Z","title":"Only Ask What You Don't Know: Grounded Delta Planning for Efficient Multi-step RAG","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-26T10:10:16.661082Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2606.22681"},"observation_digest":"sha256:c565af4b17ecb7c01aa205cfa4d1e9a0e591ee4dc9c9d8bffcc0c3686924b856","observation_id":"db9aef6c-bfa3-49ad-a7dc-56134ef4abd3","resolution":{"observed_at":"2026-06-26T10:29:19.148598Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-01T23:46:25.362456Z","title":"arXiv preprint arXiv:2410.20753 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15257","last_updated":"2026-07-16T17:51:23Z","snapshot_observed_at":"2026-08-08T02:15:17.714780Z","submitted_at":"2026-07-16T17:51:23Z","title":"SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T23:46:25.362456Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2607.15257"},"observation_digest":"sha256:15d39bdc4d340b4d0fa6c5b5a21506943ee9cce47ca3fb07d1b402c59a41763f","observation_id":"fa4ec57a-edeb-4162-a773-69db2a3e1365","resolution":{"observed_at":"2026-08-01T23:46:25.362456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-08-01T13:54:22.646220Z","title":"arXiv preprint arXiv:2410.20753 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18979","last_updated":"2026-07-21T11:14:33Z","snapshot_observed_at":"2026-08-06T13:13:54.204332Z","submitted_at":"2026-07-21T11:14:33Z","title":"Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T13:54:22.646220Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2607.18979"},"observation_digest":"sha256:6b20fb284ae97c8ecfbfb1a29f9ab82181dbd7fde2cb9ed1bfebbf56df8b8896","observation_id":"f793436a-3a80-45eb-9095-f2f408dc6214","resolution":{"observed_at":"2026-08-01T13:54:22.646220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20753","snapshot_observed_at":"2026-07-30T11:12:00.237119Z","title":"arXiv preprint arXiv:2410.20753 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27136","last_updated":"2026-07-29T17:07:37Z","snapshot_observed_at":"2026-08-08T11:22:32.161850Z","submitted_at":"2026-07-29T17:07:37Z","title":"KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-30T11:12:00.237119Z"},"links":{"cited_paper":"/paper/2410.20753","citing_paper":"/paper/2607.27136"},"observation_digest":"sha256:af2415d1e2f09213cd2e3ca49af4a4d74a620251d131d516d67545871d44de7c","observation_id":"00d4526a-fec8-4bb6-921f-be3df9b40c80","resolution":{"observed_at":"2026-07-30T11:12:00.237119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.20753/citation-record","integrity":"/paper/2410.20753/integrity","json":"/paper/2410.20753/citation-record.json","paper":"/paper/2410.20753"},"outbound":[],"paper":{"arxiv_id":"2410.20753","last_updated":"2025-02-04T15:30:36Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T17:29:28.578703Z","submitted_at":"2024-10-28T05:35:04Z","title":"Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2410.20753."}