{"as_of":"2026-08-13T13:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66cffb7e2bcf5c7e3d3a3e22ddf964b09d086cbc4086fd828d30251bd8dfd992","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-13T06:32:02.005865+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-11T16:39:23.790246Z","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-03T05:57:41.643715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02575","snapshot_observed_at":"2026-08-11T16:39:23.790246Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.09906","last_updated":"2024-12-13T06:45:26Z","snapshot_observed_at":"2026-08-12T23:34:21.180994Z","submitted_at":"2024-12-13T06:45:26Z","title":"Enhancing the Reasoning Capabilities of Small Language Models via Solution Guidance Fine-Tuning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:23.790246Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2412.09906"},"observation_digest":"sha256:802adb8a6801fb8bbf0fc35b49026a61e4a63ac545e575ec8108c25371d7b58d","observation_id":"1e749cfc-01bb-45e4-ba10-bdac5a223176","resolution":{"observed_at":"2026-08-11T16:39:23.790246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02575","snapshot_observed_at":"2026-08-11T11:50:29.412354Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15310","last_updated":"2024-12-19T15:02:33Z","snapshot_observed_at":"2026-08-11T19:13:56.077668Z","submitted_at":"2024-12-19T15:02:33Z","title":"MRWeb: An Exploration of Generating Multi-Page Resource-Aware Web Code from UI Designs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T11:50:29.412354Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2412.15310"},"observation_digest":"sha256:e77ea9d3ee37566b8d26c9196e00b418155287472aaa51214658c29f453f14bf","observation_id":"b18023ef-7aca-4bf7-a598-e1dc9d0b9e14","resolution":{"observed_at":"2026-08-11T11:50:29.412354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02575","snapshot_observed_at":"2026-08-07T06:09:18.069910Z","title":"T.-i., Kwak, B.-w., Kim, M., Kim, S., Kwon, T., Chung, J., Yu, Y., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06008","last_updated":"2025-06-06T11:53:27Z","snapshot_observed_at":"2026-08-12T21:46:27.729846Z","submitted_at":"2025-06-06T11:53:27Z","title":"Token Signature: Predicting Chain-of-Thought Gains with Token Decoding Feature in Large Language Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:18.069910Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2506.06008"},"observation_digest":"sha256:56cc7eccd18fd05fb58b3f3cc7968412075033020c135c47a36d0698d14e0d10","observation_id":"3d58bc4a-6dbc-4369-aaae-82a6e8c60dc4","resolution":{"observed_at":"2026-08-07T06:09:18.069910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02575","snapshot_observed_at":"2026-08-06T20:19:19.140622Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.03254","last_updated":"2025-07-04T02:20:19Z","snapshot_observed_at":"2026-08-09T12:28:10.149601Z","submitted_at":"2025-07-04T02:20:19Z","title":"CodeAgents: A Token-Efficient Framework for Codified Multi-Agent Reasoning in LLMs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T20:19:19.140622Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2507.03254"},"observation_digest":"sha256:88ca4529a20302813ef2f9748095361e0cb357b59c2e194ebb362449d891ba59","observation_id":"5b08bec4-baab-43d2-b992-3818850b1bb7","resolution":{"observed_at":"2026-08-06T20:19:19.140622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models","version":1},"cited_work":{"arxiv_id":"2404.02575","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02575","snapshot_observed_at":"2026-07-03T05:57:41.643715Z","title":"Language models as compilers: Simulating pseudocode execution improves algorithmic reasoning in language models","venue":null,"work_id":"488bce44-c530-49ba-a972-f01c59014e91","year":2024},"citing_paper":{"arxiv_id":"2606.11470","last_updated":"2026-08-10T19:13:02Z","snapshot_observed_at":"2026-08-13T13:22:41.269378Z","submitted_at":"2026-06-09T21:59:37Z","title":"The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T12:59:51.091008Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2606.11470"},"observation_digest":"sha256:d194476e8fb20c7206995cdb31664325f6054252ff7ce33daf9b44bb46b0ce92","observation_id":"82631c26-c52d-4dcf-a6ce-18348d6b6c4c","resolution":{"observed_at":"2026-07-03T05:57:41.645118Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.02575/citation-record","integrity":"/paper/2404.02575/integrity","json":"/paper/2404.02575/citation-record.json","paper":"/paper/2404.02575"},"outbound":[],"paper":{"arxiv_id":"2404.02575","last_updated":"2024-04-03T08:49:11Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T00:38:38.851804Z","submitted_at":"2024-04-03T08:49:11Z","title":"Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2404.02575."}