{"as_of":"2026-08-10T10:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1ae76901e0aa76d69c2db5454bc4a0512bb2111ec36affc32bc641f6f71b3da","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":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:23:22.145829Z","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-04T18:30:01.590053Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-08T13:23:22.145829Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.07266","last_updated":"2025-05-27T02:56:52Z","snapshot_observed_at":"2026-08-08T13:14:58.702776Z","submitted_at":"2025-02-11T05:28:59Z","title":"When More is Less: Understanding Chain-of-Thought Length in LLMs","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T13:23:22.145829Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2502.07266"},"observation_digest":"sha256:7c45bc1d426d660badc104b9de9c7d98a5ce08870b84dbb2950e30f00ea6d09a","observation_id":"cbab64a0-80cd-4115-98ff-ef427404d89a","resolution":{"observed_at":"2026-08-08T13:23:22.145829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2505.22312","last_updated":"2025-05-29T09:07:33Z","snapshot_observed_at":"2026-08-08T15:56:07.800611Z","submitted_at":"2025-05-28T12:56:04Z","title":"Skywork Open Reasoner 1 Technical Report","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-17T04:26:47.283983Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2505.22312"},"observation_digest":"sha256:d410424a1113a760e2593023145239098edb25254d8af12a0481cbc15bd06ff0","observation_id":"e039299b-129a-4617-983d-d56ca6c284bd","resolution":{"observed_at":"2026-05-17T04:26:47.355380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-07T12:45:40.247629Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23598","last_updated":"2025-05-29T16:11:18Z","snapshot_observed_at":"2026-08-09T20:10:22.596013Z","submitted_at":"2025-05-29T16:11:18Z","title":"LLM Performance for Code Generation on Noisy Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:40.247629Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2505.23598"},"observation_digest":"sha256:620d207789ee2bb744fcffef70a66ea133e3b332abbe584ff9b33aa319141fde","observation_id":"c3ecf66b-b835-4348-9251-46c8cdb2961b","resolution":{"observed_at":"2026-08-07T12:45:40.247629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-07T01:08:01.421727Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11928","last_updated":"2025-06-13T16:29:09Z","snapshot_observed_at":"2026-08-07T05:17:24.433763Z","submitted_at":"2025-06-13T16:29:09Z","title":"LiveCodeBench Pro: How Do Olympiad Medalists Judge LLMs in Competitive Programming?","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T01:08:01.421727Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2506.11928"},"observation_digest":"sha256:8482a5d7d571ba71d171c5b1bff588ff9cd8513e92e199136a0e15622e7887bc","observation_id":"88adc4bf-2f71-4e37-9529-14dff9aec9bb","resolution":{"observed_at":"2026-08-07T01:08:01.421727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-06T23:58:09.855676Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21595","last_updated":"2025-06-18T17:33:51Z","snapshot_observed_at":"2026-08-09T19:09:21.501829Z","submitted_at":"2025-06-18T17:33:51Z","title":"Thunder-LLM: Efficiently Adapting LLMs to Korean with Minimal Resources","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-06T23:58:09.855676Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2506.21595"},"observation_digest":"sha256:d8dd6c92c5e5263d5f4bfb4e113a9e658a23385cbce87db217bbe734a1be9cb1","observation_id":"6b5cf1a2-b129-471d-9d83-79b48f9e7118","resolution":{"observed_at":"2026-08-06T23:58:09.855676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-06T18:43:59.848050Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07498","last_updated":"2025-07-14T07:10:51Z","snapshot_observed_at":"2026-08-09T12:20:15.585267Z","submitted_at":"2025-07-10T07:34:05Z","title":"Teaching LLM to Reason: Reinforcement Learning from Algorithmic Problems without Code","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T18:43:59.848050Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2507.07498"},"observation_digest":"sha256:1db2f80d7eb28a4ad51554a0fd3b9c1df00556e9b77e484ce726e35a799d783a","observation_id":"b8b0e9da-da06-47ad-8c4d-09724995ea1a","resolution":{"observed_at":"2026-08-06T18:43:59.848050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-06T17:26:57.798530Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.15868","last_updated":"2025-07-15T03:22:07Z","snapshot_observed_at":"2026-08-10T10:12:08.549626Z","submitted_at":"2025-07-15T03:22:07Z","title":"Small Edits, Big Consequences: Telling Good from Bad Robustness in Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:26:57.798530Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2507.15868"},"observation_digest":"sha256:da2c42a7a45efe8dea9ab48e0a894c5ae793856d0af7021a5474655713982edf","observation_id":"1a497670-7b41-4cbb-b7e6-25af520195d5","resolution":{"observed_at":"2026-08-06T17:26:57.798530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-06T15:20:17.686438Z","title":"K., Sun, H., Wu, S., Hu, J., and Xu, X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16331","last_updated":"2026-07-03T09:17:03Z","snapshot_observed_at":"2026-08-07T04:15:41.914807Z","submitted_at":"2025-07-22T08:13:01Z","title":"Re:Form -- Reducing Human Annotations in Scalable Formal Software Verification with RL in LLMs: A Preliminary Study on Dafny","version":4},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-06T15:20:17.686438Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2507.16331"},"observation_digest":"sha256:a776ab57238fd175bde03ae9cb12f1fe3f0797a8b5e96700d8ff3821ed50fc3d","observation_id":"bd8c166a-4143-41dc-9d89-038eee7ac710","resolution":{"observed_at":"2026-08-06T15:20:17.686438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-06T14:53:04.611175Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.17512","last_updated":"2025-07-23T13:51:04Z","snapshot_observed_at":"2026-08-09T23:40:29.433863Z","submitted_at":"2025-07-23T13:51:04Z","title":"Can One Domain Help Others? A Data-Centric Study on Multi-Domain Reasoning via Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T14:53:04.611175Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2507.17512"},"observation_digest":"sha256:5abdb0300ef9d65a0d1ee0f3781a5b5d9b51e0af800e3bde1a17ceb63ff24c67","observation_id":"a669a212-d3d2-46c4-8b50-39da3cbb3553","resolution":{"observed_at":"2026-08-06T14:53:04.611175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2510.01379","last_updated":"2026-04-19T08:10:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-01T19:07:16Z","title":"Multi-LLM Orchestration for High-Quality Code Generation: Exploiting Complementary Model Strengths","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-18T10:22:09.037783Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2510.01379"},"observation_digest":"sha256:bb70d4ca5cbc7cdca13e77c77971a1c465c012e79e2bf176cb8f49ec1d53a52b","observation_id":"477d0844-47a5-426b-b416-27b06eee984e","resolution":{"observed_at":"2026-05-18T10:22:33.298510Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2510.18471","last_updated":"2026-04-22T14:35:52Z","snapshot_observed_at":"2026-08-02T15:24:09.026985Z","submitted_at":"2025-10-21T09:48:06Z","title":"CodeRL+: Improving Code Generation via Reinforcement with Execution Semantics Alignment","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T05:16:28.008746Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2510.18471"},"observation_digest":"sha256:ce02fc110e7fbde3d29c8d9e687b7e194f6ca4b19deaceaf0d880d3ec220500a","observation_id":"c5509687-8d24-4de0-8b8a-917d97791d98","resolution":{"observed_at":"2026-05-18T05:20:54.593415Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-03T13:06:59.145164Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs.ArXiv preprint, abs/2504.14655, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.00575","last_updated":"2026-05-26T07:56:19Z","snapshot_observed_at":"2026-08-03T13:06:54.133045Z","submitted_at":"2026-01-02T05:26:27Z","title":"InfoSynth: Information-Guided Benchmark Synthesis for LLMs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T13:06:59.145164Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2601.00575"},"observation_digest":"sha256:1f24afdab45d7fda01d359aecdfa32108ce89522f74107347e3e07e75f5d73b4","observation_id":"9b42878a-468e-41b8-96ca-7a3cfc5e8e58","resolution":{"observed_at":"2026-08-03T13:06:59.145164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2603.29957","last_updated":"2026-04-27T03:21:20Z","snapshot_observed_at":"2026-08-04T18:04:37.264740Z","submitted_at":"2026-03-31T16:24:03Z","title":"Think Anywhere in Code Generation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-13T23:16:42.782431Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2603.29957"},"observation_digest":"sha256:a07771275989155e075b9b19f97895ac68bddede3f56d0ec2345d440c91507eb","observation_id":"c3a0e1d5-75e5-4c76-afdd-9629eaaf4912","resolution":{"observed_at":"2026-05-13T23:18:25.538454Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-13T12:00:02.401705Z","title":"Leet- CodeDataset: A temporal dataset for robust evaluation and efficient training of code LLMs.arXiv preprint arXiv:2504.14655,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.03922","last_updated":"2026-07-12T05:30:15Z","snapshot_observed_at":"2026-08-10T00:52:25.875514Z","submitted_at":"2026-04-05T01:15:57Z","title":"ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T12:00:02.401705Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.03922"},"observation_digest":"sha256:fd905b32ef9fb7a2fc64a413758689c0fda5317eb1ada96eb65840a40f664d76","observation_id":"d0ec1a28-94b9-4385-aa21-1d56f7429326","resolution":{"observed_at":"2026-07-13T12:00:02.401705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-14T19:54:08.600196Z","title":"Leet- CodeDataset: A temporal dataset for robust evaluation and efficient training of code LLMs.arXiv preprint arXiv:2504.14655,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.03922","last_updated":"2026-07-12T05:30:15Z","snapshot_observed_at":"2026-08-10T00:52:25.875514Z","submitted_at":"2026-04-05T01:15:57Z","title":"ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T19:54:08.600196Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.03922"},"observation_digest":"sha256:a72fda0feaf1e70635dd383fcf1303a8db7693b9a9c138682867200a7a3011f5","observation_id":"7d1c0462-b7d0-4a3f-9062-d1db139bbf3d","resolution":{"observed_at":"2026-07-14T19:54:08.600196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2604.05963","last_updated":"2026-04-07T14:56:38Z","snapshot_observed_at":"2026-08-05T02:26:16.730619Z","submitted_at":"2026-04-07T14:56:38Z","title":"QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T18:41:12.750879Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.05963"},"observation_digest":"sha256:f88f231b2d8e0b2d23e7bb54f7aedcd32d4f041acf5f69e038f09aba21dfda4b","observation_id":"141223fe-3244-469e-968b-53ab39482ae0","resolution":{"observed_at":"2026-05-11T00:10:50.836308Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2604.12268","last_updated":"2026-04-14T04:31:45Z","snapshot_observed_at":"2026-07-06T23:00:32.607699Z","submitted_at":"2026-04-14T04:31:45Z","title":"CodeSpecBench: Benchmarking LLMs for Executable Behavioral Specification Generation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-10T14:54:51.051959Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.12268"},"observation_digest":"sha256:6a868a35c8ee29810d2b7575587e5bebbdba097473d8e8539155359c89f76831","observation_id":"1873c522-6a14-4526-b96f-1d4322fa7e86","resolution":{"observed_at":"2026-05-11T11:26:03.588091Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2604.16322","last_updated":"2026-02-27T21:31:41Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-27T21:31:41Z","title":"Steerable Instruction Following Coding Data Synthesis with Actor-Parametric Schema Co-Evolution","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-15T18:00:39.404711Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.16322"},"observation_digest":"sha256:8f211e3623bdee22becda1f800a4c097d8c61dffd833c58c358f1090f4099a0d","observation_id":"e71600fe-315f-40f2-80bb-15e9c5bf4784","resolution":{"observed_at":"2026-05-15T18:01:25.334520Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2604.23488","last_updated":"2026-07-31T19:56:49Z","snapshot_observed_at":"2026-08-06T23:11:04.568170Z","submitted_at":"2026-04-26T01:26:50Z","title":"Do Prompt-Elicited Trajectories Reflect Training-Time Reward Hacking? A Systematic Study on Monitoring Training-Time Reward Hacking in Code Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T06:38:32.413172Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.23488"},"observation_digest":"sha256:f9d8d43f7dbc4b2ccbb0ed33c7c595a986e3416b9163385e3df3ba7f6239d61d","observation_id":"b622e4c6-f455-4a15-b8b5-4a04ef8f3039","resolution":{"observed_at":"2026-05-11T21:11:10.331536Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2604.23488","last_updated":"2026-07-31T19:56:49Z","snapshot_observed_at":"2026-08-06T23:11:04.568170Z","submitted_at":"2026-04-26T01:26:50Z","title":"Do Prompt-Elicited Trajectories Reflect Training-Time Reward Hacking? A Systematic Study on Monitoring Training-Time Reward Hacking in Code Generation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-01T09:56:48.019404Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.23488"},"observation_digest":"sha256:bcbbcf90c7f050e0dcafef714149a90471fd5daef7c5a06743383eb8fa9dd976","observation_id":"11f3c5fd-13c7-4875-be25-a6711bf71dc1","resolution":{"observed_at":"2026-07-01T10:05:40.195801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-04T05:25:41.152925Z","title":"Preprint, arXiv:2504.14655","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.23488","last_updated":"2026-07-31T19:56:49Z","snapshot_observed_at":"2026-08-06T23:11:04.568170Z","submitted_at":"2026-04-26T01:26:50Z","title":"Do Prompt-Elicited Trajectories Reflect Training-Time Reward Hacking? A Systematic Study on Monitoring Training-Time Reward Hacking in Code Generation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T05:25:41.152925Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2604.23488"},"observation_digest":"sha256:a43f6d142a4fbadf427c45801ae3911752831564fa91182cb0c1a113607a5ef8","observation_id":"b24afdd9-471f-4e1d-bd83-03f676b31a0f","resolution":{"observed_at":"2026-08-04T05:25:41.152925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.06111","last_updated":"2026-05-07T12:24:53Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:24:53Z","title":"Schedule-and-Calibrate: Utility-Guided Multi-Task Reinforcement Learning for Code LLMs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T09:11:20.733960Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.06111"},"observation_digest":"sha256:667435a293e80f36031407d9e34f34bf317750fbb9742578406005066506b315","observation_id":"5b42439a-d642-41dd-93dc-5a5a62d2baab","resolution":{"observed_at":"2026-05-11T20:26:10.412611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.07725","last_updated":"2026-08-03T03:33:59Z","snapshot_observed_at":"2026-08-09T22:35:00.024991Z","submitted_at":"2026-05-08T13:30:42Z","title":"SOD: Step-wise On-policy Distillation for Small Language Model Agents","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-11T02:25:59.056181Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.07725"},"observation_digest":"sha256:382dd840492afd9ba8f55b2fd73a8ba110898061f897daa094e6b0c725f5a0dc","observation_id":"fe0f54f0-85b2-46d0-b37e-68742d50efe2","resolution":{"observed_at":"2026-05-11T03:40:54.525214Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-04T05:20:45.244544Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms.arXiv preprint arXiv:2504.14655, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.07725","last_updated":"2026-08-03T03:33:59Z","snapshot_observed_at":"2026-08-09T22:35:00.024991Z","submitted_at":"2026-05-08T13:30:42Z","title":"SOD: Step-wise On-policy Distillation for Small Language Model Agents","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T05:20:45.244544Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.07725"},"observation_digest":"sha256:bba3637f0fb2c354f2a4ec22d6078fcb5aaa3dd670be003771e4df5d9742d20a","observation_id":"e3b58194-f65f-4788-a235-2c21bf6ce13f","resolution":{"observed_at":"2026-08-04T05:20:45.244544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.14539","last_updated":"2026-05-14T08:22:21Z","snapshot_observed_at":"2026-07-06T23:25:58.895612Z","submitted_at":"2026-05-14T08:22:21Z","title":"Learning from Failures: Correction-Oriented Policy Optimization with Verifiable Rewards","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-15T01:41:31.631505Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.14539"},"observation_digest":"sha256:ad60943ce939455c2b0a92b6f9d3501fd5fa2b0dbeb46163f86fc2601544e4a2","observation_id":"d2beaf0a-b1c1-4f47-89e7-c42a07dc93d6","resolution":{"observed_at":"2026-05-15T01:43:27.576125Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.17958","last_updated":"2026-05-18T07:12:44Z","snapshot_observed_at":"2026-07-06T23:28:55.079333Z","submitted_at":"2026-05-18T07:12:44Z","title":"Enhancing the Code Reasoning Capabilities of LLMs via Consistency-based Reinforcement Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-20T13:13:51.081597Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.17958"},"observation_digest":"sha256:6a6d61d3eaedc8f3f20973428c32278143b5e64ed25216a17d09250e7095d634","observation_id":"14231b6c-ba56-4479-b9c2-6c7635052711","resolution":{"observed_at":"2026-05-20T13:18:18.455978Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.18822","last_updated":"2026-05-12T15:11:44Z","snapshot_observed_at":"2026-08-03T00:45:41.074883Z","submitted_at":"2026-05-12T15:11:44Z","title":"Hybrid-LoRA: Bridging Full Fine-Tuning and Low-Rank Adaptation for Post-Training","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T22:22:50.299625Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.18822"},"observation_digest":"sha256:4f2d89ecedff5ad49a7cbb55463690c29a3edf37cbc446ac90da62e903799c55","observation_id":"17538fcb-026f-4dcf-b60e-c6ea31afe80a","resolution":{"observed_at":"2026-05-20T22:23:47.696918Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2605.26842","last_updated":"2026-05-26T10:56:20Z","snapshot_observed_at":"2026-08-02T04:41:45.987582Z","submitted_at":"2026-05-26T10:56:20Z","title":"MONA: Muon Optimizer with Nesterov Acceleration for Scalable Language Model Training","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-29T19:15:49.229099Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2605.26842"},"observation_digest":"sha256:ac98ac3d20364c92d298293b10f46a9a777a4c507ae44bf3772f53dd1ee86e98","observation_id":"bce36ece-1f7a-429c-a34c-0f0f7f459a10","resolution":{"observed_at":"2026-06-29T19:23:54.151382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2606.25178","last_updated":"2026-06-27T02:34:55Z","snapshot_observed_at":"2026-07-30T22:09:19.101343Z","submitted_at":"2026-06-23T21:10:29Z","title":"Transferability for General Reasoning: An Automated Curriculum for Multi-Domain RLVR","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-25T22:47:09.330723Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2606.25178"},"observation_digest":"sha256:dd4fa5f51e612d09123ad2d68f15aebbe6a2793bb17ed94fba4ed516518e6594","observation_id":"4529a888-af0d-41e7-bd28-683a40258d37","resolution":{"observed_at":"2026-07-04T18:30:01.591682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2606.25178","last_updated":"2026-06-27T02:34:55Z","snapshot_observed_at":"2026-07-30T22:09:19.101343Z","submitted_at":"2026-06-23T21:10:29Z","title":"Transferability for General Reasoning: An Automated Curriculum for Multi-Domain RLVR","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-30T09:55:19.804589Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2606.25178"},"observation_digest":"sha256:5fde6547a4971b7cd86386a226098fad77cd4ac729311de301583da68df24227","observation_id":"2f1882cb-9cb1-43b4-8c28-dfabe97aa7e3","resolution":{"observed_at":"2026-06-30T12:54:40.439898Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":"2504.14655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-04T18:30:01.590053Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms","venue":null,"work_id":"fa4f9b7e-a077-4016-9e1e-920df8d601b6","year":2025},"citing_paper":{"arxiv_id":"2606.31725","last_updated":"2026-06-30T14:26:46Z","snapshot_observed_at":"2026-08-02T21:38:55.765772Z","submitted_at":"2026-06-30T14:26:46Z","title":"Do Machines Struggle Where Humans Do? LLM and Human Comprehension of Obfuscated Code","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-01T04:20:58.193962Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2606.31725"},"observation_digest":"sha256:f4e76dac287ab11cd8069ffacfd8be2231f53f66dd96496ad81a192ff92ac848","observation_id":"0577f2a4-6adc-4ad4-956e-dff38ca3f0eb","resolution":{"observed_at":"2026-07-01T11:35:42.800992Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-07-13T03:34:35.116630Z","title":"CoRRabs/2504.14655(2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09366","last_updated":"2026-07-10T12:44:08Z","snapshot_observed_at":"2026-08-08T15:40:43.691400Z","submitted_at":"2026-07-10T12:44:08Z","title":"Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T03:34:35.116630Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2607.09366"},"observation_digest":"sha256:bc0dac72ba7c9d795f5e70d91ba8fc4b9abb835c8596f03ee97ec536261d35ba","observation_id":"a84ff77f-299f-4d58-9c6d-e18488256e0c","resolution":{"observed_at":"2026-07-13T03:34:35.116630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-01T21:34:28.035103Z","title":"arXiv preprint arXiv:2504.14655 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16051","last_updated":"2026-07-20T15:59:50Z","snapshot_observed_at":"2026-08-09T11:29:07.026465Z","submitted_at":"2026-07-17T15:28:43Z","title":"Loop the Loopies!","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T21:34:28.035103Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2607.16051"},"observation_digest":"sha256:dd5c737e3d7ad14dc578163dd5033037ab7b0d45ba8304dffdf32548c6343d09","observation_id":"f3163d5b-85a4-4540-bacb-13911226eac0","resolution":{"observed_at":"2026-08-01T21:34:28.035103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14655","snapshot_observed_at":"2026-08-01T06:17:29.782230Z","title":"Leetcodedataset: A temporal dataset for robust evaluation and efficient training of code llms.arXiv preprint arXiv:2504.14655,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21971","last_updated":"2026-07-24T04:35:29Z","snapshot_observed_at":"2026-08-08T03:29:18.543567Z","submitted_at":"2026-07-24T04:35:29Z","title":"Teaching LLMs to Self-Evolve: Cultivating Core Meta-Skills with Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T06:17:29.782230Z"},"links":{"cited_paper":"/paper/2504.14655","citing_paper":"/paper/2607.21971"},"observation_digest":"sha256:7452e7e5dc3403df8fdf1af0b376e3fc68e4bd67c9d800600777ce23129bfc31","observation_id":"63972755-8e1c-4bd2-b8cb-66c9de8a73bd","resolution":{"observed_at":"2026-08-01T06:17:29.782230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.14655/citation-record","integrity":"/paper/2504.14655/integrity","json":"/paper/2504.14655/citation-record.json","paper":"/paper/2504.14655"},"outbound":[],"paper":{"arxiv_id":"2504.14655","last_updated":"2025-04-20T15:28:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T10:10:21.478473Z","submitted_at":"2025-04-20T15:28:16Z","title":"LeetCodeDataset: A Temporal Dataset for Robust Evaluation and Efficient Training of Code LLMs"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:2504.14655."}