{"as_of":"2026-08-10T00:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bff21bbd04dfe2874dd1d4615d3a9580c4ff29392b62794f41eaad9283c580cb","coverage":[{"denominator":91,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":91,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:12:52.503592Z","state":"measured"},{"denominator":91,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":91,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.21056/citation-record","integrity":"/paper/2511.21056/integrity","json":"/paper/2511.21056/citation-record.json","paper":"/paper/2511.21056"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:12:51.246373Z","title":"A convergence theory for deep learning via over- parameterization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.246373Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:e1b821cd8fdd4a11e7ffea44b3ca4e81709aacdcad4bc863b56fc53b03aa0004","observation_id":"ab403ad6-b9c5-4aac-84c0-c3a8660c7342","resolution":{"observed_at":"2026-08-03T20:12:51.246373Z","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-03T20:12:51.289759Z","title":"Amortized im- plicit differentiation for stochastic bilevel optimiza- tion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.289759Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:2f86513eeb997a8b466cf7d6e56b1634274fd0af3141416c5c088ff2135e91a4","observation_id":"e1fbd1f3-e067-4dde-bbe8-94fde42c6d62","resolution":{"observed_at":"2026-08-03T20:12:51.289759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.21692","last_updated":"2025-05-27T19:28:22Z","snapshot_observed_at":"2026-08-07T13:22:35.598267Z","submitted_at":"2025-05-27T19:28:22Z","title":"What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.21692","snapshot_observed_at":"2026-08-03T20:12:51.341168Z","title":"What data en- ables optimal decisions? an exact characteri- zation for linear optimization.arXiv preprint arXiv:2505.21692, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.341168Z"},"links":{"cited_paper":"/paper/2505.21692","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:de1d3a8297ecabbbc6ffd2feb6c59ac467b322c26316c667464b9e1688fc0ea0","observation_id":"ab1f98d2-f63d-446a-832a-f476dfcdc24d","resolution":{"observed_at":"2026-08-03T20:12:51.341168Z","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-03T20:12:51.402085Z","title":"Pythia: A suite for analyzing large language models across training and scaling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.402085Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:45757a49735656ee5ede5ee28c4c0a2304c3c360d23ad8ccbcd5153bf7625d80","observation_id":"7474ef4b-82da-4094-b24b-17637e419818","resolution":{"observed_at":"2026-08-03T20:12:51.402085Z","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-03T20:12:51.461175Z","title":"Cambridge uni- versity press, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.461175Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:dd8ee8084ecd39b40c2400927ef84f229f99c7831551d20aecc5985e4f55d682","observation_id":"163ffbf2-d36e-4193-98b5-25145af70ccc","resolution":{"observed_at":"2026-08-03T20:12:51.461175Z","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-03T20:12:51.514989Z","title":"Ef- ficient first-order optimization on the pareto set for multi-objective learning under preference guid- ance","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.514989Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:0955624ebdb9b23015486d161e567126ae51bb254e502b0aaaef389fb0b3463f","observation_id":"18e996b5-4944-4d5c-a3b9-2b7a57a66f66","resolution":{"observed_at":"2026-08-03T20:12:51.514989Z","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-03T20:12:51.520878Z","title":"Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.520878Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:636925844386bd0083822b0332b8aceef799aaec24f867b5eeb5a9b8b054fe5a","observation_id":"351dec59-0cc8-4e93-a2c5-9526086b688e","resolution":{"observed_at":"2026-08-03T20:12:51.520878Z","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-03T20:12:51.540733Z","title":"Safety-aware fine-tuning of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.540733Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:79fd99bf2137003beaf9c23e7d8fae3c64339a9782349861837ac11b5a9d7b6f","observation_id":"3216ebf7-ffd7-4d83-acbb-dc3d61320bb1","resolution":{"observed_at":"2026-08-03T20:12:51.540733Z","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-03T20:12:51.639248Z","title":"A framework for bilevel op- timization that enables stochastic and global vari- ance reduction algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.639248Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:051163189d1cb5f202175a584b13a7f8e64bb01a13a9e932ae9d50bb14b2af32","observation_id":"de36fc85-c6d9-483c-8fdc-e7d6c92ebcbe","resolution":{"observed_at":"2026-08-03T20:12:51.639248Z","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-03T20:12:51.731383Z","title":"Solving bilevel multi-objective optimization problems using evolu- tionary algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.731383Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:2375b26dc896fb938efc57d37238f194b722016cba2cc4e6e37d5b2e433bb768","observation_id":"dc563609-9254-429f-aec9-94271f718d1f","resolution":{"observed_at":"2026-08-03T20:12:51.731383Z","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-03T20:12:51.777569Z","title":"Dempe and P","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.777569Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:6f92d9d27a078a65f28ff3e2dcf900f94e46c6ef7b4c58648822e2c087c76010","observation_id":"a5dab678-5645-4aee-857a-3ee994b18cce","resolution":{"observed_at":"2026-08-03T20:12:51.777569Z","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-03T20:12:51.897053Z","title":"Springer, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.897053Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:1ffbc41aeb466348cb2fa29ac5c54c91c369fb2765a77421376bd3873f05c1db","observation_id":"d6c00817-1f34-4c7d-92d0-877129740414","resolution":{"observed_at":"2026-08-03T20:12:51.897053Z","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-03T20:12:51.968465Z","title":"Mitigating forgetting in llm su- pervised fine-tuning and preference learning.arXiv preprint arXiv:2410.15483, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:51.968465Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:d7dd5127fdd47f4758734f20fafe726abf91603ab093c7954c35d2630c6a19dc","observation_id":"f84fe988-16d4-4402-be4d-8bb37c2abc15","resolution":{"observed_at":"2026-08-03T20:12:51.968465Z","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-03T20:12:52.073323Z","title":"Forward and reverse gradient-based hyperparameter optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.073323Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:df6bbc2d0038d2ea9aefb19ee8190ceae02c3d44621db44b641193a41b5853de","observation_id":"76ce55f1-4e95-49b9-9648-2e8209424493","resolution":{"observed_at":"2026-08-03T20:12:52.073323Z","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-03T20:12:52.178458Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.178458Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:2c4550e8a22084cdc9b6b64225a8afb8fe7e8d597b03cfd45083651547fa71e1","observation_id":"d9f218b1-bde7-4ece-939c-c39b49cadd13","resolution":{"observed_at":"2026-08-03T20:12:52.178458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07858","last_updated":"2022-11-22T19:12:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-08-23T23:37:14Z","title":"Red Teaming Language Models to Reduce Harms: Methods, Scaling Behaviors, and Lessons Learned","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.07858","snapshot_observed_at":"2026-08-03T20:12:52.214551Z","title":"Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned.arXiv preprint arXiv:2209.07858, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.214551Z"},"links":{"cited_paper":"/paper/2209.07858","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8cdd8c98e37feb9e45128dd3a4859b0ec7a5cb481f157c7a952c5f2fb7504ce4","observation_id":"d17162b0-d216-459e-94a9-f0b8b1f49fbb","resolution":{"observed_at":"2026-08-03T20:12:52.214551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00805","last_updated":"2018-08-21T00:02:44Z","snapshot_observed_at":"2026-07-06T05:36:24.195368Z","submitted_at":"2017-04-03T20:50:29Z","title":"On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.00805","snapshot_observed_at":"2026-08-03T20:12:52.231148Z","title":"On the properties of the softmax function with application in game theory and reinforcement learning.arXiv preprint arXiv:1704.00805, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.231148Z"},"links":{"cited_paper":"/paper/1704.00805","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:506d5d982c45c64cbf95d00752ab7d06d5acb050da1c4d199c96b1d9e1af4f90","observation_id":"f4509a2b-db27-493f-9081-6cb2077a5473","resolution":{"observed_at":"2026-08-03T20:12:52.231148Z","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-03T20:12:52.313568Z","title":"The language model evaluation harness, 07 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.313568Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ed551c50d41c21240e88721f7234159699ce9e76a7f19d1fbdd869b0e104f847","observation_id":"1bd0803c-9180-416c-bbb6-205fec7b80af","resolution":{"observed_at":"2026-08-03T20:12:52.313568Z","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-03T20:12:52.335863Z","title":"Learning and data selection in big datasets","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.335863Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:b79e5046592bf91724b873c1af7e5b5c9f2679ffb287f54ad7e4f43006ad0541","observation_id":"6e49ede4-ad42-4151-b71b-3cc9c45626e8","resolution":{"observed_at":"2026-08-03T20:12:52.335863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-07-06T06:22:08.261855Z","submitted_at":"2018-02-06T22:10:14Z","title":"Approximation Methods for Bilevel Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.02246","snapshot_observed_at":"2026-08-03T20:12:52.337898Z","title":"Approximation methods for bilevel programming.arXiv preprint arXiv:1802.02246, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.337898Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:28b8a0801063279e2d81a3c743726f2fee968b492a0051730641c42e6a71ca39","observation_id":"052265c8-8825-4c00-94e0-37800b3c3b02","resolution":{"observed_at":"2026-08-03T20:12:52.337898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-03T20:12:52.342653Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.342653Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ff8e0261d4f2cc6a41986ac39ef8dd0889cbf11e3d99792b6981146459777eb9","observation_id":"8e2d2b7c-a764-4fa3-b620-67220d4d797a","resolution":{"observed_at":"2026-08-03T20:12:52.342653Z","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-03T20:12:52.344850Z","title":"On the iteration com- plexity of hypergradient computation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.344850Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:52bc1c5441ba6325577611a476161886fc889e7030a3b61c73bccee42847b46a","observation_id":"528e2287-f758-4241-b95b-d544da564c91","resolution":{"observed_at":"2026-08-03T20:12:52.344850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08998","last_updated":"2023-08-21T10:23:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-08-17T14:12:48Z","title":"Reinforced Self-Training (ReST) for Language Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08998","snapshot_observed_at":"2026-08-03T20:12:52.346982Z","title":"Reinforced self-training (rest) for language modeling.arXiv preprint arXiv:2308.08998, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.346982Z"},"links":{"cited_paper":"/paper/2308.08998","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:b880148726b65b5233d8a951f98c06bd28c7275976476d7739d9c7a101e0bb20","observation_id":"8d7942c8-ebd2-47e6-8635-f1f2cfb3b91f","resolution":{"observed_at":"2026-08-03T20:12:52.346982Z","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-03T20:12:52.349698Z","title":"A two-timescale stochastic algo- rithm framework for bilevel optimization: Com- plexity analysis and application to actor-critic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.349698Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:538027da120423deb00d54b69052d962b34b0b6a1c369d1a6269f44edcd0f4dc","observation_id":"0bef5df0-5185-4d3a-bdf3-a8fd0044c38c","resolution":{"observed_at":"2026-08-03T20:12:52.349698Z","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-03T20:12:52.351881Z","title":"User prefer- ence meets pareto-optimality in multi-objective bayesian optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.351881Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9395087140ecfadd3ebcd564bb9fbe0505a9fa12cbeb7ce328c8b7ba2a539525","observation_id":"6e96d6a9-1e48-4810-8041-b7091217df71","resolution":{"observed_at":"2026-08-03T20:12:52.351881Z","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-03T20:12:52.353862Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.353862Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:748919286a63f8b41f59cc4b33c93659bb04e958a9b017d7b29aac040a7dd329","observation_id":"46ab4710-a689-4bb1-bbd3-3ca176b4bede","resolution":{"observed_at":"2026-08-03T20:12:52.353862Z","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-03T20:12:52.355984Z","title":"Directional conver- gence and alignment in deep learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.355984Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:336aa282fd0e4bcd52eb32a47981e9d81ef5292189cdcb54bc7d543546016730","observation_id":"1f137fbb-69f8-4289-8b7d-c82a6079b679","resolution":{"observed_at":"2026-08-03T20:12:52.355984Z","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-03T20:12:52.358055Z","title":"Get more for less: Principled data selection for warming up fine- tuning in llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.358055Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:d3f5a8063a2eb7ebc244820f4535acb25314ac3540ea4d823e17e58b75de505c","observation_id":"337139c7-ab9c-4b0d-b0f8-71d6626f297e","resolution":{"observed_at":"2026-08-03T20:12:52.358055Z","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-03T20:12:52.360446Z","title":"A near-optimal algorithm for stochastic bilevel op- timization via double-momentum","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.360446Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:6875654986f0a3c51a3f470556b3c14dfbb227cfe6c21e93b4aca90a974d43ce","observation_id":"0a5e236b-dffb-41af-b096-d29546ca20be","resolution":{"observed_at":"2026-08-03T20:12:52.360446Z","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-03T20:12:52.362491Z","title":"Adam: A method for stochas- tic optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.362491Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:076a0b11715ced4acdb7742f5e2bf2bac149d518896bdfe2d1c1f9299abe0189","observation_id":"fd31897d-b889-4b17-9378-a067f811cb3d","resolution":{"observed_at":"2026-08-03T20:12:52.362491Z","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-03T20:12:52.364627Z","title":"A fully first-order method for stochastic bilevel optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.364627Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8e52a0a04a12a4a1656edfc487eb924aa69c9c1e0007bf10668b487c794622ec","observation_id":"dbf93589-9b06-4a4b-8a09-95cb87e739e1","resolution":{"observed_at":"2026-08-03T20:12:52.364627Z","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-03T20:12:52.366806Z","title":"On penalty methods for non- convex bilevel optimization and first-order stochas- tic approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.366806Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:318431a38e4ea178bc5cd9e6bb19c63cb8d20a172f7853d281588758c1274a6a","observation_id":"c71d23e5-574f-4876-aa00-06523f30f26b","resolution":{"observed_at":"2026-08-03T20:12:52.366806Z","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-03T20:12:52.369033Z","title":"A fully sin- gle loop algorithm for bilevel optimization without hessian inverse","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.369033Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:c44be6bf2f3b0522afcfc8efa62cbd29559019269a079231aabcca05fe768941","observation_id":"0527d3e8-655e-4af7-8a7c-0a7a12cef4cc","resolution":{"observed_at":"2026-08-03T20:12:52.369033Z","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-03T20:12:52.371120Z","title":"Hashimoto","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.371120Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:6d175828824a2fd147cef7f3957de1a14b52d2e06510057b14d5f34dc43a6559","observation_id":"224b8105-1393-4311-b7a7-f48958de1ac8","resolution":{"observed_at":"2026-08-03T20:12:52.371120Z","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-03T20:12:52.373501Z","title":"Data mixing optimization for supervised fine-tuning of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.373501Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9381f716b52c1cf48fc62d56a072985b3da4f5400e83ff975a4e16038cc09a64","observation_id":"bb82aa4c-c984-4bae-9043-ca40a3253d32","resolution":{"observed_at":"2026-08-03T20:12:52.373501Z","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-03T20:12:52.375598Z","title":"Preserving diversity in supervised fine-tuning of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.375598Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:78d82355cf12884fbbd073e9f8248805de101869dc3bc48f4db33141436826f0","observation_id":"ef2126c6-d6a9-49b0-8ed7-033f9a685c91","resolution":{"observed_at":"2026-08-03T20:12:52.375598Z","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-03T20:12:52.377841Z","title":"Data- efficient fine-tuning for llm-based recommenda- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.377841Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:812e481ca0d1539cd9d23d7360708c246bf74cee71fad39d6a2c0da8075f071a","observation_id":"85d80849-762c-407c-9ce1-f131abc0ce80","resolution":{"observed_at":"2026-08-03T20:12:52.377841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03613","last_updated":"2025-08-05T16:28:22Z","snapshot_observed_at":"2026-08-02T23:39:36.635461Z","submitted_at":"2025-08-05T16:28:22Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.03613","snapshot_observed_at":"2026-08-03T20:12:52.379898Z","title":"Goedel- prover-v2: Scaling formal theorem proving with scaffolded data synthesis and self-correction.arXiv preprint arXiv:2508.03613, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.379898Z"},"links":{"cited_paper":"/paper/2508.03613","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:1684d162983cdce5865c7e28c8ee11ad8ebf393bd6ab580c26ee988511644c13","observation_id":"fb3e154e-0b23-4e74-96b8-ad90e3e23bc4","resolution":{"observed_at":"2026-08-03T20:12:52.379898Z","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-03T20:12:52.382561Z","title":"Regmix: Data mixture as re- gression for language model pre-training","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.382561Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8bb148e8585977995333ed8c410b63e86d61dbe76506e7cef10b564c5450b76a","observation_id":"6f674fb5-6687-417d-9068-c957bacb11ec","resolution":{"observed_at":"2026-08-03T20:12:52.382561Z","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-03T20:12:52.384658Z","title":"A generic first-order algo- rithmic framework for bi-level programming be- yond lower-level singleton","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.384658Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ea29176bb9ea1508c4a02b0872e2e06e61b2bcb4b13027a0a4d5c7b834a044fe","observation_id":"a568a591-d504-450f-b704-2080456295f8","resolution":{"observed_at":"2026-08-03T20:12:52.384658Z","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-03T20:12:52.386824Z","title":"Averaged method of multipliers for bi-level optimization without lower-level strong convexity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.386824Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:14cbcb79a40726a2cfe9c0f8f3e0e477e2a6761f8703b2969e285cfdf1f275d5","observation_id":"d4f60168-a918-47ec-903e-0e95c2294e06","resolution":{"observed_at":"2026-08-03T20:12:52.386824Z","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-03T20:12:52.389047Z","title":"What makes good data for align- ment? a comprehensive study of automatic data selection in instruction tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.389047Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:3ef5038965437a249482f7467d92a2bb8092b1e705df917f9df130013fb63ccf","observation_id":"7a22653e-b4af-415e-9d9c-da8c9e280170","resolution":{"observed_at":"2026-08-03T20:12:52.389047Z","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-03T20:12:52.391093Z","title":"The flan col- lection: Designing data and methods for effective instruction tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.391093Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8e6fce0403836d6a291b0956eb7beee472e90e92fb7ca3a46e0e32699957caf8","observation_id":"a7db3ff2-9e74-4d1a-b57b-2a23dafe8a01","resolution":{"observed_at":"2026-08-03T20:12:52.391093Z","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-03T20:12:52.393537Z","title":"First-order penalty methods for bilevel optimization.SIAM Journal on Optimization, 34(2):1937–1969, 2024","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.393537Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8a21886b9edb00b7531ba61217541b97ffed91cb3a13821578ca23d9a295e034","observation_id":"55c26a91-1207-4c67-95be-2de50e27c814","resolution":{"observed_at":"2026-08-03T20:12:52.393537Z","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-03T20:12:52.395773Z","title":"Learning what reinforcement learning can’t: Interleaved online fine-tuning for hardest questions.arXiv preprint arXiv:2506.07527, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.395773Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:fc5368557a7361bf5cfa498f256643a7e689f6e03356a9fb28675f1cbb7cfd0d","observation_id":"a0c5299b-dade-46ea-a0fe-33c19989ff8d","resolution":{"observed_at":"2026-08-03T20:12:52.395773Z","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-03T20:12:52.397840Z","title":"Multi- task learning with user preferences: Gradient de- scent with controlled ascent in pareto optimiza- Offline Data Selection and Online Self-refining Generation tion","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.397840Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:993f7bf01153a61a777cffc42238551048114adbdca4bbb1ce331e1e7ec05733","observation_id":"6b52a6fd-6899-45b4-86f6-87bc822bcb3e","resolution":{"observed_at":"2026-08-03T20:12:52.397840Z","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-03T20:12:52.399939Z","title":"Emergence of separable manifolds in deep language representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.399939Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:3b697ad433f0e074a15938c03ce9c9bbb467098bd44f8261e03c9e716253c238","observation_id":"417eb84b-5cb5-4243-a5ed-d7f52a923e3d","resolution":{"observed_at":"2026-08-03T20:12:52.399939Z","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-03T20:12:52.402130Z","title":"MIT press, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.402130Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:2c3aa2dbd06182ccb0f4c184ca2a1c10a2bd0ac522b7183980a63119177e6cb6","observation_id":"b046e0e0-c79e-40d7-8a36-f7c43eefc12d","resolution":{"observed_at":"2026-08-03T20:12:52.402130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02707","last_updated":"2023-06-05T08:58:39Z","snapshot_observed_at":"2026-08-09T03:29:22.849759Z","submitted_at":"2023-06-05T08:58:39Z","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02707","snapshot_observed_at":"2026-08-03T20:12:52.404282Z","title":"Orca: Progressive learning from complex explanation traces of gpt-4.arXiv preprint arXiv:2306.02707, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.404282Z"},"links":{"cited_paper":"/paper/2306.02707","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ce768b4b5209462f1084266ec7e1b7aed81f12e97a141c575069198b5eb14f5d","observation_id":"e42ff315-af8b-46e3-bd2f-96526a6a3c38","resolution":{"observed_at":"2026-08-03T20:12:52.404282Z","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-03T20:12:52.406482Z","title":"Token cleaning: Fine-grained data selection for llm su- pervised fine-tuning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.406482Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:cd232387e32739b69c24d21734c86b2c46990293e2674d0ac9d9d422182ef534","observation_id":"9fa07a31-73c2-4d30-82c2-6ac92569497c","resolution":{"observed_at":"2026-08-03T20:12:52.406482Z","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-03T20:12:52.408660Z","title":"Hyperparameter optimization with approximate gradient","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.408660Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:6755b30b2db0c68778ff76385fb0b3bda5a8374af39d3d50fbf7ce21a613fcd2","observation_id":"9be8929e-01f9-44a6-8bb8-e7098921251b","resolution":{"observed_at":"2026-08-03T20:12:52.408660Z","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-03T20:12:52.410689Z","title":"Learning dy- namics of LLM Finetuning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.410689Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:832d94b720e804bcb46d0c52430caf3910d6183307fa8050684355e3804d89c2","observation_id":"f462f6cf-a878-4e4f-b5f8-3df9e2a174ed","resolution":{"observed_at":"2026-08-03T20:12:52.410689Z","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-03T20:12:52.412789Z","title":"Cos-dpo: Condi- tioned one-shot multi-objective fine-tuning frame- work","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.412789Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:e4dd68ffd7bac995f046350c278fda463c2162f31a4eadc4e4119d0c2013af68","observation_id":"765a2a02-1b7f-461f-9cfa-194dc25340a1","resolution":{"observed_at":"2026-08-03T20:12:52.412789Z","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-03T20:12:52.415398Z","title":"Springer Science & Business Media, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.415398Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:809db178d7e0b9559ffa45817c45297418a0db9806ba5c97e6a759a00f0674dd","observation_id":"ff9223eb-75e3-42ba-8714-2617c25472f5","resolution":{"observed_at":"2026-08-03T20:12:52.415398Z","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-03T20:12:52.418035Z","title":"Large language models encode seman- tics in low-dimensional linear subspaces.arXiv preprint arXiv:2507.09709, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.418035Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:4a4d013ae2db350806d33b01c26ffbabb8a6046bc7414990c17fbe62dce7a1cb","observation_id":"989cafcb-8a90-4fd5-9dd1-0f2ba80c5d4d","resolution":{"observed_at":"2026-08-03T20:12:52.418035Z","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-03T20:12:52.420099Z","title":"Equilibrium propagation: Bridging the gap between energy- based models and backpropagation.Frontiers in computational neuroscience, 11:24, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.420099Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:700d078934c1c03e6dd867fbf3ae86cba447748e5171c84f9ff69b25f2d5fa17","observation_id":"398ff0eb-37e8-421d-bd04-52221b100a96","resolution":{"observed_at":"2026-08-03T20:12:52.420099Z","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-03T20:12:52.422399Z","title":"Seal: Safety-enhanced aligned llm fine- tuning via bilevel data selection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.422399Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:09d882bb4e6b12ca40707851d7fd224237867f3213ea2ac4f1b9718358cccaf3","observation_id":"617839a0-e3aa-4645-9e3d-77ea19dd68c8","resolution":{"observed_at":"2026-08-03T20:12:52.422399Z","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-03T20:12:52.424746Z","title":"On penalty-based bilevel gradient descent method","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.424746Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ffb5195bea9bfa9d2b4646817d3d6836f1edeedcd8a9c1686553f7880e2c817f","observation_id":"76f15c48-928d-4b1b-9ff4-0c060f1750e6","resolution":{"observed_at":"2026-08-03T20:12:52.424746Z","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-03T20:12:52.426831Z","title":"The importance of online data: Un- derstanding preference fine-tuning via coverage","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.426831Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:25b8262e0e195c809eb63a52d241a467eb45089349b997ae68f3b91133a5cdb4","observation_id":"3df3e21c-8e05-4b89-825b-31ec602607f1","resolution":{"observed_at":"2026-08-03T20:12:52.426831Z","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-03T20:12:52.429041Z","title":"The im- plicit bias of gradient descent on separable data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.429041Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:71e1d70df7edab4a01f89dd3455a57c52d9da56abef2851cad84016218dc9450","observation_id":"8b2d2a75-0a41-4f78-a641-5f0edbb5bdbf","resolution":{"observed_at":"2026-08-03T20:12:52.429041Z","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-03T20:12:52.431056Z","title":"Preference fine-tuning of llms should leverage sub- optimal, on-policy data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.431056Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:22a9f0d0a1a838bceba9def3414a70c2681f4e728f49ee271a70010e70a144d7","observation_id":"2f8cf577-fd17-4fa6-95f5-d901e7bb420d","resolution":{"observed_at":"2026-08-03T20:12:52.431056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09333","last_updated":"2023-04-09T05:47:41Z","snapshot_observed_at":"2026-07-06T10:05:41.209309Z","submitted_at":"2020-10-19T09:16:43Z","title":"New merit functions for multiobjective optimization and their properties","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.09333","snapshot_observed_at":"2026-08-03T20:12:52.433567Z","title":"Fukuda, and Nobuo Ya- mashita","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.433567Z"},"links":{"cited_paper":"/paper/2010.09333","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:2a17e806e5e50305b0736e25d450c8ee643c0f6d98da2484656aeab848153131","observation_id":"545d82f0-6939-4170-987b-220a7677e883","resolution":{"observed_at":"2026-08-03T20:12:52.433567Z","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-03T20:12:52.435845Z","title":"Stanford al- paca: An instruction-following llama model, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.435845Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9e74254b3ed4958e75116e6db0f3e227063c51faee7c1939c4f8a1ac7cdba021","observation_id":"69fb5c0f-4a33-4c55-9834-14dff3e2c8e7","resolution":{"observed_at":"2026-08-03T20:12:52.435845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.16898","last_updated":"2024-02-22T18:38:14Z","snapshot_observed_at":"2026-07-06T16:12:55.132006Z","submitted_at":"2023-08-31T17:57:50Z","title":"Transformers as Support Vector Machines","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.16898","snapshot_observed_at":"2026-08-03T20:12:52.437823Z","title":"Transform- ers as support vector machines.arXiv preprint arXiv:2308.16898, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.437823Z"},"links":{"cited_paper":"/paper/2308.16898","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:eec769b61f57b0fa1cdd6494c7d1659bcf4454b35461440acbf3669f78dc1f6a","observation_id":"93817fb6-e601-4ce0-93cc-2b2fdcd1cfb7","resolution":{"observed_at":"2026-08-03T20:12:52.437823Z","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-03T20:12:52.440533Z","title":"Importance sampling: a review.Wiley Interdisciplinary Re- views: Computational Statistics, 2(1):54–60, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.440533Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9be0525bda46ae5df094f6ab4726d9902ed81b83636c87d050edacf480e6fe68","observation_id":"b522613c-7c15-4fff-b3d5-db9978c6b0c5","resolution":{"observed_at":"2026-08-03T20:12:52.440533Z","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-03T20:12:52.442578Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.442578Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:109314b1e684b44e9ab05ba5e91e28a30c9edb39e9df226cda165a7bec4b3896","observation_id":"c76cc4eb-7356-443e-b0ec-4c93f20133a8","resolution":{"observed_at":"2026-08-03T20:12:52.442578Z","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-03T20:12:52.444837Z","title":"On implicit bias in overparameterized bilevel op- timization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.444837Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:3037addb6c85e6f20693db3fb96746885ebff04ad29c566a420068c2cf18df62","observation_id":"18318a74-416b-478d-82c7-d6d1d623ae1e","resolution":{"observed_at":"2026-08-03T20:12:52.444837Z","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-03T20:12:52.446962Z","title":"Interpretable preferences via multi-objective reward modeling and mixture- of-experts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.446962Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:45ab06e07004e346ee24405840b80aee873ffc99d831cef7d38abd7c28421206","observation_id":"4a5a12c8-aefc-401d-aa38-eb2debe966e2","resolution":{"observed_at":"2026-08-03T20:12:52.446962Z","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-03T20:12:52.449234Z","title":"Hbo: Hierarchical balancing op- timization for fine-tuning large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.449234Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:bbc34a3202316d5a95a108c56b262ac4923633277df3a2683d80607ef3f6c967","observation_id":"3750258a-053c-4426-8b77-3aa8a4e08d6b","resolution":{"observed_at":"2026-08-03T20:12:52.449234Z","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-07-06T14:33:11.945106Z","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-03T20:12:52.451438Z","title":"Self-instruct: Aligning language models with self-generated instructions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.451438Z"},"links":{"cited_paper":"/paper/2212.10560","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:246c114106b02cdeddbac0aedd7a4b22000b5c79961b5057fd93fa9ae272a6a3","observation_id":"1c97a6dd-4bc2-4877-ab78-edfd3fa6f655","resolution":{"observed_at":"2026-08-03T20:12:52.451438Z","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-03T20:12:52.454758Z","title":"Finetuned language models are zero-shot learners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.454758Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:8427fa1deffc2eb634638974e2fa4b8f1a3a0c855f94e7f0ddc3205f420adf5c","observation_id":"bad86346-ed9b-4e2d-9f7d-71230d294e32","resolution":{"observed_at":"2026-08-03T20:12:52.454758Z","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-03T20:12:52.457040Z","title":"Ldc-mtl: Balancing multi-task learning through scalable loss discrepancy control.arXiv preprint arXiv:2502.08585, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.457040Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:e7387f826c2941a1e6fe8ad5841e9af947a1748f9d2395d1861e4bf39edb3ea8","observation_id":"1e7def17-8153-4136-8ae6-e2d285534295","resolution":{"observed_at":"2026-08-03T20:12:52.457040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.16087","last_updated":"2024-12-24T06:17:53Z","snapshot_observed_at":"2026-07-06T19:07:20.444206Z","submitted_at":"2024-08-28T18:34:54Z","title":"Unlocking Global Optimality in Bilevel Optimization: A Pilot Study","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.16087","snapshot_observed_at":"2026-08-03T20:12:52.459185Z","title":"Unlocking global optimality in bilevel optimization: A pilot study","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.459185Z"},"links":{"cited_paper":"/paper/2408.16087","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:fd9f2e6694f933bb7aa31c0b40353b257cd10dba0e2cfbf41d48a7527160c738","observation_id":"022aa620-7218-4883-b983-8c54c2633a33","resolution":{"observed_at":"2026-08-03T20:12:52.459185Z","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-03T20:12:52.461439Z","title":"A gen- eralized alternating method for bilevel optimiza- tion under the polyak- lojasiewicz condition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.461439Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:e9817670b9418558878bd7a7d4d82dcb27efcdf73a2bb93fdb8154e3e5748908","observation_id":"c0eac551-d7b8-4950-9efd-31ed4d1df885","resolution":{"observed_at":"2026-08-03T20:12:52.461439Z","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-03T20:12:52.463444Z","title":"Self-training with noisy student im- proves imagenet classification","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.463444Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:20c8db826400bc5cdb06fbb0751819ddac4dd7a80627585b2ac90fcd29fa19d5","observation_id":"7de097fd-993f-41dc-bb6a-3fc3274f7581","resolution":{"observed_at":"2026-08-03T20:12:52.463444Z","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-03T20:12:52.466228Z","title":"Doremi: Optimizing data mixtures speeds up lan- guage model pretraining","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.466228Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9569298157d0f1447c187dbd2c1520617934a21f83d6bcc37ad58858f59ea2a0","observation_id":"640788d6-774e-4cbe-bde3-f197f2767a47","resolution":{"observed_at":"2026-08-03T20:12:52.466228Z","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-03T20:12:52.468287Z","title":"Data selection for language models via importance resampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.468287Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:d95187a2549675e7da2c45d965f6ddcf4ec2dc60fb4665f1e2b0251c52c593df","observation_id":"ab5008b9-029f-4bf6-901e-d21f65625183","resolution":{"observed_at":"2026-08-03T20:12:52.468287Z","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-03T20:12:52.471064Z","title":"Prov- ably faster algorithms for bilevel optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.471064Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:20726325329f1d077e565678517be3cca06cb8184afabad6c14fc567db829d13","observation_id":"a61cb33b-7a90-42eb-b11b-dfd479d579d5","resolution":{"observed_at":"2026-08-03T20:12:52.471064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.16178","last_updated":"2025-07-22T02:47:12Z","snapshot_observed_at":"2026-08-09T20:19:47.392884Z","submitted_at":"2025-07-22T02:47:12Z","title":"LLM Data Selection and Utilization via Dynamic Bi-level Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.16178","snapshot_observed_at":"2026-08-03T20:12:52.473205Z","title":"Llm data selection and utilization via dynamic bi-level opti- mization.arXiv preprint arXiv:2507.16178, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.473205Z"},"links":{"cited_paper":"/paper/2507.16178","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:e18051c9f02fab05588a3278eaedae6692bcbe7a705c2f78aaa6b5276069f964","observation_id":"fea06d46-0954-45c0-8340-9f2ba7c05b2d","resolution":{"observed_at":"2026-08-03T20:12:52.473205Z","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-03T20:12:52.475395Z","title":"Understanding why generalized reweighting does not improve over ERM","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.475395Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:d7c08e536dd2e4161568dd0c6e7e4909483e42d7521a069e6eb5e4e9e396bf7c","observation_id":"b663a8ad-5819-4fd6-bd3a-523c052755c7","resolution":{"observed_at":"2026-08-03T20:12:52.475395Z","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-03T20:12:52.477689Z","title":"Harnessing diversity for important data selection in pretraining large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.477689Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:ceca2066ea90d423b0108af0a4c057a9fa36e0904ec7705366a2464e30131fbc","observation_id":"bb086deb-3041-4c44-999d-afcca190b44f","resolution":{"observed_at":"2026-08-03T20:12:52.477689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03530","last_updated":"2017-02-26T19:36:40Z","snapshot_observed_at":"2026-08-01T16:56:59.989486Z","submitted_at":"2016-11-10T22:02:36Z","title":"Understanding deep learning requires rethinking generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.03530","snapshot_observed_at":"2026-08-03T20:12:52.479829Z","title":"Understanding deep learning requires rethinking generalization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.479829Z"},"links":{"cited_paper":"/paper/1611.03530","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:84c40824ff0dbcf5cd78802e8ca36ec5a76bbd997719a7004b07963c402f9859","observation_id":"c3937c39-b92d-457d-99a2-1bb1a7e65bc6","resolution":{"observed_at":"2026-08-03T20:12:52.479829Z","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-03T20:12:52.482133Z","title":"The best instruction-tuning data are those that fit","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.482133Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:7fd7476b4c8202797d9050cfd81cd3667ad49822f9fb40a446c82fcb69f7d9a0","observation_id":"f53ba641-7e99-46e1-a61e-fdf2ced22eb1","resolution":{"observed_at":"2026-08-03T20:12:52.482133Z","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-03T20:12:52.484401Z","title":"How unlabeled data improve generalization in self-training? a one-hidden-layer theoretical analysis","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.484401Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:44b07ac9cce7aae1d167d03c06434290837a44e38fb543ba7c087c2537493734","observation_id":"05c01dc6-f7b7-42a5-872c-3b42d11c03ca","resolution":{"observed_at":"2026-08-03T20:12:52.484401Z","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-03T20:12:52.486696Z","title":"On-policy rl meets off-policy ex- perts: Harmonizing supervised fine-tuning and re- inforcement learning via dynamic weighting.arXiv preprint arXiv:2508.11408, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.486696Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:284f38cad0f72984274f4729fc1ed1e936f2847d00f539e2cc43ea1e9334b842","observation_id":"c2b5febc-8160-4bde-aea1-14ff71e3473f","resolution":{"observed_at":"2026-08-03T20:12:52.486696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00788","last_updated":"2023-12-20T20:30:24Z","snapshot_observed_at":"2026-07-06T16:01:26.276862Z","submitted_at":"2023-08-01T18:59:07Z","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00788","snapshot_observed_at":"2026-08-03T20:12:52.489056Z","title":"An introduction to bi-level optimization: Founda- tions and applications in signal processing and ma- chine learning.arXiv preprint arXiv:2308.00788, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.489056Z"},"links":{"cited_paper":"/paper/2308.00788","citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:9dd61a9808b2f9442201b8c3ed5d0e425a7fd6f552265daca89d8cdc1e78c0cb","observation_id":"e9e0bf03-e009-4b44-9754-7c68eefb0a6d","resolution":{"observed_at":"2026-08-03T20:12:52.489056Z","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-03T20:12:52.492479Z","title":"Panacea: Pareto alignment via preference adaptation for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.492479Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:894b3cac94a2a2d9f3b1778ccd588205f423521ee1ff69d39777cc38476853bc","observation_id":"3c6b83d0-8f95-4dc5-9580-ab3357ebb7cc","resolution":{"observed_at":"2026-08-03T20:12:52.492479Z","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-03T20:12:52.494607Z","title":"Lima: Less is more for alignment","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.494607Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:c7d7bea9a9e582270eac9236ed503a4e269df9851b34d773d989efa9b702be07","observation_id":"ae3612b1-468d-45e7-b1a7-ddc556eea1ff","resolution":{"observed_at":"2026-08-03T20:12:52.494607Z","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-03T20:12:52.498005Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.498005Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:664a10227ddde786b14e7a9523be2f0dc32f2c19d4fd5453a02ab757697cfd7c","observation_id":"414718cb-c6a8-4a23-94af-be5b1a032084","resolution":{"observed_at":"2026-08-03T20:12:52.498005Z","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-03T20:12:52.500627Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.500627Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:caa166ee2e1d1e787163d423405953343654e9a652a3279625368d5e7b16b9a3","observation_id":"4fbf2bf7-48f0-427e-8a50-f7de2fd588ed","resolution":{"observed_at":"2026-08-03T20:12:52.500627Z","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-03T20:12:52.503592Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-03T20:12:52.503592Z"},"links":{"citing_paper":"/paper/2511.21056"},"observation_digest":"sha256:fbc343de397121eaee02ed97526b1b7a8167d4dd5a1e2de2f291620573f8ff4e","observation_id":"262a2e27-03ee-4b3d-9144-b0e394d2cc0b","resolution":{"observed_at":"2026-08-03T20:12:52.503592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.21056","last_updated":"2026-06-22T20:57:57Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T22:42:52.448509Z","submitted_at":"2025-11-26T04:48:33Z","title":"Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation"},"reference_resolution":{"displayed":91,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":91,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":91},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 91 of 91 outbound references and 0 inbound Pith citation observations for arXiv:2511.21056."}