{"as_of":"2026-08-14T23:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6bd971ee47a38f569d80e24e99890a892f1d8db44edb7f6c11a538f65cd221ee","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:09:39.870165Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T04:33:39.431579Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.09529","last_updated":"2025-01-07T20:26:34Z","snapshot_observed_at":"2026-08-14T15:55:33.453226Z","submitted_at":"2024-08-18T16:26:39Z","title":"Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path","version":2},"cited_work":{"arxiv_id":"2408.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09529","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the graph reasoning ability of large language models: Case studies in translation, connectivity and shortest path","venue":null,"work_id":"8e215088-10e3-4094-a02e-e734fda43ce3","year":2024},"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":73,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2408.09529","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:10c5b11e5b950b4fbbc2e25af8a39f3ca1e19d4f91b83484eb65cd7727f2ab27","observation_id":"b56dec7b-e43b-4fd4-a74a-1eff35028efe","resolution":{"observed_at":"2026-05-18T04:33:39.434504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09529","last_updated":"2025-01-07T20:26:34Z","snapshot_observed_at":"2026-08-14T15:55:33.453226Z","submitted_at":"2024-08-18T16:26:39Z","title":"Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09529","snapshot_observed_at":"2026-08-07T11:09:39.870165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05393","last_updated":"2025-06-03T19:34:24Z","snapshot_observed_at":"2026-08-13T23:28:49.324765Z","submitted_at":"2025-06-03T19:34:24Z","title":"Are Large Language Models Good Temporal Graph Learners?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:39.870165Z"},"links":{"cited_paper":"/paper/2408.09529","citing_paper":"/paper/2506.05393"},"observation_digest":"sha256:5ae618bd176f824391fcbe5d62170809f75f7e1ae9da5b8c31b1fa06aab2ead2","observation_id":"f45595a5-c4a8-4fc1-8491-4ad30ea0041b","resolution":{"observed_at":"2026-08-07T11:09:39.870165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09529","last_updated":"2025-01-07T20:26:34Z","snapshot_observed_at":"2026-08-14T15:55:33.453226Z","submitted_at":"2024-08-18T16:26:39Z","title":"Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path","version":2},"cited_work":{"arxiv_id":"2408.09529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09529","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the graph reasoning ability of large language models: Case studies in translation, connectivity and shortest path","venue":null,"work_id":"8e215088-10e3-4094-a02e-e734fda43ce3","year":2024},"citing_paper":{"arxiv_id":"2604.15306","last_updated":"2026-04-16T17:59:43Z","snapshot_observed_at":"2026-07-06T23:02:53.677687Z","submitted_at":"2026-04-16T17:59:43Z","title":"Generalization in LLM Problem Solving: The Case of the Shortest Path","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T10:37:45.355872Z"},"links":{"cited_paper":"/paper/2408.09529","citing_paper":"/paper/2604.15306"},"observation_digest":"sha256:19f17c20ec1488fde5d6ea1f5b2082635385e326ba3fb1bf205af443d881dfbe","observation_id":"9eca8707-8b87-4f10-ad91-75d9579b4207","resolution":{"observed_at":"2026-05-10T10:39:38.090036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.09529/citation-record","integrity":"/paper/2408.09529/integrity","json":"/paper/2408.09529/citation-record.json","paper":"/paper/2408.09529"},"outbound":[],"paper":{"arxiv_id":"2408.09529","last_updated":"2025-01-07T20:26:34Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T15:55:33.453226Z","submitted_at":"2024-08-18T16:26:39Z","title":"Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.09529."}