{"as_of":"2026-08-17T04:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2d8a9cea69f29f24d66cfc34ae0b719c1ff3d2a4376b85ed4835abd750d65a5","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:16:33.127876Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T09:11:43.179956Z","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-05-21T09:14:05.808483Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"cited_work":{"arxiv_id":"2507.08945","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.08945","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dantanarayana, Kriszti´an Flautner, Lingjia Tang, and Jason Mars","venue":null,"work_id":"182f8345-139d-429a-9ad4-b6ffdce020f7","year":2025},"citing_paper":{"arxiv_id":"2603.01410","last_updated":"2026-04-15T12:49:26Z","snapshot_observed_at":"2026-08-11T13:51:16.081832Z","submitted_at":"2026-03-02T03:25:40Z","title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-15T18:47:06.207176Z"},"links":{"cited_paper":"/paper/2507.08945","citing_paper":"/paper/2603.01410"},"observation_digest":"sha256:3f7e4b9dce9bf8a4e8b93c1b3bff4c41cffb016b4313d813ea5c570fb7fb6bbc","observation_id":"801665a8-a4aa-4547-b350-9365a6f24bfb","resolution":{"observed_at":"2026-05-15T18:50:16.925339Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"cited_work":{"arxiv_id":"2507.08945","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.08945","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dantanarayana, Kriszti´an Flautner, Lingjia Tang, and Jason Mars","venue":null,"work_id":"182f8345-139d-429a-9ad4-b6ffdce020f7","year":2025},"citing_paper":{"arxiv_id":"2605.18760","last_updated":"2026-04-06T22:38:15Z","snapshot_observed_at":"2026-07-06T23:29:33.702647Z","submitted_at":"2026-04-06T22:38:15Z","title":"DOTRAG: Retrieval-Time Reasoning Along Paths","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T09:11:43.179956Z"},"links":{"cited_paper":"/paper/2507.08945","citing_paper":"/paper/2605.18760"},"observation_digest":"sha256:f9dd3f8bcb03d162d93b213bc29d9d2b8ec51e3bea9e0028a2fe218c200dca27","observation_id":"d527e5a3-7c41-4c64-9c95-b1de45a5c6c3","resolution":{"observed_at":"2026-05-21T09:14:05.811404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.08945/citation-record","integrity":"/paper/2507.08945/integrity","json":"/paper/2507.08945/citation-record.json","paper":"/paper/2507.08945"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:31.023681Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.023681Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:f2c5eb2f99e891430382ea52401ee1c5b9e6b16e35541690fc35c2e08df1d3b4","observation_id":"5d63eecf-a752-4078-a80f-63e89ff29b6a","resolution":{"observed_at":"2026-08-06T18:16:31.023681Z","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-06T18:16:31.129153Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.129153Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:2ee8e3c7dd25ecfbb59db19d4a57bf7faa1d204ac7ed4736cce94245a8ca0298","observation_id":"e864cd1f-eb72-4134-ad82-b2906f13538f","resolution":{"observed_at":"2026-08-06T18:16:31.129153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05845","last_updated":"2023-10-09T16:42:00Z","snapshot_observed_at":"2026-08-16T14:53:45.330716Z","submitted_at":"2023-10-09T16:42:00Z","title":"GraphLLM: Boosting Graph Reasoning Ability of Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05845","snapshot_observed_at":"2026-08-06T18:16:31.186261Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.186261Z"},"links":{"cited_paper":"/paper/2310.05845","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:42e8da4ef8a2cd520c741f6e2ab0c94fa9890e1baa9f4d138f57d64cda106354","observation_id":"b1ed546a-0648-478c-aac9-85dc2f213c38","resolution":{"observed_at":"2026-08-06T18:16:31.186261Z","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-06T18:16:31.241797Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.241797Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:7484828c2226acd62f1f929e0a4558a17344203fa0802cce65a42ae09fd6cdc0","observation_id":"a6c8ae22-633b-4e1f-b93c-4a8bb8244c44","resolution":{"observed_at":"2026-08-06T18:16:31.241797Z","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":"5103.36551","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:33.738108Z","title":null,"venue":null,"work_id":"207c1dc1-581e-4ab9-af93-d05b86cfb7d8","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.321570Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:c2011105e296880b4887a020c68cd4f37c1250f9d1a81531b80d6a2e751d64b8","observation_id":"de9ccac9-0d1e-4778-9735-d3c3bc6b1c23","resolution":{"observed_at":"2026-08-06T18:16:33.775748Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:35.119814Z","title":null,"venue":null,"work_id":"691ba5a5-7335-45d6-9403-b39bb7b303cf","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.399379Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:a6a14c45b47359a4d9ba2f13a616592f16cec913e939b0f177862b415f9c5b1f","observation_id":"2b82ea76-7be2-4a76-9b66-e4e1633232c6","resolution":{"observed_at":"2026-08-06T18:16:35.182707Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-06T18:16:31.442064Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.442064Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:61cab3e40dce4670c48ca2f96e8765d2efa01b3ada9df3d362b2c91faf073f20","observation_id":"118e771a-21f1-4970-8473-427049524805","resolution":{"observed_at":"2026-08-06T18:16:31.442064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04166","last_updated":"2023-02-13T16:19:05Z","snapshot_observed_at":"2026-08-05T08:58:00.258106Z","submitted_at":"2023-02-08T16:17:29Z","title":"GPTScore: Evaluate as You Desire","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04166","snapshot_observed_at":"2026-08-06T18:16:31.522550Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.522550Z"},"links":{"cited_paper":"/paper/2302.04166","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:72499e7e26a52ccd1e02bd6403e18ae57fabd9989d7838c285fea4a2d21df57e","observation_id":"2190252a-0c61-414e-a8db-d3e5f8070d7f","resolution":{"observed_at":"2026-08-06T18:16:31.522550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-06T18:16:31.580464Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.580464Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:789e4e04b8b6a75eec0f6b9af82220d1d35e6c5340d97ebee4f078713e319b7c","observation_id":"959eb52f-ab18-48f1-8e4b-1681340213bb","resolution":{"observed_at":"2026-08-06T18:16:31.580464Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.950269Z","title":null,"venue":null,"work_id":"4632375c-42c7-4e67-8995-5084f9cbe59d","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.666259Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:db8f4d8efff1301f3ca6f82033a4db3197edb592061790c179fd080afeb11e55","observation_id":"f418cd19-c54a-4d7a-890b-89a6dbf3ada7","resolution":{"observed_at":"2026-08-06T18:16:35.039369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T18:16:31.751169Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.751169Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:51a146e8f33c96ed9fdbd5e6bffb15ff26c08399f96af7c8d88193246c9316c8","observation_id":"9493e4b5-fbef-4b2a-8434-557ffb953575","resolution":{"observed_at":"2026-08-06T18:16:31.751169Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.858566Z","title":null,"venue":null,"work_id":"6b5c8a32-211c-4a87-8311-37205ff4d4e3","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.837945Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:a3a30b3c7066231c49ef1f42eee45608574951f5aed11de34db4adc71386e044","observation_id":"f6b2778b-74bd-47d1-a289-d76cd95e5dcb","resolution":{"observed_at":"2026-08-06T18:16:34.896956Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T18:16:31.923014Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.923014Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:c8821e8f41e76e313d7b5194b505de4e68d34c0549425fc9d22b3aa0a4578614","observation_id":"2989d607-1de8-4357-9cc5-a7e4a684d35b","resolution":{"observed_at":"2026-08-06T18:16:31.923014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07103","last_updated":"2024-10-03T13:55:08Z","snapshot_observed_at":"2026-08-16T14:02:01.627241Z","submitted_at":"2024-04-10T15:41:53Z","title":"Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07103","snapshot_observed_at":"2026-08-06T18:16:31.987520Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:31.987520Z"},"links":{"cited_paper":"/paper/2404.07103","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:c67c72770128f3c225f601540ae17c295518d60a270192fa2a9f5a9f55f5786c","observation_id":"4cbae3d5-fb93-468b-878f-4c979fd6f446","resolution":{"observed_at":"2026-08-06T18:16:31.987520Z","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-06T18:16:32.034716Z","title":"u ttler, Mike Lewis, Wen-tau Yih, Tim Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.034716Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:c9c452aa82d9093e0774ecce97f003384450afbbcf5ab50803d90532cea0d372","observation_id":"d6c57184-3044-41f9-825b-d6b094eab573","resolution":{"observed_at":"2026-08-06T18:16:32.034716Z","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-06T18:16:32.094451Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.094451Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:073a1ae7d231186d0e0ad323a17f3da564e5b96ff9b9c41dc95c9e1da99bb930","observation_id":"7d59bfa4-7650-44af-a681-bff20a1efd3c","resolution":{"observed_at":"2026-08-06T18:16:32.094451Z","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-06T18:16:32.197022Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.197022Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:0a17540b72c943cee013984d6252753543a9f5d38d329c775034b5f3e42f4819","observation_id":"04614e09-8c07-494e-a5b4-e33b57ac772f","resolution":{"observed_at":"2026-08-06T18:16:32.197022Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.595179Z","title":"Dual reasoning: A gnn-llm collaborative framework for knowledge graph question answering","venue":null,"work_id":"1febdd75-d479-4c97-a72a-a01b7a86f665","year":null},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.280095Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:19c973007dc609d863a85d6db3896d1f2f0b3821b2c8561052b3acb0374f9f2c","observation_id":"a957abee-e221-456e-8bfc-1f8fe4bafb8d","resolution":{"observed_at":"2026-08-06T18:16:34.659951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T18:16:32.356512Z","title":"Liu, Kevin Lin, John Hewitt, Ashwin Paranjape, Michele Bevilacqua, Fabio Petroni, and Percy Liang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.356512Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:1d4f0689b78451f58e22e73f6d4e6ac6b5d9afecc21ead99875ad64e360aa4b6","observation_id":"898638d4-15a2-4980-8d1e-35994b3f59f8","resolution":{"observed_at":"2026-08-06T18:16:32.356512Z","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-06T18:16:32.428657Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.428657Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:8ac9044d1ba77079a30bbc2a6b722e29cdad11d0530478b9a1ec6601f2b475ec","observation_id":"d8d5fc57-1530-4681-a8f1-34af521796db","resolution":{"observed_at":"2026-08-06T18:16:32.428657Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.447524Z","title":null,"venue":null,"work_id":"9c2742e8-513c-4aaa-9048-8e15986625cc","year":2025},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.496332Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:fdfdaf8fd0b7bb25bde5fd2682afab2ee638fd4c23f36e48101cda7ec1bd31f7","observation_id":"0e4a3ab0-6285-423a-a148-477778f4ffff","resolution":{"observed_at":"2026-08-06T18:16:34.496130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.296085Z","title":null,"venue":null,"work_id":"9e1aa5c2-7ec3-4752-b5eb-c0acb34e09ee","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.571079Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:533dda90c202c96b048fe0959239eda773e6bf740abb117f3a3e1a0d7dc5b9be","observation_id":"d323fe9a-cdf3-49ca-bcb9-30011f7f8a29","resolution":{"observed_at":"2026-08-06T18:16:34.358051Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.01066","last_updated":"2019-09-04T09:33:20Z","snapshot_observed_at":"2026-08-16T06:43:05.193260Z","submitted_at":"2019-09-03T11:11:08Z","title":"Language Models as Knowledge Bases?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01066","snapshot_observed_at":"2026-08-06T18:16:32.691058Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.691058Z"},"links":{"cited_paper":"/paper/1909.01066","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:e116227f5432dc366559aa802960548a612ac91f7161c8e2ea4d5d243b62a3e6","observation_id":"9bd5c918-d7a1-40e8-882d-167af31388c2","resolution":{"observed_at":"2026-08-06T18:16:32.691058Z","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-06T18:16:32.798839Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.798839Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:7bfbb3001a9e3c575d3d464574d1ccb873304e22e2d3e6f2d4cf3878d71aac3d","observation_id":"5e8ad4ae-331f-45bd-9823-defdeaa8b9e3","resolution":{"observed_at":"2026-08-06T18:16:32.798839Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:34.038040Z","title":null,"venue":null,"work_id":"43e36d6c-f0a1-48f3-8c81-8a5f2b25d8f6","year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.904962Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:a5b3afd5cb26726beb0805e1609b530507b5a9cf9f613c25ba0536bdc5a648b3","observation_id":"54d646da-5684-46f0-acdb-1f4843c2e847","resolution":{"observed_at":"2026-08-06T18:16:34.180030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:16:33.876859Z","title":null,"venue":null,"work_id":"80f07bbd-d201-41a7-80fc-fea0aa500805","year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:32.975420Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:afd8a7e08e5db585d944aec641b53e504cd53d444ad32c561a8e04fe307556a0","observation_id":"b65a48fa-bead-4321-ad08-3eb602635da2","resolution":{"observed_at":"2026-08-06T18:16:33.957771Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06T18:16:33.032785Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:33.032785Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:b71501a8069a527426d275ccba2bec9092776a6439bd1a07075b2adc9a73fda4","observation_id":"bebe0abd-ac05-42ff-a605-a7119346c91f","resolution":{"observed_at":"2026-08-06T18:16:33.032785Z","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-06T18:16:33.056774Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:33.056774Z"},"links":{"citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:e69a0f1a4ed63bbadd11ef7ed4ea71f7c08d871348f276d1770fa83bf686679e","observation_id":"b1860a24-5fbd-44c5-a148-ceca8519f359","resolution":{"observed_at":"2026-08-06T18:16:33.056774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11116","last_updated":"2023-05-11T06:00:03Z","snapshot_observed_at":"2026-08-16T15:41:40.619433Z","submitted_at":"2023-04-10T05:25:54Z","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Augmented by ChatGPT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11116","snapshot_observed_at":"2026-08-06T18:16:33.127876Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:16:33.127876Z"},"links":{"cited_paper":"/paper/2304.11116","citing_paper":"/paper/2507.08945"},"observation_digest":"sha256:e7fa4be8edfb467011ec971f602f9e071785c95501db011183aca416c0bbf5e1","observation_id":"a71905a6-9c0f-4685-87fb-3d03f048be13","resolution":{"observed_at":"2026-08-06T18:16:33.127876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.08945","last_updated":"2025-07-11T18:10:01Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-13T17:48:31.576461Z","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":29},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 2 inbound Pith citation observations for arXiv:2507.08945."}