{"as_of":"2026-08-21T09:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0adaaf81739ac4e644564e9f4259622d1511dde204416d313e3d0ffb0cccd2c8","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":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":41,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:50:27.795731Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T13:57:06.984595Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_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},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-05-24T05:10:25.171044Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2312.10997"},"observation_digest":"sha256:c5080c9bf8f50a6bdfe444736f34dba877bbbdbf2eee1daf8df4196c4e0719ea","observation_id":"fc0d8d88-2b16-4114-9e64-ef59b9b675d2","resolution":{"observed_at":"2026-05-24T05:13:57.103952Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-12T10:37:50.901670Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.19064","last_updated":"2024-11-28T11:24:43Z","snapshot_observed_at":"2026-08-19T12:48:28.493516Z","submitted_at":"2024-11-28T11:24:43Z","title":"Way to Specialist: Closing Loop Between Specialized LLM and Evolving Domain Knowledge Graph","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T10:37:50.901670Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2411.19064"},"observation_digest":"sha256:2303067dcc1291084cc3a007c473d4186dcc38de11b1bffcaad73cc3fff36c90","observation_id":"ea40bd12-772a-4416-b837-9e32a90e2c8e","resolution":{"observed_at":"2026-08-12T10:37:50.901670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-11T18:44:08.916727Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07618","last_updated":"2024-12-20T03:12:49Z","snapshot_observed_at":"2026-08-15T18:29:48.721484Z","submitted_at":"2024-12-10T15:56:03Z","title":"Adapting to Non-Stationary Environments: Multi-Armed Bandit Enhanced Retrieval-Augmented Generation on Knowledge Graphs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T18:44:08.916727Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2412.07618"},"observation_digest":"sha256:676a8992a34adc8dc7d38bd5b73257b4ad557b00b0bd56f8d98587f203033a86","observation_id":"ad2ef0dc-ea7c-47d7-9f1f-e227cd3833e7","resolution":{"observed_at":"2026-08-11T18:44:08.916727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-11T15:47:29.436774Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10654","last_updated":"2024-12-14T02:51:47Z","snapshot_observed_at":"2026-08-15T08:46:48.480415Z","submitted_at":"2024-12-14T02:51:47Z","title":"Thinking with Knowledge Graphs: Enhancing LLM Reasoning Through Structured Data","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:47:29.436774Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2412.10654"},"observation_digest":"sha256:9d4c09b4db2ae632ea40dc166d9758641d99ed5c20041d62f6e55daf04a78c06","observation_id":"7b33ea17-926d-4aca-8383-c5f01d16971b","resolution":{"observed_at":"2026-08-11T15:47:29.436774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-10T23:21:34.173440Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20995","last_updated":"2024-12-30T14:58:46Z","snapshot_observed_at":"2026-08-18T17:10:45.706834Z","submitted_at":"2024-12-30T14:58:46Z","title":"KARPA: A Training-free Method of Adapting Knowledge Graph as References for Large Language Model's Reasoning Path Aggregation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T23:21:34.173440Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2412.20995"},"observation_digest":"sha256:60b86a7b5ea05a80af41d2ad986e70c25b0063d9b51a0c23300328944bbc4f50","observation_id":"ec4759cb-79c8-4270-ac88-13240b6440e3","resolution":{"observed_at":"2026-08-10T23:21:34.173440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2501.00309","last_updated":"2025-01-08T05:16:25Z","snapshot_observed_at":"2026-08-15T15:30:31.504538Z","submitted_at":"2024-12-31T06:59:35Z","title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","version":2},"reference_index":272,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:7c20a83fc2d3f7fcbb605c0c48f571d8b3c6318ef8097fc30433d3d7eda02848","observation_id":"ccc06b0b-06e8-4f2a-85ad-e2e3fae1fdbc","resolution":{"observed_at":"2026-05-18T04:33:39.757007Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-10T22:17:53.825489Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02226","last_updated":"2025-05-28T09:34:22Z","snapshot_observed_at":"2026-08-17T13:02:06.466068Z","submitted_at":"2025-01-04T08:16:23Z","title":"Knowledge Graph Retrieval-Augmented Generation for LLM-based Recommendation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T22:17:53.825489Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2501.02226"},"observation_digest":"sha256:1dafb3ebdbcc58a26f3bc331d9facaa4f4225ad7acfcd9d03bb133594251b49e","observation_id":"68bb11fe-30f0-4d91-b3b1-6c42f18e414a","resolution":{"observed_at":"2026-08-10T22:17:53.825489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-10T19:35:35.315064Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09957","last_updated":"2025-01-22T13:42:26Z","snapshot_observed_at":"2026-08-18T07:26:56.956541Z","submitted_at":"2025-01-17T05:19:14Z","title":"FRAG: A Flexible Modular Framework for Retrieval-Augmented Generation based on Knowledge Graphs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T19:35:35.315064Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2501.09957"},"observation_digest":"sha256:3e337b6d980975b2a6487280d3058a3a57d7336720c8e97d14a7edce9c3500a5","observation_id":"ef0efe87-c4d4-42ac-9b90-aefb9e9614ef","resolution":{"observed_at":"2026-08-10T19:35:35.315064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-10T18:34:59.757119Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13947","last_updated":"2025-05-01T03:29:50Z","snapshot_observed_at":"2026-08-18T04:16:07.155571Z","submitted_at":"2025-01-19T23:25:21Z","title":"A Comprehensive Survey on Integrating Large Language Models with Knowledge-Based Methods","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.757119Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2501.13947"},"observation_digest":"sha256:79fac300ffeb45996a7d0d42f3576357b92dfcedd0ffe9ae7a3acb8d1af6787e","observation_id":"64dc3ab9-4f72-4d92-9346-26930b0a3826","resolution":{"observed_at":"2026-08-10T18:34:59.757119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2501.17549","last_updated":"2026-05-18T07:20:23Z","snapshot_observed_at":"2026-08-16T23:49:33.805412Z","submitted_at":"2025-01-29T10:35:41Z","title":"Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T04:36:06.247071Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2501.17549"},"observation_digest":"sha256:e09a5f2779593e8f04e8817b5c0372fa660b09cc99a1c5ae752fb3d42ae455eb","observation_id":"1d35128c-37df-418b-9f47-087aed305cc6","resolution":{"observed_at":"2026-05-23T04:37:32.125626Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-08T23:56:16.849889Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04413","last_updated":"2025-06-27T12:06:42Z","snapshot_observed_at":"2026-08-13T11:33:15.231169Z","submitted_at":"2025-02-06T12:27:35Z","title":"MedRAG: Enhancing Retrieval-augmented Generation with Knowledge Graph-Elicited Reasoning for Healthcare Copilot","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T23:56:16.849889Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2502.04413"},"observation_digest":"sha256:ee7b4365276b0a73baee8155c48c6c3a48d23b55f60f35e27619c20723226138","observation_id":"8aeca402-dda5-4ae3-b49c-b11885f44130","resolution":{"observed_at":"2026-08-08T23:56:16.849889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2502.09891","last_updated":"2026-05-11T03:00:07Z","snapshot_observed_at":"2026-08-14T10:51:21.684930Z","submitted_at":"2025-02-14T03:28:36Z","title":"ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-23T03:28:13.313028Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2502.09891"},"observation_digest":"sha256:225a4590fc8ccdc0bd12b57fb84a8cab5aa48a08bc82c37f1179d82a753326bd","observation_id":"de0cf129-9dae-4c40-a434-92e4aa6d47fa","resolution":{"observed_at":"2026-05-23T03:32:28.608947Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2503.04338","last_updated":"2026-04-27T08:04:44Z","snapshot_observed_at":"2026-08-18T18:27:34.060489Z","submitted_at":"2025-03-06T11:34:49Z","title":"In-depth Analysis of Graph-based RAG in a Unified Framework","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-23T01:36:25.057478Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2503.04338"},"observation_digest":"sha256:c37795c00d099860edb310db6d688052b2e6bc02d572b34efd0a3f57e0d83aaa","observation_id":"11e222f4-741e-4a9a-864c-fb12ca5653a9","resolution":{"observed_at":"2026-05-23T01:37:22.137870Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-16T11:50:27.795731Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.14520","last_updated":"2025-04-20T07:34:26Z","snapshot_observed_at":"2026-08-18T07:29:47.820993Z","submitted_at":"2025-04-20T07:34:26Z","title":"Meta-Thinking in LLMs via Multi-Agent Reinforcement Learning: A Survey","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:50:27.795731Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2504.14520"},"observation_digest":"sha256:8e466a670e8c2a456d7b6142c4a98e09efe73c140f6e697e7c4345e8530b5133","observation_id":"18d80309-24b0-459c-9331-679058f8a2bd","resolution":{"observed_at":"2026-08-16T11:50:27.795731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-15T20:38:09.384379Z","title":"Reasoning on graphs: Faith- ful and interpretable large language model reasoning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.12476","last_updated":"2025-05-18T15:52:57Z","snapshot_observed_at":"2026-08-18T09:39:44.918280Z","submitted_at":"2025-05-18T15:52:57Z","title":"Enhancing Large Language Models with Reward-guided Tree Search for Knowledge Graph Question and Answering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:38:09.384379Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.12476"},"observation_digest":"sha256:1b3b5c051df5c2d162c489c6488caf6cc5c13fc7fe952ea4972cb9cf8bacbb57","observation_id":"b36d8f69-0fba-4292-bab0-9821e2909d06","resolution":{"observed_at":"2026-08-15T20:38:09.384379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-15T22:36:25.197214Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13479","last_updated":"2025-05-11T00:17:26Z","snapshot_observed_at":"2026-08-18T07:29:24.663338Z","submitted_at":"2025-05-11T00:17:26Z","title":"RTL++: Graph-enhanced LLM for RTL Code Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T22:36:25.197214Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.13479"},"observation_digest":"sha256:3b5d2288dc487f5e2edec5eab3b42292aae94a406a9c372e64d87516829fdb34","observation_id":"494a654b-63b5-486f-b366-2ce34cae114a","resolution":{"observed_at":"2026-08-15T22:36:25.197214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T15:36:50.106129Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14629","last_updated":"2025-05-20T17:19:57Z","snapshot_observed_at":"2026-08-18T07:29:45.240549Z","submitted_at":"2025-05-20T17:19:57Z","title":"KERL: Knowledge-Enhanced Personalized Recipe Recommendation using Large Language Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:50.106129Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.14629"},"observation_digest":"sha256:eca59d2b3133ae1de0bee594db450e372f58846b7aa65574634f970f0a5e2cf4","observation_id":"fd9bb0da-2979-4cd5-a66c-ae6f7a807c1e","resolution":{"observed_at":"2026-08-07T15:36:50.106129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T14:18:48.828059Z","title":"In Proceedings of the AAAI conference on artificial in- telligence, volume 38, pages 18608–18616","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19410","last_updated":"2025-05-26T01:59:00Z","snapshot_observed_at":"2026-08-18T07:29:46.306157Z","submitted_at":"2025-05-26T01:59:00Z","title":"Self-Reflective Planning with Knowledge Graphs: Enhancing LLM Reasoning Reliability for Question Answering","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:48.828059Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.19410"},"observation_digest":"sha256:93d87c6f1e4df6b320911eeaa225172a866b51ba5ec1518cd2e0f70ee532084e","observation_id":"e1f1f7a2-d804-43a5-9e54-3544ed7f80e2","resolution":{"observed_at":"2026-08-07T14:18:48.828059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T14:18:42.245889Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning.arXiv preprint arXiv:2310.01061, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19473","last_updated":"2025-05-26T03:52:41Z","snapshot_observed_at":"2026-08-16T15:28:54.961130Z","submitted_at":"2025-05-26T03:52:41Z","title":"Improving Recommendation Fairness without Sensitive Attributes Using Multi-Persona LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:42.245889Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.19473"},"observation_digest":"sha256:758d71e1b784a00df936275587a3fd5dc545078d44e36fb19789bf57e76f69d2","observation_id":"f8be77ac-50e2-473c-bfd3-e5a1b292cf2e","resolution":{"observed_at":"2026-08-07T14:18:42.245889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T12:51:34.903463Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning.arXiv preprint arXiv:2310.01061, 2023a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23442","last_updated":"2025-05-29T13:39:18Z","snapshot_observed_at":"2026-08-17T21:17:14.673037Z","submitted_at":"2025-05-29T13:39:18Z","title":"Rethinking Regularization Methods for Knowledge Graph Completion","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T12:51:34.903463Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.23442"},"observation_digest":"sha256:fb8bed740281eecbb61da8c725df59754571c637f68f698e55f193770fdf1990","observation_id":"af906bb3-7a1b-4ad8-85a8-365302b35c68","resolution":{"observed_at":"2026-08-07T12:51:34.903463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T12:24:17.191085Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24478","last_updated":"2025-05-30T11:27:59Z","snapshot_observed_at":"2026-08-14T13:49:22.074679Z","submitted_at":"2025-05-30T11:27:59Z","title":"Optimizing the Interface Between Knowledge Graphs and LLMs for Complex Reasoning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:17.191085Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.24478"},"observation_digest":"sha256:74d0b5dd1baf57062daa19e9d8e9fe8bbf5e374562a45e16fad94ff7ae2fe308","observation_id":"65861c8d-207e-4a18-a465-dc6613b5c3a8","resolution":{"observed_at":"2026-08-07T12:24:17.191085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T12:27:45.124911Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24479","last_updated":"2025-05-30T11:29:10Z","snapshot_observed_at":"2026-08-19T02:31:00.726192Z","submitted_at":"2025-05-30T11:29:10Z","title":"Leveraging Knowledge Graphs and LLMs for Structured Generation of Misinformation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:45.124911Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2505.24479"},"observation_digest":"sha256:ac19b6fca27f99906e719a8d16f561fc2f603c7775aacc78c5c329e944910cd1","observation_id":"0a78ce93-f31c-47e9-8aa0-443defcdcd70","resolution":{"observed_at":"2026-08-07T12:27:45.124911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T12:13:00.673773Z","title":"arXiv preprint arXiv:2310.01061","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00261","last_updated":"2025-06-03T02:07:40Z","snapshot_observed_at":"2026-08-15T22:25:53.816084Z","submitted_at":"2025-05-30T21:50:29Z","title":"GPR: Empowering Generation with Graph-Pretrained Retriever","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:00.673773Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2506.00261"},"observation_digest":"sha256:47062303ddd14e4701ab33a5c09a6b9da3f3be9b34085ded38c595e3f1ec6a96","observation_id":"fa7c700b-5e6f-4100-861d-25e37f480757","resolution":{"observed_at":"2026-08-07T12:13:00.673773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2506.06211","last_updated":"2026-04-21T03:40:06Z","snapshot_observed_at":"2026-08-16T03:59:33.200708Z","submitted_at":"2025-06-06T16:17:09Z","title":"PuzzleWorld: A Benchmark for Multimodal, Open-Ended Reasoning in Puzzlehunts","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T10:43:02.601014Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2506.06211"},"observation_digest":"sha256:06074cb08952371cbd1752cc6f3db6a0f7f165a83e41c96ee8e59c19685cb7aa","observation_id":"d27c25f7-e2e8-41c8-9603-cbc067625ada","resolution":{"observed_at":"2026-05-19T10:47:15.198489Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-07T00:42:58.017883Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13178","last_updated":"2025-06-16T07:43:18Z","snapshot_observed_at":"2026-08-09T02:30:57.581405Z","submitted_at":"2025-06-16T07:43:18Z","title":"Enhancing Large Language Models with Reliable Knowledge Graphs","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T00:42:58.017883Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2506.13178"},"observation_digest":"sha256:4603ebd80c91d238bf3f620cd58d0d1e2878e558eae515f02299c0fb2ed512e7","observation_id":"e6a20bb9-f476-461a-8e98-90dfa8d8be97","resolution":{"observed_at":"2026-08-07T00:42:58.017883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-06T22:31:35.075688Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22518","last_updated":"2025-06-26T17:40:23Z","snapshot_observed_at":"2026-08-16T06:37:13.704979Z","submitted_at":"2025-06-26T17:40:23Z","title":"Weak-to-Strong GraphRAG: Aligning Weak Retrievers with Large Language Models for Graph-based Retrieval Augmented Generation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T22:31:35.075688Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2506.22518"},"observation_digest":"sha256:f64e9505e3110b9d12ecf1d66a271ea70a648897f1492c0d18e1cc69dfb3fc27","observation_id":"37d261e0-6b9b-4b00-8b0a-1034122a7596","resolution":{"observed_at":"2026-08-06T22:31:35.075688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-06T20:58:52.402489Z","title":"Luo, Y.-F","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03001","last_updated":"2025-07-02T00:53:54Z","snapshot_observed_at":"2026-08-18T07:29:48.498378Z","submitted_at":"2025-07-02T00:53:54Z","title":"Evaluating Hierarchical Clinical Document Classification Using Reasoning-Based LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:58:52.402489Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2507.03001"},"observation_digest":"sha256:9a957d07742cf674646326bc94c6229dd06ca7ce80df601dece8feb0ef2e67b1","observation_id":"0c6e034b-0e83-41e7-a3cc-5d8ac4b0c9a8","resolution":{"observed_at":"2026-08-06T20:58:52.402489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-06T18:24:51.799161Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08432","last_updated":"2025-07-11T09:18:41Z","snapshot_observed_at":"2026-08-15T20:00:37.185273Z","submitted_at":"2025-07-11T09:18:41Z","title":"xpSHACL: Explainable SHACL Validation using Retrieval-Augmented Generation and Large Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.799161Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2507.08432"},"observation_digest":"sha256:f1e6a1bb9eb84d8c8ce629cadce1efe74719ed9baed6db5c45712e7da213039b","observation_id":"a17cb461-fe7c-4569-ac63-acca45eab0c0","resolution":{"observed_at":"2026-08-06T18:24:51.799161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-06T14:56:30.197754Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17273","last_updated":"2025-07-23T07:18:55Z","snapshot_observed_at":"2026-08-18T07:29:45.823157Z","submitted_at":"2025-07-23T07:18:55Z","title":"Leveraging Knowledge Graphs and LLM Reasoning to Identify Operational Bottlenecks for Warehouse Planning Assistance","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T14:56:30.197754Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2507.17273"},"observation_digest":"sha256:da169d3d28e1eaa3cdd99dc5d883152333627e71f5d30af68db10db684c6d812","observation_id":"c2575299-7b37-4235-8ac1-8b6d382df842","resolution":{"observed_at":"2026-08-06T14:56:30.197754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-05T15:29:57.412658Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.19855","last_updated":"2025-09-03T02:56:22Z","snapshot_observed_at":"2026-08-08T12:20:20.696893Z","submitted_at":"2025-08-27T13:13:20Z","title":"Youtu-GraphRAG: Vertically Unified Agents for Graph Retrieval-Augmented Complex Reasoning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:29:57.412658Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2508.19855"},"observation_digest":"sha256:c72d6a9f988d0de8758aee2bf450765df6b92a500b9ba911461cb316496ebfed","observation_id":"9859a2ef-9d7c-424d-b5c6-f4945c981016","resolution":{"observed_at":"2026-08-05T15:29:57.412658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-05T13:36:38.555839Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00449","last_updated":"2025-08-30T10:44:06Z","snapshot_observed_at":"2026-08-18T02:22:51.928015Z","submitted_at":"2025-08-30T10:44:06Z","title":"GOSU: Retrieval-Augmented Generation with Global-Level Optimized Semantic Unit-Centric Framework","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T13:36:38.555839Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2509.00449"},"observation_digest":"sha256:c849ec52bc8032b7e8cb29624233265bd791c8d7430d82652cd52523a9f709dc","observation_id":"31d97466-dd4d-4c62-9671-97d3643557c0","resolution":{"observed_at":"2026-08-05T13:36:38.555839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-04T19:24:53.032523Z","title":"F., Haffari, G., & Pan, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09272","last_updated":"2025-09-11T09:02:15Z","snapshot_observed_at":"2026-08-20T17:33:20.364005Z","submitted_at":"2025-09-11T09:02:15Z","title":"Fusing Knowledge and Language: A Comparative Study of Knowledge Graph-Based Question Answering with LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T19:24:53.032523Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2509.09272"},"observation_digest":"sha256:ad0c25766c7bdbed9a4bf7e04f3125d8fd24fb4e63c35a4de7714a19ac8048c1","observation_id":"0045545f-6db0-4233-9c9f-c1a50e2fd9d5","resolution":{"observed_at":"2026-08-04T19:24:53.032523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2509.23330","last_updated":"2026-05-01T04:31:12Z","snapshot_observed_at":"2026-08-11T14:10:26.093121Z","submitted_at":"2025-09-27T14:34:19Z","title":"Structured In-context Environment Scaling for Large Language Model Reasoning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T12:23:15.257737Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2509.23330"},"observation_digest":"sha256:80adc7932b5e7eff54dd414c775947dd695198d201ae4e6e754309f6ecd0ec5d","observation_id":"b9293ff0-72a1-4c0a-adc7-10865854a3ec","resolution":{"observed_at":"2026-05-18T12:26:22.279728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2509.26383","last_updated":"2026-05-22T06:49:31Z","snapshot_observed_at":"2026-08-19T06:15:20.517523Z","submitted_at":"2025-09-30T15:14:24Z","title":"Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-25T07:44:05.582003Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2509.26383"},"observation_digest":"sha256:7a7c24563ac9afd113c7dbfa0ecbe7328d8265f17ec0c00b50befb3e39c0e7a9","observation_id":"b574cb70-4e70-48cf-bb9b-2febfaacf70b","resolution":{"observed_at":"2026-05-25T07:45:28.978802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-08-03T17:26:46.374545Z","title":"Reasoning on graphs: Faith- ful and interpretable large language model reasoning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.10999","last_updated":"2026-06-22T03:58:27Z","snapshot_observed_at":"2026-08-13T08:24:03.041800Z","submitted_at":"2025-12-10T17:45:42Z","title":"KBQA-R1: Reinforcing Large Language Models for Knowledge Base Question Answering","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T17:26:46.374545Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2512.10999"},"observation_digest":"sha256:55ba3dbdf735f0e972cbc0291751149dc6d25ee2ca70fbc460e6a29c7aaff9d9","observation_id":"6d4248c2-d233-4f6b-ac02-8960210f922c","resolution":{"observed_at":"2026-08-03T17:26:46.374545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2604.18362","last_updated":"2026-04-20T14:51:43Z","snapshot_observed_at":"2026-08-13T12:32:28.802562Z","submitted_at":"2026-04-20T14:51:43Z","title":"ArbGraph: Conflict-Aware Evidence Arbitration for Reliable Long-Form Retrieval-Augmented Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T04:51:20.787489Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2604.18362"},"observation_digest":"sha256:2826301b99a8e6a2d44e0e54f0580385e1369265f5b10f3f8a2ba0960fd7f6aa","observation_id":"34ee6f0f-2c86-4a2b-b649-145791d9c499","resolution":{"observed_at":"2026-05-10T11:30:19.593834Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2606.03102","last_updated":"2026-06-02T03:42:04Z","snapshot_observed_at":"2026-08-11T22:46:29.104838Z","submitted_at":"2026-06-02T03:42:04Z","title":"Small RL Controller, Large Language Model: RL-Guided Adaptive Sampling for Test-Time Scaling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T10:25:10.559953Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2606.03102"},"observation_digest":"sha256:58d016c2cb2e3099babcba7dca1fa1f386cc5d189a5cc977131e21dbb2e3c47e","observation_id":"4eed8b83-1b71-484f-b1d6-6ace30b2be44","resolution":{"observed_at":"2026-07-02T02:56:29.942136Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2606.26458","last_updated":"2026-06-24T23:38:42Z","snapshot_observed_at":"2026-08-16T15:36:17.486303Z","submitted_at":"2026-06-24T23:38:42Z","title":"MKG-RAG-Bench: Benchmarking Retrieval in Multimodal Knowledge Graph-Augmented Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T01:11:45.657964Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2606.26458"},"observation_digest":"sha256:2e2c9e558614038cfcc0b2b86a339d615f2ce0c6370c0869411363091f20d46b","observation_id":"ec83d2f0-eed0-4892-89a3-52cf7a8e994c","resolution":{"observed_at":"2026-07-04T15:59:56.614250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2607.00052","last_updated":"2026-06-30T01:23:09Z","snapshot_observed_at":"2026-08-02T17:58:34.671249Z","submitted_at":"2026-06-30T01:23:09Z","title":"AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-02T18:01:48.915707Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2607.00052"},"observation_digest":"sha256:fa248ff216b25c9807a24fcc331495789103787bcf4a91b28738b60a48bdbc07","observation_id":"aeb4fcf9-6c21-418c-b7ea-85ff458071b5","resolution":{"observed_at":"2026-07-02T18:47:17.212675Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":"2310.01061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-10T13:57:06.984595Z","title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","venue":"cs.CL","work_id":"dae74763-39c1-4c73-889d-4634a1621914","year":2023},"citing_paper":{"arxiv_id":"2607.08009","last_updated":"2026-07-09T00:27:07Z","snapshot_observed_at":"2026-08-13T06:08:17.610900Z","submitted_at":"2026-07-09T00:27:07Z","title":"From Execution to Education: A Bloom-Aligned Framework for Measuring Educational Control in LLMs","version":1},"reference_index":103,"source":"arxiv_source","source_observed_at":"2026-07-10T13:49:17.343893Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2607.08009"},"observation_digest":"sha256:9f62ffe2c79d743e15be432fb3783d202d723fcd027c5bc2690bea382ab0f32b","observation_id":"a56dc3eb-96c5-4914-810f-3ad406271dc6","resolution":{"observed_at":"2026-07-10T13:57:06.985964Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01061","snapshot_observed_at":"2026-07-30T11:11:56.610743Z","title":"arXiv preprint arXiv:2310.01061 , 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-18T13:18:31.177275Z","submitted_at":"2026-07-29T17:07:37Z","title":"KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-30T11:11:56.610743Z"},"links":{"cited_paper":"/paper/2310.01061","citing_paper":"/paper/2607.27136"},"observation_digest":"sha256:5dee342411cfaaa71fe3bc0643c84fb13330543c8fb83e66c17e7b6e44570bac","observation_id":"81ef0e94-032e-48ec-a28c-f2b29e08a4a2","resolution":{"observed_at":"2026-07-30T11:11:56.610743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.01061/citation-record","integrity":"/paper/2310.01061/integrity","json":"/paper/2310.01061/citation-record.json","paper":"/paper/2310.01061"},"outbound":[],"paper":{"arxiv_id":"2310.01061","last_updated":"2024-02-24T03:03:12Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-21T04:20:15.607381Z","submitted_at":"2023-10-02T10:14:43Z","title":"Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 41 inbound Pith citation observations for arXiv:2310.01061."}