{"as_of":"2026-08-21T12:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1d7d96bf80e0ae11c4bb599f6df253a4226dedf11850f1991308929a4c8f191","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":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:22:01.121204Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T16:19:57.924347Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"1807.03819","last_updated":"2019-03-05T16:46:19Z","snapshot_observed_at":"2026-08-13T07:34:17.550838Z","submitted_at":"2018-07-10T18:39:15Z","title":"Universal Transformers","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T08:04:31.337298Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/1807.03819"},"observation_digest":"sha256:37ffdc78a0ff1aed959297474616c2a5b7a76220863a5937daf739490fbb40dc","observation_id":"e9d9ff2d-6fca-4d52-acda-912716dff612","resolution":{"observed_at":"2026-05-13T08:04:31.507051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"1906.12266","last_updated":"2019-06-28T15:35:11Z","snapshot_observed_at":"2026-07-06T08:03:38.968054Z","submitted_at":"2019-06-28T15:35:11Z","title":"Growing Action Spaces","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T13:24:59.682609Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/1906.12266"},"observation_digest":"sha256:aa0de6f8d828cf0330d0e2f0c8c797fa8b498c2f552b5a09ce594206395c6beb","observation_id":"0253db41-f22e-4efc-88b5-93bce7c6fa5e","resolution":{"observed_at":"2026-05-25T13:25:52.333023Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-14T12:22:01.121204Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07423","last_updated":"2020-12-16T11:33:08Z","snapshot_observed_at":"2026-08-16T19:13:02.295614Z","submitted_at":"2019-08-20T15:14:54Z","title":"Learning to Sit: Synthesizing Human-Chair Interactions via Hierarchical Control","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:01.121204Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/1908.07423"},"observation_digest":"sha256:0222022b3ea352269ff549ef72fd380bbf038dbdbf795fad2b872c3368a4c411","observation_id":"78e4ffc1-b646-4f0b-bf71-e3e1995d0032","resolution":{"observed_at":"2026-08-14T12:22:01.121204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-14T11:45:19.509600Z","title":"and Sutskever, I","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.08351","last_updated":"2020-02-23T15:42:10Z","snapshot_observed_at":"2026-08-20T20:48:54.208648Z","submitted_at":"2019-08-22T13:08:26Z","title":"Compositionality decomposed: how do neural networks generalise?","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-14T11:45:19.509600Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/1908.08351"},"observation_digest":"sha256:36b082de4596a20f73faed80dddbeee33d073af752bc103ea2f77610910b60e2","observation_id":"6ce56fe7-bd1e-442d-968c-b8e9837a7835","resolution":{"observed_at":"2026-08-14T11:45:19.509600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-08-12T23:06:05.148534Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-05-13T02:39:29.411021Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2104.13478"},"observation_digest":"sha256:0c5cc32c32e8c96c0a097269eb9ca6e04d44b79d36564a25a5cabb35330da2a6","observation_id":"4a3f92e1-c28a-4388-849e-9426416d34a7","resolution":{"observed_at":"2026-05-13T02:39:30.046269Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T13:43:53.640086Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2108.07732"},"observation_digest":"sha256:ed4cfe9209325142a959f2e096b5792dc35bfa3f9cc706b7af5b05bdac2fca65","observation_id":"e7251139-e6e6-4c59-8a8b-780a5bc2c313","resolution":{"observed_at":"2026-05-24T13:44:31.903391Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2112.00114","last_updated":"2021-11-30T21:32:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-11-30T21:32:46Z","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T00:31:41.558831Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2112.00114"},"observation_digest":"sha256:32efdf02ca15e678efa20246483b83040f47cd57dd21097c3f6730429b655602","observation_id":"9adf688c-c123-454a-96a2-2692c18a5aba","resolution":{"observed_at":"2026-05-13T00:31:41.617351Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-08-13T07:04:41.220509Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-10T12:54:44.636760Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2201.11903"},"observation_digest":"sha256:4f1f05b995f90a77e077edf6f683535bc1594aa8e9f504bb7d7190c61891d13a","observation_id":"add10672-f11d-4a0d-b048-a5710680ce1c","resolution":{"observed_at":"2026-05-10T12:54:44.809847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"reference_index":199,"source":"arxiv_source","source_observed_at":"2026-05-12T11:59:25.813128Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2305.10403"},"observation_digest":"sha256:65bc0331441bd08ba817af82256246866585782f714735361ad65f7a06111d9e","observation_id":"f7607f7e-7198-45e4-8166-1f4d8ad300d4","resolution":{"observed_at":"2026-05-12T11:59:27.270417Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2403.16032","last_updated":"2026-04-21T07:29:04Z","snapshot_observed_at":"2026-08-14T05:18:53.327359Z","submitted_at":"2024-03-24T06:21:35Z","title":"DeepFWI: Identifying Bug-Sensitive Warnings with Multi-Modal Code-Warning Semantics","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-24T02:49:45.773698Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2403.16032"},"observation_digest":"sha256:039b12145a0646c8b79d9c700ce2dad49b2f473b195ed58c66966e64d3258253","observation_id":"b49477d0-ccd8-4e96-b6d0-ddeb4b1e65d4","resolution":{"observed_at":"2026-05-24T02:53:48.763025Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-12T16:43:54.101432Z","title":"Learning to Execute,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.15212","last_updated":"2024-11-20T12:11:12Z","snapshot_observed_at":"2026-08-19T12:31:26.039531Z","submitted_at":"2024-11-20T12:11:12Z","title":"Effective Analog ICs Floorplanning with Relational Graph Neural Networks and Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T16:43:54.101432Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2411.15212"},"observation_digest":"sha256:7566e48bfa43039f2027253c303d260a01cc616654d4ab244bd136f201a4e3ff","observation_id":"3e927cf2-8594-49a1-963d-e2aae15bcc1b","resolution":{"observed_at":"2026-08-12T16:43:54.101432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-08T13:11:51.791119Z","title":"and Sutskever, I","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.07316","last_updated":"2025-05-21T13:38:27Z","snapshot_observed_at":"2026-08-16T15:36:15.556886Z","submitted_at":"2025-02-11T07:26:50Z","title":"CodeI/O: Condensing Reasoning Patterns via Code Input-Output Prediction","version":4},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T13:11:51.791119Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2502.07316"},"observation_digest":"sha256:32ae11b4f950677b876e8adb702bfbd50f1cf20bd55dfc0be6dd9b9c49e2396b","observation_id":"11514f86-26f8-4a0d-b90a-7de778c18663","resolution":{"observed_at":"2026-08-08T13:11:51.791119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-08T11:57:12.058622Z","title":"and Sutskever, I","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.09650","last_updated":"2025-05-13T18:54:09Z","snapshot_observed_at":"2026-08-19T13:32:24.767728Z","submitted_at":"2025-02-11T17:01:11Z","title":"Principled Data Selection for Alignment: The Hidden Risks of Difficult Examples","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-08T11:57:12.058622Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2502.09650"},"observation_digest":"sha256:b751fbc0ac2ca32ff81eb24c19ee9aa1f5a2b2b8814a6743e984731d1d8cd3c8","observation_id":"1545fe36-70d1-4250-8e09-1041f3ed5f4b","resolution":{"observed_at":"2026-08-08T11:57:12.058622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-08T15:14:54.221435Z","title":"Learning to execute","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2503.05703","last_updated":"2025-02-10T14:42:13Z","snapshot_observed_at":"2026-08-12T14:00:08.225974Z","submitted_at":"2025-02-10T14:42:13Z","title":"What I cannot execute, I do not understand: Training and Evaluating LLMs on Program Execution Traces","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T15:14:54.221435Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2503.05703"},"observation_digest":"sha256:93f005a68539a23b88fe3cd413ae41fb55e5be5ce20dde003aa752bbe200457c","observation_id":"0881eb4c-f2d6-490e-9ae7-d98c0b56d0ca","resolution":{"observed_at":"2026-08-08T15:14:54.221435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-06T18:43:59.965594Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.07498","last_updated":"2025-07-14T07:10:51Z","snapshot_observed_at":"2026-08-15T12:03:04.307569Z","submitted_at":"2025-07-10T07:34:05Z","title":"Teaching LLM to Reason: Reinforcement Learning from Algorithmic Problems without Code","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T18:43:59.965594Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2507.07498"},"observation_digest":"sha256:18acf190936ed5ff64fb008355d615b9f4c1b3d577126e535fe652667174da68","observation_id":"85f4a8c5-380c-40c7-ac76-6aedd63ed9e2","resolution":{"observed_at":"2026-08-06T18:43:59.965594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-06T05:45:41.230803Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.01250","last_updated":"2025-08-02T08:02:06Z","snapshot_observed_at":"2026-08-15T08:57:56.454010Z","submitted_at":"2025-08-02T08:02:06Z","title":"DisFaceRep: Representation Disentanglement for Co-occurring Facial Components in Weakly Supervised Face Parsing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T05:45:41.230803Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2508.01250"},"observation_digest":"sha256:f6d399f33cbeaca2a5a3414489d41aab44324169bd9d8860cc0b0c0004e536e5","observation_id":"3647c77a-716b-44ac-9ded-5ae8fbbf3740","resolution":{"observed_at":"2026-08-06T05:45:41.230803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2508.05015","last_updated":"2026-04-16T06:15:21Z","snapshot_observed_at":"2026-08-12T14:10:49.692076Z","submitted_at":"2025-08-07T03:50:48Z","title":"SPaCe: Unlocking Sample-Efficient Large Language Models Training With Self-Pace Curriculum Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T00:20:41.922815Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2508.05015"},"observation_digest":"sha256:e59866b6f4c731621963c658b95c9f8eb9905734c4369dace87c232cad8ad67b","observation_id":"f9c921d1-f230-4893-9521-bf627a4053eb","resolution":{"observed_at":"2026-05-19T00:21:56.319651Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-05T15:26:35.944230Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.19873","last_updated":"2025-08-27T13:35:13Z","snapshot_observed_at":"2026-08-10T16:09:31.307221Z","submitted_at":"2025-08-27T13:35:13Z","title":"Beyond Shallow Heuristics: Leveraging Human Intuition for Curriculum Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T15:26:35.944230Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2508.19873"},"observation_digest":"sha256:71e542324ded3faef08293d15d27332de576cadaa5e00a9cb62072406484e4bb","observation_id":"d50a7b23-8aaf-42d6-bc0c-99dea9835fe3","resolution":{"observed_at":"2026-08-05T15:26:35.944230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-08-03T06:26:58.923173Z","title":"Learning to execute","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.23207","last_updated":"2026-06-05T15:55:12Z","snapshot_observed_at":"2026-08-12T21:37:05.239930Z","submitted_at":"2026-01-30T17:31:26Z","title":"Learning to Execute Graph Algorithms Exactly with Graph Neural Networks","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-03T06:26:58.923173Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2601.23207"},"observation_digest":"sha256:b80be0d78ad23f8ab31a63a827ace514eeb09e49d1da8cc311db805bae068c2a","observation_id":"a10ff6c4-9a44-4f0e-92ab-4a0dae5494c4","resolution":{"observed_at":"2026-08-03T06:26:58.923173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2604.25166","last_updated":"2026-04-28T03:15:44Z","snapshot_observed_at":"2026-07-06T23:11:02.043135Z","submitted_at":"2026-04-28T03:15:44Z","title":"Training Transformers as a Universal Computer","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-07T16:36:19.729400Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2604.25166"},"observation_digest":"sha256:11a2b6dfd22d49089696af9ae163848399ad46c79586c104e568b1ca2a0d2f96","observation_id":"6428f3c4-df48-49e2-ad57-8a693792176e","resolution":{"observed_at":"2026-05-11T23:36:39.112779Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"citing_paper":{"arxiv_id":"2605.10237","last_updated":"2026-05-11T09:11:20Z","snapshot_observed_at":"2026-08-11T08:29:59.040807Z","submitted_at":"2026-05-11T09:11:20Z","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-05-12T05:27:11.761971Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2605.10237"},"observation_digest":"sha256:72deb18461842cf0a1c18e923bb022588835b0170e45c4441a1db67752294266","observation_id":"fe5513c9-3f77-4f00-a78f-83b52873b851","resolution":{"observed_at":"2026-05-12T05:31:24.257691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute","version":3},"cited_work":{"arxiv_id":"1410.4615","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.4615","snapshot_observed_at":"2026-07-04T16:19:57.924347Z","title":"Learning to Execute","venue":"cs.NE","work_id":"872d5953-8bb9-40b0-b4a3-aa1db4294cb7","year":2014},"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":1,"source":"pdf_text","source_observed_at":"2026-06-26T00:45:31.424547Z"},"links":{"cited_paper":"/paper/1410.4615","citing_paper":"/paper/2606.24980"},"observation_digest":"sha256:07d95ab6d4bcac10900dbe52abb496d3857b4850ead7b6f9884eb3dbd4c630ef","observation_id":"9c88a939-622a-4fd6-9dfd-c67651ad2816","resolution":{"observed_at":"2026-07-04T16:19:57.925571Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1410.4615/citation-record","integrity":"/paper/1410.4615/integrity","json":"/paper/1410.4615/citation-record.json","paper":"/paper/1410.4615"},"outbound":[],"paper":{"arxiv_id":"1410.4615","last_updated":"2015-02-19T15:33:35Z","latest_version":3,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-14T23:15:21.933877Z","submitted_at":"2014-10-17T01:35:12Z","title":"Learning to Execute"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 22 inbound Pith citation observations for arXiv:1410.4615."}