{"as_of":"2026-08-08T04:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:553dca5050dff4c2f2890ec6f7be0dd8ffafb181a0fb0dd10e25b3c1f3368d36","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-07T06:34:17.273281+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-07T10:10:58.216797Z","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-06T00:58:26.026153Z","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:3cf8aa0ebd98cebca437e4ea78e29aa589a7d9835d5f1c87a78a83a4b1a00522","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-07T10:10:58.216797Z","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-06T13:10:04.037804Z","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:542e02a1b4b90936c9d92e5e616eb746e098e8d0b4c3fba71e52aaa4af620f58","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-01T01:27:54.176469Z","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:2c1f7053638ed9453d443d4be5016ec17ff430e4f1e0cdd8aad8cf4199d39167","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-02T13:25:19.726180Z","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:7db793150e9e4dc74ce71a0f158a530cc80fdbe9f50191d955581502b1fc5d3d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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:2a64c354759d4af382faf2f82a4c5f0ffe11ddbe9ed53804e665e66b2e1517c9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-03T01:31:14.694940Z","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:1f7e2852309fe835973ca7cd46432d536628c99d3436eee63df89ca12d55063c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-07-06T23:15:32.349713Z","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:11c3048d7dc38dd7a80e47659616b8b57e897c98fc32e699e2719126a31ec4ca","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-07-06T23:20:47.880233Z","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:e91b26870c48bd85a59b210af1877968c274e7531ae4560d52fc328fdd76bbab","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-07-06T23:23:06.755816Z","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:17d9e40b8ef0fd2cc381bd4d115983c3bd922d76122bc3577572a2dce70ff36a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-02T11:57:07.030410Z","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:614cdf24fb606e61d65b140a2a80407b116030a7bf823f33b02a0ddb932f7aa3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-04T14:19:36.942893Z","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:a6ea1627b405f7a3fc40d480eb72c1d9e8ae0cc73e0d831737b9e3d9460de756","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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:814c036e2c2dd0582834481b36890dd2a24c65c0d366bc3a7d6d05c3a6ef9384","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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:6ec236515c50d2dd5cae3626686e24c64fb6b5ba9a1bf94c1a34d41b996d3958","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-02T04:58:05.165698Z","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:108d595327ed4959ac49d0e74e4bbe00e4f64b505cdad551d5e82e4967332433","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-02T04:58:05.165698Z","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:287b3e93abd9d53ff8a459d8becfb099d95509aca949efe3fb64edbe424f6d65","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-06T12:59:33.461754Z","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:a45cadd5d76ea247a214478c50bff2246f78beb9bac4851109175a51b2b3d468","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-07T10:10:58.216797Z","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-07T22:47:51.608048Z","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:f2cf096274096df229596bca9459beb92dabca03df6a000a97d96032ebcb2007","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-02T19:23:53.535075Z","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-07T10:10:58.216797Z","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:11e67cb1ef6107dc069e8b6b25d93258a7a3d81812f744daa84ead30e8789237","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-07T10:10:58.216797Z","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:ef907d94c81f070650b9ef68ca6f1227e74855d2bb65cb780534b7bf892cdbba","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-07-06T02:11:23.670680Z","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-07T10:10:58.216797Z","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:efff29ce4db0195ae7bc30eea2d9bb4c8c763b082b3767ee30a0385997838cee","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-07-06T19:59:28.832182Z","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-07T10:10:58.216797Z","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:eb5de27cf769271cc2c779068763225792b9d5dee5b609fa2ee494e8dfc33655","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-05T15:21:07.825807Z","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-07T10:10:58.216797Z","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:1e5d38ce925d226aabb40e5b88ed68f1863b3c33a3edadd81706d03e091e77e7","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-07-06T02:11:23.670680Z","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-07T10:10:58.216797Z","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:8edfc8e5e26d2e038964f415ae808005c4db0b242032d74671e9160dc901de60","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-07T10:10:58.216797Z","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:e0c025e873e0dbaef6186412c59e8d27edfd0354c92fe2ee5e27b6665ce63c06","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-07T10:10:58.216797Z","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:167e2939723ae7805675b1852295074eff77ab71fe627c02d8ddbb3afd743f59","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-07T10:10:58.216797Z","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:1c0b5192464a7b587f6f52aa2aebcf6e6d822e3ffb957d0dd4f9d207141ecb61","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14852","last_updated":"2023-12-27T10:09:18Z","snapshot_observed_at":"2026-07-06T17:07:14.412645Z","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-07T10:10:58.216797Z","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:abf28b728062928d7109ea77c49b5587de3ce920821bf751ca93b658ca16e8bb","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-07T10:10:58.216797Z","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:a88682d7e53accde7ac194900291ba03139209b90ef094cd800902da3954a923","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-07T10:10:58.216797Z","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:0a5530caaa18ad9941838f6178ebff811806aa3b71f98aaf2bb80026c0ceee57","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-07T10:10:58.216797Z","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:8a3ea477d8140c55fd8e9344399fd09c1289d79f6df10fbd4b986f94ba57766f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-07T10:10:58.216797Z","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:986fe1df6788e367f0c7057288a9ad7379a01552177d60ed85336864a9c1dd6c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10952","last_updated":"2024-04-16T23:27:38Z","snapshot_observed_at":"2026-08-07T05:16:48.851507Z","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-07T10:10:58.216797Z","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:efdc4928206bdced864aeea916daac23194980cb0e6949ee67d0677d8a74bad7","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-07T10:10:58.216797Z","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:76f077964936ec1882bcc669f09243ff4da248a9a54f7d3bc54b6f988079edc9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T10:10:58.216797Z","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:8a1555f7a57408c01371f8726a3406f280de6efd5c8d74642cf550d7b6b2e079","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-07T10:10:58.216797Z","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:13a727a5847fec9e8c1c9111e51288b39e784f78653f96b1dd068adf4fc65f76","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-07T10:10:58.216797Z","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:39bba6b9c4bfe186ed467275a257fa0637b232bdc307caefe16f9f3a4570b8fe","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-07T10:10:58.216797Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 17 inbound Pith citation observations for arXiv:2506.05817."}