{"as_of":"2026-08-05T01:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd978e8e659a38c044f27061c953210a140241ce45d52e1732e02eda3f5ca846","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":43,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:37:05.044597Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2204.05999","last_updated":"2023-04-09T14:31:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-12T16:25:26Z","title":"InCoder: A Generative Model for Code Infilling and Synthesis","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T02:21:20.438666Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2204.05999"},"observation_digest":"sha256:64e432c6820dfeb8f670e6e9cd794b6f638029c814b10cea7d07b57d366ab725","observation_id":"088ce5e1-a338-44c6-8051-246140984301","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2211.01910","last_updated":"2023-03-10T17:20:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-03T15:43:03Z","title":"Large Language Models Are Human-Level Prompt Engineers","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T09:43:26.288866Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2211.01910"},"observation_digest":"sha256:9e604dd10c6bcca189aabb89c9d6787c66dc9c21ea0f5ae055063070913cf8b6","observation_id":"08dbc198-e4a0-4431-89b4-778a0cca44a8","resolution":{"observed_at":"2026-05-24T09:43:26.419939Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2211.05100","last_updated":"2023-06-27T09:57:58Z","snapshot_observed_at":"2026-08-04T18:56:03.233715Z","submitted_at":"2022-11-09T18:48:09Z","title":"BLOOM: A 176B-Parameter Open-Access Multilingual Language Model","version":4},"reference_index":265,"source":"arxiv_source","source_observed_at":"2026-05-12T00:51:10.919818Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2211.05100"},"observation_digest":"sha256:e81cbbca1e255fef2c65b3a0f94799dfcd2985336869dd1fdd4c3f6604a66c07","observation_id":"73f16155-2beb-43cd-b3dd-6964a9c6f9c8","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2305.06161","last_updated":"2023-12-13T14:44:10Z","snapshot_observed_at":"2026-07-06T15:25:35.930688Z","submitted_at":"2023-05-09T08:16:42Z","title":"StarCoder: may the source be with you!","version":2},"reference_index":132,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:7f7a3c2794bd3d75dc22a6a64ea75b3d122a796e153199c217b978e2818e87f4","observation_id":"8140df7b-5c77-479d-a724-25ef116525ac","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2305.07922","last_updated":"2023-05-20T07:27:15Z","snapshot_observed_at":"2026-08-01T08:49:52.462843Z","submitted_at":"2023-05-13T14:23:07Z","title":"CodeT5+: Open Code Large Language Models for Code Understanding and Generation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T05:26:57.440959Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2305.07922"},"observation_digest":"sha256:05bc92823bd6946952b41ef5018f5637fb32dbff08d054161c26a4d97b9d54e0","observation_id":"b5d1ebbc-94be-4410-b6a8-39f60b8f2d90","resolution":{"observed_at":"2026-05-19T05:26:57.548257Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"reference_index":286,"source":"arxiv_source","source_observed_at":"2026-05-12T11:59:25.813128Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2305.10403"},"observation_digest":"sha256:02c2ed07cc52bf91fce51a8638746a3d6ae1a57a813a728bf87a7fc79bd0e3e2","observation_id":"4aa5afe1-247e-4e93-b509-fa8edd937bd7","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2305.16291","last_updated":"2023-10-19T16:27:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-25T17:46:38Z","title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-10T13:11:40.995345Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2305.16291"},"observation_digest":"sha256:d2e5f9a852771d1d898854dfa0bbdc594fbcbdd7753361d089583a6a77820860","observation_id":"5855b325-34e2-46e2-a07b-d3e9a7875da7","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2402.13228","last_updated":"2024-07-03T13:46:33Z","snapshot_observed_at":"2026-07-31T05:05:41.080329Z","submitted_at":"2024-02-20T18:42:34Z","title":"Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive","version":2},"reference_index":171,"source":"arxiv_source","source_observed_at":"2026-05-17T23:04:44.287660Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2402.13228"},"observation_digest":"sha256:fc92c2d928f989d4ea981c3f4c17a734d237f1e91e4f5dbd9337d7819f311e1a","observation_id":"7b0f2e67-ef49-4068-b063-aa156dd166aa","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2402.17762","last_updated":"2024-08-14T16:00:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-27T18:55:17Z","title":"Massive Activations in Large Language Models","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-16T07:02:53.740597Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2402.17762"},"observation_digest":"sha256:d79b8f250b5240af95ba7f1bddec712495db4a1165c334e6667eec31205e56a7","observation_id":"3576dd43-7ecb-4202-8aff-56b9e07acc0d","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2408.15815","last_updated":"2026-04-11T09:31:33Z","snapshot_observed_at":"2026-07-06T19:07:07.234443Z","submitted_at":"2024-08-28T14:24:48Z","title":"MR-Adopt: Automatic Deduction of Input Transformation Function for Metamorphic Testing","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T22:17:02.681066Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2408.15815"},"observation_digest":"sha256:d150d25edfa20180d31b42c791d5265180f9bee17bee3454957d641f48f6c093","observation_id":"a4fa9406-8830-493a-9f90-2cbd5d2d6919","resolution":{"observed_at":"2026-05-23T22:18:31.400177Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2502.01456","last_updated":"2025-09-26T09:25:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-03T15:43:48Z","title":"Process Reinforcement through Implicit Rewards","version":2},"reference_index":152,"source":"arxiv_source","source_observed_at":"2026-05-11T20:23:30.763794Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2502.01456"},"observation_digest":"sha256:954365b943f74e2196a22f2cd5d5aabecbb6fb3639f462e571470e5ea452bcc4","observation_id":"72fdf243-1e78-4dc8-8bb0-bd528b431152","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2503.02497","last_updated":"2026-04-16T18:11:21Z","snapshot_observed_at":"2026-07-06T20:46:27.988338Z","submitted_at":"2025-03-04T11:04:35Z","title":"A PennyLane-Centric Dataset to Enhance LLM-based Quantum Code Generation using RAG","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T01:41:25.033971Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2503.02497"},"observation_digest":"sha256:e56445c9abb1c40d348f0d69bd44420349b5f2cb50a1069c0b32574a1dad3687","observation_id":"41f99836-b1e4-4853-9bce-f35fe6feaa85","resolution":{"observed_at":"2026-05-23T01:42:23.175693Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-08-04T10:37:05.044597Z","title":"URL http://dx.doi.org/10.1126/science","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.09595","last_updated":"2026-07-08T17:08:31Z","snapshot_observed_at":"2026-08-04T10:36:55.325152Z","submitted_at":"2025-10-10T17:54:24Z","title":"LiveOIBench: Can Large Language Models Outperform Human Contestants in Informatics Olympiads?","version":3},"reference_index":9203,"source":"pdf_text","source_observed_at":"2026-08-04T10:37:05.044597Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2510.09595"},"observation_digest":"sha256:9480dc2174d050c05a722efa18749d52643fb26bc15f44c812e172ce68d6119a","observation_id":"d266517c-71a9-434f-88d2-ae64ce2eadc5","resolution":{"observed_at":"2026-08-04T10:37:05.044597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2510.14232","last_updated":"2026-04-14T23:27:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-16T02:19:25Z","title":"Scaling Test-Time Compute to Achieve IOI Gold Medal with Open-Weight Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T06:20:16.941026Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2510.14232"},"observation_digest":"sha256:f1343ecfbe9da492188c09ba4349b50caa67b06b23ccd84178e94d81cac1b829","observation_id":"4796b708-d336-44d7-8de4-17c2fd10631f","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2603.11287","last_updated":"2026-05-10T03:42:23Z","snapshot_observed_at":"2026-07-06T22:48:44.253503Z","submitted_at":"2026-03-11T20:26:58Z","title":"Synthesis-in-the-Loop Evaluation of LLMs for RTL Generation: Quality, Reliability, and Failure Modes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T12:35:20.684017Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2603.11287"},"observation_digest":"sha256:a0c0b95f50023237a708ee2600bd2ee7a44d444096c043efa708038a39f1fae6","observation_id":"1ce84947-f201-45e6-b538-701a44ca004e","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-13T14:33:35.834383Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.01193","last_updated":"2026-06-24T22:44:36Z","snapshot_observed_at":"2026-08-02T16:28:38.685624Z","submitted_at":"2026-04-01T17:39:50Z","title":"Embarrassingly Simple Self-Distillation Improves Code Generation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T14:33:35.834383Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.01193"},"observation_digest":"sha256:05dea2a8a4d8fcd82f37d0870946d1b7125a8089bf5f027890a0a885a018d076","observation_id":"37cf376d-5008-4c9a-b382-b07def6fed31","resolution":{"observed_at":"2026-07-13T14:33:35.834383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2604.06231","last_updated":"2026-04-02T02:56:04Z","snapshot_observed_at":"2026-07-06T22:54:44.656835Z","submitted_at":"2026-04-02T02:56:04Z","title":"Automating Database-Native Function Code Synthesis with LLMs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-13T21:21:02.976322Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.06231"},"observation_digest":"sha256:99a2257e65112e74fefb3490f8fe29ef6e3f33a98a5f6f2657bc17ccb5716aa3","observation_id":"285f721b-42cc-4707-8db4-f03e8d27ba92","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2604.09557","last_updated":"2026-05-28T14:40:40Z","snapshot_observed_at":"2026-08-03T16:37:32.743096Z","submitted_at":"2026-02-10T16:19:56Z","title":"SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-16T03:13:37.202362Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.09557"},"observation_digest":"sha256:7ff8a466d9a947f6adbefa4c60e50def768b7a28280bb11f9922b31dfe05fbbd","observation_id":"2fe228d9-c301-4295-b59b-e124ebdca234","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-08-03T02:40:55.849478Z","title":"Competition-level code generation with alphacode","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2604.09557","last_updated":"2026-05-28T14:40:40Z","snapshot_observed_at":"2026-08-03T16:37:32.743096Z","submitted_at":"2026-02-10T16:19:56Z","title":"SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T02:40:55.849478Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.09557"},"observation_digest":"sha256:2faa15263e2e4fae1559fe440eab3716ff9a6f5b14b3bfb84faea497811bbba6","observation_id":"61c1d0c5-0dd1-4a09-8cb6-32957fb30486","resolution":{"observed_at":"2026-08-03T02:40:55.849478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2604.10126","last_updated":"2026-04-17T00:57:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-11T09:42:44Z","title":"MR-Coupler: Automated Metamorphic Test Generation via Functional Coupling Analysis","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:42.720172Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.10126"},"observation_digest":"sha256:4df17a0e4f67889e358720a2e51714147f57ed76261c557bc5e6af05ab11403a","observation_id":"a1308c5f-d92e-4f23-bed9-f36f02e62fa8","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2604.10158","last_updated":"2026-04-11T11:11:06Z","snapshot_observed_at":"2026-07-30T01:17:07.329252Z","submitted_at":"2026-04-11T11:11:06Z","title":"Tracing the Thought of a Grandmaster-level Chess-Playing Transformer","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:56.809032Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2604.10158"},"observation_digest":"sha256:1c8308bc4232dc1d9c7c0ea26814a4aee7440dc9f661f249ddcb8f57b3736837","observation_id":"3073e88d-b44d-4412-ac3e-24ced9340990","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.02741","last_updated":"2026-05-04T15:41:13Z","snapshot_observed_at":"2026-07-06T23:15:46.390406Z","submitted_at":"2026-05-04T15:41:13Z","title":"AI-Generated Smells: An Analysis of Code and Architecture in LLM and Agent-Driven Development","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T18:06:00.379846Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.02741"},"observation_digest":"sha256:12e7fee78c8311554c86265b7bbeae1393aca41e48c424aa6302881910aa7c0c","observation_id":"cbf8ea89-f7e1-4261-b867-52501043ce11","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.06111","last_updated":"2026-05-07T12:24:53Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:24:53Z","title":"Schedule-and-Calibrate: Utility-Guided Multi-Task Reinforcement Learning for Code LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T09:11:20.733960Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.06111"},"observation_digest":"sha256:fbf3f2c28793bc97b610e51452dddcc849a79c38ff4d1ccfe7f3447bc33d3b86","observation_id":"aba23a10-da7c-43a0-ac3c-0cb0da58f8e6","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.11299","last_updated":"2026-05-13T03:29:35Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-11T22:34:45Z","title":"Primal Generation, Dual Judgment: Self-Training from Test-Time Scaling","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-14T20:46:38.558668Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.11299"},"observation_digest":"sha256:3f092dd9fb45b7f21ac963d628d69526a88b05b2823bcae38061bc07f2a21dd2","observation_id":"969e17b7-5318-4198-b11c-27119200a272","resolution":{"observed_at":"2026-05-18T06:43:48.088484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.16142","last_updated":"2026-05-18T14:26:59Z","snapshot_observed_at":"2026-07-06T23:27:20.429737Z","submitted_at":"2026-05-15T16:23:35Z","title":"Property-Guided LLM Program Synthesis for Planning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-20T17:50:16.418931Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.16142"},"observation_digest":"sha256:0d580e7603e90829f89b3f3d49ac5b84b88a8efb277262f1d6f520240240eb4c","observation_id":"8e499ff4-1da3-482c-b395-05c4556174dc","resolution":{"observed_at":"2026-05-20T17:53:36.618462Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.18073","last_updated":"2026-05-18T08:55:30Z","snapshot_observed_at":"2026-07-06T23:28:59.503300Z","submitted_at":"2026-05-18T08:55:30Z","title":"A-ProS: Towards Reliable Autonomous Programming Through Multi-Model Feedback","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-20T09:22:06.285118Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.18073"},"observation_digest":"sha256:0ee1667970938e7e3f03a4b3591b02e9d9e1c63f06c78a6d110afa1d2247362d","observation_id":"65bfe8b8-6d1c-4ed9-a0be-17cf899e431c","resolution":{"observed_at":"2026-05-20T09:23:10.528267Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.20722","last_updated":"2026-05-20T05:20:46Z","snapshot_observed_at":"2026-07-06T23:31:18.520630Z","submitted_at":"2026-05-20T05:20:46Z","title":"AGPO: Adaptive Group Policy Optimization with Dual Statistical Feedback","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.20722"},"observation_digest":"sha256:f1eff2f9e063b1f2d0218ed43abbb025a90a192855a974a8f73f1453677953a2","observation_id":"87cddbe4-3fa7-4cb6-984e-e76d3e04387c","resolution":{"observed_at":"2026-05-21T07:14:02.356790Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2605.27130","last_updated":"2026-05-26T15:00:57Z","snapshot_observed_at":"2026-08-02T21:03:24.556958Z","submitted_at":"2026-05-26T15:00:57Z","title":"DEI: Diversity in Evolutionary Inference for Quality-Diversity Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T18:41:53.436686Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2605.27130"},"observation_digest":"sha256:6273699a6f58d2bfc1339e69be65123ddec6586445be5dc6f7f3cb1eb9be4218","observation_id":"b47079d8-679e-4bd3-be2d-cb7310e259cc","resolution":{"observed_at":"2026-06-29T18:43:50.460338Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.04273","last_updated":"2026-06-02T22:58:19Z","snapshot_observed_at":"2026-07-06T23:44:23.633099Z","submitted_at":"2026-06-02T22:58:19Z","title":"Characterizing initial human-AI proof formalization workflows","version":1},"reference_index":124,"source":"arxiv_source","source_observed_at":"2026-06-28T09:29:50.282874Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.04273"},"observation_digest":"sha256:6617e7908cdf7f02822d401e36ed1a6e91cd93c06acc488e6935a3fb0677fac1","observation_id":"f2795873-9939-41d9-b78f-af119abe73c2","resolution":{"observed_at":"2026-07-02T04:06:34.842073Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.05464","last_updated":"2026-06-03T21:43:38Z","snapshot_observed_at":"2026-08-03T10:19:08.677126Z","submitted_at":"2026-06-03T21:43:38Z","title":"Step-by-Step Optimization-like Reasoning in LLMs over Expanding Search Spaces","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.05464"},"observation_digest":"sha256:eb1d842c3e29ed0a8564bdf001533f6780ca3cf04fdb89675bfde75559066e70","observation_id":"94c1bc3b-1390-43d9-9ff3-754747d4695d","resolution":{"observed_at":"2026-06-28T05:51:40.603780Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.07157","last_updated":"2026-06-26T08:44:02Z","snapshot_observed_at":"2026-07-06T23:46:51.468468Z","submitted_at":"2026-06-05T11:17:08Z","title":"Think Fast: Estimating No-CoT Task-Completion Time Horizons of Frontier AI Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T22:10:01.701850Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.07157"},"observation_digest":"sha256:d3126620e221f832812b68094412f0ce5768b0ab82d6020534efb4bace269db5","observation_id":"91ab839c-115b-438f-a18d-077f465997a2","resolution":{"observed_at":"2026-07-02T17:07:12.986851Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.07157","last_updated":"2026-06-26T08:44:02Z","snapshot_observed_at":"2026-07-06T23:46:51.468468Z","submitted_at":"2026-06-05T11:17:08Z","title":"Think Fast: Estimating No-CoT Task-Completion Time Horizons of Frontier AI Models","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T05:50:40.480874Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.07157"},"observation_digest":"sha256:a2c9a7433ae73dd89236c2c60d013f8212dc4bca1307d124e25106662902097a","observation_id":"6c877ba2-7ac2-43fa-918c-a65b394064de","resolution":{"observed_at":"2026-06-29T05:53:08.756781Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.09135","last_updated":"2026-06-08T07:32:44Z","snapshot_observed_at":"2026-07-06T23:48:30.569726Z","submitted_at":"2026-06-08T07:32:44Z","title":"Steganography Without Modification: Hidden Communication via LLM Seeds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T16:31:01.499103Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.09135"},"observation_digest":"sha256:8a2edeeb81bbb12fc355de25cd0e8bd2555badbe9f6207a38dfe044266fb806b","observation_id":"9c5fe8ff-4a77-4e22-a99a-a5ea50b7bd4c","resolution":{"observed_at":"2026-07-03T01:27:31.285724Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.22610","last_updated":"2026-06-21T17:37:01Z","snapshot_observed_at":"2026-07-06T23:57:28.172988Z","submitted_at":"2026-06-21T17:37:01Z","title":"PaperClaw: Harnessing Agents for Autonomous Research and Human-in-the-Loop Refinement","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-26T10:36:14.840581Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.22610"},"observation_digest":"sha256:86d0c94e455b441f33430e2c4d04255a7e1cf0468fd65cd77da25df638d97918","observation_id":"cbbed088-716d-42c9-bf67-09322359f2fc","resolution":{"observed_at":"2026-07-04T09:09:42.514498Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.25561","last_updated":"2026-06-24T08:37:38Z","snapshot_observed_at":"2026-08-02T18:51:27.426890Z","submitted_at":"2026-06-24T08:37:38Z","title":"CrypFormBench: Benchmarking Formal Analysis Capability of Large Language Models for Cryptographic Schemes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-25T20:51:33.256476Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.25561"},"observation_digest":"sha256:d49c09cd39e6598cc1b6cbc39f8094cc20820bdbf31e22fc2a218dca6da31513","observation_id":"bfc1729c-5f9e-4c8e-b685-c9a2dca31e4f","resolution":{"observed_at":"2026-06-25T20:58:21.166727Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2606.28434","last_updated":"2026-06-26T04:55:24Z","snapshot_observed_at":"2026-08-01T16:45:43.562159Z","submitted_at":"2026-06-26T04:55:24Z","title":"SWE-MeM: Learning Adaptive Memory Management for Long-Horizon Coding Agents","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T01:36:39.836224Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2606.28434"},"observation_digest":"sha256:d86631ecf9d8531cff450d39b66ba4d74447b091f689c209d169039475fcc6cf","observation_id":"016a21ce-5fbe-4386-98ef-14879b7aff5f","resolution":{"observed_at":"2026-06-30T03:34:13.497033Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2607.01953","last_updated":"2026-07-02T09:43:15Z","snapshot_observed_at":"2026-08-03T06:36:37.906637Z","submitted_at":"2026-07-02T09:43:15Z","title":"Underspecification does not imply Incoherence: The Risks of Semantic Collapse in Coding Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-03T09:01:48.501745Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.01953"},"observation_digest":"sha256:32ae64c8636696c606268ff3b7cab5f5c8deb8852f7e3efc3418745a56ec4a52","observation_id":"063f2b35-743e-4273-8c4f-719f3efe028b","resolution":{"observed_at":"2026-07-03T09:07:47.131749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2607.01953","last_updated":"2026-07-02T09:43:15Z","snapshot_observed_at":"2026-08-03T06:36:37.906637Z","submitted_at":"2026-07-02T09:43:15Z","title":"Underspecification does not imply Incoherence: The Risks of Semantic Collapse in Coding Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-03T09:01:48.501745Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.01953"},"observation_digest":"sha256:40df23167919a91a8346b699396f53454b40570d2f543e8b69fd63b9999f8d60","observation_id":"75c9a267-b403-4282-9510-56ff168c240c","resolution":{"observed_at":"2026-07-03T09:07:47.020199Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-11T19:29:32.509575Z","title":"Olausson, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04395","last_updated":"2026-07-05T16:37:41Z","snapshot_observed_at":"2026-08-02T16:01:53.725408Z","submitted_at":"2026-07-05T16:37:41Z","title":"NKI-Agent: Domain-Specific Fine-Tuning and Agentic Tool Use for Neuron Kernel Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T19:29:32.509575Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.04395"},"observation_digest":"sha256:5c3b4dc2d16ab29df3c3219c6453f2dc2a1bbd00276e8a8f3eee6c6040a43f6e","observation_id":"22e6f809-dd66-4b61-8eb0-1fe229378a57","resolution":{"observed_at":"2026-07-11T19:29:32.509575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-11T07:57:43.000834Z","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":"2607.05155","last_updated":"2026-07-06T14:39:22Z","snapshot_observed_at":"2026-07-11T07:57:39.948830Z","submitted_at":"2026-07-06T14:39:22Z","title":"EdgeBench: Unveiling Scaling Laws of Learning from Real-World Environments","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T07:57:43.000834Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.05155"},"observation_digest":"sha256:82fe756e2d0a57d40a0e0e21c5e6d4e7d64e0738e30257b3ecd344f7b836ec5c","observation_id":"3ecf02af-9595-477c-a464-f98d9e60071f","resolution":{"observed_at":"2026-07-11T07:57:43.000834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":"2203.07814","doi":"10.48550/arxiv.2203.07814","metadata_source":"pith","pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Competition-Level Code Generation with AlphaCode","venue":"cs.PL","work_id":"00d9ab4d-e694-4677-8132-332873a8f9a7","year":2022},"citing_paper":{"arxiv_id":"2607.07619","last_updated":"2026-07-08T16:36:03Z","snapshot_observed_at":"2026-08-04T16:15:42.813681Z","submitted_at":"2026-07-08T16:36:03Z","title":"Rethinking Code Performance Benchmarks for LLMs","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-09T05:16:58.549058Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.07619"},"observation_digest":"sha256:14338dd20f2d26e55b30118f45eb4632014c2c4dfbc014df54e75896b9765f39","observation_id":"77e5cd76-c43f-48e6-868a-e6446d139c28","resolution":{"observed_at":"2026-07-09T05:26:01.144105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:34.328608+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-07-13T03:34:35.116630Z","title":"CoRRabs/2203.07814(2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09366","last_updated":"2026-07-10T12:44:08Z","snapshot_observed_at":"2026-08-02T10:03:21.422521Z","submitted_at":"2026-07-10T12:44:08Z","title":"Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T03:34:35.116630Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.09366"},"observation_digest":"sha256:18e5d754f91a289b5deb2e280fc2a27ac5f955e2bd8694c5740ff05580a96169","observation_id":"efc388c3-5563-4c3b-a230-593100859032","resolution":{"observed_at":"2026-07-13T03:34:35.116630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-08-03T00:22:56.610217Z","title":"Competition-Level Code Generation with","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28815","last_updated":"2026-07-30T20:16:35Z","snapshot_observed_at":"2026-08-05T01:11:24.920533Z","submitted_at":"2026-07-30T20:16:35Z","title":"Preventing Premature Commitment in Coding Agents with an Evidence-Conditioned Execution Layer","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-03T00:22:56.610217Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2607.28815"},"observation_digest":"sha256:bcb81ff5f9d3ba3b3c3c1b5ba530dbdfd285a8685686e19b4894634ac1d2e837","observation_id":"ec5ec9d3-c4fd-41b1-bf78-1548b5eb29a9","resolution":{"observed_at":"2026-08-03T00:22:56.610217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.07814/citation-record","integrity":"/paper/2203.07814/integrity","json":"/paper/2203.07814/citation-record.json","paper":"/paper/2203.07814"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/d18-1045","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T22:45:39.967881Z","title":"Understanding Back-Translation at Scale","venue":null,"work_id":"b479bc45-a80e-4ac6-b1f2-fb6fd55129f7","year":2018},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:568022fd8600cd0ffc3864a004fcee5efb663b440372e9acc39e3182ea2e6df2","observation_id":"82268a7b-3c3d-41f8-9578-6e94e1d92aba","resolution":{"observed_at":"2026-05-18T06:43:48.032044Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-11T07:49:04.289387+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T07:49:04.289387+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":"2001.08361","doi":"10.1145/3616855.3635845","metadata_source":"pith","pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Scaling Laws for Neural Language Models","venue":"cs.LG","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","year":2020},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:aad35c563b495ad4554c9b64d8a499bc0642299467f3c3e38ff224e252f6651d","observation_id":"9a0caaf3-9f68-4d1e-967b-2dc5ddb952f8","resolution":{"observed_at":"2026-05-18T06:43:48.038576Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.05698","last_updated":"2018-04-12T19:09:05Z","snapshot_observed_at":"2026-07-06T05:33:59.539667Z","submitted_at":"2017-03-16T16:23:30Z","title":"Neural Sketch Learning for Conditional Program Generation","version":5},"cited_work":{"arxiv_id":"1703.05698","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.05698","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural Sketch Learning for Conditional Program Generation","venue":"cs.PL","work_id":"89ee572c-ca3a-421d-bb28-e54a555d1607","year":2017},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"cited_paper":"/paper/1703.05698","citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:4c401d7f7df7adea443840453831fe7a44d79ea67f8a288e1d903a598d4a15d1","observation_id":"e17ce4ac-c9a4-4189-a163-698b11101ab8","resolution":{"observed_at":"2026-05-18T06:43:48.044312Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"38 A.2 Program judging","venue":null,"work_id":"25d43658-c040-4076-94a4-328979e87830","year":2022},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:38883cc4e8303cd7b42ac519d2c29615eb810e1d919767d0bd6aea79ed69839a","observation_id":"c0038811-3947-4d74-b01f-582495622cd7","resolution":{"observed_at":"2026-05-18T06:43:48.048409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Submissions for duplicate problems were merged","venue":null,"work_id":"abfe2a38-71a4-407e-b46f-ecc3a40a1210","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:695f055c5496710a51eb81e3e23001ae16655463f0a309b1847f6a200bbc458e","observation_id":"a27fa404-603a-4020-a18b-6c9955267e76","resolution":{"observed_at":"2026-05-18T06:43:48.052483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"eb31ee75-74a3-479d-ae4f-da79d22f9e55","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:012a98d0c3a91fd501c09e78945b04ccd12257b9bb64c01d35d2ff128f5e7392","observation_id":"ff75f684-0469-49db-8a3f-133fbcb22f6b","resolution":{"observed_at":"2026-05-18T06:43:48.056466Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a3fd3999-763d-4722-98a8-954f805542fd","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:0b990b59e6654f3c614ae49c9a1231e8f6e146b53a963ff5a590ed077e6f0d93","observation_id":"36c6f922-2fab-473f-a617-eb1d3077f503","resolution":{"observed_at":"2026-05-18T06:43:48.060532Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"divide and conquer","venue":null,"work_id":"1dd39f82-c09f-4287-bf05-5cf35895c8bc","year":2020},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:4ffef360b14fc00b55b95d3453b2b6c9a3ac0944210e8ff5a54634980ddf26df","observation_id":"2fd09b37-efa1-4974-b620-a31c54f408b7","resolution":{"observed_at":"2026-05-18T06:43:48.064706Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"375b6a94-826c-4835-8154-87bf1d602e77","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:5f56ef7f21fdc73f7e8fcf8d65c5fed490b9799395a5418f28ce05bcb6ceaacc","observation_id":"6ef916dc-7f78-497e-94f6-3dc49378585d","resolution":{"observed_at":"2026-05-18T06:43:48.068926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1361a02e-c54d-4181-b60e-66b72ff7c742","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:b0bb19e01b1e3f0c21df1acc28ac4fb6ddbc0fac1d9cc2a17bd2724cee5b152e","observation_id":"5c8ca07f-80e5-4fd4-a67d-bae822fcfd65","resolution":{"observed_at":"2026-05-18T06:43:48.073072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Each test case consists of two lines","venue":null,"work_id":"e740ce22-df8c-472a-a707-6929e69fb3c5","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:3f12601fe345bc434e0faeffb50b5dddc71c104b40590faffe544173da5e2f59","observation_id":"17bae890-601b-47af-8b76-d1b0d5f97d21","resolution":{"observed_at":"2026-05-18T06:43:48.076927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"baba\" and","venue":null,"work_id":"61ed8d08-3b2d-4028-b8b3-63c8f6c0bc59","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:4c614df3446d694f049d556f1bfd6298f499436fa912a320103d028991ab3f0a","observation_id":"745275e4-5562-4d98-8202-6bcf61bbd96d","resolution":{"observed_at":"2026-05-18T06:43:48.079971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"abbaba\" and substring","venue":null,"work_id":"6331c36c-8524-4313-837b-213268ab81f9","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:e2d1240c193bd8d0bec63b5e4133384302f70cedbe7791ce585a011b03184828","observation_id":"9ed83506-674c-47e2-8220-cc8f0f5722cc","resolution":{"observed_at":"2026-05-18T06:43:48.083266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Then the descriptions of t testcases follow","venue":null,"work_id":"bfc4a795-5a0b-4344-8512-0a297b5738a2","year":null},"citing_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T06:43:48.006218Z"},"links":{"citing_paper":"/paper/2203.07814"},"observation_digest":"sha256:36135e8df2996f94c041d59ecf2cc57be8baa218bb5939af0e590281d9d0c6af","observation_id":"2d3e57ad-9f17-4c85-a0f5-7d04559242ed","resolution":{"observed_at":"2026-05-18T06:43:48.087169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":6},"total_outbound_references":14},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 43 inbound Pith citation observations for arXiv:2203.07814."}