{"as_of":"2026-08-07T09:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b474d9400c622015b8b8022b80ac03906591a15b4ce47abb92a164c8c572ad7e","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T02:47:55.649231Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2605.09404/citation-record","integrity":"/paper/2605.09404/integrity","json":"/paper/2605.09404/citation-record.json","paper":"/paper/2605.09404"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Intrinsic dimensionality explains the effectiveness of language model fine-tuning","venue":null,"work_id":"60f3b24e-b4ff-4498-bd15-99d015e21ebc","year":2020},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:5d263101b75f4b494f1230234ccda064ae75f0f55414909fb00265d4135627ac","observation_id":"99c18575-7263-4988-b3ed-936a246efac5","resolution":{"observed_at":"2026-05-12T21:41:53.914382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08701","last_updated":"2024-02-13T18:37:25Z","snapshot_observed_at":"2026-07-06T15:54:58.589775Z","submitted_at":"2023-07-17T17:59:40Z","title":"AlpaGasus: Training A Better Alpaca with Fewer Data","version":5},"cited_work":{"arxiv_id":"2307.08701","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.08701","snapshot_observed_at":"2026-07-03T08:17:45.494270Z","title":"Alpagasus: Training a better alpaca with fewer data.arXiv preprint arXiv:2307.08701","venue":null,"work_id":"4f776266-d896-4d99-8b0e-422920f23dc0","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2307.08701","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:c2863c1cb164ae20dfad77fb751437a814fc93cb01424f5b46005c7cd131d3d3","observation_id":"9667eca4-8983-4d2d-89f4-c3c0d20c07fe","resolution":{"observed_at":"2026-05-12T02:51:17.967401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.17835","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:04:56.633990Z","title":"Influence-preserving proxies for gradient-based data selection in llm fine-tuning","venue":null,"work_id":"a2f363d3-4883-46f0-8c42-b8980bb0476c","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:d8f23067baf68173828f5999cd3339612a0dc06194a6791cbfc9dca21a65316e","observation_id":"d11a3628-97b4-4887-9026-93101beb8d51","resolution":{"observed_at":"2026-05-12T02:51:18.019562Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Task- aware data selection via proxy-label enhanced distribution matching for LLM finetuning","venue":null,"work_id":"2972d791-2cbd-474c-b4a9-6c84fe240a17","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:53ab86a754fe13ca6918275d154fe976c9dc697f4e015d9509e027287852083a","observation_id":"c4365d9d-ddb0-4d45-ad1f-213a8224f701","resolution":{"observed_at":"2026-05-12T21:41:53.909566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"TyDi QA: A benchmark for information-seeking question answering in typologically diverse languages.Transactions of the Association for Computational Linguistics, 8:454–470","venue":null,"work_id":"8a7d2521-792d-40dd-9713-4f99c5d76d3a","year":2020},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:3dc3e5ea9f8002b893bd40b93424fb61f76955471331b63442eeff4ca75b2e5a","observation_id":"f6bd0787-87eb-46bc-b09a-d5a14b01cfa7","resolution":{"observed_at":"2026-05-12T21:41:53.905480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Free Dolly: Introducing the world’s first truly open instruction-tuned LLM","venue":null,"work_id":"d315521c-8a4d-4f89-98d4-4d61f0bf1708","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:f0a8bd49524af9bba94895a3750ab1865bbae5efda547b713fe844bd01ef595b","observation_id":"89542134-1b7a-4bec-83b7-981f164e92da","resolution":{"observed_at":"2026-05-12T21:41:53.984908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bd60a27c-415a-46fb-bc61-8ac89aa18963","year":1958},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:1f5a7953ef4bb4e6b03b4b5ff464430a6efec70e1e8ffde8816e9ea2c9cb5f72","observation_id":"9bbd4c7f-6f27-4cd1-838c-3a000f5797ea","resolution":{"observed_at":"2026-05-12T21:41:53.968148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":"0ab2c82d-8fd4-4600-8b46-ba5b03009652","year":2009},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:34d187de65a22c54ef0134fbf779658c798bbd92b8941d468c233f0653f8a942","observation_id":"9402e397-6a2e-405f-9bfa-6e6acf80e427","resolution":{"observed_at":"2026-05-12T21:41:53.974687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16710","last_updated":"2024-10-22T05:32:40Z","snapshot_observed_at":"2026-07-31T07:41:29.482224Z","submitted_at":"2024-10-22T05:32:40Z","title":"Influential Language Data Selection via Gradient Trajectory Pursuit","version":1},"cited_work":{"arxiv_id":"2410.16710","doi":"10.48550/arxiv.2410.16710","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.16710","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Influential language data selection via gradient trajectory pursuit","venue":"arXiv (Cornell University)","work_id":"39056f07-c2b2-4bfb-8e04-4d63bf8d9804","year":2024},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2410.16710","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:56cbf1a3fad1bf9f6642af284f8b9eafb13fa91c72f9311d2151d0fc780db563","observation_id":"4f651c0c-df63-4051-9201-64ea74abd58f","resolution":{"observed_at":"2026-05-12T02:51:18.000071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Greedy information projection for llm data selection","venue":null,"work_id":"ae762fd5-9570-42ab-af08-4d01a9efdf9f","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:c0785d1adb369f3518ee8159aa27223707302266f8710d607adccc9cfb3ad061","observation_id":"08c9b519-ccb7-4c55-b33f-8396271edd15","resolution":{"observed_at":"2026-05-12T21:41:53.981725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1cbed808-0369-4eaa-a7f5-3e6e30694f21","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:54533401f295886b52e50b77c2fa2df898d21195fce34de7ea103b9da31dae28","observation_id":"766d605e-be55-4eac-ad40-a07c8f86bb7e","resolution":{"observed_at":"2026-05-12T21:41:53.962248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:11d51d28a86db5bbcbacca5726435fa0090f245d4698a939e5712deb5aed10f2","observation_id":"52f48ce8-b29d-4d7a-b7c9-80ebee7ed1eb","resolution":{"observed_at":"2026-05-12T02:51:18.002707Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10365","last_updated":"2020-02-24T16:51:01Z","snapshot_observed_at":"2026-08-06T07:50:58.718464Z","submitted_at":"2020-02-24T16:51:01Z","title":"The Early Phase of Neural Network Training","version":1},"cited_work":{"arxiv_id":"2002.10365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.10365","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2002.10365 , year=","venue":null,"work_id":"30263c5b-355c-4fea-8d3a-10aebad00e92","year":2002},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2002.10365","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:18a03b05e266f0b779febad942fd481024d3e0919f87f4b5a31d3d930725a876","observation_id":"cf30433b-a810-41d8-8875-6c3027892112","resolution":{"observed_at":"2026-05-12T02:51:17.984752Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0710036","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Golub and Victor Pereyra","venue":"SIAM Journal on Numerical Analysis","work_id":"f81bb935-c38f-4aca-9974-33ded0044ba4","year":1973},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:b86684d815a551ec31421e97b952c6fb07e7f57f051abfb81796857975884ce5","observation_id":"5558e69b-9189-4745-9572-a3602fad7572","resolution":{"observed_at":"2026-05-12T02:51:16.878526Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.06048","last_updated":"2026-06-18T04:28:50Z","snapshot_observed_at":"2026-08-04T11:16:05.008855Z","submitted_at":"2025-10-07T15:42:33Z","title":"BLISS: A Lightweight Bilevel Influence Scoring Method for Data Selection in Language Model Pretraining","version":5},"cited_work":{"arxiv_id":"2510.06048","doi":null,"metadata_source":"pith","pith_arxiv_id":"2510.06048","snapshot_observed_at":"2026-07-03T23:39:04.471904Z","title":"Bliss: A lightweight bilevel influence scoring method for data selection in language model pretraining","venue":"cs.LG","work_id":"5c711be9-4e0a-447d-b651-e63ca5c7af89","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2510.06048","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:a741c974eb86a92e897bf4d994bbfab35410a2061161123b16c6c75e0a890f47","observation_id":"a8529f82-f5b4-4e97-aa22-9ebdbaeae50f","resolution":{"observed_at":"2026-06-02T03:04:01.491891Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep residual learning for im- age recognition","venue":null,"work_id":"ece852db-7f84-45d3-8efb-6dab4f7bf6de","year":2016},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:1ca66961bff5e468cff5b8db58252237f3b7b4d4ea33bae6746255c32ea6c3a5","observation_id":"550f9f04-5c29-4760-b6be-41661a8fe1d1","resolution":{"observed_at":"2026-05-12T21:41:53.958989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Measuring massive multitask language understanding","venue":null,"work_id":"965c4265-31b6-4a42-bef9-073d7aad2215","year":2021},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:0a2fd4473364c4982f7251102731833faeb96f16a0f89f2df5e57df9658253d3","observation_id":"749a6804-3aa2-40da-9b07-b2293be2f563","resolution":{"observed_at":"2026-05-12T21:41:53.988181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":"2106.09685","doi":"10.4088/pcc.v03n0609","metadata_source":"pith","pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","venue":"cs.CL","work_id":"0426219a-789e-4964-adc8-a04538510818","year":2021},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:f29f29406ebf7f58114b5eb8ed1216abc22f2277b2a2d591f2c7a30cccf78102","observation_id":"166b8a95-79de-4a90-bc23-bdf600f4d432","resolution":{"observed_at":"2026-05-12T02:51:17.959198Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.00386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T19:22:34.811323Z","title":"Train on validation (tov): Fast data selection with applications to fine-tuning","venue":null,"work_id":"4249fd5b-18de-4eee-aeeb-398dd4da4b1d","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:6d698eb3e0d6e9411f9a94920a8e768f84e07ea983162f13de5994b511964d60","observation_id":"ae78e9a5-df41-40ed-ab63-a8187e625038","resolution":{"observed_at":"2026-05-12T02:51:17.964485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00123","last_updated":"2021-06-11T22:08:29Z","snapshot_observed_at":"2026-07-06T10:45:06.227629Z","submitted_at":"2021-02-27T04:09:32Z","title":"GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Training","version":2},"cited_work":{"arxiv_id":"2103.00123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.00123","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"13 Alex Krizhevsky","venue":null,"work_id":"03ffa4b8-a9f4-4bdb-90f8-9fbf897a8f0a","year":2021},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2103.00123","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:bf6ca42cce76db7d59155c75d4d935a30cd726c99f84ca12dd46db7dfb2d1226","observation_id":"8f6daf97-d261-4711-9fc0-f670468deaad","resolution":{"observed_at":"2026-05-12T02:51:18.014028Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.10630","last_updated":"2021-06-11T22:45:42Z","snapshot_observed_at":"2026-07-06T10:26:04.986424Z","submitted_at":"2020-12-19T08:41:34Z","title":"GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learning","version":4},"cited_work":{"arxiv_id":"2012.10630","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.10630","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Glister: Generalization based data subset selection for efficient and robust learning","venue":null,"work_id":"db639bdb-3831-431f-b1ff-c2a324facaa8","year":2021},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2012.10630","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:126551ab618d9e5d180ef84bd84dece63eebbb2f612473b93576a4df95161931","observation_id":"e4ebf131-45a7-4e03-b70f-1002d968f752","resolution":{"observed_at":"2026-05-12T02:51:18.011275Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Understanding black-box predictions via influence functions","venue":null,"work_id":"27a219fb-d278-474c-b692-fe341c6fc594","year":2017},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:03ec20834a50f246bb5a440e4013d41c1592275358c8182a780d39fb5bd935b3","observation_id":"40ccfff8-707f-4637-ad11-559185623a90","resolution":{"observed_at":"2026-05-12T21:41:53.965388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A study of cross-validation and bootstrap for accuracy estimation and model selection","venue":null,"work_id":"76ca2b9d-4592-49bb-9c16-d38093218791","year":1995},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:60cc162224bef934c10a1d082891e3eb3f1af73366c19f31b529bef056ac53de","observation_id":"b1ff6c8d-8fa1-4afc-8ec6-6b69572c4beb","resolution":{"observed_at":"2026-05-12T21:41:53.971641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Openassistant conversations–democratizing large language model alignment","venue":null,"work_id":"9dbcf604-f294-4323-bf58-a3f8bd4a800d","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:dce229cd9fd4ec4ef951a039774715dfd8c22032d6db8bdc4c14412860abcd09","observation_id":"e3e69cf7-3e3c-42f0-bcdf-b44927020ebc","resolution":{"observed_at":"2026-05-12T21:41:53.978103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T09:16:07.147895Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":"49a70b89-c970-47e3-9178-e555f913716e","year":2009},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:1a6005916815f3ec96295ab92fc59b89bb92f79b6637e2b8090902b29c08c6be","observation_id":"44ade208-d3bd-4715-a233-5a5682ae47a1","resolution":{"observed_at":"2026-05-12T21:41:53.951292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15685","last_updated":"2024-04-16T02:46:58Z","snapshot_observed_at":"2026-07-06T17:07:52.197869Z","submitted_at":"2023-12-25T10:29:28Z","title":"What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuning","version":2},"cited_work":{"arxiv_id":"2312.15685","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.15685","snapshot_observed_at":"2026-07-03T08:17:45.507249Z","title":"What makes good data for alignment? a comprehensive study of automatic data selection in instruction tuning","venue":null,"work_id":"bf928949-0348-46a2-b106-7fdc5ab7d707","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2312.15685","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:427217c7784b6efa1d216c530a0137298898000636785f948846c373404f2c77","observation_id":"7c00a638-c554-4ed2-ab2d-0166f0acf9bb","resolution":{"observed_at":"2026-05-12T02:51:17.975709Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The flan collection: Designing data and methods for effective instruction tuning","venue":null,"work_id":"c4a65cb7-f150-4986-a25c-aea7289665d4","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:b28437c99637fdcbdf5bae17d3be76da6762c24c63d486b7f697e4f28261bddc","observation_id":"f8f3bf5e-b900-4bde-8fa8-cd38d5e891e8","resolution":{"observed_at":"2026-05-12T21:41:53.955335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.18584","last_updated":"2026-05-16T01:08:46Z","snapshot_observed_at":"2026-08-02T09:38:59.455163Z","submitted_at":"2026-02-20T19:44:24Z","title":"GIST: Targeted Data Selection for Instruction Tuning via Coupled Optimization Geometry","version":2},"cited_work":{"arxiv_id":"2602.18584","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.18584","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gist: Targeted data selection for instruction tuning via coupled optimization geometry","venue":null,"work_id":"733260f5-ea03-4d30-8c32-f2ab4904797c","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2602.18584","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:17f9d54005a8e3be6b0e0413e6db54381dfb5839981df342cef8daffe57e1aa5","observation_id":"a905dfe8-60ad-4f01-b0b8-9e2672c4bc32","resolution":{"observed_at":"2026-05-20T00:02:09.973489Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prioritized training on points that are learnable, worth learning, and not yet learnt","venue":null,"work_id":"0a547c9e-3ef2-428b-acfd-c2d5705f4ec0","year":2022},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:ecd9bd8baad5574049d6e396a58a94d3aefbc429f3a9c258117b03379a9e6d3e","observation_id":"f6c7d58d-6019-43a6-b846-6efb17866f9e","resolution":{"observed_at":"2026-05-12T21:41:53.944323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01827","last_updated":"2020-11-16T20:58:39Z","snapshot_observed_at":"2026-08-04T18:52:13.934750Z","submitted_at":"2019-06-05T05:10:37Z","title":"Coresets for Data-efficient Training of Machine Learning Models","version":3},"cited_work":{"arxiv_id":"1906.01827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01827","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coresets for data-efficient training of machine learning models","venue":null,"work_id":"6294e816-3c4b-4eef-9b3b-147f58028f86","year":1906},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/1906.01827","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:12f374364d90c8abbd7c964db48561cf0477d38ee6240f2ed37ec4a49ceee493","observation_id":"0a5d0405-beb9-41cb-b4d1-f5a917ca9427","resolution":{"observed_at":"2026-05-12T02:51:17.970250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.01968","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Token cleaning: Fine-grained data selection for llm supervised fine-tuning","venue":null,"work_id":"816cb734-e04d-4872-aa7d-98e73ee0bd2b","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:e8c75ce74cde09aa25ac48c38a92c194706a52e2b823686456a4fe0282866e15","observation_id":"8b205f3b-d216-42c8-a6db-ef3ac152a9df","resolution":{"observed_at":"2026-05-12T02:51:18.016819Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trak: Attributing model behavior at scale","venue":null,"work_id":"1de78e94-1342-4474-a294-ee10cd8ae90a","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:a25b647846b8a2cbed799dae7d204b3e707c8722b8602960599ce71243fa613e","observation_id":"10ae2e7a-0f0a-454a-ba25-4ae2b7a90be4","resolution":{"observed_at":"2026-05-12T21:41:53.947558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep learning on a data diet: Finding important examples early in training","venue":null,"work_id":"52b6eb68-5384-4892-a52c-ecbb80cc92f2","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:607a6c0cf59c81125d37c063dcd9b3c7ed6b3917d0feb007bc8a728165183b68","observation_id":"7f7d7e2a-27b9-4665-afb5-401665cc1611","resolution":{"observed_at":"2026-05-12T21:41:53.999110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Elenberg, and Kilian Q","venue":null,"work_id":"a1120cd6-0664-4c48-b4d9-54561abcee53","year":2020},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:af068b44730e23bd36f125e558983421ac34a60503aaecbb1f80bad3c993c1fe","observation_id":"18e8a8f3-7825-4142-8ae1-6c78297437ac","resolution":{"observed_at":"2026-05-12T21:41:53.991347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08484","last_updated":"2020-11-14T18:47:35Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-19T22:40:32Z","title":"Estimating Training Data Influence by Tracing Gradient Descent","version":3},"cited_work":{"arxiv_id":"2002.08484","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.08484","snapshot_observed_at":"2026-07-04T06:19:38.875861Z","title":"Estimating training data influence by tracing gradient descent","venue":null,"work_id":"beaa9ade-a6e8-4faf-8499-42886e01db56","year":2020},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2002.08484","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:36ecb68f71100a5f3fec1dc3bb7f5d31a585d1cc63e344d42ded82841ef6571f","observation_id":"7b219f61-860f-454c-9ac9-fd13d30be752","resolution":{"observed_at":"2026-05-12T02:51:18.005919Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/120891009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A unified convergence analysis of block successive minimization methods for nonsmooth optimization.SIAM Journal on Optimization, 23(2):1126–1153","venue":"SIAM Journal on Optimization","work_id":"23e6ec39-89af-4de2-9517-69a2c630f332","year":2013},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:848f7eb02f467e051fe28b44b2a25898e6b209145c7a87fe3b25851c018932ea","observation_id":"412450fc-715a-42b9-ab7e-ca94b188c2d7","resolution":{"observed_at":"2026-05-12T02:51:16.881103Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cross-validatory choice and assessment of statistical predictions.Journal of the Royal Statistical Society: Series B, 36(2):111–133","venue":null,"work_id":"3c148753-b1f6-4f6e-a246-62f1b6a02e10","year":1974},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:8b1696f2700a8cf2a1cb13e2d14d4d4bdc4c13618bf21b069dac8f4d497d691d","observation_id":"cfc41f1b-e8b6-4813-b4a9-cfdaad71fc93","resolution":{"observed_at":"2026-05-12T21:41:53.995743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Challenging BIG- bench tasks and whether chain-of-thought can solve them","venue":null,"work_id":"e5326321-38d1-451e-b0d7-3758ca8d7a86","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:997b86900d0b3efbf5e2616b4d3c580e1a13f7df466579e4a622ef6d83af1b07","observation_id":"7ac239b7-7a80-48ce-a147-1664a63d74e3","resolution":{"observed_at":"2026-05-12T21:41:53.934482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10795","last_updated":"2020-10-15T05:53:46Z","snapshot_observed_at":"2026-07-06T09:57:57.267506Z","submitted_at":"2020-09-22T20:19:41Z","title":"Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamics","version":2},"cited_work":{"arxiv_id":"2009.10795","doi":"10.48550/arxiv.2009.10795","metadata_source":"arxiv_reference","pith_arxiv_id":"2009.10795","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Dataset cartography: Mapping and diagnosing datasets with training dynamics","venue":null,"work_id":"5d3a0f41-a608-4f69-9b29-c9878a39e907","year":2009},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2009.10795","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:3a157e763cfdfde04a46f94a950b2c3354273b1561d373b5b2f127719af15f09","observation_id":"f7a34262-8719-469a-b5f8-53118da239f6","resolution":{"observed_at":"2026-05-12T02:51:17.953969Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pereira, and William Bialek","venue":null,"work_id":"401d325d-953b-439e-87e6-d422bb36ea7e","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:032f1400bbc51e04561b2b4c3530a416bf9955669379d5983169b29ebe9ab296","observation_id":"aa237632-0a1f-40c9-888e-477518565ef0","resolution":{"observed_at":"2026-05-12T21:41:53.937784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-07-07T06:44:19.645435Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":"physics/0004057","doi":"10.48550/arxiv.physics/0004057","metadata_source":"pith","pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The information bottleneck method","venue":"physics.data-an","work_id":"72655a80-0724-45ad-a330-1f4ed7aa613b","year":2000},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:7947f95b678e6e8f19515913c836e3b075658f3f334389178602f8a916ff0be4","observation_id":"98ba71c5-21ef-4514-8d0f-a5a744976fb4","resolution":{"observed_at":"2026-05-12T02:51:17.961792Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-10T23:49:06.793856+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T23:49:06.793856+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05159","last_updated":"2019-11-15T17:08:30Z","snapshot_observed_at":"2026-08-01T06:33:25.731787Z","submitted_at":"2018-12-12T21:24:15Z","title":"An Empirical Study of Example Forgetting during Deep Neural Network Learning","version":3},"cited_work":{"arxiv_id":"1812.05159","doi":"10.48550/arxiv.1812.05159","metadata_source":"pith","pith_arxiv_id":"1812.05159","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An empirical study of example forgetting during deep neural network learning.arXiv preprint arXiv:1812.05159","venue":"cs.LG","work_id":"7d8ffe39-cf5a-4cb9-8835-8fc3f0984de1","year":2018},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/1812.05159","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:1e7377424c2b9f26879cba2e52fde3da8ae8346b0a9115c55fbdd04a6e762498","observation_id":"2a787acd-ce57-41ff-a65a-2d021b9411b7","resolution":{"observed_at":"2026-05-12T02:51:17.942694Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-11T02:19:28.595758+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T02:19:28.595758+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.00001","last_updated":"2026-05-12T19:39:47Z","snapshot_observed_at":"2026-08-02T04:22:12.793114Z","submitted_at":"2026-03-08T21:46:16Z","title":"Filter-then-Weight: Online Data Selection and Reweighting for LLM Fine-Tuning","version":2},"cited_work":{"arxiv_id":"2604.00001","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2604.00001","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"671b18f0-2ee2-423b-8e7b-9da755a0c816","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2604.00001","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:4892017f4dac009861d9b844fa81e9422290e5755f9dd239fe5c64316b5b0a08","observation_id":"ef2b1305-bf50-4b7f-a80e-f6648b1d58b9","resolution":{"observed_at":"2026-05-14T01:53:30.082707Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03875","last_updated":"2024-05-06T21:46:10Z","snapshot_observed_at":"2026-07-06T18:10:41.264712Z","submitted_at":"2024-05-06T21:46:10Z","title":"Rethinking Data Shapley for Data Selection Tasks: Misleads and Merits","version":1},"cited_work":{"arxiv_id":"2405.03875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.03875","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wang, Tianji Yang, James Zou, Yongchan Kwon, and Ruoxi Jia","venue":null,"work_id":"b62337d6-069d-4e87-be31-300cb2520321","year":2024},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2405.03875","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:650dca04eb0d5904fec11bb0b5fc25540876f2d05415595facb951b0e7c76e15","observation_id":"99f83dce-fa0c-4e6f-b50f-591883c86ea1","resolution":{"observed_at":"2026-05-12T02:51:17.937391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NICE data selection for instruction tuning in LLMs with non-differentiable evaluation metric","venue":null,"work_id":"40c5fd47-4c87-4291-9921-d493e01bfa17","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:da6b1a0a9935717a012acf93da2fc42ec9bea9cbb84a2f7cc3ce04e4c7d34a70","observation_id":"b80e5662-ede8-48f9-b1c2-85b4748776de","resolution":{"observed_at":"2026-05-12T21:41:53.941250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Opus: Towards efficient and principled data selection in large language model pre-training in every iteration","venue":null,"work_id":"a7a6d7e0-50fd-49ab-bf67-a58fef728a91","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:4d967a7b75a4214adcf8f2593b2c5354b29338a861aa032216403c948fc7de38","observation_id":"93e81444-66fd-497f-9b4b-a6ce3377e04d","resolution":{"observed_at":"2026-05-12T21:41:53.922890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.05400","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T07:09:37.425592Z","title":"Opus: Towards efficient and principled data selection in large language model pre-training in every iteration.arXiv preprint arXiv:2602.05400,","venue":null,"work_id":"d94ebb37-ab83-4192-87a3-6609d6e9274c","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:782d702aefcf2058ae85e4a43fb382e7cfcec9a079d37093fd1fcd4b196d76b0","observation_id":"386f51ec-97b6-4204-a38b-d35b8b58c7dd","resolution":{"observed_at":"2026-05-12T02:51:17.972849Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Smith, Iz Beltagy, and Hannaneh Ha- jishirzi","venue":null,"work_id":"1496e2a4-f87f-4e5c-81e0-1169e1a6f2a9","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:b75d8e8e9b8845a5b8c190bcffc8e96bb224016f7138f61691bad283b13bddf9","observation_id":"50061784-a9f4-4f8a-8302-aa1267f7a6a3","resolution":{"observed_at":"2026-05-12T21:41:53.927701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.04751","last_updated":"2023-10-30T20:36:20Z","snapshot_observed_at":"2026-08-04T08:05:09.732049Z","submitted_at":"2023-06-07T19:59:23Z","title":"How Far Can Camels Go? Exploring the State of Instruction Tuning on Open Resources","version":2},"cited_work":{"arxiv_id":"2306.04751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.04751","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2306.04751 , year=","venue":null,"work_id":"be09ac68-3260-4c2f-bfcb-1ae1b5717468","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2306.04751","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:e79a63dc8b79b439415193d9ed4638fd138eb2da3fbba1bc7acc4864a5f63614","observation_id":"ea83bfc2-937b-4abe-898d-68f7f85fbc0d","resolution":{"observed_at":"2026-05-12T02:51:17.945367Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.15706","last_updated":"2026-04-17T05:27:03Z","snapshot_observed_at":"2026-07-06T23:03:12.000381Z","submitted_at":"2026-04-17T05:27:03Z","title":"Target-Oriented Pretraining Data Selection via Neuron-Activated Graph","version":1},"cited_work":{"arxiv_id":"2604.15706","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.15706","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Target-Oriented Pretraining Data Selection via Neuron-Activated Graph","venue":"cs.CL","work_id":"2048a2e0-7ed8-4db3-96b8-ee3d7ef92d93","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2604.15706","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:b6351bb0624571ac154379075d8a562ea0cfddf95068e21c6330dd4dbc8c6ec2","observation_id":"f6dec4c3-cddf-40d1-b8b5-e67e8a9dd5d9","resolution":{"observed_at":"2026-05-12T02:51:17.948436Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":"2201.11903","doi":"10.48550/arxiv.2201.11903","metadata_source":"pith","pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","venue":"cs.CL","work_id":"d1cf6693-a082-403c-ada9-dac7b96341f9","year":2022},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:92b86322738ed0c2cf49239cf9caa22a991e775bbe6f96b5aad37df77b76ea33","observation_id":"534b4af5-bbbc-45c1-8c5a-676039adec16","resolution":{"observed_at":"2026-05-12T02:51:18.008422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-04T01:08:13.648188+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T01:08:13.648188+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00631","last_updated":"2025-08-29T17:58:46Z","snapshot_observed_at":"2026-08-02T11:20:30.801285Z","submitted_at":"2024-12-01T01:01:09Z","title":"ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning","version":2},"cited_work":{"arxiv_id":"2412.00631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00631","snapshot_observed_at":"2026-07-03T08:17:45.521021Z","title":"Rose: A reward-oriented data selection framework for llm task-specific instruction tuning","venue":null,"work_id":"53aca014-fe23-4902-b583-13e3829df3d8","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2412.00631","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:404a106271be5f9db9e161c1dba71449dd29711135070c35baa41751c8d65e05","observation_id":"50e43d54-8a0d-4742-8df3-5a3e9045f193","resolution":{"observed_at":"2026-05-12T02:51:17.982139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04333","last_updated":"2024-06-13T03:42:02Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:18:04Z","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","version":3},"cited_work":{"arxiv_id":"2402.04333","doi":"10.48550/arxiv.2402.04333","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.04333","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Less: Selecting influential data for targeted instruction tuning","venue":"arXiv (Cornell University)","work_id":"74caee8c-a05c-4b22-ab43-b144f71fcf6d","year":2024},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2402.04333","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:762c1617a0a91aa5dad86756962bf25d5ddb3665486d884ceb3ff1686e980e65","observation_id":"b0c16eca-6102-4996-a681-820d1221266b","resolution":{"observed_at":"2026-05-12T02:51:17.987635Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.21492","last_updated":"2026-07-18T04:56:29Z","snapshot_observed_at":"2026-08-04T06:06:14.689327Z","submitted_at":"2026-02-25T01:54:50Z","title":"GradAlign: Gradient-Aligned Data Selection for LLM Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2602.21492","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.21492","snapshot_observed_at":"2026-07-21T02:19:50.278133Z","title":"Gradalign: Gradient- aligned data selection for llm reinforcement learning","venue":null,"work_id":"6065f26b-88c5-4051-961a-66267193ebdd","year":2026},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2602.21492","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:aa589939fe3c9ad075547fa38b89156a51a3ca1c6b5e7f29c76097923cb845dd","observation_id":"fd11cc83-5644-444b-8e23-e9e73db2f544","resolution":{"observed_at":"2026-07-21T02:19:50.278133Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.1.17625","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey on data selection for llm instruction tuning.Journal of Artificial Intelligence Research, 83, August 2025","venue":"Journal of Artificial Intelligence Research","work_id":"4b931d12-bbea-451f-ad66-d35df8169615","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:f5dc6cea2675929845b22c63077dd2c73b59d0f625ed07e6fedf8c6c5a67dbf3","observation_id":"33b79aed-cb0e-4fa3-b8f7-9abd423bfbb7","resolution":{"observed_at":"2026-05-12T02:51:16.883470Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.04194","doi":"10.48550/arxiv.2502.04194","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The best instruction-tuning data are those that fit.arXiv preprint arXiv:2502.04194","venue":"ArXiv.org","work_id":"f4126c17-c6f1-42b4-9fd7-c235e470f335","year":2025},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:29d1d497d02c22425e11342c8da16e1cb793f9ef42952f25957bd102a4fd0823","observation_id":"ce182efa-e63e-4d71-8e0c-fe0328ed797b","resolution":{"observed_at":"2026-05-12T02:51:17.979199Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards understanding valuable preference data for large language model alignment","venue":null,"work_id":"e8d507a4-07d0-4c86-bcda-431d2fd4d3f8","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:51c3f9bb49b0d516730654babf64a9998969cda4fdeecc2fce589768e5efa279","observation_id":"52f451f4-764b-466b-8809-82ec785e932a","resolution":{"observed_at":"2026-05-12T21:41:53.918387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.13212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"82a0e4cb-8e2d-422e-85d6-076fc7701534","year":null},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:14f47f24b36b47bb4aef1b08edb29605df7cc2614264bf5a4bfa9aa6e762b270","observation_id":"710c3456-92e4-4ece-afc8-34f9efceb7b3","resolution":{"observed_at":"2026-05-12T02:51:17.956490Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11206","last_updated":"2023-05-18T17:45:22Z","snapshot_observed_at":"2026-07-06T15:29:24.259073Z","submitted_at":"2023-05-18T17:45:22Z","title":"LIMA: Less Is More for Alignment","version":1},"cited_work":{"arxiv_id":"2305.11206","doi":"10.48550/arxiv.2305.11206","metadata_source":"pith","pith_arxiv_id":"2305.11206","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LIMA: Less Is More for Alignment","venue":"cs.CL","work_id":"3986a077-ad54-4cba-bd8f-914fe1862115","year":2023},"citing_paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-12T02:47:55.649231Z"},"links":{"cited_paper":"/paper/2305.11206","citing_paper":"/paper/2605.09404"},"observation_digest":"sha256:c3a8e2314af89fbbed0bd6bc152567b7a04590f2224a5367ed33bb7824328564","observation_id":"be7c49e5-d3fe-44a6-adc1-bb2135d9cc02","resolution":{"observed_at":"2026-05-17T11:34:13.088019Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.09404","last_updated":"2026-05-10T08:07:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:21:30.897592Z","submitted_at":"2026-05-10T08:07:09Z","title":"Let the Target Select for Itself: Data Selection via Target-Aligned Paths"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":2,"verified_exact":29,"verified_fuzzy":24},"total_outbound_references":59},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2605.09404."}