{"as_of":"2026-08-20T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e09dc61ce0a1f09354eed6b5fc2e341e8c1689155916396a09a7293bc9fe665","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:57:42.317612Z","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-16T14:04:01.677816Z","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-20T03:16:23.568993Z","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:14718f596f89e30a6e579799c7e29b6901a72aac70022234821960f5f4fb8deb","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-16T14:04:01.677816Z","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-19T07:01:29.204023Z","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:31406d30d999d72dd2ace7540ee56845f7d6277e218b424e13cdca1a72bebb28","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-16T14:04:01.677816Z","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-15T20:57:42.317612Z","title":"Language models as compilers: Simulating pseudocode execution improves algorithmic reasoning in language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11423","last_updated":"2025-09-02T02:55:17Z","snapshot_observed_at":"2026-08-18T02:48:56.587134Z","submitted_at":"2025-05-16T16:36:00Z","title":"When Thinking Fails: The Pitfalls of Reasoning for Instruction-Following in LLMs","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T20:57:42.317612Z"},"links":{"cited_paper":"/paper/2404.02575","citing_paper":"/paper/2505.11423"},"observation_digest":"sha256:fa99e36fc236d6246b7b00ea10201847150461cda2a1c7826b4fd7f517622da1","observation_id":"7b29e637-250c-4737-9862-6c12d6337d00","resolution":{"observed_at":"2026-08-15T20:57:42.317612Z","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-16T14:04:01.677816Z","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-19T08:33:00.528037Z","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:cc007dfe266422832b8686e8b9df27b07e6d0543f8ea2f7f615c2c528fa6359f","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-16T14:04:01.677816Z","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-15T13:15:50.408683Z","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:8d07b5b1741ee0c6ab1461bfb216ac8778e4d1283a3c2dd8a262319bcbca8633","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-16T14:04:01.677816Z","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-14T23:09:31.705348Z","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:17b07c0d9c7f8dfa263a98cf1e961e27fb1d6f9147cf42793cbc173e15dca52b","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-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/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-16T14:04:01.677816Z","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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2404.02575."}