{"as_of":"2026-08-05T08:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e23b623c92e60b63b222e3ed117b7ba282e55ad09e1da2752bc56250166cab88","coverage":[{"denominator":243,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T23:32:59.517389Z","state":"measured"},{"denominator":200,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":200,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":142,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T04:48:36.083170Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":192,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2303.11366","last_updated":"2023-10-10T05:21:45Z","snapshot_observed_at":"2026-07-06T15:05:53.556198Z","submitted_at":"2023-03-20T18:08:50Z","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T13:51:41.915864Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2303.11366"},"observation_digest":"sha256:6de1e8ad5e27e3994f88624562bc71a72853cb3f67cdf85cc2a0aac968a9c688","observation_id":"10e3f7b7-6b36-460c-a7e5-37dfe9c9e40c","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-05T07:32:07.993510Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-05-10T22:46:39.268353Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2303.18223"},"observation_digest":"sha256:f3d4dced5a248f2393b311d32b9f1851bc4d9775cd7df4181993af54aaa9dc10","observation_id":"e33f9242-4f49-4ad4-a593-21d1f57c8fce","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2304.05128","last_updated":"2023-10-05T09:12:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-04-11T10:43:43Z","title":"Teaching Large Language Models to Self-Debug","version":2},"reference_index":106,"source":"arxiv_source","source_observed_at":"2026-05-12T06:24:24.607354Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2304.05128"},"observation_digest":"sha256:645d35c26b8dad38fc37a9bbf2555121c5404d2ade431dcd3c5c8ad9278917f4","observation_id":"8e5e8a6d-b071-4f15-a21c-3000fd593dce","resolution":{"observed_at":"2026-05-12T06:24:24.935594Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"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":18,"source":"pdf_text","source_observed_at":"2026-05-19T05:26:57.440959Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2305.07922"},"observation_digest":"sha256:b2210824126abca23cc51c16439bc982b842ff10050807dcc00069eb87d4d4dc","observation_id":"480663a8-8764-4601-a84a-99d23bc2c9a2","resolution":{"observed_at":"2026-05-19T05:26:57.543237Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2305.12138","last_updated":"2026-05-20T13:07:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-20T08:43:49Z","title":"Exploring Code Analysis: Zero-Shot Insights on Syntax and Semantics with LLMs","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-24T08:11:01.612343Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2305.12138"},"observation_digest":"sha256:8dc352eeb315c0e783b403f2ce9d11686cdb8584776fa93ea7e9513cc603cd07","observation_id":"9aa71449-d5bb-4fd1-ad47-52202d7b6bb1","resolution":{"observed_at":"2026-05-24T08:14:10.348240Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2305.15334","last_updated":"2023-05-24T16:48:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-24T16:48:11Z","title":"Gorilla: Large Language Model Connected with Massive APIs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-11T23:22:16.879418Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2305.15334"},"observation_digest":"sha256:576f5c68a8ab522335913bbc38afff827fafcf7f52781c9ffcc90574454afa8e","observation_id":"154fd3ea-386e-4e5e-88ca-7cfd5c9203eb","resolution":{"observed_at":"2026-05-11T23:22:17.363064Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2305.16264","last_updated":"2025-06-28T00:00:06Z","snapshot_observed_at":"2026-07-06T15:33:27.761070Z","submitted_at":"2023-05-25T17:18:55Z","title":"Scaling Data-Constrained Language Models","version":5},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-18T01:35:21.150772Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2305.16264"},"observation_digest":"sha256:a6d7b0026a060496fc4d61d73913e7488aebf5879604c8b8766775053c64fb45","observation_id":"03889351-ce30-4f4b-9f3f-105f20103fad","resolution":{"observed_at":"2026-05-18T01:35:21.238061Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2306.11644","last_updated":"2023-10-02T06:12:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-20T16:14:25Z","title":"Textbooks Are All You Need","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T04:44:03.148223Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2306.11644"},"observation_digest":"sha256:092178e7e7e14244c7255a0700d82cb44f65584d8ede285cd8731c3824ed2d50","observation_id":"836dd657-3540-459c-bc61-0acf526474a2","resolution":{"observed_at":"2026-05-13T04:44:03.230118Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2307.06435","last_updated":"2024-10-17T01:10:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-12T20:01:52Z","title":"A Comprehensive Overview of Large Language Models","version":10},"reference_index":147,"source":"pdf_text","source_observed_at":"2026-05-19T20:28:38.900026Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2307.06435"},"observation_digest":"sha256:378fb95f512cebb211c445507d8afdc75ec341419befc225d5b17443874c9d03","observation_id":"703c3e53-ba35-459b-b8a0-131a3ce055b8","resolution":{"observed_at":"2026-05-19T20:28:39.483236Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2309.07597","last_updated":"2024-09-24T03:01:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-14T10:57:50Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-13T13:24:32.084878Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2309.07597"},"observation_digest":"sha256:730533b1c4a4833c26bdf5dd3b576743420f1247b0b664aa770b5ee15a46c1c7","observation_id":"578a01a8-a970-4faf-bee5-2f585d0ae18b","resolution":{"observed_at":"2026-05-13T13:24:32.225085Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2309.12284","last_updated":"2024-05-03T17:36:07Z","snapshot_observed_at":"2026-08-02T15:00:50.388422Z","submitted_at":"2023-09-21T17:45:42Z","title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-13T10:07:53.748795Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2309.12284"},"observation_digest":"sha256:a1db4a052bdfdd9585ab0c3483294b2dbbc18cfabd0ae0b52dd38af93b9a5456","observation_id":"5e116516-d824-4f75-926e-111b81300fd1","resolution":{"observed_at":"2026-05-13T10:07:53.806668Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2310.10631","last_updated":"2024-03-15T19:14:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-16T17:54:07Z","title":"Llemma: An Open Language Model For Mathematics","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-19T08:17:46.055279Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2310.10631"},"observation_digest":"sha256:dcf5cf3512f37d7a2369431d224ae444df87fce0f926adf637914bf6f27a0689","observation_id":"8f00e24f-5c50-4a52-9696-8d82b0f956d4","resolution":{"observed_at":"2026-05-19T08:17:46.471392Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2311.16867","last_updated":"2023-11-29T19:45:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-11-28T15:12:47Z","title":"The Falcon Series of Open Language Models","version":2},"reference_index":181,"source":"arxiv_source","source_observed_at":"2026-05-16T09:46:09.701440Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2311.16867"},"observation_digest":"sha256:31d9f532c949dda36a29cc6d4535de63c2dd4112f840ec0fa7879b479dc077ab","observation_id":"7a853a69-0243-46e7-adb8-6a509611a3ee","resolution":{"observed_at":"2026-05-16T09:46:10.171138Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2312.13010","last_updated":"2024-05-24T11:47:24Z","snapshot_observed_at":"2026-07-06T17:05:56.282078Z","submitted_at":"2023-12-20T13:22:41Z","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-15T03:58:45.824197Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2312.13010"},"observation_digest":"sha256:73efb88be96eccfc6b4be8ace43116418b46b028894518d6981baf4974dfe24b","observation_id":"92df4a36-fb0d-4796-b69d-20daf9510744","resolution":{"observed_at":"2026-05-15T03:58:45.985379Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2312.14125","last_updated":"2024-06-04T17:25:20Z","snapshot_observed_at":"2026-07-30T23:45:07.963944Z","submitted_at":"2023-12-21T18:46:41Z","title":"VideoPoet: A Large Language Model for Zero-Shot Video Generation","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-15T17:51:05.465548Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2312.14125"},"observation_digest":"sha256:be612a1f2b0db600ceb5b2016b20a25c432527112962934f2da9a1e38ce2fd91","observation_id":"8a4cb642-62f5-4bd6-8982-89ef070e3ec1","resolution":{"observed_at":"2026-05-15T17:51:05.729578Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T17:26:38.812485Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2401.14196"},"observation_digest":"sha256:ebc007b8f84c9e08b942622999f7b631a7570d613d9acdefebe301104592e502","observation_id":"93d321ad-5cfb-4d8b-9c21-d319b251a460","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2402.06196","last_updated":"2025-03-23T14:51:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-09T05:37:09Z","title":"Large Language Models: A Survey","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-05-11T15:22:54.023279Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2402.06196"},"observation_digest":"sha256:cb33d052578bf99731e2b6ac1ed2c93623cad7d3e338cda0e1aae92b5ffb103c","observation_id":"e87a2094-0187-4a52-8aed-ee36270bf818","resolution":{"observed_at":"2026-05-11T15:22:55.357458Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2402.19173","last_updated":"2024-02-29T13:53:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T13:53:35Z","title":"StarCoder 2 and The Stack v2: The Next Generation","version":1},"reference_index":223,"source":"arxiv_source","source_observed_at":"2026-05-12T17:28:22.353355Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2402.19173"},"observation_digest":"sha256:24ae82ab13162edc7ba5b399664451ccb01bd23bae7850f4f108f2df239d9b95","observation_id":"5062627c-8b14-45ab-8c3c-a4d0e9100ac7","resolution":{"observed_at":"2026-05-12T17:28:22.858128Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"reference_index":270,"source":"arxiv_source","source_observed_at":"2026-05-10T17:34:42.565806Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2403.07974"},"observation_digest":"sha256:08c2a188e5c50ac249a102b608d9dfdaccfb999961a086ac822907419a6357f2","observation_id":"c48f023e-2655-490e-999b-15e43e959bf5","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2404.06395","last_updated":"2024-06-03T08:54:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-04-09T15:36:50Z","title":"MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategies","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-13T18:00:53.389420Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2404.06395"},"observation_digest":"sha256:a20de25649d7576f9a2dbfc4f252335825a59451071114f60729b3cc47d72667","observation_id":"d32f89f1-1d71-4dfa-bc06-756c591e29e9","resolution":{"observed_at":"2026-05-13T18:00:53.540310Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2406.00515","last_updated":"2024-11-10T22:02:27Z","snapshot_observed_at":"2026-07-29T20:40:25.374189Z","submitted_at":"2024-06-01T17:48:15Z","title":"A Survey on Large Language Models for Code Generation","version":2},"reference_index":150,"source":"pdf_text","source_observed_at":"2026-05-13T20:18:06.304134Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2406.00515"},"observation_digest":"sha256:51f5d9021beccc2cd7af3b7d2913314ae19df1877c8f24ca6202031f499e6130","observation_id":"e74c16cd-9bf2-448e-ae71-a1878c2fcaa1","resolution":{"observed_at":"2026-05-13T20:18:06.776885Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2406.11794","last_updated":"2025-04-21T17:48:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-17T17:42:57Z","title":"DataComp-LM: In search of the next generation of training sets for language models","version":4},"reference_index":105,"source":"pdf_text","source_observed_at":"2026-05-17T22:58:16.523267Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2406.11794"},"observation_digest":"sha256:c3842a08c9d54d853fba9dccde2ed4ca502a1ce0a9f0b33c97200cef1246c399","observation_id":"005f895a-6ca8-4283-bd11-55f5394426ed","resolution":{"observed_at":"2026-05-17T22:58:17.053618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2406.19314","last_updated":"2025-04-18T19:36:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-27T16:47:42Z","title":"LiveBench: A Challenging, Contamination-Limited LLM Benchmark","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-15T04:48:26.303240Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2406.19314"},"observation_digest":"sha256:53a15406a5fca6f61e95ff3a1f36ed3170c1f7fb6330169fe963061347a76d5a","observation_id":"6a2bc4f0-f65a-4a9d-a887-0391390d3307","resolution":{"observed_at":"2026-05-15T04:48:26.461199Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2407.08608","last_updated":"2024-07-12T22:15:02Z","snapshot_observed_at":"2026-07-06T18:44:53.587276Z","submitted_at":"2024-07-11T15:44:48Z","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-20T19:45:36.337956Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2407.08608"},"observation_digest":"sha256:b08811055be31484d70cd79e7ea710085b8c192a73d83b9fd282e9a5b031f8a8","observation_id":"96b1dfe6-6f4a-46bf-a2d3-4918c427c34c","resolution":{"observed_at":"2026-05-20T19:45:36.472884Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2408.01055","last_updated":"2026-05-02T04:53:15Z","snapshot_observed_at":"2026-08-02T17:57:33.411133Z","submitted_at":"2024-08-02T07:03:00Z","title":"Towards Agentic Runtime Healing","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T22:14:23.865122Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2408.01055"},"observation_digest":"sha256:d76e64eb83728b9bffc9b98fc0255d5ecb15b8e89099e53a0a9e548b2960631e","observation_id":"d8f43b19-3330-4c0d-ae76-d9108a832f54","resolution":{"observed_at":"2026-05-23T22:15:50.049836Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"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":22,"source":"pdf_text","source_observed_at":"2026-05-23T22:17:02.681066Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2408.15815"},"observation_digest":"sha256:749ad997fb1ea2e791538f00ce9dc66834fc0698152a00a0b65f44a92a0ab810","observation_id":"4935a2ca-e053-4118-980b-b8cb324725ed","resolution":{"observed_at":"2026-05-23T22:18:31.361494Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T12:33:38.867604Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2409.12186"},"observation_digest":"sha256:cfe59344f24b20c6d53894db405f2d6454b0b2f1a77b3141d4de566c159b7320","observation_id":"edb0e38d-9967-4db4-82d0-a24ff35cdd64","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2409.18839","last_updated":"2024-09-27T15:35:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-27T15:35:15Z","title":"MinerU: An Open-Source Solution for Precise Document Content Extraction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T04:00:25.624430Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2409.18839"},"observation_digest":"sha256:c263bfe5c676cfe9e9006a3f3ab38b28b29342d006c44f2c638290967b7c495a","observation_id":"445151cf-ba85-4262-96e4-e3f3a3fa85bd","resolution":{"observed_at":"2026-05-16T04:00:25.822993Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2501.05465","last_updated":"2026-05-14T16:52:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-03T19:53:57Z","title":"Small Language Models (SLMs) Can Still Pack a Punch: A survey (updated 2026)","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-23T05:47:48.488826Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2501.05465"},"observation_digest":"sha256:3016792528e14279d73490439bae70b120488414ddfc9554bac1b2bd36b01f00","observation_id":"90a28a2a-6a14-461f-bab4-ba1dd4c95e11","resolution":{"observed_at":"2026-05-23T05:52:37.310953Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2502.02737","last_updated":"2025-02-04T21:43:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-04T21:43:16Z","title":"SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Model","version":1},"reference_index":195,"source":"arxiv_source","source_observed_at":"2026-05-13T17:30:02.803757Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2502.02737"},"observation_digest":"sha256:dd10209463ecc1f272bd43dfd9733f594aa5e135b4f0d46c427a32fdd3afe9dd","observation_id":"feae7435-2660-4cee-9341-f3ebeff08311","resolution":{"observed_at":"2026-05-13T17:30:02.987449Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2502.10517","last_updated":"2025-02-14T19:30:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-14T19:30:53Z","title":"KernelBench: Can LLMs Write Efficient GPU Kernels?","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T16:55:01.976356Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2502.10517"},"observation_digest":"sha256:032655dad34bbb8617bb530bf4b0b7277a79d06a7747c8c888e74fbff7d7b0d7","observation_id":"6b6227d4-4d10-45df-9dcf-75376695a535","resolution":{"observed_at":"2026-05-15T16:55:02.084120Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2503.08223","last_updated":"2026-04-09T15:28:27Z","snapshot_observed_at":"2026-07-06T20:50:33.513259Z","submitted_at":"2025-03-11T09:41:29Z","title":"Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devices","version":3},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-05-23T01:03:26.037233Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2503.08223"},"observation_digest":"sha256:cc1d2ddbab28fc0e097bb9c6719d52403186132ea3112508d3efb1f59e6b0fd6","observation_id":"640ca5a2-7d98-4d65-bd87-ac90a929cf07","resolution":{"observed_at":"2026-05-23T01:05:16.312704Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2503.16771","last_updated":"2026-04-12T13:23:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-21T01:00:45Z","title":"Enabling Global, Human-Centered Explanations for LLMs:From Tokens to Interpretable Code and Test Generation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-22T23:41:22.017848Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2503.16771"},"observation_digest":"sha256:bc91a3cd45a4bdd9f6a0f47021e7e5d7dba2533a8062f1c1dd43b55d1c865273","observation_id":"36e74444-3b6d-4917-9404-57c12ef01710","resolution":{"observed_at":"2026-05-22T23:42:16.097193Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2503.22760","last_updated":"2025-03-27T16:09:23Z","snapshot_observed_at":"2026-07-06T21:00:32.425750Z","submitted_at":"2025-03-27T16:09:23Z","title":"Malicious and Unintentional Disclosure Risks in Large Language Models for Code Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T22:23:48.554356Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2503.22760"},"observation_digest":"sha256:c52ff31d9964cfc4c1ef4716a0a0de56f104d6bc77cf28451e87092e99d47658","observation_id":"f8e4954d-276a-4d1d-a6a1-0ad9fe9bf5b5","resolution":{"observed_at":"2026-05-22T22:25:12.080596Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2504.16584","last_updated":"2025-04-23T10:05:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-23T10:05:27Z","title":"Case Study: Fine-tuning Small Language Models for Accurate and Private CWE Detection in Python Code","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T18:40:59.564031Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2504.16584"},"observation_digest":"sha256:f35bfa6b01aa3ee1347dbf2b97e8201ac3d5773dbb1d6c8653182dc4855a5ba9","observation_id":"094bacc3-f4e4-4cc7-aecc-04693de71368","resolution":{"observed_at":"2026-05-22T18:41:56.381281Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2508.15503","last_updated":"2026-05-21T21:46:55Z","snapshot_observed_at":"2026-07-06T22:16:05.197728Z","submitted_at":"2025-08-21T12:30:30Z","title":"Guidelines for Empirical Studies in Software Engineering involving Large Language Models","version":5},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-05-18T22:02:36.307598Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2508.15503"},"observation_digest":"sha256:b9e817599e4564b23096d24f9d831898b42d0fa77f18c00b4a008d7dc62852a5","observation_id":"f03b89a6-c778-4e39-8e18-c4b2f1175211","resolution":{"observed_at":"2026-05-18T22:02:52.427555Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2508.15503","last_updated":"2026-05-21T21:46:55Z","snapshot_observed_at":"2026-07-06T22:16:05.197728Z","submitted_at":"2025-08-21T12:30:30Z","title":"Guidelines for Empirical Studies in Software Engineering involving Large Language Models","version":6},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-05-25T08:18:18.448122Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2508.15503"},"observation_digest":"sha256:955347eea4ff209454f7c0072562594fdcc67bda0ef1940df346219936551934","observation_id":"9980e738-3b02-41e1-bb0b-38228ccda57c","resolution":{"observed_at":"2026-05-25T08:20:31.397180Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2508.16771","last_updated":"2026-07-02T23:23:00Z","snapshot_observed_at":"2026-07-09T23:16:38.895546Z","submitted_at":"2025-08-22T20:08:09Z","title":"EyeMulator: Improving Code Language Models by Mimicking Human Visual Attention","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-18T20:54:30.449792Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2508.16771"},"observation_digest":"sha256:6606cf32fe67152e623d0c6656e658d90657789b3d8d20348d39614dabd8b8cb","observation_id":"d1216059-ae6f-43e4-8b3c-01eeb76e25ac","resolution":{"observed_at":"2026-05-18T20:56:50.605349Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T04:48:36.083170Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05980","last_updated":"2025-09-07T09:01:48Z","snapshot_observed_at":"2026-08-05T04:48:32.410179Z","submitted_at":"2025-09-07T09:01:48Z","title":"GRACE: Graph-Guided Repository-Aware Code Completion through Hierarchical Code Fusion","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T04:48:36.083170Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2509.05980"},"observation_digest":"sha256:7f3ae366e875f7d55037815ea8f38c28e2b1dbab3561bc11fe18f0e935e8a544","observation_id":"2ea7c371-c7cb-481c-a723-e9cba48482c1","resolution":{"observed_at":"2026-08-05T04:48:36.083170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-04T14:52:48.179470Z","title":"Starcoder: may the source be with you! arXiv preprint arXiv:2305.06161, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22768","last_updated":"2026-07-28T18:10:53Z","snapshot_observed_at":"2026-08-04T14:52:43.431298Z","submitted_at":"2025-09-26T17:20:27Z","title":"ML2B: Benchmarking LLMs on Cross-Lingual ML Pipeline Generation","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T14:52:48.179470Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2509.22768"},"observation_digest":"sha256:9eb0d8fc7fbc21ca6418836bdc19b75a7432cef8a54b07cba5051175eaf4c24c","observation_id":"d4a1793e-a95c-4941-a3a7-2bb8a7f54953","resolution":{"observed_at":"2026-08-04T14:52:48.179470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2510.04905","last_updated":"2026-05-20T17:52:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-06T15:20:03Z","title":"Retrieval-Augmented Code Generation: A Survey with Focus on Repository-Level Approaches","version":3},"reference_index":170,"source":"pdf_text","source_observed_at":"2026-05-21T21:19:44.176374Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2510.04905"},"observation_digest":"sha256:af920dade3b1f0ff60b38cd9035c5be17b559a368662f2a2abf8dcdb0958a025","observation_id":"2e3ff0fb-d2bc-43f9-baa0-57e1c7e6607c","resolution":{"observed_at":"2026-05-21T21:20:38.688806Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2510.08804","last_updated":"2026-05-04T16:48:58Z","snapshot_observed_at":"2026-08-02T08:04:43.071958Z","submitted_at":"2025-10-09T20:35:23Z","title":"MOSAIC: Multi-agent Orchestration for Task-Intelligent Scientific Coding","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-18T08:28:59.161675Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2510.08804"},"observation_digest":"sha256:f2c838ced5e62814213420046136ba23bd2010cc801bb097b4522781b3158248","observation_id":"4b9c135a-a8c0-4ce1-84f7-68142a50cdf2","resolution":{"observed_at":"2026-05-18T08:31:06.811706Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-04T09:18:10.290005Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.16384","last_updated":"2026-06-09T03:35:31Z","snapshot_observed_at":"2026-08-05T06:03:02.410520Z","submitted_at":"2025-10-18T07:44:18Z","title":"SemOpt: LLM-Driven Code Optimization via Rule-Based Analysis","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T09:18:10.290005Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2510.16384"},"observation_digest":"sha256:1f0e099a33ad7e186c03ae434550b0e23644390a3009c94e2040addb3fcd8e6f","observation_id":"4d8f7298-d4b0-4bed-8a46-55472a4949e5","resolution":{"observed_at":"2026-08-04T09:18:10.290005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2510.18165","last_updated":"2026-04-29T02:39:52Z","snapshot_observed_at":"2026-08-03T23:37:43.649187Z","submitted_at":"2025-10-20T23:38:12Z","title":"Saber: An Efficient Sampling with Adaptive Acceleration and Backtracking Enhanced Remasking for Diffusion Language Model","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T05:32:13.409022Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2510.18165"},"observation_digest":"sha256:694d73c75d69f754042e3e0137fc2a09371e8e9d2905d04b9af97d0471dbd52d","observation_id":"173021fe-3e3b-44ae-983e-b897761cfb81","resolution":{"observed_at":"2026-05-18T05:32:25.282716Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2511.03182","last_updated":"2026-05-08T03:46:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-11-05T04:58:13Z","title":"Understanding Robustness of Model Editing in Code LLMs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T01:46:57.287296Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2511.03182"},"observation_digest":"sha256:e828e5f8a3ccf2454f0c763a9f8947997c726cc6e09ee7f4cfba960a513f1d40","observation_id":"ea047160-1e0e-44c6-971d-019340a6ccaa","resolution":{"observed_at":"2026-05-18T01:50:38.394584Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-03T22:23:29.950798Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.10868","last_updated":"2026-05-29T03:47:16Z","snapshot_observed_at":"2026-08-03T22:23:28.105321Z","submitted_at":"2025-11-14T00:35:00Z","title":"Go-UT-Bench: A Fine-Tuning Dataset for LLM-Based Unit Test Generation in Go","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T22:23:29.950798Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2511.10868"},"observation_digest":"sha256:6b50d920776d27d8ea9f0cff6802d96a61580c878120da8432f9b5a25847322e","observation_id":"1b2adf9b-2f62-49bf-9a7f-1ba414dd2e9e","resolution":{"observed_at":"2026-08-03T22:23:29.950798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-03T20:13:35.455785Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.20878","last_updated":"2026-07-04T12:22:08Z","snapshot_observed_at":"2026-08-04T09:06:52.618549Z","submitted_at":"2025-11-25T21:49:36Z","title":"Supporting Students in Navigating LLM-Generated Insecure Code","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T20:13:35.455785Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2511.20878"},"observation_digest":"sha256:2485b725bf652de54d22dd764ba98a48f21996c7e3477f504b09cbd60a4c2579","observation_id":"4ec6ed12-8aa2-438a-8589-45bc799fdb4d","resolution":{"observed_at":"2026-08-03T20:13:35.455785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-03T14:02:56.693271Z","title":"Starcoder: may the source be with you!arXiv preprint arXiv:2305.06161,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.22088","last_updated":"2026-06-10T15:31:41Z","snapshot_observed_at":"2026-08-04T20:26:36.323933Z","submitted_at":"2025-12-26T17:20:09Z","title":"Unifying Learning Dynamics and Generalization in Transformers Scaling Law","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T14:02:56.693271Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2512.22088"},"observation_digest":"sha256:28ada672a1db3c0fed3b7f686cafb322472386a7f059a155eb428fccf453eb1f","observation_id":"e01668b8-0ffd-47b9-a1d3-f24303931f67","resolution":{"observed_at":"2026-08-03T14:02:56.693271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2512.24120","last_updated":"2026-04-16T12:18:23Z","snapshot_observed_at":"2026-07-06T22:40:23.205898Z","submitted_at":"2025-12-30T10:01:55Z","title":"Enhancing LLM-Based Neural Network Generation: Few-Shot Prompting and Efficient Validation for Automated Architecture Design","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T19:08:18.706760Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2512.24120"},"observation_digest":"sha256:9911cdc3f080b8389bc388f889acaf9b2902b6940bff93f8b6562718e1dc3cb9","observation_id":"f2ae8e2a-f70a-47d8-a771-1a3332be1f10","resolution":{"observed_at":"2026-05-16T19:11:11.778167Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-03T12:07:32.344596Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.04426","last_updated":"2026-05-25T20:48:59Z","snapshot_observed_at":"2026-08-03T23:31:38.919091Z","submitted_at":"2026-01-07T22:18:51Z","title":"XGrammar-2: Efficient Dynamic Structured Generation Engine for Agentic LLMs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T12:07:32.344596Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2601.04426"},"observation_digest":"sha256:b2a857e29345a8bbd5543c5e1dc895f4c821113411be4f5342bac1d56a61d1e0","observation_id":"404bf972-ea4b-40d8-bfa3-3eede7aff255","resolution":{"observed_at":"2026-08-03T12:07:32.344596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-03T06:14:26.311005Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.23254","last_updated":"2026-07-29T07:40:43Z","snapshot_observed_at":"2026-08-03T06:14:23.946322Z","submitted_at":"2026-01-30T18:22:15Z","title":"Better Call Grep: Evaluating and Improving Grep-Like Lexical Retrieval for Repository-Level Code Completion","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T06:14:26.311005Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2601.23254"},"observation_digest":"sha256:188356e4d5594f1d7a695fab314c00c171f998ae4a168d18b57657cf149a3e86","observation_id":"edbc161a-58d8-4a87-9ea8-84512b108a92","resolution":{"observed_at":"2026-08-03T06:14:26.311005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2602.06283","last_updated":"2026-05-08T00:20:43Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-06T00:41:44Z","title":"SOCKET: SOft Collision Kernel EsTimator for Sparse Attention","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T06:29:17.678347Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2602.06283"},"observation_digest":"sha256:f8163f604370764f1f7c114a5aa1926bce1d1124212260bd11366f257387aef7","observation_id":"3db4cde2-099c-40ef-94e9-406b469dce4e","resolution":{"observed_at":"2026-05-16T06:30:41.489973Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2602.08072","last_updated":"2026-04-08T14:08:33Z","snapshot_observed_at":"2026-07-31T17:32:31.832511Z","submitted_at":"2026-02-08T18:05:27Z","title":"IssueGuard: Real-Time Secret Leak Prevention Tool for GitHub Issue Reports","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T05:51:24.984358Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2602.08072"},"observation_digest":"sha256:843c6cdcdfd438860a31f3f01ca68882724884696216c1a54facad4cae83fd5f","observation_id":"78ffbb73-6db9-4e40-a934-2306b3e25b18","resolution":{"observed_at":"2026-05-16T05:52:24.215471Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-02T21:11:49.946228Z","title":"B., Zi, Y., Muennighoff, N., Kocetkov, D., Mou, C., Marone, M., Akiki, C., Li, J., Chim, J., Liu, Q., Zheltonozhskii, E., Zhuo, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21196","last_updated":"2026-07-10T12:36:34Z","snapshot_observed_at":"2026-08-03T04:26:29.988892Z","submitted_at":"2026-02-24T18:54:39Z","title":"Untied Ulysses: Memory-Efficient Context Parallelism via Headwise Chunking","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T21:11:49.946228Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2602.21196"},"observation_digest":"sha256:73d4a83409b1ec879a593e581fd50ec9128d765ad3176a5debb05ea709fcf970","observation_id":"5563856c-5726-4244-98e2-77337331e676","resolution":{"observed_at":"2026-08-02T21:11:49.946228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.00239","last_updated":"2026-04-07T18:18:00Z","snapshot_observed_at":"2026-07-06T22:51:22.254518Z","submitted_at":"2026-03-31T21:05:39Z","title":"A Taxonomy of Programming Languages for Code Generation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-08T02:17:18.127674Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.00239"},"observation_digest":"sha256:c57f1101673d74d7c07f1ed319e887662a2f395470f58d6b051769a6bf69f2e5","observation_id":"e37e080d-8791-40bf-89ec-d27ed21fe25d","resolution":{"observed_at":"2026-05-11T22:56:14.125540Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-04T05:38:33.848030Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.00787","last_updated":"2026-08-03T15:00:31Z","snapshot_observed_at":"2026-08-05T07:40:39.346759Z","submitted_at":"2026-04-01T11:53:12Z","title":"The Rise of Language Models in Mining Software Repositories: A Survey","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-04T05:38:33.848030Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.00787"},"observation_digest":"sha256:dee9494e34e6c21c1b5743d71efaf901ae39a831cff3c0e76c4c1dabbe29b37d","observation_id":"87eca94a-c580-4698-a3a7-ed8392e9c8ec","resolution":{"observed_at":"2026-08-04T05:38:33.848030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.02647","last_updated":"2026-04-03T02:23:25Z","snapshot_observed_at":"2026-07-06T22:51:57.889822Z","submitted_at":"2026-04-03T02:23:25Z","title":"Runtime Execution Traces Guided Automated Program Repair with Multi-Agent Debate","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T20:45:46.540346Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.02647"},"observation_digest":"sha256:659843b4b4396867a7b231dda6dcc25c02fa642df217d384ba6f50106bbd510a","observation_id":"da4a530b-cca9-46bf-b792-2bc0eb4cb8f8","resolution":{"observed_at":"2026-05-13T20:48:15.271074Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.06788","last_updated":"2026-04-12T13:27:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-08T07:56:34Z","title":"From Perception to Autonomous Computational Modeling: A Multi-Agent Approach","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:54:40.177049Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.06788"},"observation_digest":"sha256:6b0ac5fde1dce3ec32e11ce43f8f46927b06cde1386f091273a0934082c30adb","observation_id":"4903125d-bfb0-4109-a546-450d2f82c365","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.07769","last_updated":"2026-04-09T03:48:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-09T03:48:11Z","title":"An Empirical Study on Influence-Based Pretraining Data Selection for Code Large Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T18:13:24.750244Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.07769"},"observation_digest":"sha256:369b72195bb3acbfc00974f70b3baef93f47d8fda32088e3be99c49a2a4e49a2","observation_id":"80e82aa7-0e04-454f-8c21-64de80f34e0c","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.10235","last_updated":"2026-04-11T14:38:11Z","snapshot_observed_at":"2026-08-02T23:47:42.583705Z","submitted_at":"2026-04-11T14:38:11Z","title":"CodeComp: Structural KV Cache Compression for Agentic Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T15:39:44.149481Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.10235"},"observation_digest":"sha256:33eb718820f5800af9b5600e5685f082d93277fd0ec937785f05eeba1b064141","observation_id":"efe42201-1c21-49d5-879e-92fd5a7143f3","resolution":{"observed_at":"2026-05-11T10:06:02.430583Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.10449","last_updated":"2026-04-12T04:15:31Z","snapshot_observed_at":"2026-07-06T22:59:05.519456Z","submitted_at":"2026-04-12T04:15:31Z","title":"AdverMCTS: Combating Pseudo-Correctness in Code Generation via Adversarial Monte Carlo Tree Search","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-10T16:35:16.056397Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.10449"},"observation_digest":"sha256:2662926e4ad59c4f1ca0a79d4a5c81939c4001e09e6655aede69a47537895427","observation_id":"475e351f-2890-48cd-97f0-46bdbd4acdfe","resolution":{"observed_at":"2026-05-11T08:40:57.501334Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.13725","last_updated":"2026-04-15T11:00:17Z","snapshot_observed_at":"2026-07-06T23:01:41.643335Z","submitted_at":"2026-04-15T11:00:17Z","title":"On the Effectiveness of Context Compression for Repository-Level Tasks: An Empirical Investigation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T13:00:56.512868Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.13725"},"observation_digest":"sha256:9e49592132329c9ce383e7473005c521f7a949fba51add289def860b58c03633","observation_id":"f3dd2f86-f628-4c5f-9fba-c659b985c3e1","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.15385","last_updated":"2026-04-16T03:25:28Z","snapshot_observed_at":"2026-07-06T23:02:58.361418Z","submitted_at":"2026-04-16T03:25:28Z","title":"Prompt-Driven Code Summarization: A Systematic Literature Review","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T11:35:12.299549Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.15385"},"observation_digest":"sha256:ea998408124a864c589dd9402c95d746da28ccbaf2e2827b56d026689e412f63","observation_id":"e7aec214-786d-403c-a3ad-f22bde1bb89e","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.16001","last_updated":"2026-04-17T12:25:41Z","snapshot_observed_at":"2026-07-06T23:03:26.308324Z","submitted_at":"2026-04-17T12:25:41Z","title":"MATRIX: Multi-Layer Code Watermarking via Dual-Channel Constrained Parity-Check Encoding","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T08:23:04.201981Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.16001"},"observation_digest":"sha256:172d1674dea82b622e36ff9284eb856f1e01e39230bbea8aec8d7b9adaed2782","observation_id":"cdbe5f3a-14b8-4594-b517-c3a586685513","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.17338","last_updated":"2026-05-16T01:01:08Z","snapshot_observed_at":"2026-08-04T01:50:51.745798Z","submitted_at":"2026-04-19T09:08:23Z","title":"Precise Debugging Benchmark: Is Your Model Debugging or Regenerating?","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T06:05:32.866387Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.17338"},"observation_digest":"sha256:b127fb5be40e0ccce7cafcd2fc85a9e21d8e0d9dc00993bbaf6f4452f21dc315","observation_id":"cde58c6d-278d-40f2-8e16-f2b08af5bd14","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.17338","last_updated":"2026-05-16T01:01:08Z","snapshot_observed_at":"2026-08-04T01:50:51.745798Z","submitted_at":"2026-04-19T09:08:23Z","title":"Precise Debugging Benchmark: Is Your Model Debugging or Regenerating?","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T00:02:09.490384Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.17338"},"observation_digest":"sha256:6fc2b23d21448d373cb27643aebc986856e4b98dc7a62edc7f23438ad4410604","observation_id":"fb79a69a-2688-4119-b7e3-422064d90fea","resolution":{"observed_at":"2026-05-21T00:03:51.815463Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.18027","last_updated":"2026-04-20T09:52:50Z","snapshot_observed_at":"2026-07-31T18:18:26.451057Z","submitted_at":"2026-04-20T09:52:50Z","title":"CodePivot: Bootstrapping Multilingual Transpilation in LLMs via Reinforcement Learning without Parallel Corpora","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T04:59:44.880102Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.18027"},"observation_digest":"sha256:bac850c22414e09d0a47bc30ada43715f83c4cd21997ed885290bf860ec6b104","observation_id":"e459dd20-adc6-41bb-b285-77868a55b7ca","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.18473","last_updated":"2026-04-20T16:24:41Z","snapshot_observed_at":"2026-07-06T23:05:21.974248Z","submitted_at":"2026-04-20T16:24:41Z","title":"Train Separately, Merge Together: Modular Post-Training with Mixture-of-Experts","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-10T05:52:28.822723Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.18473"},"observation_digest":"sha256:5281e2ab03680c80829057cec9a19d078eb221e328c11a5765795df7a43f0823","observation_id":"ca015b89-66bb-4a95-b1ba-42cf494c3f9a","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.23106","last_updated":"2026-04-25T02:01:54Z","snapshot_observed_at":"2026-07-06T23:09:23.591544Z","submitted_at":"2026-04-25T02:01:54Z","title":"No Test Cases, No Problem: Distillation-Driven Code Generation for Scientific Workflows","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T08:12:07.708441Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.23106"},"observation_digest":"sha256:1021c5b0c8c11d6144ce0f428177b92cd97ca443315df0492e4a9b8cd4d39763","observation_id":"dd79dd27-76f5-43b1-8452-45c55941b908","resolution":{"observed_at":"2026-05-11T20:46:10.034177Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.23892","last_updated":"2026-04-26T21:34:51Z","snapshot_observed_at":"2026-07-06T23:10:02.659384Z","submitted_at":"2026-04-26T21:34:51Z","title":"Optimas: An Intelligent Analytics-Informed Generative AI Framework for Performance Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-08T04:42:31.763225Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.23892"},"observation_digest":"sha256:4d462c0cd6a948a2872ec4d21e33fedf2967ce5fd5ab1d2398621c1f31037650","observation_id":"1f492e23-cd45-4a66-a3b0-add478bc5e58","resolution":{"observed_at":"2026-05-11T21:36:18.286857Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.23940","last_updated":"2026-05-01T21:28:31Z","snapshot_observed_at":"2026-08-02T04:55:02.592639Z","submitted_at":"2026-04-27T01:28:11Z","title":"Constraint-Guided Multi-Agent Decompilation for Executable Binary Recovery","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T03:38:20.915757Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.23940"},"observation_digest":"sha256:5d7fb33d3d8d223eb03f9e7f615f5b336a54840b0ce57e422ad29bcc83bd733f","observation_id":"8c4918d6-690f-478a-b1d6-c7cfcfa24e58","resolution":{"observed_at":"2026-05-11T22:01:11.677827Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.26523","last_updated":"2026-04-29T10:43:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-29T10:43:02Z","title":"RepoDoc: A Knowledge Graph-Based Framework to Automatic Documentation Generation and Incremental Updates","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-07T11:33:21.671482Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.26523"},"observation_digest":"sha256:615c2c9fb09dc3eb94138d2f5d25c834b297c8c742ce139347212b5d65c64e0a","observation_id":"4b6c07c0-8f53-44d9-a873-4352a46f4769","resolution":{"observed_at":"2026-05-12T09:16:27.918063Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.26923","last_updated":"2026-04-29T17:38:37Z","snapshot_observed_at":"2026-07-06T23:12:29.385105Z","submitted_at":"2026-04-29T17:38:37Z","title":"ClassEval-Pro: A Cross-Domain Benchmark for Class-Level Code Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T10:33:28.276228Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.26923"},"observation_digest":"sha256:48813ee48e8903125c0acc28faa29bdc80f89d2dbfbd57d21695adb289baf61c","observation_id":"065f1c9b-20a9-4b31-af84-b7f9a4fbb182","resolution":{"observed_at":"2026-05-12T09:31:27.022934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2604.27319","last_updated":"2026-04-30T02:03:37Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-30T02:03:37Z","title":"REBENCH: A Procedural, Fair-by-Construction Benchmark for LLMs on Stripped-Binary Types and Names (Extended Version)","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-07T09:32:02.956530Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2604.27319"},"observation_digest":"sha256:e53364fb1d7cc69ef367b1f147b0e44ebe498a39ed6fea29a39ee83580ad9728","observation_id":"b380419f-53a5-44e6-9448-a83b2d2a8327","resolution":{"observed_at":"2026-05-12T09:46:26.088086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.00382","last_updated":"2026-05-05T08:05:07Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T04:06:02Z","title":"Social Bias in LLM-Generated Code: Benchmark and Mitigation","version":3},"reference_index":155,"source":"arxiv_source","source_observed_at":"2026-05-09T19:34:51.433422Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.00382"},"observation_digest":"sha256:2e0cda8f6b8ea6c7649f907d506d34ee01edbd7c7634e958df59217acb7e1649","observation_id":"4606a570-4084-44ce-8403-7393701865bc","resolution":{"observed_at":"2026-05-11T15:36:08.814874Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.00632","last_updated":"2026-05-01T13:09:30Z","snapshot_observed_at":"2026-08-03T02:13:50.582285Z","submitted_at":"2026-05-01T13:09:30Z","title":"BlenderRAG: High-Fidelity 3D Object Generation via Retrieval-Augmented Code Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-09T20:17:19.228252Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.00632"},"observation_digest":"sha256:f266c7df925382aac15a26705d6665dfe82aaf4b510ba67f7a45d047a1ef072e","observation_id":"34954ea8-0745-45ee-9041-335f9809d3ff","resolution":{"observed_at":"2026-05-11T15:21:06.161396Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.02163","last_updated":"2026-05-04T02:41:33Z","snapshot_observed_at":"2026-07-06T23:15:18.048504Z","submitted_at":"2026-05-04T02:41:33Z","title":"DocSync: Agentic Documentation Maintenance via Critic-Guided Reflexion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T18:57:38.925464Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.02163"},"observation_digest":"sha256:6ac57a886fc01eb95cb8e00219f322915390140abaecb2c3d31ec8a6d2238f0d","observation_id":"01c37aab-6f0d-41f4-aadb-6d9af12acd35","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.03101","last_updated":"2026-05-04T19:34:03Z","snapshot_observed_at":"2026-07-06T23:16:05.372336Z","submitted_at":"2026-05-04T19:34:03Z","title":"Programmatic Context Augmentation for LLM-based Symbolic Regression","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-08T18:26:09.810673Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.03101"},"observation_digest":"sha256:a9aeab6989320a5f261bb9162f7d9e983523b87e5b8dd2e46145e75eff01f5c6","observation_id":"e4fa015d-d969-41f9-b5a2-1a1f9eb11ecc","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.03179","last_updated":"2026-05-04T21:42:10Z","snapshot_observed_at":"2026-08-03T23:09:27.517424Z","submitted_at":"2026-05-04T21:42:10Z","title":"A Validated Prompt Bank for Malicious Code Generation: Separating Executable Weapons from Security Knowledge in 1,554 Consensus-Labeled Prompts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T18:11:29.066362Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.03179"},"observation_digest":"sha256:2f8494c4bbe9bba71843ea6beacb2d58391cae0e5b99498d49d64bff29abcd11","observation_id":"ab6e9451-7c33-4947-85dc-4499829979f8","resolution":{"observed_at":"2026-05-10T23:33:01.814344Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.03356","last_updated":"2026-05-05T04:29:38Z","snapshot_observed_at":"2026-08-05T07:34:17.722091Z","submitted_at":"2026-05-05T04:29:38Z","title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-07T16:04:48.394294Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.03356"},"observation_digest":"sha256:6a021535b283f638bab09e17407b32fddab174f06ff119f3e2410f33b29bb2ca","observation_id":"14c596c7-e91d-4e43-9961-7e6e29afa5c3","resolution":{"observed_at":"2026-05-11T23:56:12.245709Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.05267","last_updated":"2026-05-06T09:38:31Z","snapshot_observed_at":"2026-08-04T17:41:12.164736Z","submitted_at":"2026-05-06T09:38:31Z","title":"Bridging Generation and Training: A Systematic Review of Quality Issues in LLMs for Code","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:e4d7d6a3819ae113bb9f76510bccf9802f93ef07bf09cdc8264799556f35a8a5","observation_id":"ae54f87c-7bcc-4720-ae95-1ed8231ea255","resolution":{"observed_at":"2026-05-11T17:26:04.799515Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.11290","last_updated":"2026-05-11T22:17:51Z","snapshot_observed_at":"2026-07-06T23:23:06.755816Z","submitted_at":"2026-05-11T22:17:51Z","title":"ReAD: Reinforcement-Guided Capability Distillation for Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T01:45:26.316655Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.11290"},"observation_digest":"sha256:9f81276f5b39682945e8e0e7ec9d1c54ff8d7062b9f729895e39944e86c025ea","observation_id":"095cf2db-c097-4a8c-b093-017c18c41437","resolution":{"observed_at":"2026-05-13T01:47:03.990469Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.13280","last_updated":"2026-08-03T10:27:33Z","snapshot_observed_at":"2026-08-05T07:40:43.819154Z","submitted_at":"2026-05-13T09:58:21Z","title":"Characterizing Readability Issue Patterns and the Role of Prompt Design in LLM-Generated Code","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-14T18:18:05.384433Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.13280"},"observation_digest":"sha256:f65f254b3191c8bb06f6743f7219fbc5417a128329a6e0ef199b1b29fbaccfb6","observation_id":"e26bdd4d-3abb-427a-857a-ed5678d5b7c0","resolution":{"observed_at":"2026-05-14T18:19:23.649419Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-04T05:12:31.890376Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.13280","last_updated":"2026-08-03T10:27:33Z","snapshot_observed_at":"2026-08-05T07:40:43.819154Z","submitted_at":"2026-05-13T09:58:21Z","title":"Characterizing Readability Issue Patterns and the Role of Prompt Design in LLM-Generated Code","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T05:12:31.890376Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.13280"},"observation_digest":"sha256:faeee6cec21ff8534b970de9dbcd385cdb0f4ad68905cf7ae2c00e478663e5d9","observation_id":"55d06367-0799-4b9c-bbb8-cf0943988271","resolution":{"observed_at":"2026-08-04T05:12:31.890376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.13501","last_updated":"2026-05-13T13:23:54Z","snapshot_observed_at":"2026-08-03T21:52:03.710852Z","submitted_at":"2026-05-13T13:23:54Z","title":"Reward-Weighted On-Policy Distillation with an Open Property-Equivalence Verifier for NL-to-SVA Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T18:30:46.766638Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.13501"},"observation_digest":"sha256:29a336eb106f1f53a1a1957165ed1d29f65519d053d326d6e3d22d639788aa80","observation_id":"d33c0816-2d59-4b26-8e2f-fa3ddb3044e4","resolution":{"observed_at":"2026-05-14T18:32:34.596199Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.15053","last_updated":"2026-05-15T02:16:20Z","snapshot_observed_at":"2026-08-01T22:38:16.506764Z","submitted_at":"2026-05-14T16:46:26Z","title":"TFGN: Task-Free, Replay-Free Continual Pre-Training Without Catastrophic Forgetting at LLM Scale","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-19T17:06:12.280460Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.15053"},"observation_digest":"sha256:c6225e39a6f93f9263323138f697954b2868ef45aa288ddac85fbec81b9bc382","observation_id":"f59eab80-3db3-4a30-8be6-918463f18703","resolution":{"observed_at":"2026-05-19T17:07:41.549682Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.16046","last_updated":"2026-07-02T08:35:02Z","snapshot_observed_at":"2026-07-06T23:27:15.745896Z","submitted_at":"2026-05-15T15:17:43Z","title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-20T16:31:27.989614Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.16046"},"observation_digest":"sha256:1d2702ea5ea192de7807e64bc89a0343153692c684659c5b8d25656fc3813466","observation_id":"f8f663c3-4f20-4208-8f8a-561ad43892e0","resolution":{"observed_at":"2026-05-20T16:33:34.110346Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.16046","last_updated":"2026-07-02T08:35:02Z","snapshot_observed_at":"2026-07-06T23:27:15.745896Z","submitted_at":"2026-05-15T15:17:43Z","title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-04T00:55:50.772103Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.16046"},"observation_digest":"sha256:0a71a219e3423d45c49de1068bf2c53989ef897dc7bd35dea102e04b44e7b561","observation_id":"2ac5c992-0bb2-42c8-9772-3d8116abb95a","resolution":{"observed_at":"2026-07-04T00:59:18.907599Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.17535","last_updated":"2026-08-04T06:17:41Z","snapshot_observed_at":"2026-08-05T07:47:20.648436Z","submitted_at":"2026-05-17T16:39:48Z","title":"AgentModernize: Preserving Business Logic in Legacy Modernization with Multi-Agent LLMs and Behavioral Specification Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T22:39:14.920548Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.17535"},"observation_digest":"sha256:11b675d313b93dc0727464afdb0d7208df6c418e2b9460c50e5440157ea20cfc","observation_id":"bce7e91f-bb64-4bac-9d80-c51ca0ef11b9","resolution":{"observed_at":"2026-05-19T22:42:50.499816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.18430","last_updated":"2026-05-18T14:03:41Z","snapshot_observed_at":"2026-07-06T23:29:20.279470Z","submitted_at":"2026-05-18T14:03:41Z","title":"Text2CAD-Bench: A Benchmark for LLM-based Text-to-Parametric CAD Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-20T12:48:19.704406Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.18430"},"observation_digest":"sha256:14d83c0c5589b046fe1b0f6edad5fd38309f71c52e22d24a8bbb363e01355385","observation_id":"b5a0d357-e1b0-40a3-ac3f-b25448e98892","resolution":{"observed_at":"2026-05-20T12:53:17.750445Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.19369","last_updated":"2026-05-19T05:04:42Z","snapshot_observed_at":"2026-08-02T20:03:33.509954Z","submitted_at":"2026-05-19T05:04:42Z","title":"When to Answer and When to Defer: A Decision Framework for Reliable Code Predictions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T04:53:51.761561Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.19369"},"observation_digest":"sha256:bfc388f48ca586d9484821bd067a7b2801fe924c8bffe6ba4789c972b8de2160","observation_id":"4ef83da0-bae4-4d62-972f-e66b660aec0d","resolution":{"observed_at":"2026-05-20T04:58:05.220001Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.21543","last_updated":"2026-05-20T09:16:39Z","snapshot_observed_at":"2026-08-01T19:04:50.092578Z","submitted_at":"2026-05-20T09:16:39Z","title":"Provable Joint Decontamination for Benchmarking Multiple Large Language Models","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-22T00:40:54.038367Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.21543"},"observation_digest":"sha256:2ac714620f04e6f3dbb55961669792226c9e37c2c9013f4ba3af37b0b0548ca7","observation_id":"f331be50-618f-49d0-bf4b-3cd987611f75","resolution":{"observed_at":"2026-05-22T00:44:29.432539Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.23901","last_updated":"2026-05-22T17:59:38Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-22T17:59:38Z","title":"LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T04:30:35.962947Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.23901"},"observation_digest":"sha256:87381c9ccad62264091c64c46ac9f5079e1957197feb2b32707493b6671b6a75","observation_id":"dc49e1eb-ce06-4ac2-b3ed-30961da19ee6","resolution":{"observed_at":"2026-05-25T04:35:21.791105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.24171","last_updated":"2026-05-22T19:44:51Z","snapshot_observed_at":"2026-07-06T23:34:18.555542Z","submitted_at":"2026-05-22T19:44:51Z","title":"PromptAudit: Auditing Prompt Sensitivity in LLM-Based Vulnerability Detection","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T16:24:55.986340Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.24171"},"observation_digest":"sha256:94b77028507ca2aa085cf59cce3c3e6f81bd7f83ff320762aa1facd65de1ee11","observation_id":"7a5585af-05b3-4390-b862-b470bfc4399f","resolution":{"observed_at":"2026-06-30T16:44:56.337686Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.27358","last_updated":"2026-05-26T17:58:24Z","snapshot_observed_at":"2026-07-06T23:37:02.891611Z","submitted_at":"2026-05-26T17:58:24Z","title":"MobileMoE: Scaling On-Device Mixture of Experts","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T18:48:50.656971Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.27358"},"observation_digest":"sha256:86a25b04d30bc3e6726fe35b8e986c8ce9a07a752c8d88766f069b6f0278411e","observation_id":"c1556684-604a-4bbc-9fdf-02d08a805646","resolution":{"observed_at":"2026-06-29T18:53:51.451961Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.27849","last_updated":"2026-05-27T02:06:11Z","snapshot_observed_at":"2026-07-06T23:37:31.844094Z","submitted_at":"2026-05-27T02:06:11Z","title":"FPMoE: A Sparse Mixture-of-Experts Approach to Functional Code Generation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-29T09:47:17.718270Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.27849"},"observation_digest":"sha256:092ff969f0dd150f2d4ede98d5afec3ebaa9b6edb2c9ddd40e1dbec800a4229a","observation_id":"41f2e858-3354-4dc7-a92e-94433bc12a4c","resolution":{"observed_at":"2026-06-29T09:53:17.457053Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.30348","last_updated":"2026-05-28T17:59:53Z","snapshot_observed_at":"2026-08-02T00:40:00.272948Z","submitted_at":"2026-05-28T17:59:53Z","title":"LLMSurgeon: Diagnosing Data Mixture of Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T07:58:41.776928Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.30348"},"observation_digest":"sha256:3e4c03fb56c232946446ed34876cbd374b64a65fe88e78b43454885ac15e1037","observation_id":"88740a42-ce8e-4e65-b1f3-e864444f91bb","resolution":{"observed_at":"2026-06-29T08:03:14.353950Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.30777","last_updated":"2026-08-04T03:28:33Z","snapshot_observed_at":"2026-08-05T07:47:26.219014Z","submitted_at":"2026-05-29T03:09:37Z","title":"What Breaks When LLMs Code? Characterizing Operational Safety Failures of Agentic Code Assistants","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T21:57:02.677603Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.30777"},"observation_digest":"sha256:d0a79acc5f0d45ed0176b5b9f045cf9dee88d69ae04dd477ba4941dc627e818c","observation_id":"ee0c9676-65f4-4c83-a86a-27d769799219","resolution":{"observed_at":"2026-07-01T19:56:10.792181Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.31175","last_updated":"2026-05-29T11:42:55Z","snapshot_observed_at":"2026-07-06T23:40:22.583302Z","submitted_at":"2026-05-29T11:42:55Z","title":"Towards Efficient LLMs Annealing with Principled Sample Selection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T22:36:28.889515Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.31175"},"observation_digest":"sha256:522e5bd5a7fc8a01de6969a0cea0ba28daf3e94209fdebc1af7f61d82263289e","observation_id":"5d39ca21-fc89-4856-96ee-1c8f0f090b16","resolution":{"observed_at":"2026-06-28T22:42:47.022816Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2305.06161","doi":"10.48550/arxiv.2305.06161","metadata_source":"pith","pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"StarCoder: may the source be with you!","venue":"cs.CL","work_id":"7e9c3d6e-d6f7-4763-9ef6-de471506c58f","year":2023},"citing_paper":{"arxiv_id":"2605.31268","last_updated":"2026-05-29T13:01:11Z","snapshot_observed_at":"2026-07-06T23:40:27.543522Z","submitted_at":"2026-05-29T13:01:11Z","title":"Mellum2 Technical Report","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T22:58:35.397914Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2605.31268"},"observation_digest":"sha256:0a980f041b18371ee765e1da43c91491e8d7543044b51109403d1f7f4cd4f9af","observation_id":"f33d4242-5ebe-4d78-a000-c5bddecf0767","resolution":{"observed_at":"2026-06-28T23:02:46.582393Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.06161/citation-record","integrity":"/paper/2305.06161/integrity","json":"/paper/2305.06161/citation-record.json","paper":"/paper/2305.06161"},"outbound":[{"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":"Unified pre-training for program understanding and generation","venue":null,"work_id":"98d15866-1af7-4c5b-8034-96dab7ee1bf7","year":2021},"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":1,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:73cad4f6c31ab31cf7efc0fa4314e41df55a592aeff1113207f6fbb33617682b","observation_id":"2a826972-3e3f-4d9e-934d-87f26b063c74","resolution":{"observed_at":"2026-05-10T23:33:01.694999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Stability AI et al","venue":null,"work_id":"72b1345f-b7af-4714-9ae5-2e67dcfea69c","year":2023},"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":4,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:64caf2d190aab1489905602ae64b95653984824dfe3f4cbdc3b58e098c67d593","observation_id":"1987c65d-5448-4d71-912a-72214f5fcf45","resolution":{"observed_at":"2026-05-10T23:33:01.653353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1983.476737","doi":"10.1109/tpami.1983.4767370","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A maximum likelihood approach to continuous speech recognition","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","work_id":"6de51f5a-babe-4faa-a47d-e4d8bcf0097a","year":1983},"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":7,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ab5ccb9304b3c1c3e1dc2bfdfbcf1eef49c45d04e3a30e0ac42102e82dc5b32e","observation_id":"e14351f2-b891-48dc-8ca2-f80760e8fa92","resolution":{"observed_at":"2026-05-10T23:33:00.429765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"ChatGPT accessible again in Italy","venue":null,"work_id":"3773edf0-3396-44bb-8fe7-3ae64d84c152","year":2023},"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":9,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:81e5acdb1a1481803e959d8daaf0973a9bc28bfc259177cc3ee66ab4921aca46","observation_id":"20a1122e-6b9a-4afd-8903-0a3a0a7f4e27","resolution":{"observed_at":"2026-05-10T23:33:01.758818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"A framework for the evaluation of code generation models","venue":null,"work_id":"a0cae6e0-1429-4088-99d6-4f3f703c80c4","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":10,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:6e7f9e7a882ffd80ab76a02114be37c04dffdde811c8d8ac6cbc1d57476f4be5","observation_id":"2ce15612-a46c-404a-9b18-aea183ec02f5","resolution":{"observed_at":"2026-05-10T23:33:01.415328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"SantaCoder: don't reach for the stars! In Deep Learning for Code Workshop (DL4C)","venue":null,"work_id":"da9d42d2-cba4-4705-a4d7-19ad0a0890c3","year":2023},"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":11,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:9ccc39f3df269cf338bd5d1762f6722eb3af92f120619b21dd7eda077db3b039","observation_id":"ab60afca-5bc7-4c5f-ab90-02d0831d0c00","resolution":{"observed_at":"2026-05-10T23:33:01.382343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"A neural probabilistic language model","venue":null,"work_id":"1dfb0032-45c3-4305-a483-f99b442e0afe","year":2000},"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":12,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:6e5bb958931145dd7e140e1beb7a8701ea1099873566c0a1de23bc725e20770f","observation_id":"554a9a58-daeb-4517-849d-927f35b95677","resolution":{"observed_at":"2026-05-10T23:33:01.377268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"BLOOM (revision 4ab0472)","venue":null,"work_id":"32c37702-40a7-4b1d-92d3-5c0516351435","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":14,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:23087cb227b2478a3d6962ed9323c9e5d4ec9997fed8346b16c33028fe642868","observation_id":"ff743d94-5f80-4fa3-b9d7-dea8dcba0308","resolution":{"observed_at":"2026-05-10T23:33:01.370264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.06745","last_updated":"2022-04-14T04:00:27Z","snapshot_observed_at":"2026-07-06T13:00:12.148951Z","submitted_at":"2022-04-14T04:00:27Z","title":"GPT-NeoX-20B: An Open-Source Autoregressive Language Model","version":1},"cited_work":{"arxiv_id":"2204.06745","doi":"10.48550/arxiv.2204.06745","metadata_source":"pith","pith_arxiv_id":"2204.06745","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GPT-NeoX-20B: An Open-Source Autoregressive Language Model","venue":"cs.CL","work_id":"168a55d5-675d-49cf-be47-a17ee8cd742e","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":15,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2204.06745","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:59f59a73de862f540d7e9cf434ae629631f19800b8d25cc3d23ef84c7b87b63f","observation_id":"c094ffb1-ea7f-40f3-8066-853c3c3bda48","resolution":{"observed_at":"2026-05-10T23:33:00.473362Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Popat, Peng Xu, Franz J","venue":null,"work_id":"a80c0eee-f344-4527-9abb-4329be97e9f6","year":2007},"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":18,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:90426665679f5cae7de2c84549ac9901a07ea75b65be7c7b417996321f7a34ed","observation_id":"93733895-b1da-4085-925b-d83807e1dd54","resolution":{"observed_at":"2026-05-10T23:33:01.223064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"78e577d0-a41d-4f1d-8be2-47906f1fcd85","year":2000},"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":19,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:784a05e74cfc60cef7b001416b36da673d25a7da74b16197f0190c9c04638dd3","observation_id":"9a813a62-97a1-466c-8791-431be5ec221e","resolution":{"observed_at":"2026-05-16T01:20:29.590019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"N -gram counts and language models from the C ommon C rawl","venue":null,"work_id":"ee2d4c0c-5e6b-44a8-b4dc-9afdead280c0","year":2014},"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":21,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:b384cea7b12b570f819ba40bc569391f9be8d2e5a9d567eeb590a6d22970edae","observation_id":"03471d1f-f086-44b7-95cb-57dd45d3762b","resolution":{"observed_at":"2026-05-16T01:20:29.649031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"This CoPilot is stupid and wants to kill me","venue":null,"work_id":"90f7e4a5-4ca6-45d0-b562-d5c386c49e5e","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":22,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:64da50a672d9babe7b8bf43ea43698e0cde517b7d6d93fe62304e02d0ea894b9","observation_id":"9121bb26-f44f-4bee-86c5-01cb8c699279","resolution":{"observed_at":"2026-05-16T01:20:29.722508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"254731f4-28ac-4a1e-b580-f3119fe33680","year":2021},"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":24,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:449d1add214336a2664490be5f8e91c6ba6134451aab1c7c5ad2e813cef1e38d","observation_id":"43d70fd2-7018-4f75-8dc4-e341bba624f4","resolution":{"observed_at":"2026-05-16T01:20:29.687577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-07T18:24:01.210279Z","title":"Fu, Stefano Ermon, Atri Rudra, and Christopher R \\'e","venue":null,"work_id":"b7c95fa2-0ee8-4a45-9b26-e6f825786a34","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":27,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:cc6049bd579a7234a765a9649727a12b5ecb716d52d04b1b4653d6fc3d0c5106","observation_id":"60e04099-2e3f-4f4e-9a6b-acd98d6e270d","resolution":{"observed_at":"2026-05-16T01:20:29.591809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"and GitHub, Inc","venue":null,"work_id":"dbccaa9f-c0d4-4014-acfc-4086ffa560d9","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":29,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:fc51e5cedb307ac80b9d62ca534888d451cad2cc491c013ffa8ce5cb2ef4ba5d","observation_id":"f2217152-07af-4e4d-958f-2b34f69fd19e","resolution":{"observed_at":"2026-05-16T01:20:29.664392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10130","last_updated":"2023-08-21T07:58:25Z","snapshot_observed_at":"2026-07-06T15:05:00.197020Z","submitted_at":"2023-03-17T17:15:20Z","title":"GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models","version":5},"cited_work":{"arxiv_id":"2303.10130","doi":"10.48550/arxiv.2303.10130","metadata_source":"arxiv_reference","pith_arxiv_id":"2303.10130","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.2303.10130 , url =","venue":"arXiv (Cornell University)","work_id":"483332d1-b728-4def-a1b5-ec6d26fdbbb8","year":2023},"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":30,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2303.10130","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:340f44576f80313bb4822fb1126b6d23df9f353805e212f6ee174477ad78ebf9","observation_id":"8f4313da-04bd-46da-b416-e9cfd79d0cea","resolution":{"observed_at":"2026-05-10T23:33:00.490719Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-25T12:53:19.087338+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T12:53:19.087338+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Microsoft attracting users to its code-writing, generative AI software","venue":null,"work_id":"012dcb07-7f4b-4176-8a16-de4edb9bb3d6","year":2023},"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":31,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:8ccc1009d6119d9d2c7dfddf6d99461e4727919e4be22f00f866b1731b2f0e74","observation_id":"7ee21fca-d4b6-4824-913b-c65439c47e22","resolution":{"observed_at":"2026-05-16T01:20:29.683452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"The general data protection regulation","venue":null,"work_id":"9ee3ac74-4bb9-45aa-b792-e2b3824facfb","year":2018},"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":32,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:72d8d7c48eb439d2b19125009d2597940378d7f17d05744a62481a0de7d0dedd","observation_id":"fd6b7ac3-18ee-4b38-9ab4-37d090856895","resolution":{"observed_at":"2026-05-16T01:20:29.749006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10435","last_updated":"2023-01-27T15:30:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-18T18:56:13Z","title":"PAL: Program-aided Language Models","version":2},"cited_work":{"arxiv_id":"2211.10435","doi":"10.48550/arxiv.2211.10435","metadata_source":"pith","pith_arxiv_id":"2211.10435","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PAL: Program-aided Language Models","venue":"cs.CL","work_id":"4ed8425e-fa39-4f3b-816a-f312a04d19bb","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":37,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2211.10435","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:719f6a3f0506d63c814304c356cd7b84036662c9b05c18bbccce9b593307e67a","observation_id":"103b955e-c529-4fae-a0d5-18028f8bb49f","resolution":{"observed_at":"2026-05-10T23:33:00.497577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Clark, and Philipp Koehn","venue":null,"work_id":"8f060754-6600-40c3-8ccf-83bc8563595a","year":2013},"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":39,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:6c91f4fc6209b3ad6ef5d2c1e426261bb2c9137cc93ccba202a293199692e6fb","observation_id":"f15fb161-5929-424b-bcaf-8e3079069151","resolution":{"observed_at":"2026-05-16T01:20:29.659409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"On the naturalness of software","venue":null,"work_id":"eef550ce-5314-4bf9-b576-68de2cbb26c0","year":2012},"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":42,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:3b4c6eb36625cdf57dae9adf78ad1c34cae1933ce11b5f55ca78889cdc036bd6","observation_id":"94789e61-ae08-445a-9783-89e9e47d3d75","resolution":{"observed_at":"2026-05-16T01:20:29.732356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"The curious case of neural text degeneration","venue":null,"work_id":"69dc5cc1-e4ce-4420-af9c-470af8829762","year":2020},"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":44,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:82a1d5e3a9d38f0ba67832dc5e2f0787586c42e332760c0703b4ea94c572a313","observation_id":"96deb3a7-289e-4545-b046-c5112b676e85","resolution":{"observed_at":"2026-05-16T01:20:29.616332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.09436","last_updated":"2020-06-08T09:09:28Z","snapshot_observed_at":"2026-08-05T00:20:39.590098Z","submitted_at":"2019-09-20T11:52:45Z","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","version":3},"cited_work":{"arxiv_id":"1909.09436","doi":"10.48550/arxiv.1909.09436","metadata_source":"pith","pith_arxiv_id":"1909.09436","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","venue":"cs.LG","work_id":"c800e7c9-4d30-4cea-a30c-2a54a64f9229","year":2019},"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":45,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:acafb95ce99e65d9c11ea9fbac35d3a77f298678cf3dcf5668d97394cb434607","observation_id":"25d69608-e8ce-4f50-ae92-f44946c11281","resolution":{"observed_at":"2026-05-12T16:06:20.913961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T21:53:08.457832+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T21:53:08.457832+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Learning and evaluating contextual embedding of source code","venue":null,"work_id":"79adc7b6-acf9-47b0-96bc-b6565fcc7926","year":2020},"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":48,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:1a6c6676b4f5bad44eb3d941359f02d4158d9b81f2189c76e98f2872770ef93e","observation_id":"e91f9b7e-4222-4320-b06f-f693216e4486","resolution":{"observed_at":"2026-05-10T23:33:01.812465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":"1412.6980","doi":"10.1002/mrm.28086","metadata_source":"pith","pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Adam: A Method for Stochastic Optimization","venue":"cs.LG","work_id":"1910796d-9b52-4683-bf5c-de9632c1028b","year":2014},"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":51,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:b14808e0d2114de420d0f59c7014e518a60c09493e0560c3d37172e515b48b86","observation_id":"a924fe82-214b-4a49-8bea-b7d3859091e9","resolution":{"observed_at":"2026-05-10T23:33:00.546733Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15533","last_updated":"2022-11-20T18:15:30Z","snapshot_observed_at":"2026-07-06T14:24:01.962012Z","submitted_at":"2022-11-20T18:15:30Z","title":"The Stack: 3 TB of permissively licensed source code","version":1},"cited_work":{"arxiv_id":"2211.15533","doi":"10.48550/arxiv.2211.15533","metadata_source":"arxiv_reference","pith_arxiv_id":"2211.15533","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Stack: 3 TB of permissively licensed source code","venue":"arXiv (Cornell University)","work_id":"25679f5d-c50d-42ea-8f7d-43225d3917f4","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":52,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2211.15533","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:04b272cc413a93136d00dc5650cb824c94504d4c77446afa1b114a11ec5dfa74","observation_id":"01fb94cd-a444-4fd6-ba7f-34ec3aede757","resolution":{"observed_at":"2026-05-10T23:33:00.556370Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11916","last_updated":"2023-01-29T05:14:17Z","snapshot_observed_at":"2026-07-06T13:13:18.623287Z","submitted_at":"2022-05-24T09:22:26Z","title":"Large Language Models are Zero-Shot Reasoners","version":4},"cited_work":{"arxiv_id":"2205.11916","doi":"10.48550/arxiv.2205.11916","metadata_source":"pith","pith_arxiv_id":"2205.11916","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Large Language Models are Zero-Shot Reasoners","venue":"cs.CL","work_id":"d9b7eb1a-7165-46ff-9f06-d2f0b9d6f95d","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":53,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2205.11916","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:8efdb04f8fa795e0b99ae510b7d00464793a148330074fb1505d19daab1e8dfe","observation_id":"16da27ae-95db-4170-8425-dc53afd67aab","resolution":{"observed_at":"2026-05-12T19:04:13.904485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"9c8aef88-6adf-4278-bd25-3e8ccd7ff22a","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":54,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ae75da6cd34ef26fda0334d7df46133a5f35055c563ab121b5070b80bfbe6f79","observation_id":"8aef9af8-ca64-444e-802b-9007549c41c0","resolution":{"observed_at":"2026-05-10T23:33:01.802370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.11501","last_updated":"2022-11-18T17:20:27Z","snapshot_observed_at":"2026-08-02T06:47:39.159537Z","submitted_at":"2022-11-18T17:20:27Z","title":"DS-1000: A Natural and Reliable Benchmark for Data Science Code Generation","version":1},"cited_work":{"arxiv_id":"2211.11501","doi":"10.48550/arxiv.2211.11501","metadata_source":"pith","pith_arxiv_id":"2211.11501","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ds-1000: A natural and reliable bench- mark for data science code generation","venue":"cs.SE","work_id":"16d27f0f-e992-4a89-b3f3-a50dfca62314","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":57,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2211.11501","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ee5c62a4386517b8f2183f99971e6a432fcdf563a5330868941b4ade94d5200c","observation_id":"8c7cb085-ff52-4f44-ae68-77835b03cf8f","resolution":{"observed_at":"2026-05-10T23:33:00.580246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks","venue":null,"work_id":"c90df480-ae34-46e2-9d28-b77cf02e40b1","year":2013},"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":58,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:1c3980cdb08a4a8d5ef681c5a9eabe8355bc72fda6ebaa9a695cf6fb1d78dd9f","observation_id":"9863df45-074f-40a1-82d5-c0cb7038a208","resolution":{"observed_at":"2026-05-10T23:33:01.798615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Comparing code explanations created by students and large language models","venue":null,"work_id":"742535b4-cb01-48d8-9741-c4b15a1959b8","year":2023},"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":59,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:94e7d1921d52a8071547fef878f4b319a162bd24a323c595e4de499c1314bb06","observation_id":"56aed12a-34b6-4340-9fef-bb0e3859904c","resolution":{"observed_at":"2026-05-10T23:33:01.674720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fair learning","venue":null,"work_id":"aa133ede-1837-4427-82d8-e34068a4921f","year":2020},"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":60,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:8a62ced05b467efc61986bb1edcbf9e958b12cff367484fd80f60593c0f0f21e","observation_id":"e262c2f8-adac-453f-9338-29c73c7a8df6","resolution":{"observed_at":"2026-05-10T23:33:01.610701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"How copyright law can fix artificial intelligence's implicit bias problem","venue":null,"work_id":"ceaa13bf-35a1-49e7-9085-a971d1f859df","year":2018},"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":61,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:e6e87939deaf621cc86a53e3b3ccd78aca29fa84a24823681d1b7db6adb6be5a","observation_id":"f1d3743a-83a7-491c-ae34-82853ead4db8","resolution":{"observed_at":"2026-05-10T23:33:01.350986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":"1907.11692","doi":"10.1007/s10489-02203627-9","metadata_source":"pith","pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","venue":"cs.CL","work_id":"41fe12c4-e538-4890-a244-480650ed3078","year":2019},"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":64,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:d06bc526d3ba1918bbe6fe7a83757e3f298ac3535a1b324687f3295b7caa81bb","observation_id":"d0f7507d-1895-4871-9f0f-31435aeec32c","resolution":{"observed_at":"2026-05-10T23:33:00.586348Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Unpicking the rules shaping generative AI","venue":null,"work_id":"ebe8a70b-6067-42fd-8ec4-70d19412dd73","year":2023},"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":65,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:cff2b6517318249f28892e83a6e5503b3f61c03a11812d2dda636386eca077e3","observation_id":"f039edc9-76d9-40e3-960a-96e31ffe5ea4","resolution":{"observed_at":"2026-05-10T23:33:01.344784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-07-06T10:39:42.676631Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":"2102.04664","doi":"10.48550/arxiv.2102.04664","metadata_source":"pith","pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","venue":"cs.SE","work_id":"240a5e43-7f22-4634-b794-78d01e855b1d","year":2021},"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":66,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:6b0038b4b56833d031b9781651e0c35c6a077fe4a9a9ad20ed5ff8c694fe2289","observation_id":"6546ec08-b631-4fc3-8702-e6eede2e32c5","resolution":{"observed_at":"2026-05-15T11:40:02.914862Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00871","last_updated":"2023-10-22T19:28:24Z","snapshot_observed_at":"2026-07-06T14:47:30.906709Z","submitted_at":"2023-02-02T04:46:03Z","title":"Using In-Context Learning to Improve Dialogue Safety","version":3},"cited_work":{"arxiv_id":"2302.00871","doi":"10.48550/arxiv.2302.00871","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.00871","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Using in-context learning to improve dialogue safety, February 2023","venue":"arXiv (Cornell University)","work_id":"89919f83-8196-45de-ac38-d9a70c88bc50","year":2023},"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":70,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2302.00871","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:f5425e9f65b8ce6a735cdcb7df64d331ae16e464f70f9b37b256e77c08b69136","observation_id":"af9df831-d334-4c1f-905e-173ad99310a0","resolution":{"observed_at":"2026-05-10T23:33:00.606601Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Recurrent neural network based language model","venue":null,"work_id":"b8949da5-5e83-44de-9e31-d5a1df4a69f5","year":2010},"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":71,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:d6305091cff54a37af9578af39d727bc0f19f2806d203ad1d2204ff2d0e30cf1","observation_id":"8dca5366-175a-4440-91e0-5f089b34a84f","resolution":{"observed_at":"2026-05-10T23:33:01.335445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"CodeGen: an open large language model for code with multi-turn program synthesis","venue":null,"work_id":"49d206ee-0f8c-4981-a73c-3e43fe7fca56","year":2023},"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":78,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:e9600f0bff96782fe215ff53e73c74011e18c19ecba3d3c87f3ac98e34f9cc71","observation_id":"4fe73998-395e-4736-adf9-211c8c457d6d","resolution":{"observed_at":"2026-05-10T23:33:01.319749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"In-context learning and induction heads","venue":null,"work_id":"2a7f1199-ac9a-4b71-abd4-ed9ed2ffa240","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":79,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:24274f5f5ba171541a9185367a4cefc5d0595ddea152580f723cee072101e3bc","observation_id":"d16d98a1-b95f-483b-9283-2369a6e4d210","resolution":{"observed_at":"2026-05-10T23:33:01.315269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"GPT-4 system card","venue":null,"work_id":"f5d80411-3afe-4c1d-8eff-b3333ae598e3","year":2023},"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":81,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:371513221d880a6ea4d83884629b89c1e83e865bb3471fc8c2ad76b29c5fcde7","observation_id":"2393f12f-1b73-4b21-818b-9963d7c84327","resolution":{"observed_at":"2026-05-10T23:33:01.304746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.09293","last_updated":"2021-12-16T15:54:11Z","snapshot_observed_at":"2026-07-06T11:40:13.678025Z","submitted_at":"2021-08-20T17:30:33Z","title":"Asleep at the Keyboard? Assessing the Security of GitHub Copilot's Code Contributions","version":3},"cited_work":{"arxiv_id":"2108.09293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.09293","snapshot_observed_at":"2026-07-03T15:48:35.334842Z","title":"Asleep at the keyboard? assessing the security of github copilot’s code contributions","venue":null,"work_id":"0e2d1250-65a4-40f7-b534-a455db5b7eec","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":83,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2108.09293","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:4915044ec3e18de9dc19c548db51689b2dddd50bec6b9d41eec177521c3934c1","observation_id":"d5c2b9ab-d26f-4bc7-8ac5-e3855d8babfa","resolution":{"observed_at":"2026-05-10T23:33:00.617120Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Language models are unsupervised multitask learners","venue":null,"work_id":"d83db360-2902-4c8d-bb4a-06b09543ec42","year":2019},"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":87,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:03780e13a661140f836d84a91248f4607e56610edd7c5dda69c447133a59abc8","observation_id":"521867cd-2ac1-4f33-8654-b95f4ba50d9f","resolution":{"observed_at":"2026-05-10T23:33:01.300444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.11446","last_updated":"2022-01-21T18:39:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-12-08T19:41:47Z","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","version":2},"cited_work":{"arxiv_id":"2112.11446","doi":"10.48550/arxiv.2112.11446","metadata_source":"pith","pith_arxiv_id":"2112.11446","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","venue":"cs.CL","work_id":"47ce8be9-e500-407d-af41-ac2d132215eb","year":2021},"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":88,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2112.11446","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:c8bfb6cd4c6aa60e6ab29aced7135af700d7c16ae6b987973107bce45e0703ce","observation_id":"860fbc9f-43ba-4f5f-b578-cd82fdce0c4c","resolution":{"observed_at":"2026-05-11T19:13:40.454049Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Exploring the limits of transfer learning with a unified text-to-text transformer","venue":null,"work_id":"7a7020bf-1a2a-4e75-9dd9-3745719c8a85","year":2020},"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":89,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:45c5036a3f0588e052eb7c33bfbc62b3b106f2d91c39d739e748d214b19802fd","observation_id":"d0216d54-29ad-40ea-8ef5-214fb86b775f","resolution":{"observed_at":"2026-05-10T23:33:01.291091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Rothchild and Daniel Rothchild","venue":null,"work_id":"3c644c07-8720-49f8-b8b0-696ea00d1c22","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":91,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:300290f24af354a6b15d07865d3744da0dcac6a617004a130d47a18a489b079c","observation_id":"719d615e-e6ed-49d9-87a6-8d3ea86acbbe","resolution":{"observed_at":"2026-05-10T23:33:01.278100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Lost at C : A user study on the security implications of large language model code assistants","venue":null,"work_id":"30adfadc-bdd9-4562-9e9e-eae3a2bb9e40","year":2023},"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":92,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:90c0e4d08c150f6796bc4aac05cf8b59aa1944a3eaedc710cc50a9cfc4812989","observation_id":"1cfbab78-57e2-4b28-8266-b107522280f1","resolution":{"observed_at":"2026-05-10T23:33:01.273242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Kernel description","venue":null,"work_id":"a3ca8726-a527-4c17-893c-181a12093a3f","year":2016},"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":95,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:e584165795f30762edbe4a370194b10c3501f865de0cabe7f6cacc0dcca9c287","observation_id":"4a20fa3a-dbaa-4584-8a5d-02753ce9fe99","resolution":{"observed_at":"2026-05-10T23:33:01.267631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11990","last_updated":"2022-02-04T18:02:23Z","snapshot_observed_at":"2026-07-06T12:32:10.267841Z","submitted_at":"2022-01-28T08:59:57Z","title":"Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Model","version":3},"cited_work":{"arxiv_id":"2201.11990","doi":"10.48550/arxiv.2201.11990","metadata_source":"pith","pith_arxiv_id":"2201.11990","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Model","venue":"cs.CL","work_id":"7db569c6-f66a-40a1-9974-3de1eb611cc1","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":96,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2201.11990","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:4c3d41829ac4513059ace6df54a957f849b04f88b7b87f2d7bfdf7e5ae230889","observation_id":"7f1f77ed-ed3c-49c1-b48b-820e49dda987","resolution":{"observed_at":"2026-05-10T23:33:00.632672Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04844","last_updated":"2023-02-05T23:05:11Z","snapshot_observed_at":"2026-08-03T16:33:19.682728Z","submitted_at":"2023-02-05T23:05:11Z","title":"The Gradient of Generative AI Release: Methods and Considerations","version":1},"cited_work":{"arxiv_id":"2302.04844","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.04844","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The gradient of generative AI release: Methods and considerations","venue":null,"work_id":"03c91fc1-22ba-4b13-a851-d5ddaff1eb34","year":2023},"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":97,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2302.04844","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:01fe7b7c2eca737076eec3fe359bba40305e3a8c1c791b8e50fc86876236cbc9","observation_id":"0b5e1c56-3d15-45fe-b6b7-63cc91c7321d","resolution":{"observed_at":"2026-05-10T23:33:00.640802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"How an ai became my code-writing genie, Mar 2022","venue":null,"work_id":"7635e089-94b9-49d2-9eba-04fcdae5727b","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":99,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:6180bd0b1902fcf1930a39299c514400f703ed0705322fa5254697b85d8c8de4","observation_id":"a87ec59f-03a4-475b-9b98-5faef42c7712","resolution":{"observed_at":"2026-05-10T23:33:01.260087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.06035","last_updated":"2024-02-08T00:03:07Z","snapshot_observed_at":"2026-07-06T15:14:59.488000Z","submitted_at":"2023-03-31T17:33:10Z","title":"Choose Your Weapon: Survival Strategies for Depressed AI Academics","version":2},"cited_work":{"arxiv_id":"2304.06035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.06035","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yannakakis","venue":null,"work_id":"c645ee96-3e4b-4126-bda8-ca8e7492246a","year":2023},"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":101,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2304.06035","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:90ee7ecfff0a9d39ec70a61ddb75b4c4bb129991b2b42ec6afbffc00913b82ae","observation_id":"678fbfc5-8686-4c65-ad25-3f4e14eba229","resolution":{"observed_at":"2026-05-10T23:33:00.645751Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":"2302.13971","doi":"10.48550/arxiv.2302.13971","metadata_source":"pith","pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LLaMA: Open and Efficient Foundation Language Models","venue":"cs.CL","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","year":2023},"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":102,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:10ed39fe6bde594ebf28c4efe75ff7983a53c3fb9eb5ed2e476ee3d899ad0c8a","observation_id":"1f262853-7f4b-4c03-8e99-a15cef91dfcc","resolution":{"observed_at":"2026-05-10T23:33:00.653550Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Attention is all you need","venue":null,"work_id":"2c5e81ad-a48a-4163-b187-7559afdb9d60","year":2017},"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":103,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:37cf7b558deccc743e5eeb57edcdb7e2fc4ababe958a5aa8fb731bdeadda0f9e","observation_id":"f9877940-efad-4085-8001-d51f87aeda6f","resolution":{"observed_at":"2026-05-10T23:33:01.248369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Poisoning language models during instruction tuning","venue":null,"work_id":"4e67f73e-182a-4592-a245-da5b0e1f30bf","year":2023},"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":105,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:aad3ebb37facd7c67e334e8e7a4887772d4333cd052f6083ee28c354d49bb329","observation_id":"2de0a619-389f-4646-af76-b4016cdff9bd","resolution":{"observed_at":"2026-05-10T23:33:01.217190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"GPT-J-6B: a 6 billion parameter autoregressive language model","venue":null,"work_id":"6aecd83a-977b-4c3b-b8dc-acee11bdb6ca","year":2021},"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":106,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:83e7075453e1731a493f3b84d49030ba3bfaf4f8e1b55724dedde5241d252b9a","observation_id":"a32db8a9-a533-4ad8-bfef-51fee7a3214c","resolution":{"observed_at":"2026-05-10T23:33:01.182699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Chi, Quoc V Le, and Denny Zhou","venue":null,"work_id":"7e8c171c-7f0a-4b63-86a7-321c992ff781","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":109,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:c9e599f1c980308a3ccc18e70d9790052aa335dcc70b6a817f004bfeeb6c40be","observation_id":"047346b5-b2b6-4ba4-b38c-d7fa884692a4","resolution":{"observed_at":"2026-05-16T01:20:29.670143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"805ff701-3aff-4452-a1c4-4c655115b5a8","year":2020},"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":111,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:bc6058b8d7cfb7ec29cac726436f0f0fccd6976b1a45960c348fb70ccba5bed2","observation_id":"19430f72-9cf1-44b0-adb5-1837358f1102","resolution":{"observed_at":"2026-05-16T01:20:29.601087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Future of jobs report","venue":null,"work_id":"b4f3c988-030b-4205-bc75-aa2f1a13a670","year":2023},"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":112,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:d2d08a2006be340d8df961c09bbcea2012fb465ff543baf1fee39118a4fc2ec4","observation_id":"92e62461-f0e6-4cb2-a50f-959c047a39c4","resolution":{"observed_at":"2026-05-16T01:20:29.579145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Do machine learning models produce TypeScript types that type check? In European Conference on Object-Oriented Programming (ECOOP)","venue":null,"work_id":"cef73ea0-be9c-4634-9577-ee5ab0f38fd0","year":2023},"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":114,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:a76672cb4b032daddea9011da2c41caab5100984e0c699b4ef17a53a53f4ee85","observation_id":"0a679aa7-fcdd-4865-9947-5fa7a70aa14c","resolution":{"observed_at":"2026-05-16T01:20:29.713521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02414","last_updated":"2023-10-25T05:22:43Z","snapshot_observed_at":"2026-08-02T04:26:53.194797Z","submitted_at":"2022-10-05T17:34:44Z","title":"GLM-130B: An Open Bilingual Pre-trained Model","version":2},"cited_work":{"arxiv_id":"2210.02414","doi":"10.48550/arxiv.2210.02414","metadata_source":"pith","pith_arxiv_id":"2210.02414","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GLM-130B: An Open Bilingual Pre-trained Model","venue":"cs.CL","work_id":"b6ef9427-af31-4c7c-8c34-bee621978c23","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":115,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2210.02414","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:4b84173abb943ee6a580ce4b08648b22834d5a2a5d0c4511894c3224114058ba","observation_id":"0a31baee-b05a-43f3-96d0-17151c7dd15d","resolution":{"observed_at":"2026-05-14T17:41:34.452877Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-07-06T13:05:54.518154Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":"2205.01068","doi":"10.48550/arxiv.2205.01068","metadata_source":"pith","pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-07-11T03:37:45.880117Z","title":"OPT: Open Pre-trained Transformer Language Models","venue":"cs.CL","work_id":"d7ff3b21-1fff-4cf4-952a-4714e3ef2307","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":116,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:19e46e46bd91a591494de5cd1f1d9051e2df12be3537646b6d1ce8e3827a5651","observation_id":"d83912fc-1da1-442b-b14b-828afdb52f33","resolution":{"observed_at":"2026-05-10T23:33:00.668374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-25T10:53:17.026227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T10:53:17.026227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17568","last_updated":"2024-07-10T03:52:58Z","snapshot_observed_at":"2026-07-06T15:10:12.213443Z","submitted_at":"2023-03-30T17:34:01Z","title":"CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-X","version":2},"cited_work":{"arxiv_id":"2303.17568","doi":"10.48550/arxiv.2303.17568","metadata_source":"arxiv_reference","pith_arxiv_id":"2303.17568","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zheng, X","venue":"arXiv (Cornell University)","work_id":"a437deb4-3fce-40c1-ab5b-0bfcb78d4e75","year":2023},"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":117,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2303.17568","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:7f8eaf65dcc473fbee1179808717cbf641391cd4f1329930b6272c64a4e8c7c7","observation_id":"04507529-70ca-4c4e-a0c4-85a9db43ce7e","resolution":{"observed_at":"2026-05-10T23:33:00.007048Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.10625","last_updated":"2023-04-16T22:08:08Z","snapshot_observed_at":"2026-08-03T04:30:54.138138Z","submitted_at":"2022-05-21T15:34:53Z","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","version":3},"cited_work":{"arxiv_id":"2205.10625","doi":"10.48550/arxiv.2205.10625","metadata_source":"pith","pith_arxiv_id":"2205.10625","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","venue":"cs.AI","work_id":"7e58c111-4666-4996-b5ad-1c8efd433083","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":118,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2205.10625","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ab689542dbb9e8ef55e2b920c3f35b890ba96ac75b7527398ab953d47921e7fb","observation_id":"f10a8f99-ab04-43c6-af03-8d5a60e10f7c","resolution":{"observed_at":"2026-05-11T08:44:37.129111Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/n19-1423","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BERT : Pre-training of Deep Bidirectional Transformers for Language Understanding","venue":"Proceedings of the 2019 Conference of the North","work_id":"3e3c8ac8-b858-4b22-af32-393d98c883e0","year":2019},"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":119,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:332d4e7e771a27887139c8c9e6efcb303de79d0342c6cea9723511bf6f1cc2af","observation_id":"59977028-3952-4a88-a3dc-3bbe7bbe6bd5","resolution":{"observed_at":"2026-05-10T23:33:00.022601Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-01T13:38:13.85894+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T13:38:13.85894+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"8a2e7541-cf76-43fd-b09b-87398e6ebe41","year":null},"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":120,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:3d1a77b056c5015df276906259d94e09276c46f47ad703a88905e27c2218f7d3","observation_id":"45ea90ea-c3f9-41bc-a91b-93442154c498","resolution":{"observed_at":"2026-05-16T01:20:29.739092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08821","last_updated":"2022-05-18T12:29:49Z","snapshot_observed_at":"2026-07-06T11:01:05.577957Z","submitted_at":"2021-04-18T11:27:08Z","title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","version":4},"cited_work":{"arxiv_id":"2104.08821","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.08821","snapshot_observed_at":"2026-07-04T20:00:08.897138Z","title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","venue":"cs.CL","work_id":"e9fab1e4-f443-4963-9f2a-83f772482c00","year":2021},"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":121,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2104.08821","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:acdca0bc4d2eb75b02f70f52915c370e37dd86d0f14eed10684c778e38e838f3","observation_id":"4c0a0241-e274-4573-aca0-5ba8f02d9d53","resolution":{"observed_at":"2026-05-15T07:48:23.738089Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-05T05:40:43.802849Z","title":"Proceedings of the 38th International Conference on Machine Learning , pages =","venue":null,"work_id":"21a015fa-c50a-41e0-9c87-b9760c6e6693","year":2021},"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":122,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:d950a08451b721a6f6fe2949dcb7f2b8c93006e7fdba5ef5ec413f7c05a661b9","observation_id":"e0958c7a-ade4-4e56-8187-7b2ffcd8f611","resolution":{"observed_at":"2026-05-16T01:20:29.654563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"arXiv preprint , archivePrefix=","venue":null,"work_id":"0b29f308-c168-4940-963c-963f94d5c604","year":2021},"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":123,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:43ce43695d641ffe7a5e1533e93ff026c1585fee64d288eeabd1392185606792","observation_id":"bb3734da-1ee0-466e-959b-f2f46a494b79","resolution":{"observed_at":"2026-05-16T01:20:29.679002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"2023 , url=","venue":null,"work_id":"3e5ed398-c3bf-4158-ae72-7181096a6529","year":2023},"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":124,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:b85a8105fb546c0c5557b58ec8da5fbe9e86bfddb92f2e962f3c08a33b42a630","observation_id":"1cbd2d33-d793-4508-96fd-a1ddd956d6e8","resolution":{"observed_at":"2026-05-16T01:20:29.709940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17568","last_updated":"2024-07-10T03:52:58Z","snapshot_observed_at":"2026-07-06T15:10:12.213443Z","submitted_at":"2023-03-30T17:34:01Z","title":"CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-X","version":2},"cited_work":{"arxiv_id":"2303.17568","doi":"10.48550/arxiv.2303.17568","metadata_source":"arxiv_reference","pith_arxiv_id":"2303.17568","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zheng, X","venue":"arXiv (Cornell University)","work_id":"a437deb4-3fce-40c1-ab5b-0bfcb78d4e75","year":2023},"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":125,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2303.17568","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:f27c122537d6ce78e272b7a7da6c756a0b3fcaf3eac7b1bb64ee817d4ccf7468","observation_id":"b7dae65b-d8e4-4575-9b24-3a8b85f8e533","resolution":{"observed_at":"2026-05-10T23:33:00.695905Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"4399ae97-3fee-4283-83df-206b1027f6ac","year":null},"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":126,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:f4a85a7cbb03ef9c780e45dea68a2401a259962867ebaf33b396dd7f4a1cba14","observation_id":"7e05a31f-1e73-46e2-b6bf-cd69d42aa03e","resolution":{"observed_at":"2026-05-16T01:20:29.620939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2211.05100","doi":"10.48550/arxiv.2211.05100","metadata_source":"pith","pith_arxiv_id":"2211.05100","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"BLOOM: A 176B-Parameter Open-Access Multilingual Language Model","venue":"cs.CL","work_id":"337ba690-f35d-4154-9450-8edf4bc9f488","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":127,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2211.05100","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:3898b8cdaf2ac6ec64112bc205eedaf65384bedab161273e2448e10d364ddf8b","observation_id":"6aa97507-69e8-4df7-b1d7-3bf03b885bab","resolution":{"observed_at":"2026-05-12T00:51:12.019329Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-25T16:25:57.975024+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T16:25:57.975024+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"536edec1-553b-460a-a089-c984851ac558","year":null},"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":128,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:4e9b8505efe71570b4cf1ff2f37ae2b01539c51a493c19e695be9de1d91a99e9","observation_id":"d86150d1-52e0-487d-84d4-cb01c05d6785","resolution":{"observed_at":"2026-05-16T01:20:29.639333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"389fa0bc-d2db-4e8c-91b1-f40c775dd91d","year":null},"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":129,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:24fb835b01149fa358df37fb448fd84ed6161e5294f12c3812399d5352c39083","observation_id":"4f12677f-1ae3-40ca-88c1-c772cb868048","resolution":{"observed_at":"2026-05-16T01:20:29.769935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2204.05999","doi":"10.48550/arxiv.2204.05999","metadata_source":"pith","pith_arxiv_id":"2204.05999","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InCoder: A Generative Model for Code Infilling and Synthesis","venue":"cs.SE","work_id":"e98a5559-529d-48b1-833c-b85b662f190c","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":130,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2204.05999","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:7f234783985c9684d2fc26e202c401abc436935e4cb237cdc2cf1cc7e4f32f25","observation_id":"2775c43a-6f24-4824-84e7-49fef1e63db1","resolution":{"observed_at":"2026-05-16T02:21:20.606144Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.11280","last_updated":"2022-07-22T18:08:16Z","snapshot_observed_at":"2026-07-06T13:34:22.280128Z","submitted_at":"2022-07-22T18:08:16Z","title":"PanGu-Coder: Program Synthesis with Function-Level Language Modeling","version":1},"cited_work":{"arxiv_id":"2207.11280","doi":"10.48550/arxiv.2207.11280","metadata_source":"arxiv_reference","pith_arxiv_id":"2207.11280","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2022 , copyright =","venue":"arXiv (Cornell University)","work_id":"af4099bf-f716-47a6-8ff4-a23aa65365df","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":131,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2207.11280","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:fc1713871ea2191c3a1da55d6c9c2094a5cd946d91b4ff63acc4f6b268529b83","observation_id":"ce70a255-44a1-46c0-9daf-ecb30a05301d","resolution":{"observed_at":"2026-05-10T23:33:00.137740Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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:007e143fac2888ea888dd77058daec9f16ecf88b943c8ad30bf4f8663849a04a","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-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+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-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":"2108.07258","doi":"10.1016/j.specom.2008.12.003","metadata_source":"pith","pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Opportunities and Risks of Foundation Models","venue":"cs.LG","work_id":"a18039e9-928d-47c9-a836-32656a71bf71","year":2021},"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":133,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:a882e06b853bcc462d7606b294dbe8c6cd0b573b14129746d93c7b19a3fa6997","observation_id":"c2232e37-2a99-4322-92ee-be65c6b17095","resolution":{"observed_at":"2026-05-10T23:33:00.718738Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-24T09:22:59.787075+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T09:22:59.787075+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":"2005.14165","doi":"10.1145/1926385.1926423","metadata_source":"pith","pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Language Models are Few-Shot Learners","venue":"cs.CL","work_id":"214732c0-2edd-44a0-af9e-28184a2b8279","year":2020},"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":134,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:b1cbdcc69b1cc05e43508c48974fcbedae39ea44abc0e6a6b104af1831743972","observation_id":"2cf2181c-7830-4c92-ad9d-1b89fc4bcea8","resolution":{"observed_at":"2026-05-10T23:33:00.724546Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:33.42086+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:33.42086+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T20:46:34.194734Z","title":"Kingma and Jimmy Ba , editor =","venue":null,"work_id":"03bfe487-67cd-4832-be0e-f98027fded15","year":2015},"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":135,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:8dfb2bbf074a6c6ea9dd12995eaeedddd43d1539b48fca3fb000cbe2ed0fe55d","observation_id":"f68391ef-1efe-48cd-9111-7d2c190478c7","resolution":{"observed_at":"2026-05-16T01:20:29.735502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.02311","last_updated":"2022-10-05T06:02:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-05T16:11:45Z","title":"PaLM: Scaling Language Modeling with Pathways","version":5},"cited_work":{"arxiv_id":"2204.02311","doi":"10.48550/arxiv.2204.02311","metadata_source":"pith","pith_arxiv_id":"2204.02311","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PaLM: Scaling Language Modeling with Pathways","venue":"cs.CL","work_id":"a94f3ef7-2c49-4445-93fe-6ec16aafd966","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":136,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2204.02311","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:a36f2a6e41e2f3972bdc68b50f5b5b6aeb68f823a42f5c9ae91c28d0121c3a9e","observation_id":"ca462012-3560-448b-8b6e-69b2c1a11b7f","resolution":{"observed_at":"2026-05-10T23:45:07.766206Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T12:25:21.411055+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T12:25:21.411055+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1146.353463","doi":"10.1145/3531146.3534631","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scott, Sonja Mei Wang, Milagros Miceli, Pieter Delobelle, Karolina Sztandar-Sztanderska, and Bettina Berendt","venue":"2022 ACM Conference on Fairness, Accountability, and Transparency","work_id":"6c598a97-8c08-4d3c-8e61-67e53219e032","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":137,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:eb51579b98599b576f25f75a7dd17182214a88ace44fa511bb6ef7c0a82dc652","observation_id":"d5ea8671-4c7b-48a7-8a55-8a7cf786ca60","resolution":{"observed_at":"2026-05-10T23:33:00.119105Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T08:52:28.425866+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T08:52:28.425866+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":"2108.07732","doi":"10.1007/s11390-025-5518-5","metadata_source":"pith","pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Program Synthesis with Large Language Models","venue":"cs.PL","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","year":2021},"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":138,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:7e779b291733788ca8e7173553fe5d09eb8cfae4d21f2f4fcc83582ab94721b9","observation_id":"37d5786f-b850-41d7-b6a6-b18ad6a93614","resolution":{"observed_at":"2026-05-10T23:33:00.737274Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0003.351017","doi":"10.1145/3510003.3510171","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 44th International Conference on Software Engineering , location =","venue":"Proceedings of the 44th International Conference on Software Engineering","work_id":"0d7c1486-22fd-44e2-a547-65f43da12b82","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":139,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:9b43eef62ee62dc024a99f9c624808dc73f7c9f7f62ac1545cafdfadc3f3a1ab","observation_id":"435d5ddb-9a28-48a7-aee5-a1f1c5283d98","resolution":{"observed_at":"2026-05-10T23:33:00.108810Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0312.353486","doi":"10.1145/3520312.3534862","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://dl.acm.org/doi/abs/10.1145/3520312.3534864","venue":null,"work_id":"f27fd089-d2d2-424b-b340-a787978be666","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":140,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:e65ecf7dc0450a33349b6e403740e41794459a8c72f115d12a6aad016af4d398","observation_id":"f456d001-fb88-41ce-b143-914afb19e543","resolution":{"observed_at":"2026-05-10T23:33:00.086559Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Unified Pre-training for Program Understanding and Generation","venue":null,"work_id":"7ea41eb0-4d39-4b18-ac3f-3a1021ad30fa","year":2021},"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":141,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ecd671f422bbde237ecd1799c9a5451676a9af9f4263be71e1d6f7854165e18e","observation_id":"929b53f8-a491-4f48-a564-146233dc60dc","resolution":{"observed_at":"2026-05-16T01:20:29.743816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2021.emnlp-main.685","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi: 10.18653/v1/2021.emnlp-main.685","venue":"Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing","work_id":"30b41c5a-1b57-43bc-9fff-c05fd61a6543","year":2021},"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":142,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:cd1bcb8c04c672a82a5f4e4ab5438592bc5f66f8b170ebe2fa6322b8579f3d72","observation_id":"4ae35ac5-a401-4216-a701-aa5777afb3ed","resolution":{"observed_at":"2026-05-10T23:33:00.066427Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:18:56.774541+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:18:56.774541+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07492","last_updated":"2021-10-27T18:34:00Z","snapshot_observed_at":"2026-07-06T10:41:24.294012Z","submitted_at":"2021-02-15T11:50:47Z","title":"DOBF: A Deobfuscation Pre-Training Objective for Programming Languages","version":3},"cited_work":{"arxiv_id":"2102.07492","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07492","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07492 , year=","venue":null,"work_id":"c8336583-3396-4dab-af17-b4a26ad932c0","year":2021},"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":143,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2102.07492","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:579efc9237feb89c75f318a7a9ba3f86046cc6765ca168858651e50a41167dbf","observation_id":"6c98409f-d8f0-425a-b5b3-2ae69e0bc89f","resolution":{"observed_at":"2026-05-10T23:33:00.747700Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"d1263b82-ca41-487f-b9be-22d57dafb6dc","year":null},"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":144,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:20af7e86aa9549c84036d8bb3dee45f783d6ba9e45d79530878632ca99d6589f","observation_id":"0692aaa9-5117-48f6-8472-2e2012d7589e","resolution":{"observed_at":"2026-05-16T01:20:29.643909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.5371628","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A framework for few-shot language model evaluation, September 2021","venue":"Zenodo (CERN European Organization for Nuclear Research)","work_id":"27d00efc-1c8b-4af4-bd30-5dfa575d0989","year":2021},"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":145,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:f1a2d618b03c014a57078d25e665271378f7f50aef867afc7b2c5a05d546ea9e","observation_id":"1296ed8f-5c84-4071-8a64-1643b49e7cac","resolution":{"observed_at":"2026-05-10T23:33:00.060531Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:19:41.045161+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:19:41.045161+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Proceedings of the 37th International Conference on Machine Learning , articleno =","venue":null,"work_id":"2ec51833-fc41-4a42-976f-913262e66dff","year":2020},"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":146,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:17e3b0c13d01afdb0f2ff95de0968090b348c4543f09fda22bed9cfda432e8f3","observation_id":"14bf34c6-d031-40e4-b0dc-9317884ed2a4","resolution":{"observed_at":"2026-05-16T01:20:29.674761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2020.findings-emnlp.139","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T00:45:11.450695Z","title":"CodeBERT: A pre-trained model for programming and natural languages","venue":"Findings of the Association for Computational Linguistics: EMNLP 2020","work_id":"87bb2915-abd6-4c5e-bc05-f9c7a96435b9","year":2020},"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":147,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:47051ecbe660ee8d17e220801cafdc16cae9872a038fe2ed70bf7b0381f62369","observation_id":"8aa4bc77-4b41-4f05-a795-ef6af29bc691","resolution":{"observed_at":"2026-05-10T23:33:00.052892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T16:19:40.851233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T16:19:40.851233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14255","last_updated":"2022-07-28T17:40:47Z","snapshot_observed_at":"2026-08-03T04:07:30.689454Z","submitted_at":"2022-07-28T17:40:47Z","title":"Efficient Training of Language Models to Fill in the Middle","version":1},"cited_work":{"arxiv_id":"2207.14255","doi":"10.48550/arxiv.2207.14255","metadata_source":"pith","pith_arxiv_id":"2207.14255","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Training of Language Models to Fill in the Middle","venue":"cs.CL","work_id":"54afe4f8-4d93-4829-99ae-2a27143a9641","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":148,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2207.14255","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:ddbf1b07aa29fd32349218d0ff162326cc4b2d8c0134e44668c23a74efe1ef5c","observation_id":"fbcd703d-c60e-486a-99f9-c7bff457d4d0","resolution":{"observed_at":"2026-05-18T00:40:42.183417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00027","last_updated":"2020-12-31T19:00:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-12-31T19:00:10Z","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","version":1},"cited_work":{"arxiv_id":"2101.00027","doi":"10.1117/1.jmi.10.6.061104","metadata_source":"pith","pith_arxiv_id":"2101.00027","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","venue":"cs.CL","work_id":"9b10667a-da61-4358-aceb-10578234d45d","year":2020},"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":149,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2101.00027","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:0b9d61b2e84f66005569fc97ea20a95005a72ce42db66fefa728485141bde19e","observation_id":"a1d4d301-265f-4b59-ac84-21e044423914","resolution":{"observed_at":"2026-05-10T23:33:00.753379Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"1f37620b-1b77-4db9-9c3b-0c126c4ae27a","year":null},"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":150,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:0e230f8e55ecc8f01e0494abf0714a8a9845de57ca7bfb3876ce29e8fe72014d","observation_id":"aa55665e-ad5c-4339-8659-ff6f6fc001fb","resolution":{"observed_at":"2026-05-16T01:20:29.726209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.acl-long.577","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deduplicating Training Data Makes Language Models Better","venue":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","work_id":"59f1bbd1-2ddb-4173-821f-545a910ec2aa","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":151,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:19f3bd3a26df4ce3f00dcdc036be21c04cbe5513b7adf1228b20fe9ccd97ab38","observation_id":"68721b0d-0b35-403c-ae58-19ffd7245da6","resolution":{"observed_at":"2026-05-10T23:32:59.962059Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:50:54.596138+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:50:54.596138+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":"USENIX Security Symposium , year =","venue":null,"work_id":"1ac9010b-d001-4c2c-957d-759ddc06a88f","year":null},"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":152,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:aa06b4740ae8da1eb4089eea9d2c8210e3272e2d98a534448e1625d80c35ac52","observation_id":"6596bc7d-8d16-4ae4-a4b1-93a6e754f016","resolution":{"observed_at":"2026-05-16T01:20:29.623029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06539","last_updated":"2022-12-20T05:21:40Z","snapshot_observed_at":"2026-07-06T12:37:25.512398Z","submitted_at":"2022-02-14T08:20:15Z","title":"Deduplicating Training Data Mitigates Privacy Risks in Language Models","version":3},"cited_work":{"arxiv_id":"2202.06539","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.06539","snapshot_observed_at":"2026-07-03T00:57:30.314629Z","title":"Kandpal, E","venue":null,"work_id":"3ae8f9ae-1809-495c-91a2-31ba604fe54b","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":153,"source":"arxiv_source","source_observed_at":"2026-05-10T23:32:59.517389Z"},"links":{"cited_paper":"/paper/2202.06539","citing_paper":"/paper/2305.06161"},"observation_digest":"sha256:75682bcb2c1d066c2b9bbbba4ad52243f5fe3d75f13bdffca28907014a0ec153","observation_id":"8e758aa5-1775-41d3-a3d8-46014625f49b","resolution":{"observed_at":"2026-05-10T23:33:00.763374Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2305.06161","last_updated":"2023-12-13T14:44:10Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T15:25:35.930688Z","submitted_at":"2023-05-09T08:16:42Z","title":"StarCoder: may the source be with you!"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":13,"parse_uncertain":0,"unresolved":10,"verified_exact":31,"verified_fuzzy":46},"total_outbound_references":243},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 100 of 243 outbound references and 100 inbound Pith citation observations for arXiv:2305.06161."}