{"as_of":"2026-08-14T13:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15077a08ef4693c5de8440064f1877660aef727395bb307068a3e422b8cb5d32","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:47:29.460351Z","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-03T20:08:56.294066Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.10037","last_updated":"2024-01-06T01:01:38Z","snapshot_observed_at":"2026-08-13T11:40:26.514754Z","submitted_at":"2023-05-17T08:29:21Z","title":"Can Language Models Solve Graph Problems in Natural Language?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10037","snapshot_observed_at":"2026-08-11T15:47:29.460351Z","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-12T08:35:42.010289Z","submitted_at":"2024-12-14T02:51:47Z","title":"Thinking with Knowledge Graphs: Enhancing LLM Reasoning Through Structured Data","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:47:29.460351Z"},"links":{"cited_paper":"/paper/2305.10037","citing_paper":"/paper/2412.10654"},"observation_digest":"sha256:d0da929546bd81056978152f2d035f698e15965fa411fff1ca4099a94d204f51","observation_id":"c1680942-f8dd-4a56-a50e-8efe234397cc","resolution":{"observed_at":"2026-08-11T15:47:29.460351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10037","last_updated":"2024-01-06T01:01:38Z","snapshot_observed_at":"2026-08-13T11:40:26.514754Z","submitted_at":"2023-05-17T08:29:21Z","title":"Can Language Models Solve Graph Problems in Natural Language?","version":3},"cited_work":{"arxiv_id":"2305.10037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.10037","snapshot_observed_at":"2026-07-03T20:08:56.294066Z","title":"Can language models solve graph problems in natural lan- guage?arXiv preprint arXiv:2305.10037,","venue":null,"work_id":"852c9643-4619-4e5c-86b9-8beb84ea6629","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":32,"source":"pdf_text","source_observed_at":"2026-06-28T22:23:24.536258Z"},"links":{"cited_paper":"/paper/2305.10037","citing_paper":"/paper/2605.31404"},"observation_digest":"sha256:9b986de23d3e698cb0118fc5adfb8c9b3bfb92806b3c14338984ffdeb3e73782","observation_id":"5a254c9d-3906-4ef3-80da-dc37062b8b71","resolution":{"observed_at":"2026-07-01T19:36:08.372963Z","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":"2305.10037","last_updated":"2024-01-06T01:01:38Z","snapshot_observed_at":"2026-08-13T11:40:26.514754Z","submitted_at":"2023-05-17T08:29:21Z","title":"Can Language Models Solve Graph Problems in Natural Language?","version":3},"cited_work":{"arxiv_id":"2305.10037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.10037","snapshot_observed_at":"2026-07-03T20:08:56.294066Z","title":"Can language models solve graph problems in natural lan- guage?arXiv preprint arXiv:2305.10037,","venue":null,"work_id":"852c9643-4619-4e5c-86b9-8beb84ea6629","year":2023},"citing_paper":{"arxiv_id":"2606.17667","last_updated":"2026-06-16T08:29:34Z","snapshot_observed_at":"2026-08-11T15:30:28.701558Z","submitted_at":"2026-06-16T08:29:34Z","title":"Handling Feature Heterogeneity with Learnable Graph Patches","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/2305.10037","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:c3d84f6aed763850e5c4179d27cb25351506d05197dcfc0ea02cbe72bc5d7b6f","observation_id":"952523b8-944a-4b51-b1f1-819c0721e9f3","resolution":{"observed_at":"2026-07-03T20:08:56.296970Z","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":"2305.10037","last_updated":"2024-01-06T01:01:38Z","snapshot_observed_at":"2026-08-13T11:40:26.514754Z","submitted_at":"2023-05-17T08:29:21Z","title":"Can Language Models Solve Graph Problems in Natural Language?","version":3},"cited_work":{"arxiv_id":"2305.10037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.10037","snapshot_observed_at":"2026-07-03T20:08:56.294066Z","title":"Can language models solve graph problems in natural lan- guage?arXiv preprint arXiv:2305.10037,","venue":null,"work_id":"852c9643-4619-4e5c-86b9-8beb84ea6629","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":76,"source":"pdf_text","source_observed_at":"2026-07-02T18:01:48.915707Z"},"links":{"cited_paper":"/paper/2305.10037","citing_paper":"/paper/2607.00052"},"observation_digest":"sha256:b4cbc3feac96f4d6e0601209ccd58e1356d1a5be98d6ac7662a8d03c5cef7aa8","observation_id":"50cf1f12-6ab5-4ca5-871f-3d0a776a8ec7","resolution":{"observed_at":"2026-07-02T18:47:17.237969Z","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/2305.10037/citation-record","integrity":"/paper/2305.10037/integrity","json":"/paper/2305.10037/citation-record.json","paper":"/paper/2305.10037"},"outbound":[],"paper":{"arxiv_id":"2305.10037","last_updated":"2024-01-06T01:01:38Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T11:40:26.514754Z","submitted_at":"2023-05-17T08:29:21Z","title":"Can Language Models Solve Graph Problems in Natural Language?"},"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 4 inbound Pith citation observations for arXiv:2305.10037."}