{"as_of":"2026-08-10T22:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb9685916c27c3fb480485bd46e24f87d77c0b7d8ac1a58711eab40c7a722dab","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":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:18:49.297876Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","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":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2504.01943","last_updated":"2025-08-07T23:04:55Z","snapshot_observed_at":"2026-08-08T04:08:24.938705Z","submitted_at":"2025-04-02T17:50:31Z","title":"OpenCodeReasoning: Advancing Data Distillation for Competitive Coding","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-17T19:21:42.081762Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2504.01943"},"observation_digest":"sha256:e4dc4ed50b5be14fdc2a636ce091481d07b8ad675b7a32f0ffb1feefcc742b21","observation_id":"168ccc8c-3374-4594-be38-0393a235f81f","resolution":{"observed_at":"2026-05-17T19:21:42.190903Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-07T14:18:49.297876Z","title":"Kodcode: A diverse, challenging, and verifiable synthetic dataset for coding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19502","last_updated":"2025-05-26T04:29:14Z","snapshot_observed_at":"2026-08-08T05:31:17.095413Z","submitted_at":"2025-05-26T04:29:14Z","title":"CODE-DITING: A Reasoning-Based Metric for Functional Alignment in Code Evaluation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:49.297876Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2505.19502"},"observation_digest":"sha256:f92fef3501dfc7b925c1fa317c3fd6cf8d92bf3916320a7913589a26c2ab1cd8","observation_id":"3a2a8f9d-ef7c-44b5-8dbe-1e0898697da3","resolution":{"observed_at":"2026-08-07T14:18:49.297876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-07T14:11:06.837138Z","title":"Kodcode: A diverse, challenging, and verifiable synthetic dataset for coding.arXiv preprint arXiv:2503.02951, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19914","last_updated":"2025-06-09T07:49:32Z","snapshot_observed_at":"2026-08-07T16:09:17.796555Z","submitted_at":"2025-05-26T12:40:31Z","title":"Enigmata: Scaling Logical Reasoning in Large Language Models with Synthetic Verifiable Puzzles","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:11:06.837138Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2505.19914"},"observation_digest":"sha256:09c9fa1a77451278ec675cab1c3ac8e3e1b000d59b614bb29421e3e2996203b0","observation_id":"6b402227-a144-481c-b7f7-da4da9a64e55","resolution":{"observed_at":"2026-08-07T14:11:06.837138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-07T13:00:24.860735Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23060","last_updated":"2025-08-23T09:05:01Z","snapshot_observed_at":"2026-08-09T22:08:14.309775Z","submitted_at":"2025-05-29T04:04:44Z","title":"Self-Correcting Code Generation Using Small Language Models","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T13:00:24.860735Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2505.23060"},"observation_digest":"sha256:a92c714747464b4eaf3556d6a15f63aaa46a1fa69b9c6ffd505e5288a9430678","observation_id":"b979841d-ad02-44f0-a740-e00d54881dc5","resolution":{"observed_at":"2026-08-07T13:00:24.860735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-07T12:39:57.824234Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24098","last_updated":"2025-05-30T01:00:34Z","snapshot_observed_at":"2026-08-09T17:58:14.173767Z","submitted_at":"2025-05-30T01:00:34Z","title":"HardTests: Synthesizing High-Quality Test Cases for LLM Coding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:57.824234Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2505.24098"},"observation_digest":"sha256:0bebd32222746bea28d45e3c356a4eabb48c83a00dfb274de3cfd62df8582dd3","observation_id":"c61da6a1-b863-4077-b298-007329eaa1e2","resolution":{"observed_at":"2026-08-07T12:39:57.824234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-07T06:02:33.047913Z","title":"Kodcode: A diverse, challenging, and verifiable synthetic dataset for coding","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06122","last_updated":"2025-06-06T14:33:56Z","snapshot_observed_at":"2026-08-07T21:55:43.371585Z","submitted_at":"2025-06-06T14:33:56Z","title":"Reinforcement Learning Optimization for Large-Scale Learning: An Efficient and User-Friendly Scaling Library","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T06:02:33.047913Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2506.06122"},"observation_digest":"sha256:fe51e813294d67da02841b550ac6476ff9712b4b0f7bf3cde4a045d43663fb26","observation_id":"93fe47af-8199-4c12-9e38-51a65f955481","resolution":{"observed_at":"2026-08-07T06:02:33.047913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2507.01679","last_updated":"2026-05-15T06:56:26Z","snapshot_observed_at":"2026-08-02T08:39:49.062624Z","submitted_at":"2025-07-02T13:04:09Z","title":"Blending Supervised and Reinforcement Fine-Tuning with Prefix Sampling","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-21T23:39:39.018498Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2507.01679"},"observation_digest":"sha256:1ffe48f76cd7d2424c934b46285f899e9229d55545e03816274f45271d30b295","observation_id":"ee0c018a-43f9-4e84-8889-707034a2b63d","resolution":{"observed_at":"2026-05-21T23:40:46.423695Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-06T18:11:19.939735Z","title":", author Liu, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09075","last_updated":"2025-07-11T23:35:54Z","snapshot_observed_at":"2026-08-09T12:00:51.451716Z","submitted_at":"2025-07-11T23:35:54Z","title":"OpenCodeReasoning-II: A Simple Test Time Scaling Approach via Self-Critique","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:19.939735Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2507.09075"},"observation_digest":"sha256:1cf5e0d2685646df83c72b6e4ff836051a99abd27e2fceddf10c0db9dd3e2770","observation_id":"36e4edfb-bd0d-41c7-a671-120befd8290a","resolution":{"observed_at":"2026-08-06T18:11:19.939735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-05-10T17:49:27.926646Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2507.20534"},"observation_digest":"sha256:cfd4c555b9405060b2814c2ff499b27708d4bb27f26ec95fcacd64c0990dc1d0","observation_id":"18cfefcb-2b71-4a12-a8f5-032144af1d1e","resolution":{"observed_at":"2026-05-10T17:49:28.091042Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T12:56:35.187842Z","title":"Kodcode: A diverse, challenging, and verifiable synthetic dataset for coding","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.01142","last_updated":"2025-09-01T05:30:56Z","snapshot_observed_at":"2026-08-08T06:17:53.010186Z","submitted_at":"2025-09-01T05:30:56Z","title":"Dream-Coder 7B: An Open Diffusion Language Model for Code","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-05T12:56:35.187842Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2509.01142"},"observation_digest":"sha256:7b7f8d2ff5be992ccbc0e6071562408945e87e92ccd2807285a2f92643a5ec60","observation_id":"9d9a3948-c25e-4233-b6df-7ae0d53d5831","resolution":{"observed_at":"2026-08-05T12:56:35.187842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-04T08:26:08.216947Z","title":"doi:10.48550/arXiv.2503.02951 , archiveprefix =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.20521","last_updated":"2026-07-29T03:56:56Z","snapshot_observed_at":"2026-08-10T04:37:32.813317Z","submitted_at":"2025-10-23T13:04:22Z","title":"Large Language Models for Fault Localization: An Empirical Study","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T08:26:08.216947Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2510.20521"},"observation_digest":"sha256:0be5a2272428c437b09f1aaa438a1a67d1996a071398a291d011626c63330eb6","observation_id":"46eb14e7-3065-48eb-8b30-a7e1d3387ca4","resolution":{"observed_at":"2026-08-04T08:26:08.216947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2511.07833","last_updated":"2026-05-09T19:03:03Z","snapshot_observed_at":"2026-08-07T14:38:48.465010Z","submitted_at":"2025-11-11T05:03:22Z","title":"MURPHY: Feedback-Aware GRPO with Retrospective Credit Assignment for Multi-Turn Code Generation","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-17T23:13:43.754235Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2511.07833"},"observation_digest":"sha256:8a71021c6c50803b61f6e4c510675eaeb014d12b856febc40c7901a5288f12ee","observation_id":"3c6e2350-a71e-4b38-b8a7-d1f6d650143f","resolution":{"observed_at":"2026-05-17T23:15:26.757913Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-03T13:06:57.148919Z","title":"Kod- Code: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding.ArXiv preprint, abs/2503.02951, 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":18,"source":"pdf_text","source_observed_at":"2026-08-03T13:06:57.148919Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2601.00575"},"observation_digest":"sha256:77d60573497029f7ac8055f0ec8b7e992ddf0d0477f03d7845304b8e77157361","observation_id":"8bbdfa41-e06b-4a2d-bfaf-9a5b9630502a","resolution":{"observed_at":"2026-08-03T13:06:57.148919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2604.07864","last_updated":"2026-06-28T14:24:43Z","snapshot_observed_at":"2026-07-13T00:12:30.852396Z","submitted_at":"2026-04-09T06:24:54Z","title":"ZeroCoder: Can LLMs Improve Code Generation Without Ground-Truth Supervision?","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T18:36:23.127141Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2604.07864"},"observation_digest":"sha256:cb90cdd7e3cfdb4a900a316ac0e21d2a40e457d2d6fae1aaa1825b4f59238ee8","observation_id":"a7787426-13da-4323-86f1-4ce39c29439a","resolution":{"observed_at":"2026-05-11T00:20:51.969223Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.07711","last_updated":"2026-05-21T08:28:27Z","snapshot_observed_at":"2026-08-05T04:52:52.507746Z","submitted_at":"2026-05-08T13:16:17Z","title":"SimCT: Recovering Lost Supervision for Cross-Tokenizer On-Policy Distillation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-11T03:01:13.168529Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.07711"},"observation_digest":"sha256:5b94083255690f625eebafa34e5536337cad4ad4389f46c8b263fa1fe0523ece","observation_id":"b40565f2-3ce2-4828-8799-6e621d11b799","resolution":{"observed_at":"2026-05-11T03:05:53.710057Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.07711","last_updated":"2026-05-21T08:28:27Z","snapshot_observed_at":"2026-08-05T04:52:52.507746Z","submitted_at":"2026-05-08T13:16:17Z","title":"SimCT: Recovering Lost Supervision for Cross-Tokenizer On-Policy Distillation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-22T10:30:11.309910Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.07711"},"observation_digest":"sha256:e14eb93c183ebefc5a99ac7a010feafaf31813378c777d0414a28b686e52e51b","observation_id":"953d47c2-8f7f-47d5-9625-98c6e36cf3d1","resolution":{"observed_at":"2026-05-22T10:31:24.914644Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.08472","last_updated":"2026-05-08T20:46:35Z","snapshot_observed_at":"2026-07-06T23:20:43.010758Z","submitted_at":"2026-05-08T20:46:35Z","title":"Mid-Training with Self-Generated Data Improves Reinforcement Learning in Language Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-12T01:11:50.343466Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.08472"},"observation_digest":"sha256:838783a698157c64c2c6716bf9c7d2e282c97ab1a6c33a37ff7e43c3c1f165cf","observation_id":"3517e1bb-4afc-45e7-b370-e2d00fa5ba8c","resolution":{"observed_at":"2026-05-12T08:26:23.303325Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.08905","last_updated":"2026-05-09T11:57:25Z","snapshot_observed_at":"2026-07-06T23:21:06.773761Z","submitted_at":"2026-05-09T11:57:25Z","title":"Forge: Quality-Aware Reinforcement Learning for NP-Hard Optimization in LLMs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T02:44:33.143247Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.08905"},"observation_digest":"sha256:1c76f96ff8adc0e05daabc34164be1435e33bf22aacd478a6671f00d4cb54fcc","observation_id":"a0988b21-4bcb-4aab-a375-ae9673a2a769","resolution":{"observed_at":"2026-05-12T02:46:18.864801Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.09304","last_updated":"2026-05-10T04:02:10Z","snapshot_observed_at":"2026-08-04T21:52:56.469407Z","submitted_at":"2026-05-10T04:02:10Z","title":"Generating Complex Code Analyzers from Natural Language Questions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-12T05:02:19.519786Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.09304"},"observation_digest":"sha256:4278e1035182ba0df8d835230bb53201df58c88b319ff33574d5b96b879dec16","observation_id":"b49fa7b3-ae8d-487a-9524-485231f539c9","resolution":{"observed_at":"2026-05-12T05:41:26.727138Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.16342","last_updated":"2026-05-08T01:02:31Z","snapshot_observed_at":"2026-07-06T23:27:29.931962Z","submitted_at":"2026-05-08T01:02:31Z","title":"DACA-GRPO: Denoising-Aware Credit Assignment for Reinforcement Learning in Diffusion Language Models","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-20T22:53:48.008589Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.16342"},"observation_digest":"sha256:2980f497c2f7172431a59defbd2f57c967746467a2b173ee5f7698a373ba4782","observation_id":"96b62dc2-a8bd-41b7-ae0a-3fae125654aa","resolution":{"observed_at":"2026-05-20T22:54:09.783102Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2605.18597","last_updated":"2026-05-19T03:38:49Z","snapshot_observed_at":"2026-07-06T23:29:29.105126Z","submitted_at":"2026-05-18T16:07:44Z","title":"Latent Action Reparameterization for Efficient Agent Inference","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-20T10:45:20.306945Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2605.18597"},"observation_digest":"sha256:e184853dd5a32f17190876000e65b00871e4390cbe77febc5c0eda9b99641720","observation_id":"79fe5607-798f-4737-b610-f9c285e52c92","resolution":{"observed_at":"2026-05-20T10:48:12.896953Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2606.07006","last_updated":"2026-06-05T07:52:40Z","snapshot_observed_at":"2026-07-06T23:46:42.693840Z","submitted_at":"2026-06-05T07:52:40Z","title":"RASFT: Rollout-Adaptive Supervised Fine-Tuning for Reasoning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T22:25:52.959859Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2606.07006"},"observation_digest":"sha256:e7a8f241a966e79301cd307ba0f795418c12967137cb0d0983c5d5416c03727b","observation_id":"9c1556bf-f6d7-453e-862c-80080e018cdd","resolution":{"observed_at":"2026-06-27T22:31:21.098357Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2606.18487","last_updated":"2026-06-22T09:16:48Z","snapshot_observed_at":"2026-08-05T23:38:39.942175Z","submitted_at":"2026-06-16T20:59:55Z","title":"SFT Overtraining Predicts Rank Inversion via Entropy Collapse Under RLVR","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T01:15:18.237335Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2606.18487"},"observation_digest":"sha256:827f212c8e4b66a7a6e6f4b9e2f4d1154c1f6c3bd9bb18a17af6e0c1815c81ed","observation_id":"a559ae72-821f-40f6-ba02-a2ec40d16950","resolution":{"observed_at":"2026-07-03T20:38:55.641095Z","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:a1c6c376a4904848885852a344765eea5b702ed1d5f110e3e4a540b17fd54656","observation_id":"32c6cc84-9aad-480c-9451-a4d867a98f44","resolution":{"observed_at":"2026-07-10T19:57:34.152440Z","resolver_source":"local_arxiv","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":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-02T02:01:57.341870Z","title":"Kodcode: A diverse, challenging, and verifiable synthetic dataset for coding","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14506","last_updated":"2026-07-16T02:42:24Z","snapshot_observed_at":"2026-08-10T11:42:23.996756Z","submitted_at":"2026-07-16T02:42:24Z","title":"Non-vacuous Generalization Bounds for Reinforcement Learning with Verifiable Rewards","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-02T02:01:57.341870Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2607.14506"},"observation_digest":"sha256:b0a5f2d85153116545f708f576961cc521d456f838891e7335f2d5219e10d59d","observation_id":"f37a584f-be9e-40c1-869a-5dca6eb208d5","resolution":{"observed_at":"2026-08-02T02:01:57.341870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-01T05:09:59.059091Z","title":"Realized-path","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22334","last_updated":"2026-07-24T14:12:54Z","snapshot_observed_at":"2026-08-06T13:13:09.326315Z","submitted_at":"2026-07-24T14:12:54Z","title":"Cross-Tokenizer On-Policy Distillation via Byte-Prefix Marginalization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T05:09:59.059091Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2607.22334"},"observation_digest":"sha256:73774ddaf6290482216533f28228ab03f211ae76a6cad83f94981e26cc1981a9","observation_id":"24bd331e-ab2e-4fc7-b682-51c81dd77a38","resolution":{"observed_at":"2026-08-01T05:09:59.059091Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.02951/citation-record","integrity":"/paper/2503.02951/integrity","json":"/paper/2503.02951/citation-record.json","paper":"/paper/2503.02951"},"outbound":[],"paper":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:29:28.382943Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding"},"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 26 inbound Pith citation observations for arXiv:2503.02951."}