{"as_of":"2026-08-19T10:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6831f9c218a73df2ace833b6c36d4baa781c107bb0fdbab24e9c1e561be40cc2","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:36:25.192466Z","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-22T07:11:12.526903Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13863","snapshot_observed_at":"2026-08-10T15:19:35.634838Z","title":"Codegraph: Enhancing graph reasoning of llms with code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14326","last_updated":"2025-09-04T17:49:22Z","snapshot_observed_at":"2026-08-14T05:28:35.403816Z","submitted_at":"2025-01-24T08:39:50Z","title":"Assessing Large Language Models in Comprehending and Verifying Concurrent Programs across Memory Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:19:35.634838Z"},"links":{"cited_paper":"/paper/2408.13863","citing_paper":"/paper/2501.14326"},"observation_digest":"sha256:5b729ed748300ce7f551f70af674335f7c95cb71be91e61aa8a2b2f0874fea5d","observation_id":"21fa218b-02f1-4230-aad3-94670383378e","resolution":{"observed_at":"2026-08-10T15:19:35.634838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13863","snapshot_observed_at":"2026-08-15T22:36:25.192466Z","title":"Codegraph: Enhancing graph reasoning of llms with code,","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":30,"source":"pdf_text","source_observed_at":"2026-08-15T22:36:25.192466Z"},"links":{"cited_paper":"/paper/2408.13863","citing_paper":"/paper/2505.13479"},"observation_digest":"sha256:54132bbf78ba83a655f9d8a7739284fc714f6cbb5b8288fc6ba6e10f773aa66c","observation_id":"76f5b5e0-d301-40f9-a547-3ea939dbb492","resolution":{"observed_at":"2026-08-15T22:36:25.192466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13863","snapshot_observed_at":"2026-08-07T10:56:39.886459Z","title":"Ziwei Chai, Tianjie Zhang, Liang Wu, Kaiqiao Han, Xiaohai Hu, Xuanwen Huang, and Yang Yang","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-07T21:43:16.151627Z","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":2024,"source":"pdf_text","source_observed_at":"2026-08-07T10:56:39.886459Z"},"links":{"cited_paper":"/paper/2408.13863","citing_paper":"/paper/2506.03939"},"observation_digest":"sha256:f1352be794f7aba0e954ae147961d3949a3622a9dad35bf2a2dd14f293043429","observation_id":"685d3ab1-2f3b-4060-a564-80824e1dcfb4","resolution":{"observed_at":"2026-08-07T10:56:39.886459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","version":1},"cited_work":{"arxiv_id":"2408.13863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13863","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CodeGraph: Enhancing graph reasoning of LLMs with code","venue":null,"work_id":"b2d03cbc-f7bc-48a3-8470-7259fedec5cf","year":2024},"citing_paper":{"arxiv_id":"2604.17715","last_updated":"2026-04-20T01:54:01Z","snapshot_observed_at":"2026-08-18T03:15:48.153387Z","submitted_at":"2026-04-20T01:54:01Z","title":"Program Structure-aware Language Models: Targeted Software Testing beyond Textual Semantics","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-10T05:07:52.261471Z"},"links":{"cited_paper":"/paper/2408.13863","citing_paper":"/paper/2604.17715"},"observation_digest":"sha256:9fe5edca12d86cb365621dcecd2c1b844d259f7b8f604ad84386a32b7301a79a","observation_id":"096e90e6-3b3c-4e76-86c7-86cb54821af6","resolution":{"observed_at":"2026-05-10T09:48:47.971626Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code","version":1},"cited_work":{"arxiv_id":"2408.13863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13863","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CodeGraph: Enhancing graph reasoning of LLMs with code","venue":null,"work_id":"b2d03cbc-f7bc-48a3-8470-7259fedec5cf","year":2024},"citing_paper":{"arxiv_id":"2605.21858","last_updated":"2026-08-15T13:07:54Z","snapshot_observed_at":"2026-08-19T09:14:26.038832Z","submitted_at":"2026-05-21T01:09:48Z","title":"Hypergraph as Language","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T07:10:29.999535Z"},"links":{"cited_paper":"/paper/2408.13863","citing_paper":"/paper/2605.21858"},"observation_digest":"sha256:8d8123b20cdb609a6c8ac2c002091e7670c3a6ae2178727af7c7cf04a4e4f7a4","observation_id":"04f13d44-8417-4f5a-bf7f-f58d0f7aa462","resolution":{"observed_at":"2026-05-22T07:11:12.530417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.13863/citation-record","integrity":"/paper/2408.13863/integrity","json":"/paper/2408.13863/citation-record.json","paper":"/paper/2408.13863"},"outbound":[],"paper":{"arxiv_id":"2408.13863","last_updated":"2024-08-25T15:27:21Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:59:03.838789Z","submitted_at":"2024-08-25T15:27:21Z","title":"CodeGraph: Enhancing Graph Reasoning of LLMs with Code"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2408.13863."}