{"as_of":"2026-08-20T20:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbf0092a2b2ba6be87d34e230a90ade29318847ea41797e59316aafd308e21fb","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-20T06:33:59.587034+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-11T13:58:20.491060Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.17906","last_updated":"2024-09-26T14:52:40Z","snapshot_observed_at":"2026-08-16T13:15:06.169801Z","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-11T13:58:20.491060Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12609","last_updated":"2024-12-17T07:14:03Z","snapshot_observed_at":"2026-08-19T18:58:30.968324Z","submitted_at":"2024-12-17T07:14:03Z","title":"MultiLingPoT: Enhancing Mathematical Reasoning with Multilingual Program Fine-tuning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T13:58:20.491060Z"},"links":{"cited_paper":"/paper/2409.17906","citing_paper":"/paper/2412.12609"},"observation_digest":"sha256:68f6570a323b697f79d38dd329b1b961d343c87f999605d56939f53287b06025","observation_id":"0c833677-3d93-4fc4-9b86-0fe831e7a120","resolution":{"observed_at":"2026-08-11T13:58:20.491060Z","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-16T13:15:06.169801Z","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-18T11:17:20.907718Z","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:4e21eb653fb10ba52fe07b6c9c2ee801709676a27064394acf88d2cd35d3c055","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":"2409.17906","last_updated":"2024-09-26T14:52:40Z","snapshot_observed_at":"2026-08-16T13:15:06.169801Z","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-07T10:56:39.930679Z","title":"arXiv preprint arXiv:2409.17906","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-20T04:55:32.095980Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:56:39.930679Z"},"links":{"cited_paper":"/paper/2409.17906","citing_paper":"/paper/2506.03939"},"observation_digest":"sha256:8b728bb0a4a3e43d0a0b66541459c7521f01cbd25b28e0ca6ed3e44a53b77ddd","observation_id":"5fedc170-3157-4e2a-a44f-650168f9e8cb","resolution":{"observed_at":"2026-08-07T10:56:39.930679Z","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-16T13:15:06.169801Z","submitted_at":"2024-09-26T14:52:40Z","title":"Graph Reasoning with Large Language Models via Pseudo-code Prompting","version":1},"cited_work":{"arxiv_id":"2409.17906","doi":"10.48550/arxiv.2409.17906","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.17906","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"no flowchart available","venue":"arXiv (Cornell University)","work_id":"2bac7cd8-8b73-4196-a11e-a9e8ba4aff2f","year":2024},"citing_paper":{"arxiv_id":"2511.12439","last_updated":"2025-12-28T02:55:19Z","snapshot_observed_at":"2026-08-14T15:16:58.925053Z","submitted_at":"2025-11-16T03:48:22Z","title":"Multi-agent Self-triage System with Medical Flowcharts","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-17T21:53:47.777529Z"},"links":{"cited_paper":"/paper/2409.17906","citing_paper":"/paper/2511.12439"},"observation_digest":"sha256:73fc9b6d9e4d0da18e23c761bbc133cf2c467a90f5f62d193acbca7f6075ac52","observation_id":"ab5fd424-a82b-49e0-a9b5-e435124490b7","resolution":{"observed_at":"2026-05-17T21:55:19.726411Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17906","last_updated":"2024-09-26T14:52:40Z","snapshot_observed_at":"2026-08-16T13:15:06.169801Z","submitted_at":"2024-09-26T14:52:40Z","title":"Graph Reasoning with Large Language Models via Pseudo-code Prompting","version":1},"cited_work":{"arxiv_id":"2409.17906","doi":"10.48550/arxiv.2409.17906","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.17906","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"no flowchart available","venue":"arXiv (Cornell University)","work_id":"2bac7cd8-8b73-4196-a11e-a9e8ba4aff2f","year":2024},"citing_paper":{"arxiv_id":"2604.24104","last_updated":"2026-04-27T06:52:09Z","snapshot_observed_at":"2026-08-11T13:08:06.136696Z","submitted_at":"2026-04-27T06:52:09Z","title":"Factual and Edit-Sensitive Graph-to-Sequence Generation via Graph-Aware Adaptive Noising","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T03:52:34.593773Z"},"links":{"cited_paper":"/paper/2409.17906","citing_paper":"/paper/2604.24104"},"observation_digest":"sha256:1c7beaf6fc660a37372d5e81cf5c7f3e0034d6f4f6cc31d64842c9c2b614e0c3","observation_id":"e9be3ff1-5c00-4d3d-ace9-2e299c783264","resolution":{"observed_at":"2026-05-11T21:56:11.469644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.17906/citation-record","integrity":"/paper/2409.17906/integrity","json":"/paper/2409.17906/citation-record.json","paper":"/paper/2409.17906"},"outbound":[],"paper":{"arxiv_id":"2409.17906","last_updated":"2024-09-26T14:52:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:15:06.169801Z","submitted_at":"2024-09-26T14:52:40Z","title":"Graph Reasoning with Large Language Models via Pseudo-code Prompting"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2409.17906."}