{"as_of":"2026-08-11T00:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad59bb76044dcb4f29ab4d43d6311479d9e6183fcf5ae377a4c1f6f5e4644019","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":43,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:23:50.752228Z","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":51,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2305.01210","last_updated":"2023-10-30T19:37:09Z","snapshot_observed_at":"2026-08-10T17:38:15.086994Z","submitted_at":"2023-05-02T05:46:48Z","title":"Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T02:04:17.888553Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2305.01210"},"observation_digest":"sha256:cb68609e0e676ec93ab8e6c249a3f46b1640fb1c244999afcbd4563e1f2f76dc","observation_id":"949efa0e-16cf-4f29-b64c-dedd88bdc79c","resolution":{"observed_at":"2026-05-14T02:04:17.938020Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2305.16264","last_updated":"2025-06-28T00:00:06Z","snapshot_observed_at":"2026-08-08T06:18:27.640980Z","submitted_at":"2023-05-25T17:18:55Z","title":"Scaling Data-Constrained Language Models","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T01:35:21.150772Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2305.16264"},"observation_digest":"sha256:7ddd285abbb8b8c7b069a0d50b7b8c6ee054cdb03ef87f6b0a1834efe2b5ad82","observation_id":"9eb1be62-8f5b-4efd-8107-4d74faf910d2","resolution":{"observed_at":"2026-05-18T01:35:21.543447Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2306.03091","last_updated":"2023-10-04T01:13:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-05T17:59:41Z","title":"RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T22:29:52.457841Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2306.03091"},"observation_digest":"sha256:d91d82089964df6edcc1e5787c549f935cd82054d17927cf771270308bbc4247","observation_id":"a2dd4eea-8ccd-4671-9517-e9e07438b335","resolution":{"observed_at":"2026-05-15T22:29:52.578579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2306.11644","last_updated":"2023-10-02T06:12:30Z","snapshot_observed_at":"2026-08-10T21:55:43.802039Z","submitted_at":"2023-06-20T16:14:25Z","title":"Textbooks Are All You Need","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T04:44:03.148223Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2306.11644"},"observation_digest":"sha256:7a3747a583e1f56b8c88d720977c64774458e058125f1797ab4c47c9e9567f30","observation_id":"9e959f15-4a50-4e7b-a454-66dfe4dfc47e","resolution":{"observed_at":"2026-05-13T04:44:03.170447Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2309.07597","last_updated":"2024-09-24T03:01:25Z","snapshot_observed_at":"2026-08-09T21:52:29.568774Z","submitted_at":"2023-09-14T10:57:50Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T13:24:32.084878Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2309.07597"},"observation_digest":"sha256:110cc9d429a2791c196ed69cd919b80dd910127a5158d4c0555970564a6ff51e","observation_id":"c11bea36-b32e-4da9-91df-a83845ffe23f","resolution":{"observed_at":"2026-05-13T13:24:32.176763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","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":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:26:38.812485Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2401.14196"},"observation_digest":"sha256:3d593db1909e5567e8d8038895d2eb16005a9ec78f07af1e2275bd3c5386da5b","observation_id":"58ef8f64-e977-4b6d-92ca-2f2a7babbece","resolution":{"observed_at":"2026-05-10T17:26:38.832088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":163,"source":"arxiv_source","source_observed_at":"2026-05-12T17:28:22.353355Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2402.19173"},"observation_digest":"sha256:a493b918a446f8bf6e257d22d88cc35cc85faa2520634e6ae434160c27384f48","observation_id":"6e2c75e3-1a1e-453d-b729-067b519e8955","resolution":{"observed_at":"2026-05-12T17:28:22.670011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-10T03:07:35.408836Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"reference_index":240,"source":"arxiv_source","source_observed_at":"2026-05-10T17:34:42.565806Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2403.07974"},"observation_digest":"sha256:e4fb93d290c727f30258b5b7a1c06709d50e0b0e3f8e5655a4d017e4d7617603","observation_id":"9e20f17a-76e9-4ec0-819e-17252883fb2a","resolution":{"observed_at":"2026-05-10T17:34:42.858586Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":9,"source":"pdf_text","source_observed_at":"2026-05-13T20:18:06.304134Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2406.00515"},"observation_digest":"sha256:ef98cc77c97e58e4cb43c6a9062cb5a7a153f18ed775304f371f7ce3fcbe94a5","observation_id":"a88551bc-74ba-477c-88f2-1e5e3811db23","resolution":{"observed_at":"2026-05-13T20:18:06.487367Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":9,"source":"pdf_text","source_observed_at":"2026-05-17T22:58:16.523267Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2406.11794"},"observation_digest":"sha256:f176f9d9fd9d864ab3b2efe08053559da112044d15b0901492f0ff0cc4e899bf","observation_id":"cebbdc4e-7b72-4322-bf1a-1dfa132f3cd8","resolution":{"observed_at":"2026-05-17T22:58:16.850256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-07T06:30:25.302107Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T01:06:07.787696Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2406.11931"},"observation_digest":"sha256:c2df542f336016e7be463537d65ac880e33002b57822003845e5bb542d301ded","observation_id":"9f87f7c8-8364-4cd9-95ca-813892029197","resolution":{"observed_at":"2026-05-16T01:06:07.874350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":2,"source":"pdf_text","source_observed_at":"2026-05-10T12:33:38.867604Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2409.12186"},"observation_digest":"sha256:2588892f880e5260b23516c27c016051f04bb96dd9ce7d5f800307ff5ce6cd25","observation_id":"b7dabe4d-4ea5-4ee4-9ca4-3ef1844f339f","resolution":{"observed_at":"2026-05-10T12:33:38.983452Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-10T21:23:50.752228Z","title":"Santacoder: don’t reach for the stars!","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-10T21:17:43.616771Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.752228Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4cdcb033a0b61f1a7e852979bc612866d50168f2d5445048498ceae8cfce87b9","observation_id":"66718e34-6cf9-414a-99e0-d1587502ac22","resolution":{"observed_at":"2026-08-10T21:23:50.752228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-10T20:54:01.967459Z","title":"Santacoder: don't reach for the stars! arXiv preprint arXiv:2301.03988, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.07124","last_updated":"2025-01-17T09:39:17Z","snapshot_observed_at":"2026-08-10T22:14:07.704280Z","submitted_at":"2025-01-13T08:26:43Z","title":"LLM360 K2: Building a 65B 360-Open-Source Large Language Model from Scratch","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T20:54:01.967459Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2501.07124"},"observation_digest":"sha256:2b24d2ac6117b7d35042abc9d84a99af1e95160db51637a8ac07581fced9611c","observation_id":"b16dbe74-6fee-486c-8ee9-a708f81ba64e","resolution":{"observed_at":"2026-08-10T20:54:01.967459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-10T04:30:42.653430Z","title":"Santacoder: don’t reach for the stars!","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18005","last_updated":"2025-02-11T13:58:39Z","snapshot_observed_at":"2026-08-10T09:37:11.450039Z","submitted_at":"2025-01-29T21:40:32Z","title":"Fault Localization via Fine-tuning Large Language Models with Mutation Generated Stack Traces","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T04:30:42.653430Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2501.18005"},"observation_digest":"sha256:1eca86ea07b1d28c63493aaa58233da829676bfdb8b6bd56f9aa796ec6b9159d","observation_id":"95c6dc97-6b53-4641-abaa-3a12c1082a5a","resolution":{"observed_at":"2026-08-10T04:30:42.653430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-09T11:01:27.555183Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-08-10T20:20:35.770726Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T11:01:27.555183Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2502.02827"},"observation_digest":"sha256:0a012773e98c8c3385cdc364a183213daafdfb481c6a077be6f2efb020fe7196","observation_id":"62b8ba0d-a905-45b9-a522-05812ecd27b5","resolution":{"observed_at":"2026-08-09T11:01:27.555183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-08T16:26:32.017246Z","title":"B., Li, R., Kocetkov, D., Mou, C., Akiki, C., Ferrandis, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06215","last_updated":"2025-02-10T07:33:49Z","snapshot_observed_at":"2026-08-09T11:45:30.991223Z","submitted_at":"2025-02-10T07:33:49Z","title":"LessLeak-Bench: A First Investigation of Data Leakage in LLMs Across 83 Software Engineering Benchmarks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T16:26:32.017246Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2502.06215"},"observation_digest":"sha256:3af7bc76d82115469e8bdea6f49380d23f4d8d6f8c6dcc9bacfce9ea2b51d5b7","observation_id":"9fda514b-0681-4f18-9312-f4680fb1afe6","resolution":{"observed_at":"2026-08-08T16:26:32.017246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-07T12:50:23.535332Z","title":"Santacoder: don’t reach for the stars!arXiv preprint arXiv:2301.03988, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23387","last_updated":"2025-06-03T09:55:22Z","snapshot_observed_at":"2026-08-07T12:44:29.008842Z","submitted_at":"2025-05-29T12:14:29Z","title":"Afterburner: Reinforcement Learning Facilitates Self-Improving Code Efficiency Optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:23.535332Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2505.23387"},"observation_digest":"sha256:5203097cff31681d47bbd1e192f2d8aea95b2b79b3273e451f3357eeef5194c1","observation_id":"468da172-88cd-4971-b37d-8c5a53c6bfc9","resolution":{"observed_at":"2026-08-07T12:50:23.535332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-07T12:14:20.187889Z","title":"S anta C oder: don’t reach for the stars! 0 (arXiv:2301.03988), February 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00204","last_updated":"2025-05-30T20:19:39Z","snapshot_observed_at":"2026-08-10T18:52:15.545472Z","submitted_at":"2025-05-30T20:19:39Z","title":"Structure-Aware Fill-in-the-Middle Pretraining for Code","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:20.187889Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2506.00204"},"observation_digest":"sha256:542e5037b9f913dc98d8feef65a9746cf4c071952a33456384d1f864ddf48176","observation_id":"5f7993ef-a013-4b10-9a9b-3394a11681be","resolution":{"observed_at":"2026-08-07T12:14:20.187889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-07T11:04:56.682931Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03524","last_updated":"2025-06-05T03:26:05Z","snapshot_observed_at":"2026-08-09T04:58:38.414289Z","submitted_at":"2025-06-04T03:17:19Z","title":"Seed-Coder: Let the Code Model Curate Data for Itself","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T11:04:56.682931Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2506.03524"},"observation_digest":"sha256:c92fb6c5f132f64dc334195910386008f1471429d64dced25ac60ec62d266b0c","observation_id":"c09a9df5-1bca-49fd-a174-9b2c0aede457","resolution":{"observed_at":"2026-08-07T11:04:56.682931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-07T12:08:02.598605Z","title":"bug” or “incorrect","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11066","last_updated":"2026-06-04T20:26:47Z","snapshot_observed_at":"2026-08-07T12:00:50.868124Z","submitted_at":"2025-05-31T13:00:17Z","title":"CoQuIR: A Comprehensive Benchmark for Code Quality-Aware Information Retrieval","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:02.598605Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2506.11066"},"observation_digest":"sha256:455ea9609036206b061f4cb05c9aa82f2655761e3a35c0b27a6b5be111f1ac43","observation_id":"000005d9-b9f1-4c9d-a641-4c73d9d69833","resolution":{"observed_at":"2026-08-07T12:08:02.598605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-07T04:10:21.014893Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11612","last_updated":"2025-06-13T09:33:58Z","snapshot_observed_at":"2026-08-07T04:02:01.830610Z","submitted_at":"2025-06-13T09:33:58Z","title":"KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:10:21.014893Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2506.11612"},"observation_digest":"sha256:a7a7ee65f9fcb2e3778821cd04d3574e4a581a03c996fefc0296e555e01aecef","observation_id":"34fd5c6e-59a3-4aab-a6b4-3a2c3dfac4b4","resolution":{"observed_at":"2026-08-07T04:10:21.014893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-06T21:23:29.843034Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00413","last_updated":"2025-07-01T03:58:43Z","snapshot_observed_at":"2026-08-09T18:06:45.792267Z","submitted_at":"2025-07-01T03:58:43Z","title":"Recommending Variable Names for Extract Local Variable Refactorings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:23:29.843034Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2507.00413"},"observation_digest":"sha256:ffb7765f3b09a2288fa46f3519f59e9cc1c502f76ec780b976d454da4be28ddf","observation_id":"e21256d2-1594-4e44-8157-9334a4db36e2","resolution":{"observed_at":"2026-08-06T21:23:29.843034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-06T19:18:56.808693Z","title":"B., Li, R., Kocetkov, D., Mou, C., Akiki, C., Ferrandis, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.05962","last_updated":"2025-07-08T13:10:32Z","snapshot_observed_at":"2026-08-10T18:36:45.534773Z","submitted_at":"2025-07-08T13:10:32Z","title":"Evaluation of Large Language Model-Driven AutoML in Data and Model Management from Human-Centered Perspective","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:18:56.808693Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2507.05962"},"observation_digest":"sha256:f9a39db4320464e0ab4549b68737db5c18797440c5c14430b7ca7aca9a38feec","observation_id":"3aca6de2-7c48-4345-a3d1-69fdaf9e91e4","resolution":{"observed_at":"2026-08-06T19:18:56.808693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-06T18:18:50.985583Z","title":"SantaCoder: Don’t reach for the stars! arXiv preprint arXiv:2301.03988, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08719","last_updated":"2025-07-11T16:19:53Z","snapshot_observed_at":"2026-08-07T04:09:15.037517Z","submitted_at":"2025-07-11T16:19:53Z","title":"Multilingual Multimodal Software Developer for Code Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:18:50.985583Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2507.08719"},"observation_digest":"sha256:233bb086f6ece0b04c72dd09138f928a101d2e581d3a489d0b1835475d69a25a","observation_id":"23c4fbb8-037c-4562-9408-087492b15554","resolution":{"observed_at":"2026-08-06T18:18:50.985583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-06T14:51:53.749336Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.17389","last_updated":"2025-07-23T10:34:22Z","snapshot_observed_at":"2026-08-07T11:21:36.520513Z","submitted_at":"2025-07-23T10:34:22Z","title":"Investigating Training Data Detection in AI Coders","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T14:51:53.749336Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2507.17389"},"observation_digest":"sha256:14351908b82b1135c0c7cefce180c4f3cbfa0da4e51ec3c84b17df332d1496d1","observation_id":"46061606-9455-48cf-a707-f6350f14070f","resolution":{"observed_at":"2026-08-06T14:51:53.749336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-06T11:44:33.902101Z","title":"SantaCoder: Don’t reach for the stars! arXiv preprint arXiv:2301.03988, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22462","last_updated":"2025-08-01T10:07:37Z","snapshot_observed_at":"2026-08-09T15:17:03.370644Z","submitted_at":"2025-07-30T08:08:48Z","title":"IFEvalCode: Controlled Code Generation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:44:33.902101Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2507.22462"},"observation_digest":"sha256:e02674598b8cc720db4055842d085576e06f800f31102a2b7fa7486bd914f253","observation_id":"ce5187cf-1362-44df-bf8a-a3d6ac86e8d4","resolution":{"observed_at":"2026-08-06T11:44:33.902101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T04:48:34.067979Z","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-08T22:47:36.414213Z","submitted_at":"2025-09-07T09:01:48Z","title":"GRACE: Graph-Guided Repository-Aware Code Completion through Hierarchical Code Fusion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T04:48:34.067979Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2509.05980"},"observation_digest":"sha256:f51e4b7201932645d88007b629be0a0b355b48632f0a49012779e74b9a21d2b0","observation_id":"126969d0-9e58-4003-b033-b08828339bc6","resolution":{"observed_at":"2026-08-05T04:48:34.067979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2510.04905","last_updated":"2026-05-20T17:52:18Z","snapshot_observed_at":"2026-08-08T22:13:05.854702Z","submitted_at":"2025-10-06T15:20:03Z","title":"Retrieval-Augmented Code Generation: A Survey with Focus on Repository-Level Approaches","version":3},"reference_index":169,"source":"pdf_text","source_observed_at":"2026-05-21T21:19:44.176374Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2510.04905"},"observation_digest":"sha256:e0d4a98f8a02f5a15b16a208c8f1d76707e943754b6b7a2990d8ae7075941409","observation_id":"2c2e1a24-a34f-491a-aaf4-d299cd86760e","resolution":{"observed_at":"2026-05-21T21:20:38.709887Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":36,"source":"pdf_text","source_observed_at":"2026-05-18T08:28:59.161675Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2510.08804"},"observation_digest":"sha256:e9fa0c202734e7f83e209439af256a58bdab2d1d1febcab7c0656576a3a69d01","observation_id":"95a86623-fbcd-4c55-aeb7-d534780a6f8c","resolution":{"observed_at":"2026-05-18T08:31:06.920134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":3,"source":"pdf_text","source_observed_at":"2026-05-16T05:51:24.984358Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2602.08072"},"observation_digest":"sha256:b4a762da4b9e01955740c9b039e0edc06e92df98479e0b7de64aedb64799c798","observation_id":"5494f7c0-7609-4b5e-b56c-21d8c51b5a31","resolution":{"observed_at":"2026-05-16T05:52:24.235794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","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":3,"source":"pdf_text","source_observed_at":"2026-05-10T18:13:24.750244Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2604.07769"},"observation_digest":"sha256:371fe47c417ea51807e7dfc1f7e5d46bbbaf4cce9a08cd847e98d6d016e26ad3","observation_id":"c6031862-45e3-47f1-9aa7-0d597d6b696f","resolution":{"observed_at":"2026-05-11T05:16:04.709250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2604.10611","last_updated":"2026-04-20T06:32:47Z","snapshot_observed_at":"2026-08-10T21:34:28.627965Z","submitted_at":"2026-04-12T12:32:38Z","title":"DuCodeMark: Dual-Purpose Code Dataset Watermarking via Style-Aware Watermark-Poison Design","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T15:51:05.379075Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2604.10611"},"observation_digest":"sha256:20c1a5e744e3d72c6ca33ceab209bfb7cdd151f3abb3e542dd10c3aec8e88b47","observation_id":"d749c298-99e3-4f1a-a180-6402532d24c1","resolution":{"observed_at":"2026-05-11T09:46:03.249308Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-07-12T22:29:24.878655Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.10615","last_updated":"2026-06-10T13:39:24Z","snapshot_observed_at":"2026-08-10T22:44:11.294431Z","submitted_at":"2026-04-12T12:42:30Z","title":"Unified Communication Compression Beyond Global Error Bounds for Distributed Nonconvex Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T22:29:24.878655Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2604.10615"},"observation_digest":"sha256:ed804bbc5098acd9de3ce1a3acce0e7e64c051b2e00598682fd034ba3547aa41","observation_id":"a9ff0944-e5ac-4212-9a51-df800c8ba4de","resolution":{"observed_at":"2026-07-12T22:29:24.878655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2604.23106","last_updated":"2026-04-25T02:01:54Z","snapshot_observed_at":"2026-08-11T00:15:53.606002Z","submitted_at":"2026-04-25T02:01:54Z","title":"No Test Cases, No Problem: Distillation-Driven Code Generation for Scientific Workflows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T08:12:07.708441Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2604.23106"},"observation_digest":"sha256:96984f18990a78c3d7dfe5223279eb1cb90604002f0713d57a432be0ca9a0363","observation_id":"3b5330a9-a91c-46b1-b882-a308c1de56ce","resolution":{"observed_at":"2026-05-11T20:46:10.098139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2605.25198","last_updated":"2026-05-24T17:59:06Z","snapshot_observed_at":"2026-07-06T23:35:11.987278Z","submitted_at":"2026-05-24T17:59:06Z","title":"Hide to Guide: Learning via Semantic Masking","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-30T12:16:12.108715Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2605.25198"},"observation_digest":"sha256:b428d48035ceefc214632f0373490f5c6461c6a68e4e0a7d0112f391d60a69cb","observation_id":"dc07683f-1969-41c6-8de1-939e7152b10f","resolution":{"observed_at":"2026-06-30T12:24:40.005909Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2606.04023","last_updated":"2026-06-01T12:55:10Z","snapshot_observed_at":"2026-08-05T23:37:36.587849Z","submitted_at":"2026-06-01T12:55:10Z","title":"CodegenBench: Can LLMs Write Efficient Code Across Architectures?","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T13:38:48.308683Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2606.04023"},"observation_digest":"sha256:632dd2cdcbc35ffc5fdfc1a5f27bc3c4fd6c899f1b485f71059a076839a56af3","observation_id":"e17ae8f2-244c-4480-b016-b327415dd325","resolution":{"observed_at":"2026-07-02T00:06:23.756791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2606.04273","last_updated":"2026-08-07T18:52:22Z","snapshot_observed_at":"2026-08-11T00:15:02.966547Z","submitted_at":"2026-06-02T22:58:19Z","title":"Human agency in initial human-AI proof formalization workflows","version":1},"reference_index":208,"source":"arxiv_source","source_observed_at":"2026-06-28T09:29:50.282874Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2606.04273"},"observation_digest":"sha256:58b1ff011f91df752ec801a310070e7414d681e7fd1616245d2991d875cba105","observation_id":"4d48958b-3ab8-41f7-9e38-49d903a31382","resolution":{"observed_at":"2026-07-02T04:06:34.902877Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2606.08840","last_updated":"2026-06-07T21:10:30Z","snapshot_observed_at":"2026-07-06T23:48:16.585598Z","submitted_at":"2026-06-07T21:10:30Z","title":"Beyond Pass Rate: A Multilingual, Execution-Grounded Evaluation of Open Code LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T18:19:26.108492Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2606.08840"},"observation_digest":"sha256:fcc5fa279faf8c6e4f29821aca733005b848b8176485634b33ee02127831b4a2","observation_id":"b83ca312-f796-41c0-84b7-299d8a6947a8","resolution":{"observed_at":"2026-07-02T23:17:29.733182Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2606.09145","last_updated":"2026-06-08T07:42:44Z","snapshot_observed_at":"2026-07-06T23:48:30.569726Z","submitted_at":"2026-06-08T07:42:44Z","title":"PrivCode++: Latent-Conditioned Differentially Private Code Generation for Comprehensive Guarantees","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-27T16:28:06.351376Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2606.09145"},"observation_digest":"sha256:6977344911272b68623563eb29c43a9e7eab6e1b720b039ffb42dd3009bfc192","observation_id":"f513c5a1-2c9f-4840-a457-a9b61f2fd708","resolution":{"observed_at":"2026-07-03T01:27:31.683696Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2606.28438","last_updated":"2026-06-26T07:35:43Z","snapshot_observed_at":"2026-08-03T00:04:55.169727Z","submitted_at":"2026-06-26T07:35:43Z","title":"When AI Reviews Its Own Code: Recursive Self-Training Collapse in Code LLMs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-30T01:29:42.919461Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2606.28438"},"observation_digest":"sha256:6852dc351e4cdc29981e6961a7f0a2f221f774072977134aeb9cf601d9a135a1","observation_id":"c5ea20da-ce94-495b-8045-faaf8fc944b2","resolution":{"observed_at":"2026-07-01T15:25:48.297668Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2607.07619","last_updated":"2026-07-08T16:36:03Z","snapshot_observed_at":"2026-08-07T18:03:39.958190Z","submitted_at":"2026-07-08T16:36:03Z","title":"Rethinking Code Performance Benchmarks for LLMs","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-09T05:16:58.549058Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2607.07619"},"observation_digest":"sha256:e61ac3a274f12183e27fff2cc6df8d729bf5cf1e5bfb75f8d305ca0de6dcada2","observation_id":"70853840-a8d6-487a-ab3d-982586435e2d","resolution":{"observed_at":"2026-07-09T05:26:01.048861Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":"2301.03988","doi":"10.48550/arxiv.2301.03988","metadata_source":"pith","pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Santacoder: don’t reach for the stars!","venue":"cs.SE","work_id":"bf393c50-a11b-4a0f-8513-52428ede71f7","year":2023},"citing_paper":{"arxiv_id":"2607.08339","last_updated":"2026-07-09T10:29:15Z","snapshot_observed_at":"2026-08-09T19:39:50.396849Z","submitted_at":"2026-07-09T10:29:15Z","title":"TypeProbe: Recovering Type Representations from Hidden States of Pre-trained Code Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T09:07:51.470661Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2607.08339"},"observation_digest":"sha256:34ea1ee610c43f10287681ea26faff7c79340d4801cae3f72489df7711f33c31","observation_id":"78bab9d3-cffd-480e-9574-66bdcc60c0be","resolution":{"observed_at":"2026-07-10T09:16:59.506242Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:35.396233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2301.03988/citation-record","integrity":"/paper/2301.03988/integrity","json":"/paper/2301.03988/citation-record.json","paper":"/paper/2301.03988"},"outbound":[],"paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-06T09:28:54.008213Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 43 inbound Pith citation observations for arXiv:2301.03988."}