{"as_of":"2026-08-17T00:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5da4acb16361c139f8c6d64d18a7778767b651f51f5dab6c9d3e8d08f202521e","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:16:54.062561Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":17,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:58:29.546047Z","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-04T20:00:08.049484Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-08-06T00:58:29.546047Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05686","last_updated":"2025-08-06T05:04:14Z","snapshot_observed_at":"2026-08-14T02:36:06.615768Z","submitted_at":"2025-08-06T05:04:14Z","title":"Efficiency of turbulence","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:58:29.546047Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2508.05686"},"observation_digest":"sha256:56d943fe28de4edc0bad89418a895d16d98c935e850bae30d1e64a9d8e3015a4","observation_id":"04ee19d5-cf52-49c3-9201-0fbd4a55cc73","resolution":{"observed_at":"2026-08-06T00:58:29.546047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2508.15229","last_updated":"2026-04-18T14:51:42Z","snapshot_observed_at":"2026-08-13T11:29:55.990098Z","submitted_at":"2025-08-21T04:32:13Z","title":"VocabTailor: Dynamic Vocabulary Selection for Downstream Tasks in Small Language Models","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T22:37:01.014698Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2508.15229"},"observation_digest":"sha256:869c447d9f130afdc6ba5f3b64de57332f1c5b7a9a662c43dd1867b1475562f6","observation_id":"69177114-fb57-46ca-b6fa-4a298658617b","resolution":{"observed_at":"2026-05-18T22:41:53.983783Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2604.02721","last_updated":"2026-04-03T04:26:56Z","snapshot_observed_at":"2026-08-16T04:31:15.817344Z","submitted_at":"2026-04-03T04:26:56Z","title":"GrandCode: Achieving Grandmaster Level in Competitive Programming via Agentic Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-13T20:30:17.791973Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2604.02721"},"observation_digest":"sha256:1decc3fa1935d50da4ccf6ddc3ee3da3c0f7a65559b628304cc877d265f58629","observation_id":"239115be-63d0-43dc-b148-758f9b4f7e24","resolution":{"observed_at":"2026-05-13T20:33:16.615464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2604.02776","last_updated":"2026-04-03T06:37:51Z","snapshot_observed_at":"2026-08-14T07:46:21.749389Z","submitted_at":"2026-04-03T06:37:51Z","title":"Evaluating the Environmental Impact of using SLMs and Prompt Engineering for Code Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-13T20:12:12.283350Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2604.02776"},"observation_digest":"sha256:2ff51a287a2f0200caba7d5e3af071451b75a20799f33bda80b525834432941d","observation_id":"60725cbe-5a7c-4576-b14c-33717da344e0","resolution":{"observed_at":"2026-05-13T20:13:13.186282Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2604.06755","last_updated":"2026-04-08T07:21:02Z","snapshot_observed_at":"2026-07-06T22:55:11.560398Z","submitted_at":"2026-04-08T07:21:02Z","title":"Babbling Suppression: Making LLMs Greener One Token at a Time","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T18:29:07.600595Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2604.06755"},"observation_digest":"sha256:31b714945ae0288a1c0aadcdde7a3bfd8cb618c12a890ed2c7025b9e2d365d23","observation_id":"955ff430-9efe-46e4-8138-ac02a52c14aa","resolution":{"observed_at":"2026-05-11T00:30:53.255284Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2604.16321","last_updated":"2026-02-25T07:55:49Z","snapshot_observed_at":"2026-08-15T23:44:14.482796Z","submitted_at":"2026-02-25T07:55:49Z","title":"LLM-Based Multi-Agent Systems for Code Generation: A Multi-Vocal Literature Review","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-15T19:52:49.324500Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2604.16321"},"observation_digest":"sha256:2fa08b852688cd86158bd82575f8ad9d2bade980a51bfc693925fc7734250c86","observation_id":"358b1b43-ce37-4c1d-be34-ae33bee6a9f8","resolution":{"observed_at":"2026-05-15T19:56:33.904422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.02431","last_updated":"2026-05-04T10:30:33Z","snapshot_observed_at":"2026-08-16T01:42:36.527263Z","submitted_at":"2026-05-04T10:30:33Z","title":"ARIADNE: Agentic Reward-Informed Adaptive Decision Exploration via Blackboard-Driven MCTS for Competitive Program Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T17:58:54.689999Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.02431"},"observation_digest":"sha256:2cbcbb2c3f00e71522de3757b7b77b49df1386284c42607d48c672265559d737","observation_id":"1ecb0a35-f0e8-4d90-8c0e-4e85af375247","resolution":{"observed_at":"2026-05-09T06:55:42.820443Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.08553","last_updated":"2026-05-08T23:25:05Z","snapshot_observed_at":"2026-08-13T04:52:24.109699Z","submitted_at":"2026-05-08T23:25:05Z","title":"VeriContest: A Competitive-Programming Benchmark for Verifiable Code Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-12T01:21:42.562823Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.08553"},"observation_digest":"sha256:16e0295904d642a05206f98625e9b4380bc13b107e45a9f408e977a9798c154c","observation_id":"2a947bd1-5740-442b-8a18-8f23dd486f54","resolution":{"observed_at":"2026-05-12T08:01:32.364032Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.11235","last_updated":"2026-05-11T20:50:29Z","snapshot_observed_at":"2026-08-10T03:47:46.321583Z","submitted_at":"2026-05-11T20:50:29Z","title":"Internalizing Curriculum Judgment for LLM Reinforcement Fine-Tuning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-13T02:19:27.345348Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.11235"},"observation_digest":"sha256:7eb66d36f084d617a6b15a9376dd18134ebfa6a48e6a0cf8f47e6464e32faf08","observation_id":"fa42c759-6d3b-4578-968d-b433a5122221","resolution":{"observed_at":"2026-05-13T02:22:06.798619Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.15301","last_updated":"2026-05-14T18:15:09Z","snapshot_observed_at":"2026-08-15T21:06:47.522910Z","submitted_at":"2026-05-14T18:15:09Z","title":"Solvita: Enhancing Large Language Models for Competitive Programming via Agentic Evolution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T16:28:23.113976Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.15301"},"observation_digest":"sha256:ebf38a4cefe5017712912fe48b99f2c158ad98392934bbcaa1400775ffbc1c93","observation_id":"1361bbf2-acca-4029-a9ef-54c10b4ab031","resolution":{"observed_at":"2026-05-19T16:32:39.523448Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.17526","last_updated":"2026-05-17T16:15:56Z","snapshot_observed_at":"2026-08-15T23:09:07.682704Z","submitted_at":"2026-05-17T16:15:56Z","title":"SaaSBench: Exploring the Boundaries of Coding Agents in Long-Horizon Enterprise SaaS Engineering","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-19T22:43:13.251812Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.17526"},"observation_digest":"sha256:db29f81f8d517a81d48bd612cb92ce5ff799d87ff7a5318c0fcfa60b78ed9e8f","observation_id":"5a541919-924b-4f4e-9952-565c7632313b","resolution":{"observed_at":"2026-05-19T22:43:14.943571Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2605.28751","last_updated":"2026-05-27T17:09:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-27T17:09:30Z","title":"Extrapolative Weight Averaging Reveals Correctness-Efficiency Frontiers in Code RL","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-29T14:41:13.191919Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2605.28751"},"observation_digest":"sha256:084748684d5c00e21d7b3ac702bd3ac6c18c96b37ec4c68f9aff7cfc0afc0ae2","observation_id":"c482698f-1bc6-4b33-a585-280ca926287d","resolution":{"observed_at":"2026-06-29T14:43:30.579464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2606.09711","last_updated":"2026-06-08T16:32:54Z","snapshot_observed_at":"2026-07-06T23:49:03.237958Z","submitted_at":"2026-06-08T16:32:54Z","title":"Proxy Reward Internalization and Mechanistic Exploitation: A Learned Precursor to Reward Hacking and Its Generalization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T16:26:34.918099Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2606.09711"},"observation_digest":"sha256:55e5c5208a3f9fcd584837c7725c86dd717fc8cd6c8622e644e775cf63907203","observation_id":"1fa561b5-d2fc-450c-a0c4-8534ea500de2","resolution":{"observed_at":"2026-07-03T01:37:30.535392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2606.25450","last_updated":"2026-06-25T16:37:45Z","snapshot_observed_at":"2026-08-15T00:00:21.528560Z","submitted_at":"2026-06-24T06:26:02Z","title":"The Generalization Spectrum: A Chromatographic Approach to Evaluating Learning Algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-25T20:55:15.784610Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2606.25450"},"observation_digest":"sha256:e267ed038f556567b4df91017bf79598137dd2a4da4abaeb5523d1d608aa2b7b","observation_id":"16803fd8-0279-4a01-9eb9-e22df035ee6a","resolution":{"observed_at":"2026-07-04T20:00:08.051041Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":"2506.05817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-07-04T20:00:08.049484Z","title":"Codecontests+: High-quality test case generation for competitive programming.CoRR, abs/2506.05817","venue":null,"work_id":"5d79d1be-9433-4607-b21f-787b0400d610","year":2025},"citing_paper":{"arxiv_id":"2606.25450","last_updated":"2026-06-25T16:37:45Z","snapshot_observed_at":"2026-08-15T00:00:21.528560Z","submitted_at":"2026-06-24T06:26:02Z","title":"The Generalization Spectrum: A Chromatographic Approach to Evaluating Learning Algorithms","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-26T05:29:21.598397Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2606.25450"},"observation_digest":"sha256:bd4eba01c97bd7ab0cdda5556e86189d0e9fc5254ef7aee294a0fb53edece86c","observation_id":"9a508b96-0b77-4ecc-9036-58a6e6683d7a","resolution":{"observed_at":"2026-07-04T13:09:50.577915Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-08-01T04:45:11.013818Z","title":"Codecon- tests+: High-quality test case generation for competitive programming,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22471","last_updated":"2026-07-24T16:39:06Z","snapshot_observed_at":"2026-08-16T22:25:29.678486Z","submitted_at":"2026-07-24T16:39:06Z","title":"MineValiCoder: Reliable Code Generation with Test Case Quality Mining and Bipartite Graph-Based Mutual Validation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T04:45:11.013818Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2607.22471"},"observation_digest":"sha256:2ce030bfc4997710ad0798858650f68e3ec1c6306834656810142afe02ea5e8f","observation_id":"c5f7216e-f0b3-48da-82fe-afbcb5095752","resolution":{"observed_at":"2026-08-01T04:45:11.013818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05817","snapshot_observed_at":"2026-08-04T22:23:17.906054Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01715","last_updated":"2026-08-03T05:24:03Z","snapshot_observed_at":"2026-08-16T23:21:31.637456Z","submitted_at":"2026-08-03T05:24:03Z","title":"Coding Agents as Test-Suite Auditors: Finding What Official Suites Miss While Approaching What They Catch","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T22:23:17.906054Z"},"links":{"cited_paper":"/paper/2506.05817","citing_paper":"/paper/2608.01715"},"observation_digest":"sha256:4a0723530eb43d80da5af8685043287b460e11e1ad49d04c36092c8a632228b9","observation_id":"79d8b6c6-2870-4d46-87f0-ef8c806f7fcb","resolution":{"observed_at":"2026-08-04T22:23:17.906054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05817/citation-record","integrity":"/paper/2506.05817/integrity","json":"/paper/2506.05817/citation-record.json","paper":"/paper/2506.05817"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-07T10:16:52.706193Z","title":"Nye, Maarten Bosma, Henryk Michalewski, David Dohan, Ellen Jiang, Carrie J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.706193Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:253f3d9cf2c6187635a141e0994d99f02aa2afcaa92dce43240e0ff173465424","observation_id":"4c964f8b-f59e-4679-95ea-d46c89cd29ca","resolution":{"observed_at":"2026-08-07T10:16:52.706193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:52.748964Z","title":"Seed-thinking-v1.5: Advancing superb reasoning models with reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.748964Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:6b3b77ba32cc7d0c6be7888d7d315f899412b73efabe1c8b0d3a01e6d220e05a","observation_id":"2daa9f0a-b367-494f-a4b2-a0dc69f71305","resolution":{"observed_at":"2026-08-07T10:16:52.748964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-07T10:16:52.804414Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.804414Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:0781ac6d71c5b51a9ca0e9cc8772ea23288974043d36cd3cb2a2bf7b4a62d586","observation_id":"c597b9b4-f68d-45fe-a2bf-3dbde63f7035","resolution":{"observed_at":"2026-08-07T10:16:52.804414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-08-15T12:44:44.609531Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-07T10:16:52.892806Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.892806Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:d2661ca66d2c2cb0dff8822851b5fe9b8a08e569e3d2550b60aa3a79d603ffed","observation_id":"3685dfb9-cbbf-440f-81cb-00da98b0e11c","resolution":{"observed_at":"2026-08-07T10:16:52.892806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-16T21:32:22.938353Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T10:16:52.953682Z","title":"Competitive programming with large reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.953682Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:be497144347991407033766f9aaa0c9efbea32e5bd627d6a14b21d358c54e2f3","observation_id":"ff870720-553e-41ae-ac1e-7aa79506a2df","resolution":{"observed_at":"2026-08-07T10:16:52.953682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T10:16:53.037212Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.037212Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:ffb650350e6f90ca1ce7b26abe8f76255bf6a74fbf179cdf5680cb681058c18d","observation_id":"4a7fa04d-86cc-4042-8d2d-e1bc1a0376fc","resolution":{"observed_at":"2026-08-07T10:16:53.037212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:56.120879Z","title":"Measuring coding challenge com- petence with APPS","venue":null,"work_id":"a3035198-52c9-4648-994d-a7e0251a85b4","year":2021},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.080238Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:800a1a21df8957fd9c02e94454eff348efd1f1d550014d94c7013619dd6e13fd","observation_id":"f1c34b99-2135-4a95-9f4e-a226aa3110d8","resolution":{"observed_at":"2026-08-07T10:16:56.236108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:55.854727Z","title":"LiveCodeBench: Holistic and contamination free evaluation of large language models for code","venue":null,"work_id":"889353b4-d9d5-4a8b-9ab5-0381c870ed3e","year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.165969Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:224709e32168ee2cd29d41570a41d2094ed0587c176aa56268fee914c57b3fe0","observation_id":"1d907147-ed46-4908-a902-1693fc5b79f3","resolution":{"observed_at":"2026-08-07T10:16:56.010067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:54.347502Z","title":"A survey of task allocation and load balancing in distributed systems.IEEE Trans","venue":null,"work_id":"37628ad8-7e35-4810-acf0-86094d9de582","year":2016},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.289297Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:228b38e956feac739f473af935d6f7c262f8cdb2fbd6564cd4b3a235b8a7a0a7","observation_id":"056843b6-3f6e-43aa-a730-e84a93cd1458","resolution":{"observed_at":"2026-08-07T10:16:54.453753Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14852","last_updated":"2023-12-27T10:09:18Z","snapshot_observed_at":"2026-08-16T14:32:08.450873Z","submitted_at":"2023-12-22T17:25:42Z","title":"TACO: Topics in Algorithmic COde generation dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14852","snapshot_observed_at":"2026-08-07T10:16:53.387241Z","title":"TACO: topics in algorithmic code generation dataset.CoRR, abs/2312.14852, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.387241Z"},"links":{"cited_paper":"/paper/2312.14852","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:6ba05876f82702502e6ef421402e3c5a2e1c525bcbb2c0af3b1bbeeb026820a6","observation_id":"89eedddc-b02a-4308-a4a0-54ec973aa9e5","resolution":{"observed_at":"2026-08-07T10:16:53.387241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:53.468690Z","title":"Mankowitz, Esme Sutherland Robson, Pushmeet Kohli, Nando de Freitas, Koray Kavukcuoglu, and Oriol Vinyals","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.468690Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:9431c9484cac5ed03aa561ed70b0baa660e0b3c2f3dccb5d9029ee64d42bfbc2","observation_id":"321a4741-eb68-428b-ace1-85306a9568b6","resolution":{"observed_at":"2026-08-07T10:16:53.468690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:55.662209Z","title":"Is your code generated by ChatGPT really correct? Rigorous evaluation of large language models for code generation","venue":null,"work_id":"73688aed-7b5f-459a-83c6-d5d25c2987c8","year":2023},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.539754Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:ab6e1e5886c62486b14f605e00630576835fe524711a56111abb9d08a03c49ab","observation_id":"a0272293-45d0-41ec-bd15-743a7fecdcde","resolution":{"observed_at":"2026-08-07T10:16:55.763790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:55.429619Z","title":"Testlib, 2005","venue":null,"work_id":"47b46195-fa68-49b9-ab87-e8e808fe1f1e","year":2005},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.626221Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:dd67ad8ca14148d9724a8c1bb46dae3d3224962bc9ebe84710924b4ebacda98b","observation_id":"f82e88b2-8747-4ae4-ba4c-c5acb0e18fbc","resolution":{"observed_at":"2026-08-07T10:16:55.564127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:55.159487Z","title":"Codeforces as an educational platform for learning programming in digitalization.Olympiads in Informatics, 14(133-142):14, 2020","venue":null,"work_id":"99ca18fa-c3ae-443d-ade1-91075a7fa51d","year":2020},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.685626Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:6ca922c7c40c748622b57209a7da7f14092ed3f60a47359f43a0f59281c3b7c7","observation_id":"e8bbfe4e-bc91-45d4-99e9-8c3c70c5df88","resolution":{"observed_at":"2026-08-07T10:16:55.288162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10952","last_updated":"2024-04-16T23:27:38Z","snapshot_observed_at":"2026-08-16T14:00:18.913865Z","submitted_at":"2024-04-16T23:27:38Z","title":"Can Language Models Solve Olympiad Programming?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10952","snapshot_observed_at":"2026-08-07T10:16:53.768867Z","title":"Can language models solve olympiad program- ming?, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.768867Z"},"links":{"cited_paper":"/paper/2404.10952","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:bd56fd4214ae1923fbcbb4a842a00e62af7ad38ebb01ea48b35e976af9c4ef43","observation_id":"2a9de8a7-fe3c-4e2a-8727-1b620dd492b8","resolution":{"observed_at":"2026-08-07T10:16:53.768867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:54.981509Z","title":null,"venue":null,"work_id":"0a203da8-929e-4359-8dd0-9b50d9e2109c","year":2023},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.841280Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:7dc63180ebc4cb65a43453dca0e976a46ce4770c9d75959ae22ac3b54101fd4d","observation_id":"e0bfc4df-6f4d-4f6c-ad82-8d5fd52a81f8","resolution":{"observed_at":"2026-08-07T10:16:55.048830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T10:16:53.908320Z","title":"Qwen2.5 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.908320Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:9571ec345579bb52c1942730e3345791903ed6a36571496f162f5197e621822c","observation_id":"d9368267-91cf-42b5-a34c-96ebbc962884","resolution":{"observed_at":"2026-08-07T10:16:53.908320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14476","last_updated":"2025-05-20T01:37:34Z","snapshot_observed_at":"2026-08-02T01:40:54.187278Z","submitted_at":"2025-03-18T17:49:06Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-07T10:16:53.969387Z","title":"If multiple feasible solutions exist, output any one of them","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:53.969387Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:f0b70969e266e6462e586ebee1c2bdb9cbc1bf93ff81f52b23d5005a151aac2b","observation_id":"381b6018-32b7-4864-a7f0-3657153c080d","resolution":{"observed_at":"2026-08-07T10:16:53.969387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:16:54.786328Z","title":"testlib . h","venue":null,"work_id":"5c52ba28-a6d2-4f03-bf40-89e08af980f8","year":null},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:54.062561Z"},"links":{"citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:3cb1467f19712e3904b6888d97c71fc3954042f9ba685d31a8f5164485045bfb","observation_id":"83287fff-320e-4a39-b637-48838834b0cb","resolution":{"observed_at":"2026-08-07T10:16:54.858078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-15T12:45:23.427079Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":19},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 17 inbound Pith citation observations for arXiv:2506.05817."}