{"as_of":"2026-08-08T15:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d05990437c8e0172e3a00415d6bbe8c73a46a762db3757c53eddd6893f93169","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-05T17:35:54.466590Z","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-08T13:14:33.292283Z","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:7a3f682824e60324e7baf78b527e819275faaeeaad65d32f2d2dead47afd87e3","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-05T17:35:54.466590Z","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:459416ee829b7fa4b9e6b5772c638bf56c7822f1cd1c1d1fed1b77a908ceaa7e","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-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"}}],"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":[],"paper":{"arxiv_id":"2501.13731","last_updated":"2025-01-23T15:04:22Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T17:35:54.466590Z","submitted_at":"2025-01-23T15:04:22Z","title":"Pseudocode-Injection Magic: Enabling LLMs to Tackle Graph Computational Tasks"},"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 2 inbound Pith citation observations for arXiv:2501.13731."}