{"as_of":"2026-08-07T20:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62d7fbe12f2aa8a15cadf5ef6ffe846db5d8486c7e783d2c1678e7795c94a6a2","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:22:02.430464Z","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":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":"2406.04229","doi":"10.48550/arxiv.2406.04229","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.04229 , year=","venue":"arXiv (Cornell University)","work_id":"2acd8b85-536a-4d3a-b032-a6a380f0ccb7","year":2024},"citing_paper":{"arxiv_id":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-07-06T19:29:09.714725Z","submitted_at":"2024-10-07T17:36:37Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-15T00:42:11.891829Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2410.05229"},"observation_digest":"sha256:1b104d74c268b4dbe0781ee0471bd3cea4c395ed8e720e64cab1b76a0617288b","observation_id":"c48aaa80-7339-4a1b-8956-8aa715d29f5a","resolution":{"observed_at":"2026-05-15T00:42:12.046595Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":"2406.04229","doi":"10.48550/arxiv.2406.04229","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.04229 , year=","venue":"arXiv (Cornell University)","work_id":"2acd8b85-536a-4d3a-b032-a6a380f0ccb7","year":2024},"citing_paper":{"arxiv_id":"2502.05171","last_updated":"2025-02-17T17:14:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-07T18:55:02Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","version":2},"reference_index":107,"source":"arxiv_source","source_observed_at":"2026-05-12T15:39:40.845703Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2502.05171"},"observation_digest":"sha256:aaff69ac67851999f119a29eda39b8bc50e840ce11d14c91b7eb58743826cc7a","observation_id":"5a6be35d-6b89-4932-ac5d-b70b9893f96a","resolution":{"observed_at":"2026-05-12T15:39:40.950070Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-03T19:22:02.430464Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01113","last_updated":"2026-07-13T20:34:04Z","snapshot_observed_at":"2026-08-07T11:25:32.057107Z","submitted_at":"2025-11-30T22:19:55Z","title":"Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:02.430464Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2512.01113"},"observation_digest":"sha256:11d5af66555b5616461708c791b8e705db4bfc6001f3c414c4f854ebb2933874","observation_id":"921699bc-5eec-49e9-b5b7-0b2a3de27276","resolution":{"observed_at":"2026-08-03T19:22:02.430464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-03T06:26:57.013652Z","title":"The CLRS -text algorithmic reasoning language benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.23207","last_updated":"2026-06-05T15:55:12Z","snapshot_observed_at":"2026-08-06T02:37:50.151833Z","submitted_at":"2026-01-30T17:31:26Z","title":"Learning to Execute Graph Algorithms Exactly with Graph Neural Networks","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-03T06:26:57.013652Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2601.23207"},"observation_digest":"sha256:5a57cd0e1dd94d41b79916bfe35dfc35e89e3a78c419306998d206fdf88f92ca","observation_id":"99dfe176-702c-4086-87ed-811dfbb60f13","resolution":{"observed_at":"2026-08-03T06:26:57.013652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":"2406.04229","doi":"10.48550/arxiv.2406.04229","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.04229 , year=","venue":"arXiv (Cornell University)","work_id":"2acd8b85-536a-4d3a-b032-a6a380f0ccb7","year":2024},"citing_paper":{"arxiv_id":"2606.24980","last_updated":"2026-06-23T13:02:06Z","snapshot_observed_at":"2026-08-06T19:00:06.168454Z","submitted_at":"2026-06-23T13:02:06Z","title":"Closed-Loop Graph Algorithm Execution with Small Language Models: Step Accuracy and Rollout Reliability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T00:45:31.424547Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2606.24980"},"observation_digest":"sha256:a6f3a36cc09676ef25c8acc7e7a162ab462257c8e36ce935feaf4874037cfe09","observation_id":"60b7d41a-fb58-410c-9fa4-358847c8206f","resolution":{"observed_at":"2026-07-04T16:19:57.918233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-07-14T12:50:33.254161Z","title":"The clrs-text algorithmic reasoning language benchmark.arXiv preprint arXiv:2406.04229, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10296","last_updated":"2026-07-11T12:47:27Z","snapshot_observed_at":"2026-08-06T14:05:48.466865Z","submitted_at":"2026-07-11T12:47:27Z","title":"SPARK: Susceptibility-Guided Profiling and Steering of Latent Reasoning States in Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T12:50:33.254161Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2607.10296"},"observation_digest":"sha256:0121148ab480e93150718d3834004edddd5a669459ae026f1cc430752d28f137","observation_id":"d8caa506-7b4c-4fa5-ae2f-83bdd1f1dfd1","resolution":{"observed_at":"2026-07-14T12:50:33.254161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04229","snapshot_observed_at":"2026-07-30T11:33:02.603897Z","title":"The CLRS-text algorithmic reasoning language benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26083","last_updated":"2026-07-26T19:31:17Z","snapshot_observed_at":"2026-08-03T14:31:55.206302Z","submitted_at":"2026-07-26T19:31:17Z","title":"Cross-Model Cross-Language AI Coding Agent Performance: Accuracy and Speed of Parallel CLRS Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T11:33:02.603897Z"},"links":{"cited_paper":"/paper/2406.04229","citing_paper":"/paper/2607.26083"},"observation_digest":"sha256:f6f2738a3173f9fd1480be8178826f4f71b55b036882981593214300db152c93","observation_id":"e1798f1c-6a9c-46e4-ae61-0caf53b29e1a","resolution":{"observed_at":"2026-07-30T11:33:02.603897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.04229/citation-record","integrity":"/paper/2406.04229/integrity","json":"/paper/2406.04229/citation-record.json","paper":"/paper/2406.04229"},"outbound":[],"paper":{"arxiv_id":"2406.04229","last_updated":"2024-06-06T16:29:25Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:29:25Z","title":"The CLRS-Text Algorithmic Reasoning Language Benchmark"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.04229."}