{"as_of":"2026-08-08T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d94d38368406915370ebfcfe01e3738acde4cfe4a0c01e836e2eb42896b4e503","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":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:34:02.027496Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":13,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2501.00309","last_updated":"2025-01-08T05:16:25Z","snapshot_observed_at":"2026-08-07T12:37:34.294206Z","submitted_at":"2024-12-31T06:59:35Z","title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","version":2},"reference_index":109,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:0d466fb54347b60a5f84e69e9aec14ac739fd8ae4781a1278dd4c242b84d8ffd","observation_id":"cbb381d0-a935-4b4f-b073-82a13ad5a1bd","resolution":{"observed_at":"2026-05-18T04:33:39.273396Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2501.17549","last_updated":"2026-05-18T07:20:23Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-29T10:35:41Z","title":"Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T04:36:06.247071Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2501.17549"},"observation_digest":"sha256:e5ba988edd6c1f72fe1f538814d9254163d8864edd7b2106bc71e848d4121150","observation_id":"da20450c-9608-4e1f-87dd-e08c14c8cf7b","resolution":{"observed_at":"2026-05-23T04:37:32.010365Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-07T14:34:02.027496Z","title":"Talk like a graph: Encoding graphs for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18499","last_updated":"2025-08-19T01:33:43Z","snapshot_observed_at":"2026-08-08T06:34:29.525332Z","submitted_at":"2025-05-24T04:33:41Z","title":"G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:02.027496Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2505.18499"},"observation_digest":"sha256:9304d4f26175ebecd6dc6623a1850d298417487b4f9fd309b54bae3d932a27f0","observation_id":"22914956-008d-4a65-b9f6-e8ba5683db7c","resolution":{"observed_at":"2026-08-07T14:34:02.027496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-07T11:07:54.957481Z","title":"Fatemi, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03424","last_updated":"2025-06-03T22:10:39Z","snapshot_observed_at":"2026-08-07T11:00:57.276062Z","submitted_at":"2025-06-03T22:10:39Z","title":"DistRAG: Towards Distance-Based Spatial Reasoning in LLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:07:54.957481Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2506.03424"},"observation_digest":"sha256:071b4b79c7656991f9d407df6d1a8a3aa9416015e66a20fa9f06bddb3cb3e214","observation_id":"6d0b37d1-d721-4909-a798-65a0ceda5f8e","resolution":{"observed_at":"2026-08-07T11:07:54.957481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-07T11:09:40.500118Z","title":"Fatemi, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.05393","last_updated":"2025-06-03T19:34:24Z","snapshot_observed_at":"2026-08-07T11:03:09.916224Z","submitted_at":"2025-06-03T19:34:24Z","title":"Are Large Language Models Good Temporal Graph Learners?","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:40.500118Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2506.05393"},"observation_digest":"sha256:95c842b0206cd89d338f49f0c187199e7d49ef18df38a59ccac77a489af77bdd","observation_id":"539965fb-7e39-4feb-9d3b-345880d6cb6d","resolution":{"observed_at":"2026-08-07T11:09:40.500118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-06T21:06:54.843692Z","title":"James Fox, Tom Everitt, Ryan Carey, Eric D Langlois, Alessandro Abate, and Michael J Wooldridge","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.00979","last_updated":"2025-07-01T17:31:51Z","snapshot_observed_at":"2026-08-07T15:24:59.427105Z","submitted_at":"2025-07-01T17:31:51Z","title":"Enhancing LLM Agent Safety via Causal Influence Prompting","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T21:06:54.843692Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.00979"},"observation_digest":"sha256:00fe57b081ee4bc5de7f63ae350431bf701298bd630fbb722ec98da3546adf4b","observation_id":"f9e097b5-2808-4588-b28c-c23690e3e36e","resolution":{"observed_at":"2026-08-06T21:06:54.843692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-06T20:19:40.107131Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03410","last_updated":"2025-07-04T09:16:21Z","snapshot_observed_at":"2026-08-06T20:08:37.194395Z","submitted_at":"2025-07-04T09:16:21Z","title":"Graph Repairs with Large Language Models: An Empirical Study","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:19:40.107131Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.03410"},"observation_digest":"sha256:eeb439673efe26c3a47890f65ad694dc10c399b57ac5a1f596ec0178b66c50ee","observation_id":"fe4788c2-febe-4319-8b40-71b3aa174086","resolution":{"observed_at":"2026-08-06T20:19:40.107131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-06T17:11:48.190207Z","title":"Talk like a graph: Encoding graphs for large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11467","last_updated":"2025-07-15T16:39:12Z","snapshot_observed_at":"2026-08-06T17:05:12.943448Z","submitted_at":"2025-07-15T16:39:12Z","title":"Modeling Code: Is Text All You Need?","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:48.190207Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.11467"},"observation_digest":"sha256:607b7713880c0558866181b0110af4a20bfe83f7568176b1f67f53c3db1d0ba6","observation_id":"dd8a4f4d-350d-428d-a502-d3525614938c","resolution":{"observed_at":"2026-08-06T17:11:48.190207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2507.14785","last_updated":"2025-10-29T15:56:28Z","snapshot_observed_at":"2026-07-06T21:59:49.953885Z","submitted_at":"2025-07-20T02:00:21Z","title":"Exploring the In-Context Learning Capabilities of LLMs for Money Laundering Detection in Financial Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T03:55:56.563517Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.14785"},"observation_digest":"sha256:6138e42b0e76f3e893e66e1d9a69e0a320da00e800016ae5d33f8782cb6d58ab","observation_id":"edfc6670-6f87-4658-9afe-279e5059932b","resolution":{"observed_at":"2026-05-19T03:57:02.959443Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-06T12:36:02.023200Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.21653","last_updated":"2025-07-29T10:10:47Z","snapshot_observed_at":"2026-08-06T12:36:00.544371Z","submitted_at":"2025-07-29T10:10:47Z","title":"DGP: A Dual-Granularity Prompting Framework for Fraud Detection with Graph-Enhanced LLMs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T12:36:02.023200Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.21653"},"observation_digest":"sha256:ca0f0a9732403d8fbeb8b583d49f02429029633d094e5ad93e1d0748961f08e2","observation_id":"5bb9d5e6-9213-4690-89fa-bf0a03997f47","resolution":{"observed_at":"2026-08-06T12:36:02.023200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-06T11:59:51.481949Z","title":"Talk like a graph: Encoding graphs for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22955","last_updated":"2025-07-29T20:47:54Z","snapshot_observed_at":"2026-08-06T11:59:51.073186Z","submitted_at":"2025-07-29T20:47:54Z","title":"LLMs Between the Nodes: Community Discovery Beyond Vectors","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:59:51.481949Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2507.22955"},"observation_digest":"sha256:5da868da3340ca892efa5875ce8a57697a6faf668a58da1076ecc4a46c76a399","observation_id":"14dbac51-19f7-413a-bd21-4a2dff8f167c","resolution":{"observed_at":"2026-08-06T11:59:51.481949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-04T20:28:21.264767Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09732","last_updated":"2025-09-10T13:08:03Z","snapshot_observed_at":"2026-08-05T05:32:56.258258Z","submitted_at":"2025-09-10T13:08:03Z","title":"Decomposing Visual Classification: Assessing Tree-Based Reasoning in VLMs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T20:28:21.264767Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2509.09732"},"observation_digest":"sha256:4b042a25d583e227f7468b6275b2f364d6057780a810524ba07c61fbead884c8","observation_id":"c3ab1004-7899-47af-a827-4fe81b49e719","resolution":{"observed_at":"2026-08-04T20:28:21.264767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-04T12:53:27.089178Z","title":"arXiv preprint arXiv:2310.04560 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.01800","last_updated":"2026-06-01T07:45:51Z","snapshot_observed_at":"2026-08-07T19:29:31.688402Z","submitted_at":"2025-10-02T08:40:55Z","title":"REBot: From RAG to CatRAG with Semantic Enrichment and Graph Routing","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:27.089178Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2510.01800"},"observation_digest":"sha256:378ed7e4397ea53b87ec73c22e0f48ed37c4f7557a78e5605941551f910a2f7c","observation_id":"5669834d-477a-40f5-9299-06a981bffcfd","resolution":{"observed_at":"2026-08-04T12:53:27.089178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-03T22:31:35.757145Z","title":"Gilmer, J.; et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.10234","last_updated":"2026-06-09T15:26:01Z","snapshot_observed_at":"2026-08-03T22:31:32.178867Z","submitted_at":"2025-11-13T12:06:12Z","title":"Lost in Serialization: Invariance and Generalization of LLM Graph Reasoners","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T22:31:35.757145Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2511.10234"},"observation_digest":"sha256:63e0c875f474978f600e389e45a64eb7c144251648bfa45fa7bc178064779e8f","observation_id":"ca3542dc-d5cb-4d7f-b518-153c6b315be9","resolution":{"observed_at":"2026-08-03T22:31:35.757145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2602.04244","last_updated":"2026-05-07T12:31:58Z","snapshot_observed_at":"2026-07-06T22:44:28.488131Z","submitted_at":"2026-02-04T06:06:28Z","title":"GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T07:25:35.324582Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2602.04244"},"observation_digest":"sha256:5a59553e97362c93a8c7801ac4e6c5bb1948d0905ca4e011d4dad39c33112a56","observation_id":"fa20f041-5f10-4766-a7c2-57b25e23c3b6","resolution":{"observed_at":"2026-05-16T07:27:31.602468Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2603.01410","last_updated":"2026-04-15T12:49:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-03-02T03:25:40Z","title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T18:47:06.207176Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2603.01410"},"observation_digest":"sha256:24c4471cc34c9260558ccb04a7c075d4789d74455d77235efc2dd20d13698788","observation_id":"c5b819b5-4519-4869-8d86-1584958fbfe2","resolution":{"observed_at":"2026-05-15T18:50:17.011207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2604.17458","last_updated":"2026-04-21T06:43:15Z","snapshot_observed_at":"2026-07-06T23:04:32.734175Z","submitted_at":"2026-04-19T14:18:49Z","title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-10T05:43:04.813867Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2604.17458"},"observation_digest":"sha256:814b0fcb954f647975b197c2cc61d6d307f71f5a6a0df40fa7a275a290609af0","observation_id":"fb2d2d0a-2715-4cbc-a14f-0f381d3514da","resolution":{"observed_at":"2026-05-10T05:56:11.511099Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2604.18092","last_updated":"2026-04-20T11:09:12Z","snapshot_observed_at":"2026-07-06T23:05:04.279268Z","submitted_at":"2026-04-20T11:09:12Z","title":"Generalization Boundaries of Fine-Tuned Small Language Models for Graph Structural Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T05:38:47.331134Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2604.18092"},"observation_digest":"sha256:1508ec74732c5afe54cb1f05d22a34360a8e813b31b137b15c0dabb6235f7fa0","observation_id":"d58fba64-f44c-4846-b7ef-0a808e93be01","resolution":{"observed_at":"2026-05-10T05:41:02.081384Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2604.27276","last_updated":"2026-06-18T17:42:41Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-30T00:18:45Z","title":"Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-01T08:28:26.970401Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2604.27276"},"observation_digest":"sha256:f03e63b62e0361584662f5287969f78dad65a0724009584c1de8160e74e12228","observation_id":"be93c783-e0b1-40d6-be4b-7240fe3a07a3","resolution":{"observed_at":"2026-07-01T08:35:33.709967Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2605.01484","last_updated":"2026-05-02T15:11:52Z","snapshot_observed_at":"2026-08-02T04:58:06.359776Z","submitted_at":"2026-05-02T15:11:52Z","title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-09T15:09:03.417040Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2605.01484"},"observation_digest":"sha256:9b54dd2b5ca44f2042d9155508f332183a7b2d61621f72c9ba7025846d0bc1ee","observation_id":"8d2bc04e-9ee6-47be-a34a-04439331ce81","resolution":{"observed_at":"2026-05-09T22:13:57.989326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2605.06671","last_updated":"2026-04-18T22:41:29Z","snapshot_observed_at":"2026-08-02T22:49:57.629704Z","submitted_at":"2026-04-18T22:41:29Z","title":"GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T01:28:40.639431Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2605.06671"},"observation_digest":"sha256:34b7f6e6c9dfbe69578438590c21b06e755697fbfa3dca6b7b213c077de7de92","observation_id":"a28e910c-3ad3-447b-bd6d-2041595cfec3","resolution":{"observed_at":"2026-05-11T01:45:52.274100Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2605.07517","last_updated":"2026-05-08T09:50:53Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:50:53Z","title":"LARAG: Link-Aware Retrieval Strategy for RAG Systems in Hyperlinked Technical Documentation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-11T02:15:18.274343Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2605.07517"},"observation_digest":"sha256:307cfcff82483416ad6cc0bf248c394eac4778b5ac40df609ff237bdff27d150","observation_id":"b63b002f-3a1f-468b-81dd-092d255285e4","resolution":{"observed_at":"2026-05-11T03:50:54.768408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2605.22471","last_updated":"2026-05-21T13:32:20Z","snapshot_observed_at":"2026-08-02T11:52:59.155097Z","submitted_at":"2026-05-21T13:32:20Z","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-22T07:03:52.438466Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2605.22471"},"observation_digest":"sha256:f6fe64d00e660286abf68bfa19ddd6247f86f1a5e4e023fc5d6b83752197ea87","observation_id":"2dc720ac-5b20-4343-a81a-ed3495d41eb1","resolution":{"observed_at":"2026-05-22T07:04:41.435358Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2605.31404","last_updated":"2026-05-29T15:09:25Z","snapshot_observed_at":"2026-08-02T20:20:50.094771Z","submitted_at":"2026-05-29T15:09:25Z","title":"The Sword, Shield, and Achilles' Heel: Characterizing the Linguistic Inductive Bias of Large Language Models for Spatial Reasoning in Navigation Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T22:23:24.536258Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2605.31404"},"observation_digest":"sha256:52633169fc8a8a6b9edf309068ac3c004cd8a7adb3879e3f739b5f252837fc5e","observation_id":"4461193a-b17c-45bc-98c1-5d174605f41d","resolution":{"observed_at":"2026-07-01T19:36:08.344470Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.04560","doi":"10.48550/arxiv.2310.04560","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Talk like a graph: Encoding graphs for large language models","venue":"arXiv (Cornell University)","work_id":"d4a808e3-fce3-47f8-abe1-4b6f35f7c57b","year":2023},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:2fa275bc5c2a17fe914146cad0f676eb552d609e1e6103bb538e7dbf94b86977","observation_id":"0d8281fb-4af9-4522-acc0-4553328366a2","resolution":{"observed_at":"2026-07-03T08:57:47.497699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04560","snapshot_observed_at":"2026-08-01T01:26:39.196694Z","title":"Talk like a graph: Encoding graphs for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25828","last_updated":"2026-07-28T15:07:47Z","snapshot_observed_at":"2026-08-05T10:03:57.290395Z","submitted_at":"2026-07-28T15:07:47Z","title":"C-RE-ACT: Causal RE-ACTing Agent for O-RAN Forensic Triage","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T01:26:39.196694Z"},"links":{"cited_paper":"/paper/2310.04560","citing_paper":"/paper/2607.25828"},"observation_digest":"sha256:b0dae3f13d1f9f4d6b18d26eb93ab32f6fa2f8fea9e2aee434ea1b08fd44e777","observation_id":"36273d3f-abea-4408-8229-245e8f7525b4","resolution":{"observed_at":"2026-08-01T01:26:39.196694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.04560/citation-record","integrity":"/paper/2310.04560/integrity","json":"/paper/2310.04560/citation-record.json","paper":"/paper/2310.04560"},"outbound":[],"paper":{"arxiv_id":"2310.04560","last_updated":"2023-10-06T19:55:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T23:16:40.305780Z","submitted_at":"2023-10-06T19:55:21Z","title":"Talk like a Graph: Encoding Graphs for 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 26 inbound Pith citation observations for arXiv:2310.04560."}