{"as_of":"2026-08-22T23:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4efe11d640d9cd561ffd99817f3d9c8e32998c4e1badd1c386bed446c463352a","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:41:43.685968Z","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-07-03T13:28:19.014303Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-11T15:01:44.563295Z","title":"Graph-constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15256","last_updated":"2024-12-16T02:57:00Z","snapshot_observed_at":"2026-08-20T10:51:02.982077Z","submitted_at":"2024-12-16T02:57:00Z","title":"Structured Extraction of Real World Medical Knowledge using LLMs for Summarization and Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:01:44.563295Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2412.15256"},"observation_digest":"sha256:62aba347f0a734bf0eedfabe8f65fef47a83aa820c48cca75519dc169cd60dab","observation_id":"9ae33f44-fb7f-44f4-a063-a13fea94535e","resolution":{"observed_at":"2026-08-11T15:01:44.563295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"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":273,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:7bf1e04b8116c64190c3e250ea95e9b6970e5b85763b58bfbacd571e6ecddd52","observation_id":"bae89ab1-c0ba-434f-9ce9-c85b3876987d","resolution":{"observed_at":"2026-05-18T04:33:39.761694Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-15T23:41:43.685968Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04253","last_updated":"2025-05-07T08:58:52Z","snapshot_observed_at":"2026-08-19T13:45:19.579989Z","submitted_at":"2025-05-07T08:58:52Z","title":"LLM-Independent Adaptive RAG: Let the Question Speak for Itself","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T23:41:43.685968Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2505.04253"},"observation_digest":"sha256:db8e58bba67ba5d9117d39ad398037a5de55472244168f3fd1d659a03f74c4b4","observation_id":"3ffeaee9-2d05-40da-b1b0-09e694896b2e","resolution":{"observed_at":"2026-08-15T23:41:43.685968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-07T10:56:39.921322Z","title":"Elan Markowitz, Anil Ramakrishna, Jwala Dhamala, Ninareh Mehrabi, Charith Peris, Rahul Gupta, Kai- Wei Chang, and Aram Galstyan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03939","last_updated":"2025-06-04T13:31:21Z","snapshot_observed_at":"2026-08-20T04:55:32.095980Z","submitted_at":"2025-06-04T13:31:21Z","title":"Graph Counselor: Adaptive Graph Exploration via Multi-Agent Synergy to Enhance LLM Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:56:39.921322Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2506.03939"},"observation_digest":"sha256:758d52e26cbe260a3a83c78a369691fe45c4936448ea966db10672e00a98dc0a","observation_id":"3615e529-936c-4fad-b2b8-9628377db59c","resolution":{"observed_at":"2026-08-07T10:56:39.921322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-07T04:28:46.787064Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Lan- guage Models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10467","last_updated":"2025-07-19T20:15:06Z","snapshot_observed_at":"2026-08-22T08:37:42.169419Z","submitted_at":"2025-06-12T08:16:17Z","title":"Specification and Evaluation of Multi-Agent LLM Systems -- Prototype and Cybersecurity Applications","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:28:46.787064Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2506.10467"},"observation_digest":"sha256:c0dfa893cdbe0d28e3f73a50c206a69a168fa5e321915d0460806a7aeebbc343","observation_id":"dc7a2591-da29-4ff6-8cf4-24aaf1ca3299","resolution":{"observed_at":"2026-08-07T04:28:46.787064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-15T19:10:13.862869Z","title":"Graph-constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17589","last_updated":"2025-08-25T08:46:29Z","snapshot_observed_at":"2026-08-18T02:13:34.687437Z","submitted_at":"2025-06-21T05:01:02Z","title":"Taming the Untamed: Graph-Based Knowledge Retrieval and Reasoning for MLLMs to Conquer the Unknown","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:10:13.862869Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2506.17589"},"observation_digest":"sha256:4a6e7a86a669e0f9cb1844a4fe9e2e60adbd38654c58d785d163bdeebd13b7e3","observation_id":"207d29f7-57c5-4fa4-ac71-a26a41e9a17b","resolution":{"observed_at":"2026-08-15T19:10:13.862869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-06T20:11:10.670469Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03928","last_updated":"2025-07-05T07:23:15Z","snapshot_observed_at":"2026-08-14T23:17:24.199467Z","submitted_at":"2025-07-05T07:23:15Z","title":"CortexDebate: Debating Sparsely and Equally for Multi-Agent Debate","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T20:11:10.670469Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2507.03928"},"observation_digest":"sha256:c089d3dcafbe0fe60eacaa7911e67f412eafebc73a860e508a62248c3e9c1dc3","observation_id":"605a8fc0-8b73-4c80-9e06-0527e2e55e64","resolution":{"observed_at":"2026-08-06T20:11:10.670469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-06T19:59:56.031584Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04127","last_updated":"2025-07-05T18:47:14Z","snapshot_observed_at":"2026-08-13T17:01:52.694068Z","submitted_at":"2025-07-05T18:47:14Z","title":"BYOKG-RAG: Multi-Strategy Graph Retrieval for Knowledge Graph Question Answering","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T19:59:56.031584Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2507.04127"},"observation_digest":"sha256:bd4503cbfd765970c3a1e948c512dd264cd17b69277d814a02d2998d29f5afd5","observation_id":"c4f518d0-4d8a-47cf-af72-6a3181c736e3","resolution":{"observed_at":"2026-08-06T19:59:56.031584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-06T19:01:14.527048Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08862","last_updated":"2025-07-09T13:06:58Z","snapshot_observed_at":"2026-08-16T20:14:36.385136Z","submitted_at":"2025-07-09T13:06:58Z","title":"RAG Safety: Exploring Knowledge Poisoning Attacks to Retrieval-Augmented Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:01:14.527048Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2507.08862"},"observation_digest":"sha256:86a7d4edd1f6b6faf8a722385b40737148a86fe5de60847acc907dbd501618b3","observation_id":"da85568f-2a87-4192-a5a7-74542df8b2a5","resolution":{"observed_at":"2026-08-06T19:01:14.527048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-05T15:29:57.438731Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":null,"year":2024},"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":30,"source":"pdf_text","source_observed_at":"2026-08-05T15:29:57.438731Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2508.19855"},"observation_digest":"sha256:8f1ede2af78bf51c9ab8847c5c1cd986f82ec16afdf08d1e371b78926cfbd74e","observation_id":"06dfb000-e69e-4856-97fb-4e91f2cb509b","resolution":{"observed_at":"2026-08-05T15:29:57.438731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-04T18:13:45.816053Z","title":"Graph-constrained reasoning: Faithful reasoning on knowl- edge graphs with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10087","last_updated":"2025-09-12T09:28:29Z","snapshot_observed_at":"2026-08-15T22:33:06.021351Z","submitted_at":"2025-09-12T09:28:29Z","title":"Querying Climate Knowledge: Semantic Retrieval for Scientific Discovery","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T18:13:45.816053Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2509.10087"},"observation_digest":"sha256:571ae3d0f66c22f69988af6939f837dac6a2c89751729e333db38535c1317c1a","observation_id":"ba479b67-406b-4976-ad1e-f1f27b78c46b","resolution":{"observed_at":"2026-08-04T18:13:45.816053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2510.20505","last_updated":"2026-04-23T06:10:19Z","snapshot_observed_at":"2026-08-11T17:29:40.125548Z","submitted_at":"2025-10-23T12:48:18Z","title":"RELOOP: Recursive Retrieval with Multi-Hop Reasoner and Planners for Heterogeneous QA","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T04:55:03.309430Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2510.20505"},"observation_digest":"sha256:2f54d5e6f8c1f940e253e11f959ba22bfedc7f297e789b501fee45d72e9c2137","observation_id":"a133471a-e3e0-4cda-8536-86be9086db9b","resolution":{"observed_at":"2026-05-18T04:55:54.088240Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2604.06603","last_updated":"2026-04-08T02:38:22Z","snapshot_observed_at":"2026-07-06T22:55:01.863342Z","submitted_at":"2026-04-08T02:38:22Z","title":"Scientific Knowledge-driven Decoding Constraints Improving the Reliability of LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T18:26:52.994787Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2604.06603"},"observation_digest":"sha256:07de2bb5cfe3da49184007426ee6bf58df44b06ecc87fe816c878976da9872e6","observation_id":"67c78a7d-33f4-4c5e-be5e-113df507467b","resolution":{"observed_at":"2026-05-11T00:35:50.256182Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:9233d93032686917e3c3ab23cf855dced33d8390e27d8a87f42cebd9027a857d","observation_id":"7d842096-2393-477f-ab3a-36409ce98261","resolution":{"observed_at":"2026-05-10T01:10:09.351723Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2605.12204","last_updated":"2026-05-13T08:12:36Z","snapshot_observed_at":"2026-08-14T12:13:45.537627Z","submitted_at":"2026-05-12T14:43:35Z","title":"Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-13T03:57:38.184634Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2605.12204"},"observation_digest":"sha256:5c27189e2312bacdd432a9c833f9c0290c52b241d5d17db2a255cdba758a89a9","observation_id":"7ce4b62c-548f-4bcf-bc80-3bf2f48335af","resolution":{"observed_at":"2026-05-13T04:02:13.483237Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2605.12204","last_updated":"2026-05-13T08:12:36Z","snapshot_observed_at":"2026-08-14T12:13:45.537627Z","submitted_at":"2026-05-12T14:43:35Z","title":"Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-14T20:29:08.889696Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2605.12204"},"observation_digest":"sha256:9237a14d1b4fb99113129b83b044ec381be39d754a4afa8627fef57a2c038f78","observation_id":"b1476291-4b98-4942-9c79-cfa9c71c8a0e","resolution":{"observed_at":"2026-05-14T20:29:27.665949Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2606.11560","last_updated":"2026-06-10T01:39:41Z","snapshot_observed_at":"2026-08-22T10:35:05.883840Z","submitted_at":"2026-06-10T01:39:41Z","title":"LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T08:00:38.559294Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2606.11560"},"observation_digest":"sha256:c4c5ca133f575564617a644e64a547a2da97e0eaf6a4d62bc118b8ed78082205","observation_id":"2e2fe8ab-2269-40c9-901f-b8f47ba837b4","resolution":{"observed_at":"2026-07-03T13:28:19.016176Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-12T02:25:06.265447Z","title":"arXiv preprint arXiv:2410.13080 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03447","last_updated":"2026-07-03T16:01:20Z","snapshot_observed_at":"2026-08-21T03:03:37.438294Z","submitted_at":"2026-07-03T16:01:20Z","title":"TRIAGE: Trustworthy Retrieval Instrumentation And Graph Evaluation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T02:25:06.265447Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2607.03447"},"observation_digest":"sha256:f1d0e1db0faea0a987dc2f563968c1f46842c68ec599b259cbe6a5e229e3a1b7","observation_id":"ceb2ad64-6ae5-4ce4-b218-2567b7cf587f","resolution":{"observed_at":"2026-07-12T02:25:06.265447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-01T18:43:47.608800Z","title":"Under review","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17240","last_updated":"2026-07-19T13:11:18Z","snapshot_observed_at":"2026-08-19T09:54:52.319775Z","submitted_at":"2026-07-19T13:11:18Z","title":"Constrained Path Reasoning: Measuring When Committed Stages Earn Their Cost","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T18:43:47.608800Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2607.17240"},"observation_digest":"sha256:144ab938b66549f886b790bbe2cdfd4fbf5c7321ddf0cb3690d479ca2bce3ba6","observation_id":"c41188d9-b16c-4b36-957c-f76ede0b46bd","resolution":{"observed_at":"2026-08-01T18:43:47.608800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-31T00:46:10.300143Z","title":"Graph-constrained reasoning: Faithful reasoning on knowledge graphs with large language models.arXiv preprint arXiv:2410.13080, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27443","last_updated":"2026-07-29T20:14:43Z","snapshot_observed_at":"2026-08-14T08:46:40.314502Z","submitted_at":"2026-07-29T20:14:43Z","title":"Leveraging Trajectory Graphs for Pre-Execution Error Diagnosis in Agentic LLM Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T00:46:10.300143Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2607.27443"},"observation_digest":"sha256:03d03c3580756e21d91c400d2d89dd919ad856952deb735948e71d536cfbfc7f","observation_id":"ebe0af0c-e496-4d16-be25-08b991c10c08","resolution":{"observed_at":"2026-07-31T00:46:10.300143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-08-04T21:36:27.463694Z","title":"arXiv preprint arXiv:2410.13080 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01763","last_updated":"2026-08-03T06:34:31Z","snapshot_observed_at":"2026-08-20T12:51:29.843346Z","submitted_at":"2026-08-03T06:34:31Z","title":"EntailLLM: Verifying LLM-Generated Vulnerability Discovery Paths with Domain Knowledge via Logic Programming","version":1},"reference_index":180,"source":"arxiv_source","source_observed_at":"2026-08-04T21:36:27.463694Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2608.01763"},"observation_digest":"sha256:8cc3bbf89a4ebd6074ce0c6683a7aef24eaf4d29423e317eb72ba1a7380e9e94","observation_id":"92cba004-d7fe-4c7f-a199-677cc0bba8ee","resolution":{"observed_at":"2026-08-04T21:36:27.463694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.13080/citation-record","integrity":"/paper/2410.13080/integrity","json":"/paper/2410.13080/citation-record.json","paper":"/paper/2410.13080"},"outbound":[],"paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-21T22:56:22.841315Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2410.13080."}