{"as_of":"2026-08-20T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a68a9aa2a5b148ff8401ca749b5d916dead1e6faf9014543bba60b6d12ad821","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:29:51.874378Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:36:26.513190Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T17:21:11.100740Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.12687","snapshot_observed_at":"2026-08-06T20:36:26.513190Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02378","last_updated":"2025-07-03T07:19:56Z","snapshot_observed_at":"2026-08-10T11:58:38.490692Z","submitted_at":"2025-07-03T07:19:56Z","title":"Efficient Code LLM Training via Distribution-Consistent and Diversity-Aware Data Selection","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T20:36:26.513190Z"},"links":{"cited_paper":"/paper/2504.12687","citing_paper":"/paper/2507.02378"},"observation_digest":"sha256:850f2762d2ffd728cc4cc7b9782f9936bcdc978dd98bb460137bca951626e03d","observation_id":"edcf25bf-0b2b-4cbd-88ff-bf72955a8efc","resolution":{"observed_at":"2026-08-06T20:36:26.513190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"cited_work":{"arxiv_id":"2504.12687","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.12687","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7546ae70-62c3-4f47-a873-1edfddc9e5ce","year":2025},"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":82,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2504.12687","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:3609622e28e566be6e3d5b32802d7c954eb18adfa473e294087e729af02bc562","observation_id":"75585882-f0ac-4137-a161-9f10178aa14c","resolution":{"observed_at":"2026-05-11T17:21:11.105630Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.12687/citation-record","integrity":"/paper/2504.12687/integrity","json":"/paper/2504.12687/citation-record.json","paper":"/paper/2504.12687"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-08-18T03:59:39.242039Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-16T12:29:51.721363Z","title":"Code llama: Open foundation models for code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.721363Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:27c22d735865cfec1373771eaa9ae7fea37bc6e7a1e55a91da7e474afc5ab9a3","observation_id":"ac34a435-cef3-49c4-a178-279b65f97fd2","resolution":{"observed_at":"2026-08-16T12:29:51.721363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-16T12:29:51.725858Z","title":"Deepseek-coder: When the large language model meets programming–the rise of code intelligence,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.725858Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:6d05d976dd4995e3f9fcc2d21326f2662c9cf759d8979b039f2ee441e1d01315","observation_id":"57a98bca-771e-4fa4-855f-b18bffe2fbef","resolution":{"observed_at":"2026-08-16T12:29:51.725858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19173","snapshot_observed_at":"2026-08-16T12:29:51.730390Z","title":"Starcoder 2 and the stack v2: The next generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.730390Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:23f7c10ddba4152c98b984bb3fe0c282c4c0949f5b74d15bdac84756aca3393f","observation_id":"228ce2ef-be42-4520-ac80-14e290564557","resolution":{"observed_at":"2026-08-16T12:29:51.730390Z","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-16T12:29:51.735124Z","title":"Starcoder: may the source be with you!","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.735124Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:38ef9fcc75a2364205294f041ba70a50a5b92ea4c338840bcf28b3a7995289b3","observation_id":"39018f29-0944-4faf-bfc4-2742e480789d","resolution":{"observed_at":"2026-08-16T12:29:51.735124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17193","last_updated":"2024-02-27T04:18:49Z","snapshot_observed_at":"2026-08-19T09:41:28.740635Z","submitted_at":"2024-02-27T04:18:49Z","title":"When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17193","snapshot_observed_at":"2026-08-16T12:29:51.740384Z","title":"When scaling meets llm finetuning: The effect of data, model and finetuning method,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.740384Z"},"links":{"cited_paper":"/paper/2402.17193","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:73af561e136e662a58a1d4d6daeb0f21fac20330e51b92c59422dc9fb26e602c","observation_id":"6e412c66-7b3e-4a1e-997e-9afde0c0013f","resolution":{"observed_at":"2026-08-16T12:29:51.740384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.745903Z","title":"Code alpaca: An instruction-following llama model for code generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.745903Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:337afbc64ece2af164323c88f580516fdbef2d8702947058fffd17e9bb61afda","observation_id":"2a3c9bba-adb1-46dc-9e2d-eed0b0f3a0fe","resolution":{"observed_at":"2026-08-16T12:29:51.745903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.750623Z","title":"Wizardcoder: Empowering code large language models with evol-instruct,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.750623Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:a99843cbaa89d639ec06704ed3044b5386414a9544b75b76f190371c15537146","observation_id":"12abfb2d-6b4b-41bf-b320-26b93e289c16","resolution":{"observed_at":"2026-08-16T12:29:51.750623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02120","last_updated":"2024-06-07T02:50:56Z","snapshot_observed_at":"2026-08-16T22:22:41.448725Z","submitted_at":"2023-12-04T18:50:35Z","title":"Magicoder: Empowering Code Generation with OSS-Instruct","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02120","snapshot_observed_at":"2026-08-16T12:29:51.754825Z","title":"Magicoder: Source code is all you need,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.754825Z"},"links":{"cited_paper":"/paper/2312.02120","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:0a6cd29b31f5b3125b7b6c8127dc223a7feca6c8decaec18b1ff96feb28b5020","observation_id":"8cab103d-debb-44e5-b2fa-83f141f358ed","resolution":{"observed_at":"2026-08-16T12:29:51.754825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14187","last_updated":"2024-06-07T07:46:28Z","snapshot_observed_at":"2026-08-18T02:09:35.614140Z","submitted_at":"2023-12-20T09:02:29Z","title":"WaveCoder: Widespread And Versatile Enhancement For Code Large Language Models By Instruction Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14187","snapshot_observed_at":"2026-08-16T12:29:51.759695Z","title":"Wavecoder: Widespread and versatile enhanced instruction tuning with refined data generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.759695Z"},"links":{"cited_paper":"/paper/2312.14187","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:89c8d2ab8dc928e2bcf44b1c5e5375871c51ee9d0cb32397affbb81688e9f426","observation_id":"46f18e85-0daf-4bca-878e-b53498adfed9","resolution":{"observed_at":"2026-08-16T12:29:51.759695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19265","last_updated":"2024-05-29T16:57:33Z","snapshot_observed_at":"2026-08-19T06:44:38.045097Z","submitted_at":"2024-05-29T16:57:33Z","title":"AlchemistCoder: Harmonizing and Eliciting Code Capability by Hindsight Tuning on Multi-source Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19265","snapshot_observed_at":"2026-08-16T12:29:51.764853Z","title":"Alchemistcoder: Harmonizing and eliciting code capability by hindsight tuning on multi-source data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.764853Z"},"links":{"cited_paper":"/paper/2405.19265","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:4197b14b5ed728c596205ce51cae6c591c923175025c4ef1b0df6499c9a3421b","observation_id":"e525a6b7-9fa9-4452-be9a-287394605bff","resolution":{"observed_at":"2026-08-16T12:29:51.764853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14906","last_updated":"2024-05-23T02:53:25Z","snapshot_observed_at":"2026-08-16T13:50:24.879902Z","submitted_at":"2024-05-23T02:53:25Z","title":"AutoCoder: Enhancing Code Large Language Model with \\textsc{AIEV-Instruct}","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14906","snapshot_observed_at":"2026-08-16T12:29:51.769581Z","title":"Autocoder: Enhancing code large language model with\\textsc{AIEV-Instruct},","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.769581Z"},"links":{"cited_paper":"/paper/2405.14906","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:00c9f2b201bd5f8d97ab821e58e62eec0cee1ef1a943d0c81ea4249693d50dbb","observation_id":"79963254-cf96-4307-885a-60d865c4898a","resolution":{"observed_at":"2026-08-16T12:29:51.769581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-16T12:29:51.774463Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.774463Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:f6bf7191d3041ee9017a4ef39d32738eb6e4d07cba9d118043fd87ecea713cbc","observation_id":"dbb5c7b4-4d46-4234-8fc0-4003b6af5886","resolution":{"observed_at":"2026-08-16T12:29:51.774463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.778501Z","title":"Training language models to follow instructions with human feedback,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.778501Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:f9b86191d5a103dba29581e9bb9c84c409980a4d1092fe0cc8077cf7edf5a94b","observation_id":"5ca619a6-0435-4600-aed2-70fbd98a3c6c","resolution":{"observed_at":"2026-08-16T12:29:51.778501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04333","last_updated":"2024-06-13T03:42:02Z","snapshot_observed_at":"2026-08-16T14:20:52.583862Z","submitted_at":"2024-02-06T19:18:04Z","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04333","snapshot_observed_at":"2026-08-16T12:29:51.783032Z","title":"Less: Selecting influential data for targeted instruction tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.783032Z"},"links":{"cited_paper":"/paper/2402.04333","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:a570f372144c484959849c5000a9f4dea8eeaeef81b2a11d2317808e5ae28eac","observation_id":"1c5560d7-8c6b-472b-ad48-2e96db58f920","resolution":{"observed_at":"2026-08-16T12:29:51.783032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.787971Z","title":"Lima: Less is more for alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.787971Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:eb4c9d94f06f787bd1ebcc72734178ee42335263e9e106c1b37651135fe9c42b","observation_id":"d4f9b54d-00f3-467a-b473-222cf60939ce","resolution":{"observed_at":"2026-08-16T12:29:51.787971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:52.397878Z","title":"From quantity to quality: Boosting llm performance with self-guided data selection for instruction tuning,","venue":null,"work_id":"c0f80db9-833a-4f42-b294-667f4b584973","year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.791895Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:4c43904b2dc3a3690ff67a90a2205a45d5a0c22b9c809c4cabee141db08a84a2","observation_id":"470221a9-aa01-4d4a-a272-923a6f32cb79","resolution":{"observed_at":"2026-08-16T12:29:52.418218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11409","last_updated":"2024-06-19T02:37:50Z","snapshot_observed_at":"2026-08-16T21:13:11.293578Z","submitted_at":"2024-06-17T10:54:35Z","title":"CodeGemma: Open Code Models Based on Gemma","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11409","snapshot_observed_at":"2026-08-16T12:29:51.795637Z","title":"Codegemma: Open code models based on gemma,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.795637Z"},"links":{"cited_paper":"/paper/2406.11409","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:0f7eba7b42b0e5c61985abb50f0335ca7dd0a1acf0e40a06a3ca2076767ba574","observation_id":"29f94bb1-59f3-420c-8417-a34ce4fc310e","resolution":{"observed_at":"2026-08-16T12:29:51.795637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-16T12:29:51.800186Z","title":"Llama 2: Open foundation and fine-tuned chat models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.800186Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:7d9284fe08ae9211d17180cd511b75650c50cda99cf7e1c6f964e6d01f854371","observation_id":"12dc5e46-3cd0-4c9a-b84f-dbabfad62a36","resolution":{"observed_at":"2026-08-16T12:29:51.800186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10560","last_updated":"2023-05-25T23:50:07Z","snapshot_observed_at":"2026-08-19T16:38:51.329886Z","submitted_at":"2022-12-20T18:59:19Z","title":"Self-Instruct: Aligning Language Models with Self-Generated Instructions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10560","snapshot_observed_at":"2026-08-16T12:29:51.804821Z","title":"Self-instruct: Aligning language models with self- generated instructions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.804821Z"},"links":{"cited_paper":"/paper/2212.10560","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:f45a6b557761933de79981c3a0b6b9f0eedc00831b7944fe5237b99f5f88d60a","observation_id":"d76c548a-5170-45b6-9c82-496cda1e2ab1","resolution":{"observed_at":"2026-08-16T12:29:51.804821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:52.331288Z","title":"Alpagasus: Training a better alpaca with fewer data,","venue":null,"work_id":"82e5da02-4187-429f-a787-b4bd08aa301f","year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.809702Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:6d82d1ca08474f90bdd25d8c0670e2a07dc30390c6c2c6d8878b22796583d25d","observation_id":"03acc8e3-97b6-4696-99a4-2af61d640951","resolution":{"observed_at":"2026-08-16T12:29:52.351692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:52.299465Z","title":"#instag: Instruction tagging for analyzing supervised fine-tuning of large language models,","venue":null,"work_id":"6f12a312-fe1e-463f-95de-88e6a431a258","year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.813999Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:37002149bc2d369575c3a8de2d764beeac868e4ae67b16f85eb4ee2df3b9270e","observation_id":"d545b54e-01f4-46e4-ba7d-9aae30e2f139","resolution":{"observed_at":"2026-08-16T12:29:52.304022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11508","last_updated":"2023-12-27T08:23:14Z","snapshot_observed_at":"2026-08-16T22:21:23.594077Z","submitted_at":"2023-12-12T03:30:21Z","title":"Rethinking the Instruction Quality: LIFT is What You Need","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11508","snapshot_observed_at":"2026-08-16T12:29:51.818434Z","title":"Rethinking the instruction quality: Lift is what you need,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.818434Z"},"links":{"cited_paper":"/paper/2312.11508","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:c6f76350d8bc9681afbf1cb9fa64b0624b4369ad480d01f6546a8cd87a3277ee","observation_id":"91ddc9d3-5472-4969-bcbf-490a5ec08dfe","resolution":{"observed_at":"2026-08-16T12:29:51.818434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14736","last_updated":"2024-11-11T13:58:11Z","snapshot_observed_at":"2026-08-16T14:41:23.945472Z","submitted_at":"2023-11-21T19:12:18Z","title":"Data Diversity Matters for Robust Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14736","snapshot_observed_at":"2026-08-16T12:29:51.823269Z","title":"Data diversity matters for robust instruction tuning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.823269Z"},"links":{"cited_paper":"/paper/2311.14736","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:84eb6bbc63b8d067a514da0e5f58b7f219ad3908090c3376eb6c9d8f71d98fae","observation_id":"c42fbd86-99ef-4c76-8380-0e710a58d3eb","resolution":{"observed_at":"2026-08-16T12:29:51.823269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.11435","last_updated":"2024-03-18T03:10:36Z","snapshot_observed_at":"2026-08-16T22:22:31.221569Z","submitted_at":"2024-03-18T03:10:36Z","title":"InsCL: A Data-efficient Continual Learning Paradigm for Fine-tuning Large Language Models with Instructions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.11435","snapshot_observed_at":"2026-08-16T12:29:51.828001Z","title":"Inscl: A data-efficient continual learning paradigm for fine-tuning large language models with instructions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.828001Z"},"links":{"cited_paper":"/paper/2403.11435","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:6ecc5e16831129772630137da996a3d77da577dde467dd4287e0e76f6fdf37d4","observation_id":"fe55dabc-eab5-4b78-a01b-e186363876ef","resolution":{"observed_at":"2026-08-16T12:29:51.828001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:52.285525Z","title":"Dataset quantization,","venue":null,"work_id":"db902697-1abc-48b9-84e1-b075a062e0e4","year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.832296Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:c4b80a367e3007cc9d675fdd2e2a6a815539e66d188c3f28017a03642fd8172d","observation_id":"d4293e59-c409-4f8d-a043-3786c9b60147","resolution":{"observed_at":"2026-08-16T12:29:52.289850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17355","last_updated":"2024-02-27T09:47:36Z","snapshot_observed_at":"2026-08-16T22:20:52.977635Z","submitted_at":"2024-02-27T09:47:36Z","title":"RECOST: External Knowledge Guided Data-efficient Instruction Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17355","snapshot_observed_at":"2026-08-16T12:29:51.836036Z","title":"Recost: External knowledge guided data-efficient instruction tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.836036Z"},"links":{"cited_paper":"/paper/2402.17355","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:7b0db92c3036e5c9724326002a7c3cd21003ba5bbdeea7e31ce0dedc6d6819a7","observation_id":"b3aab220-6a4d-4f78-b696-742547f7671b","resolution":{"observed_at":"2026-08-16T12:29:51.836036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00705","last_updated":"2024-10-30T06:33:02Z","snapshot_observed_at":"2026-08-16T22:22:24.948965Z","submitted_at":"2024-04-23T04:56:48Z","title":"SHED: Shapley-Based Automated Dataset Refinement for Instruction Fine-Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00705","snapshot_observed_at":"2026-08-16T12:29:51.840118Z","title":"Shed: Shapley-based automated dataset refinement for instruction fine- tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.840118Z"},"links":{"cited_paper":"/paper/2405.00705","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:66e44a80910cf68edc81d6dc78a5af3f0ac5bb6de250c0ce9d669266d8456431","observation_id":"8b18540f-092d-4e81-87f4-e2e39a77f0f1","resolution":{"observed_at":"2026-08-16T12:29:51.840118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:52.269285Z","title":"Submodular com- binatorial information measures with applications in machine learning,","venue":null,"work_id":"2a6ec94e-13fd-4565-ba86-9230aabfc9c9","year":2021},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.844138Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:4b8d9fbde1f66a47068f5ee69f59d2153613a972cf06068ecade83ee3d8e792a","observation_id":"39d91732-39b1-4c99-a979-b90463d5fe69","resolution":{"observed_at":"2026-08-16T12:29:52.275444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-16T12:29:51.848251Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.848251Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:0b3468c9ef94635083873d81839d03212fd8b8fdb9a335a3940132a9c6264217","observation_id":"9aab8954-be36-46e6-8744-8a04bfe062a6","resolution":{"observed_at":"2026-08-16T12:29:51.848251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.852705Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.852705Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:dc5f036fb4ace52679c44c3e0c2b64c8edd295b0b66f17f7d8be21bae7695f2e","observation_id":"4d04f58b-d45c-45bb-b486-bf46521dbbaa","resolution":{"observed_at":"2026-08-16T12:29:51.852705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-16T12:29:51.856991Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.856991Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:8d669cc6c3e044e3ffece6688e176f3ca8be0552ac3df0ba8a25c4de40c4e831","observation_id":"367e2c8a-0c02-4a9b-a678-aaccd4b2ff50","resolution":{"observed_at":"2026-08-16T12:29:51.856991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.860961Z","title":"Is your code generated by chatGPT really correct? rigorous evaluation of large language models for code generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.860961Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:e6ed7c766611a54740598e89cb5c1623fbeba7b9beb0183dab1f18c19626595f","observation_id":"75ad3c9a-5776-4431-abab-1667d74e88aa","resolution":{"observed_at":"2026-08-16T12:29:51.860961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-16T12:29:51.865520Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.865520Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:bf94b9ccdca0d9368b867c2056873d64a6b3c8f6ce59c37aebfef9394ab5803e","observation_id":"2544c58c-47ac-4cda-9f96-02a501e60f1c","resolution":{"observed_at":"2026-08-16T12:29:51.865520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.869856Z","title":"Teaching large language models to self-debug,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.869856Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:3669c4e06e3ffab7618de66979b8e6197742b250dcd6fe08e627db2e83a50829","observation_id":"d6a5dbb5-0131-4bbf-b7f3-39db63135fa0","resolution":{"observed_at":"2026-08-16T12:29:51.869856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:29:51.874378Z","title":"Decoupled weight decay regularization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:29:51.874378Z"},"links":{"citing_paper":"/paper/2504.12687"},"observation_digest":"sha256:7c89a96cd5bd8bae799a7a054877a3e697288e75342187f341408d5b520837c2","observation_id":"6819e3c0-827b-42ea-9da9-3fe24297cad6","resolution":{"observed_at":"2026-08-16T12:29:51.874378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.12687","last_updated":"2025-04-17T06:29:28Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T21:14:08.676687Z","submitted_at":"2025-04-17T06:29:28Z","title":"Data-efficient LLM Fine-tuning for Code Generation"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":35},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2504.12687."}