{"as_of":"2026-08-14T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:674e297039906a02c3e228d4c304ef7e8a16947681b030aefe62d42de85b3625","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:42:44.037573Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:43:57.462689Z","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-02T17:07:12.215404Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13731","snapshot_observed_at":"2026-08-06T18:43:57.462689Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07498","last_updated":"2025-07-14T07:10:51Z","snapshot_observed_at":"2026-08-09T12:20:15.585267Z","submitted_at":"2025-07-10T07:34:05Z","title":"Teaching LLM to Reason: Reinforcement Learning from Algorithmic Problems without Code","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:43:57.462689Z"},"links":{"cited_paper":"/paper/2501.13731","citing_paper":"/paper/2507.07498"},"observation_digest":"sha256:28b74f8fcc5148b5aba319b763e52f0f22f6e5f9ca25a26f602cd90df743e57c","observation_id":"2524e37f-3834-445b-ad3f-2766ed9f426a","resolution":{"observed_at":"2026-08-06T18:43:57.462689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"cited_work":{"arxiv_id":"2501.13731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13731","snapshot_observed_at":"2026-07-02T17:07:12.215404Z","title":null,"venue":null,"work_id":"71093d2f-4eb7-4b6f-955d-f089ad576bba","year":2025},"citing_paper":{"arxiv_id":"2606.06865","last_updated":"2026-06-05T03:24:38Z","snapshot_observed_at":"2026-07-06T23:46:37.903443Z","submitted_at":"2026-06-05T03:24:38Z","title":"Are Large Language Models Suitable for Graph Computation? Progress and Prospects","version":1},"reference_index":182,"source":"arxiv_source","source_observed_at":"2026-06-27T22:15:03.223540Z"},"links":{"cited_paper":"/paper/2501.13731","citing_paper":"/paper/2606.06865"},"observation_digest":"sha256:99d4bd198c0941ae5502cd26a7d075c78aa93d87742d0475f798fa61182bf5c2","observation_id":"8614ef63-779a-47b6-942a-3cc55fd57ac3","resolution":{"observed_at":"2026-07-02T17:07:12.216872Z","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/2501.13731/citation-record","integrity":"/paper/2501.13731/integrity","json":"/paper/2501.13731/citation-record.json","paper":"/paper/2501.13731"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-10T15:42:43.952528Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.952528Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:4d6b5c52c43a636a4bccb26700a6c4308c301a6f8d524403c6095e344cc87e16","observation_id":"bddc8d61-5adc-4d41-acb0-acebb3a425f6","resolution":{"observed_at":"2026-08-10T15:42:43.952528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.503465Z","title":"Accurate medium-range global weather forecasting with 3d neural networks","venue":null,"work_id":"87e1a333-c8e4-45c8-b795-c1f891687963","year":2023},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.956654Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:aeceb93968731afd25e45c1b8317437ac516b641454aa94717e3e2b62ed16a39","observation_id":"3290dca6-cd75-440d-b86d-f31f96cb96d5","resolution":{"observed_at":"2026-08-10T15:42:44.506827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.493902Z","title":"Graphwiz: An instruction-following language model for graph computational problems","venue":null,"work_id":"25f894c8-c868-4026-903c-8e1df94a53d7","year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.959971Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:7a27a5db2c4ab2e886dfcc163e63bc10ff2758e970f82c5820286b32468af7d5","observation_id":"23df0579-67ee-4e92-bfba-6a2292f487c4","resolution":{"observed_at":"2026-08-10T15:42:44.497263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.484555Z","title":"A note on two problems in connexion with graphs","venue":null,"work_id":"465483f3-d129-47cf-ac5a-aa9d2efc2865","year":1959},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.963651Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:c9810b5e5e9afb934a663c493d82ec344318322f66cca2b75d80820390c5a42f","observation_id":"48067590-2ded-4235-83f7-9d402c0aaa16","resolution":{"observed_at":"2026-08-10T15:42:44.487852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.474397Z","title":"Talk like a graph: Encoding graphs for large language models","venue":null,"work_id":"d9d57e5c-7de0-4c4c-97b1-3d195835aa06","year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.966971Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:370c5b083548e80a062e134214a5a9880a5db4a26459c343243b721033d4b43a","observation_id":"ca05c465-65e2-4793-9f28-d58622c709ab","resolution":{"observed_at":"2026-08-10T15:42:44.478147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-10T15:42:43.970509Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.970509Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:5b7ca181d018732c68fbe78e23c8519cfc106a643aaa41249ed364a1de76c997","observation_id":"4ac119a2-8c68-48c8-9f78-4097667906de","resolution":{"observed_at":"2026-08-10T15:42:43.970509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-10T15:42:43.974434Z","title":"Qwen2.5-coder technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.974434Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:2c6259a0878baf570cbf8682819daa640fe4620c92d8c17288562605c32652ab","observation_id":"6a117883-bbeb-45ba-9efd-597702d4faae","resolution":{"observed_at":"2026-08-10T15:42:43.974434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:43.978030Z","title":"Graphteam: Facilitating large language model-based graph analysis via multi-agent collaboration","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.978030Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:f4d3f78540b8223215df00c948257c27f1018ca0fa9ae45b2939747b48dcd03c","observation_id":"3e70e92e-03f5-414b-b77e-c604ec043045","resolution":{"observed_at":"2026-08-10T15:42:43.978030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-10T15:42:43.981050Z","title":"Deepseek-v2: A strong, economical, and efficient mixture-of-experts language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.981050Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:dd9a7cd0ba8959a70fb0e1747bf3c87d408f4a933da06aba55697a2d46ddf2e9","observation_id":"950a6b8e-890d-4465-a941-3e9a104100a9","resolution":{"observed_at":"2026-08-10T15:42:43.981050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-11T01:48:59.557045Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-10T15:42:43.984481Z","title":"Deepseek-v3 technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.984481Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:dfa6bd1c741bbdacb278fac5e49e6b56f13fe09d2d7440e321b7ca32cace57bf","observation_id":"43dcfc53-45c4-46d8-8420-0dbad8405940","resolution":{"observed_at":"2026-08-10T15:42:43.984481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:43.987862Z","title":"Graphinstruct: Empowering large language models with graph understanding and reasoning capability","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.987862Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:a6fcf75b2dfce1483e30bbb2d128cddd09cb8a4c5f77b9f8f8248a12b9260f52","observation_id":"80cb9a09-7fa2-4238-a0fa-68e0ea454535","resolution":{"observed_at":"2026-08-10T15:42:43.987862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.464570Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":"87cedb82-8dca-4fba-a1b4-e84262586050","year":2023},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.991476Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:9375ee6cc3855ca6b165aaba8cf8a180e3a000eec9ce0e0d5ea2e68e0d43e548","observation_id":"b0e4c0ac-90e0-478d-a106-212a89a5395c","resolution":{"observed_at":"2026-08-10T15:42:44.468032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.453321Z","title":"Kumar, Emilien Dupont, Francisco Ruiz, Jordan Ellenberg, Pengming Wang, Omar Fawzi, Pushmeet Kohli, and Alhussein Fawzi","venue":null,"work_id":"9329a238-2b1b-4557-a35c-86f44541e8bb","year":2023},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.994474Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:8c43104a98091cdecf0a6dbb8dc28242fd69caeacd4b593ffafe643e53b60799","observation_id":"b89627e1-1f8f-44f8-88d1-bd37d3d98ab6","resolution":{"observed_at":"2026-08-10T15:42:44.456796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-10T15:42:43.997478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:43.997478Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:13d0ce8f39d796d2f896afff200525bfb68691a7b73515033880ac7a52726583","observation_id":"73383f33-4b48-494e-8735-b9ea05b03b3b","resolution":{"observed_at":"2026-08-10T15:42:43.997478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17906","last_updated":"2024-09-26T14:52:40Z","snapshot_observed_at":"2026-08-13T17:49:18.003931Z","submitted_at":"2024-09-26T14:52:40Z","title":"Graph Reasoning with Large Language Models via Pseudo-code Prompting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17906","snapshot_observed_at":"2026-08-10T15:42:44.000717Z","title":"Graph reasoning with large language models via pseudo-code prompting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.000717Z"},"links":{"cited_paper":"/paper/2409.17906","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:aab61fc5d6190a288061815aac1fda4d35bf7b5b71f52e3860ad8d2eea60e4b7","observation_id":"9f8b528c-e3e8-44ce-bef6-49dc473fd03b","resolution":{"observed_at":"2026-08-10T15:42:44.000717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00379","last_updated":"2025-02-15T09:39:28Z","snapshot_observed_at":"2026-08-14T09:39:58.796249Z","submitted_at":"2024-06-29T09:19:23Z","title":"GraphArena: Evaluating and Exploring Large Language Models on Graph Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00379","snapshot_observed_at":"2026-08-10T15:42:44.003988Z","title":"Grapharena: Benchmarking large language models on graph computational problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.003988Z"},"links":{"cited_paper":"/paper/2407.00379","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:403145e0d40116decb384c38e55ad26ade3397ff0dff3116536023504c84ea9f","observation_id":"5d5ff92f-0d97-47d5-8d60-f1dd1c81034a","resolution":{"observed_at":"2026-08-10T15:42:44.003988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.442997Z","title":"Can language models solve graph problems in natural language? In Thirty-seventh Conference on Neural Information Processing Systems , 2023","venue":null,"work_id":"0f167976-2c50-40c7-ae6c-53c3f3f71799","year":2023},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.007187Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:15d04204e89968ad002e22848fdd0d0d860802975f8671297683ec8971056a3f","observation_id":"e47218d7-9aeb-4153-ad5a-b549336ce0f9","resolution":{"observed_at":"2026-08-10T15:42:44.446417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.433201Z","title":"Loomba, Shichang Zhang, Yizhou Sun, and Wei Wang","venue":null,"work_id":"4394aee5-f63d-40f5-b51b-a24ae449b13e","year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.010195Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:0e7fe6ce8ed3e58129d89fe6b5fa74501eb098040de68ea5c7c093c8e7751cc3","observation_id":"ac6c2cc3-adde-4e2b-a14d-04b69be3c4ee","resolution":{"observed_at":"2026-08-10T15:42:44.436747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-08-13T07:04:41.220509Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-10T15:42:44.013164Z","title":"Chi, Quoc Le, and Denny Zhou","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.013164Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:c2a81e92bde80f8694ae747a08404a0d736718518201cafe44e4c98e4c04ad53","observation_id":"8e361826-ec28-497f-bc91-0737cccd451b","resolution":{"observed_at":"2026-08-10T15:42:44.013164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16176","last_updated":"2025-02-17T09:53:43Z","snapshot_observed_at":"2026-08-12T23:36:38.513845Z","submitted_at":"2024-06-23T18:01:56Z","title":"GraphEval36K: Benchmarking Coding and Reasoning Capabilities of Large Language Models on Graph Datasets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16176","snapshot_observed_at":"2026-08-10T15:42:44.016710Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.016710Z"},"links":{"cited_paper":"/paper/2406.16176","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:cf271184680a710bf0abc43a801a648b46a4b300dd1c7d758e35fc363cd629b2","observation_id":"af09d4f2-7ce4-43f9-beec-a18a25717b0c","resolution":{"observed_at":"2026-08-10T15:42:44.016710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06332","last_updated":"2024-05-24T07:09:21Z","snapshot_observed_at":"2026-08-13T04:22:39.632135Z","submitted_at":"2024-02-09T11:22:08Z","title":"InternLM-Math: Open Math Large Language Models Toward Verifiable Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06332","snapshot_observed_at":"2026-08-10T15:42:44.020736Z","title":"Internlm-math: Open math large language models toward verifiable reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.020736Z"},"links":{"cited_paper":"/paper/2402.06332","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:eb9587c53eae4622f0247c72333cdbffb3351673985b938230c4864acfea07ed","observation_id":"7c1cc4ae-3c7c-4bb5-b92b-25437c76d9f6","resolution":{"observed_at":"2026-08-10T15:42:44.020736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19084","last_updated":"2024-10-24T18:40:36Z","snapshot_observed_at":"2026-08-14T01:21:49.072923Z","submitted_at":"2024-10-24T18:40:36Z","title":"GCoder: Improving Large Language Model for Generalized Graph Problem Solving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19084","snapshot_observed_at":"2026-08-10T15:42:44.024213Z","title":"Gcoder: Improving large language model for generalized graph problem solving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.024213Z"},"links":{"cited_paper":"/paper/2410.19084","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:32148357cdee2d200b5515f273afa39bde26c03d112d4ad806f71569f1d32aa3","observation_id":"4ad2bd53-42c1-4a55-9907-fb2cf9ce32be","resolution":{"observed_at":"2026-08-10T15:42:44.024213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.421242Z","title":"Debug like a human: A large language model debugger via verifying runtime execution step by step","venue":null,"work_id":"03bb7c8f-4728-4a5c-8427-50413e2824bb","year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.027609Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:54387f1c3b0f5229dd0c0bcefab8ee64f9a0a4f366865bf4423bc300a6395f34","observation_id":"a047c398-4540-431e-8c23-51affcae936e","resolution":{"observed_at":"2026-08-10T15:42:44.426436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2405.14365","last_updated":"2024-05-23T09:43:19Z","snapshot_observed_at":"2026-08-13T00:00:46.056902Z","submitted_at":"2024-05-23T09:43:19Z","title":"JiuZhang3.0: Efficiently Improving Mathematical Reasoning by Training Small Data Synthesis Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14365","snapshot_observed_at":"2026-08-10T15:42:44.030701Z","title":"Jiuzhang3.0: Efficiently improving mathematical reasoning by training small data synthesis models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.030701Z"},"links":{"cited_paper":"/paper/2405.14365","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:bcc8748a57eda554f7ed91a0000bbf4c47c30cb1f6e224bc8120c483afd2f219","observation_id":"6ec3d18d-0440-4628-8953-a62489dc0fc2","resolution":{"observed_at":"2026-08-10T15:42:44.030701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-14T04:42:19.578053Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11931","snapshot_observed_at":"2026-08-10T15:42:44.034066Z","title":"Wu, Yukun Li, Huazuo Gao, and Shirong Ma et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.034066Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:48ab17db60d769b17397fd1857c563d33246ccc9d2d14b4dcab43b4777a4291d","observation_id":"6fa57caa-7c10-46c2-be16-a0873076e219","resolution":{"observed_at":"2026-08-10T15:42:44.034066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:42:44.037573Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T15:42:44.037573Z"},"links":{"citing_paper":"/paper/2501.13731"},"observation_digest":"sha256:bd17eda1d603cd3b0c25029288fcea9463d27f65ef4c1ff9e7a07752659cd6a2","observation_id":"fc4f00de-9e08-47d3-8c37-e4d55c970e9c","resolution":{"observed_at":"2026-08-10T15:42:44.037573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-11T04:10:47.517119Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":26},"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 26 of 26 outbound references and 2 inbound Pith citation observations for arXiv:2501.13731."}