{"as_of":"2026-08-08T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36c4d102cbcfd73c48709d99e681f2c1d2b032b22aebb797aa89a18969bea1d4","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:33:55.702118Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T09:19:39.848194Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T09:21:21.452805Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"cited_work":{"arxiv_id":"2505.14826","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14826","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Openrubrics: Contrastive rubric generation for reward models","venue":null,"work_id":"dbfdba3c-b9fd-40f4-96a5-f046ab58a177","year":2025},"citing_paper":{"arxiv_id":"2605.17602","last_updated":"2026-05-20T20:58:48Z","snapshot_observed_at":"2026-08-02T06:34:30.012151Z","submitted_at":"2026-05-17T19:00:44Z","title":"AutoRubric-T2I: Robust Rule-Based Reward Model for Text-to-Image Alignment","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T12:11:23.775843Z"},"links":{"cited_paper":"/paper/2505.14826","citing_paper":"/paper/2605.17602"},"observation_digest":"sha256:fc6107422a15d72afcc730ea8d1eb7bb37f5b70dfbf9cfbf06f794e895b86bd4","observation_id":"6834289c-1c52-4239-8fce-1a850878b6aa","resolution":{"observed_at":"2026-05-20T12:13:16.128122Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"cited_work":{"arxiv_id":"2505.14826","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14826","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Openrubrics: Contrastive rubric generation for reward models","venue":null,"work_id":"dbfdba3c-b9fd-40f4-96a5-f046ab58a177","year":2025},"citing_paper":{"arxiv_id":"2605.17602","last_updated":"2026-05-20T20:58:48Z","snapshot_observed_at":"2026-08-02T06:34:30.012151Z","submitted_at":"2026-05-17T19:00:44Z","title":"AutoRubric-T2I: Robust Rule-Based Reward Model for Text-to-Image Alignment","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T09:19:39.848194Z"},"links":{"cited_paper":"/paper/2505.14826","citing_paper":"/paper/2605.17602"},"observation_digest":"sha256:0132cff27eeeb9e6048e0fd67446ec9aed377ca052608219a6042def1cc24471","observation_id":"db9b8703-7e0e-4549-9708-3d3e6b5dc41b","resolution":{"observed_at":"2026-05-22T09:21:21.457051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14826/citation-record","integrity":"/paper/2505.14826/integrity","json":"/paper/2505.14826/citation-record.json","paper":"/paper/2505.14826"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:49.231262Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:49.231262Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:d31563020eda94215c644d88f26108f4a77ac4cd1fdd064fbc047cc720ed8df7","observation_id":"dcdd67a7-9a4f-48fe-a4fb-2511c49dbc64","resolution":{"observed_at":"2026-08-07T15:33:49.231262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.09540","last_updated":"2023-03-22T17:22:35Z","snapshot_observed_at":"2026-08-06T15:07:40.203199Z","submitted_at":"2023-03-16T17:53:24Z","title":"SemDeDup: Data-efficient learning at web-scale through semantic deduplication","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.09540","snapshot_observed_at":"2026-08-07T15:33:49.406344Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:49.406344Z"},"links":{"cited_paper":"/paper/2303.09540","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:06f241a0dffed49de98058c418318f7660f9906cb301f8b3d81f6f6e69a4e23d","observation_id":"424a77be-2830-4c67-badd-cb43a352dbb6","resolution":{"observed_at":"2026-08-07T15:33:49.406344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:03.706146Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"6bb80ee6-8931-4367-adaa-ee8bb3ecd17e","year":2011},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:49.527948Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:fa0fe11839e0e155ec8da88762917f0624eada8a8cfc37e93bf6ffa5dfce241e","observation_id":"b7fa811c-abfe-4f18-866b-5bcee96213db","resolution":{"observed_at":"2026-08-07T15:34:03.803499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:03.458211Z","title":"P., and Wunder, M","venue":null,"work_id":"82dde7aa-f74d-40a8-bbbe-e03a5e769cb4","year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:49.736418Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:a7a7ac999c753f7813ff941ef17f6f43a29e69be8352de4060c04ec5932d440f","observation_id":"9d299939-1bc1-4683-bf7a-e12260681d37","resolution":{"observed_at":"2026-08-07T15:34:03.580345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:03.161123Z","title":null,"venue":null,"work_id":"11ab7d0e-609f-415f-a2d6-5072ef651fbb","year":2009},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:49.868934Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:cc4fc2d8242667100448242a127dc48cb6e66786d178d7f0ddf0b3bb8be13135","observation_id":"10456815-691d-4ac8-8d51-eb7b5e19b2cf","resolution":{"observed_at":"2026-08-07T15:34:03.320041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:02.932696Z","title":"Pattern Recognition and Machine Learning","venue":null,"work_id":"7a3117c5-00ca-4b04-89ba-4ef36087816c","year":2006},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.045825Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:44a961ef80fb816618073b59e1be78bf0315cbd7c53f3adcc6c9248a07bb2012","observation_id":"2b3129c8-81ee-493d-ab6c-ba184d858840","resolution":{"observed_at":"2026-08-07T15:34:03.036966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-07T15:33:50.215979Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.215979Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:6912cbef7629f286e672bcd5ce373c4f7a525a949186c10d67ea732765d979d2","observation_id":"440e0be3-022f-4413-ace6-9fee82a33c73","resolution":{"observed_at":"2026-08-07T15:33:50.215979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:02.688064Z","title":"Coresets via bilevel optimization for continual learning and streaming","venue":null,"work_id":"87e36be6-4346-4b68-9d7a-a7e149b570c8","year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.317302Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:88d149152a8dad1642e9ba05460d20a2c6f3c1dfcc3f2b697aa67445c70837cd","observation_id":"a2b9c314-426e-4062-9f3f-45f48fb1accc","resolution":{"observed_at":"2026-08-07T15:34:02.789773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:02.374922Z","title":null,"venue":null,"work_id":"dd09257d-ac5d-4c82-ba41-4a274fd089e8","year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.422295Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:0e9fa43379625576e9f901b1dd39daa88e83485bd09906f294815119b1e58b5e","observation_id":"b21aa86a-3b3f-44c6-bf34-cd3a21d39834","resolution":{"observed_at":"2026-08-07T15:34:02.506276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1203.3472","last_updated":"2012-03-15T11:17:56Z","snapshot_observed_at":"2026-07-06T02:44:38.546504Z","submitted_at":"2012-03-15T11:17:56Z","title":"Super-Samples from Kernel Herding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1203.3472","snapshot_observed_at":"2026-08-07T15:33:50.595074Z","title":"Super-samples from kernel herding","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.595074Z"},"links":{"cited_paper":"/paper/1203.3472","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:9f0d2ebef37a766c4a2bf4abf4019ade20d0a7f3c2b0e8d4a6a3272f3a28a31f","observation_id":"43649b05-d5d4-46ca-a0c7-d1c2ffd0d77f","resolution":{"observed_at":"2026-08-07T15:33:50.595074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:02.132321Z","title":"M., Haussmann, E., and Fardet, E","venue":null,"work_id":"3365b95d-149f-4e4a-8bb1-dcab7084ef56","year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.784785Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:23af116bc848be173a5ecc2bf780afc36b08512421809907ad3bc6ee8b38631e","observation_id":"a0f747e9-5d66-46c1-b1db-1038e62a893a","resolution":{"observed_at":"2026-08-07T15:34:02.258315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:50.927740Z","title":"and Shrivastava, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:50.927740Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:0cfb0479c398c1865a4897f150fc606e0147aa54bfab64e7c597bb87ebf2fb16","observation_id":"14c92296-4c4d-42b5-8064-04250ade4892","resolution":{"observed_at":"2026-08-07T15:33:50.927740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:01.896777Z","title":"Selection via proxy: Efficient data selection for deep learning","venue":null,"work_id":"92405dbd-ffde-4b9e-af4c-c03c24ea5be2","year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.076260Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:d1cb58aa1415b5966a5e7b4a5959ffc31d83f4cb0b5f03c63532afa27f7213fa","observation_id":"65ea28c3-3bc3-459f-84d4-69e99929c55e","resolution":{"observed_at":"2026-08-07T15:34:02.038794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10500","last_updated":"2025-06-07T16:03:51Z","snapshot_observed_at":"2026-07-06T17:31:00.274878Z","submitted_at":"2024-02-16T08:19:34Z","title":"Active Preference Optimization for Sample Efficient RLHF","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10500","snapshot_observed_at":"2026-08-07T15:33:51.144721Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.144721Z"},"links":{"cited_paper":"/paper/2402.10500","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:d30255041072f3e7d9cfb8a696ed8cbeb03b1d884fd1043a400dd226c5f494a5","observation_id":"fc84104b-b3ff-4fd6-aee8-135c2a4557f2","resolution":{"observed_at":"2026-08-07T15:33:51.144721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:01.644501Z","title":"and Zhang, C","venue":null,"work_id":"9f3d868c-d715-4231-8318-1c47b882ac64","year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.262928Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:8ea11aacd829662b175422237e165c63c5f62974c8aec2bc1f5ea5f92a552647","observation_id":"66056af6-47f9-4bbb-b5bb-6a1465fbfc34","resolution":{"observed_at":"2026-08-07T15:34:01.745072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:01.361540Z","title":"On the mathematical foundations of theoretical statistics","venue":null,"work_id":"4f91b349-1670-4b8d-bd74-e6d2eddf920b","year":1922},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.401001Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:bbe46ad3fca2f64406025418e64dabc3ddd06a492ebbc7bbfaf29ebd212659ef","observation_id":"7de814da-df92-4acb-bb0f-ea1e5cc4ea01","resolution":{"observed_at":"2026-08-07T15:34:01.466564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.5638","last_updated":"2014-06-21T17:55:54Z","snapshot_observed_at":"2026-07-06T03:46:58.247552Z","submitted_at":"2014-06-21T17:55:54Z","title":"Minimax-optimal Inference from Partial Rankings","version":1},"cited_work":{"arxiv_id":"1406.5638","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.5638","snapshot_observed_at":"2026-08-07T15:33:56.514104Z","title":"Minimax-optimal Inference from Partial Rankings","venue":"stat.ML","work_id":"656d1653-4a2a-4a80-9048-c16d56bb3eb1","year":2014},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.500852Z"},"links":{"cited_paper":"/paper/1406.5638","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:3f1b7d3109645388911ab095a7b890fb86a2a99410f5d89280332fb291c92a9a","observation_id":"3b88b5e0-1bfd-4e8f-b11c-5dd4c87ee52b","resolution":{"observed_at":"2026-08-07T15:33:56.609259Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:51.671297Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.671297Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:2c530293dfa8e9341a6586ab8752e7283a06e5e5ab00e0b8780e0d382b1c01d9","observation_id":"c516dfb3-4f8d-464c-ad70-4383042b3d25","resolution":{"observed_at":"2026-08-07T15:33:51.671297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:01.097094Z","title":"LoRA : Low-rank adaptation of large language models","venue":null,"work_id":"2ff02256-84f7-4bbb-aca5-47bed79ed973","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.777301Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:a9522396e6fc497bea5310bd6e613a297a1bb597edc66e4dd061ce4e02dff43b","observation_id":"e9950644-7869-4f40-9e56-0798500eed05","resolution":{"observed_at":"2026-08-07T15:34:01.254404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:51.858503Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.858503Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:860aae80aa1a126648b97af6d775f59a7aca8122b883a1bb571a771c7eb8e6b6","observation_id":"f930385d-710a-4e19-88fa-ecf1990b1214","resolution":{"observed_at":"2026-08-07T15:33:51.858503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:00.782770Z","title":"and Liberty, E","venue":null,"work_id":"48ca16d0-dd6f-449e-800b-6b5d34be9583","year":1975},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:51.923206Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:c15ba82e7eee4a3a99cbf534aa796ebb0401dabb1d7a2e99c31031faaf07f61e","observation_id":"20223e23-d6a5-494f-b997-e27c74baff71","resolution":{"observed_at":"2026-08-07T15:34:00.933462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:00.558857Z","title":"char-rnn","venue":null,"work_id":"0da7fee1-cdc7-47f5-82bf-82eb1dba3f29","year":2015},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.053201Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:0dadbb02ffc95381d10fb0f79fae91e681b01701926d11008cba12baad042a60","observation_id":"288ac579-d70f-4519-a0cf-39f96417ac91","resolution":{"observed_at":"2026-08-07T15:34:00.669480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:00.332240Z","title":"and Szepesvari, C","venue":null,"work_id":"83854ee3-bd95-4f9e-ba20-c1df24d9df32","year":2019},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.168727Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:9e4aa2e276cea3cd42c60cdf5d88c5b01729229c47717ad2570af6b88d98493b","observation_id":"3dc3c016-1e45-4bd0-9568-9e1fa1bc6a41","resolution":{"observed_at":"2026-08-07T15:34:00.446532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13840","last_updated":"2025-07-02T21:53:51Z","snapshot_observed_at":"2026-08-08T13:14:53.069676Z","submitted_at":"2023-06-24T02:25:56Z","title":"Beyond Scale: The Diversity Coefficient as a Data Quality Metric for Variability in Natural Language Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.13840","snapshot_observed_at":"2026-08-07T15:33:52.314478Z","title":"Beyond scale: The diversity coefficient as a data quality metric demonstrates llms are pre-trained on formally diverse data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.314478Z"},"links":{"cited_paper":"/paper/2306.13840","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:af57625e1eac365a7ef282728458dcdb5c95c1da5de72c8ed56baddd55904aca","observation_id":"c632ca69-546e-4b6a-86ea-8a88854e1ca4","resolution":{"observed_at":"2026-08-07T15:33:52.314478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:34:00.003039Z","title":"Deduplicating training data makes language models better","venue":null,"work_id":"10a7797a-7955-4af4-bb4e-e47b4ec3c9ea","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.460469Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:3e8ad3df21acb3653ab4c127adbc8a35efdcc27f023867d6ddab43e81ed4fe6e","observation_id":"c715a6c3-925b-4021-87a9-c8303ad1fe6d","resolution":{"observed_at":"2026-08-07T15:34:00.165111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02504","last_updated":"2024-12-31T01:36:40Z","snapshot_observed_at":"2026-07-06T19:27:03.209340Z","submitted_at":"2024-10-03T14:09:58Z","title":"Dual Active Learning for Reinforcement Learning from Human Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02504","snapshot_observed_at":"2026-08-07T15:33:52.622227Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.622227Z"},"links":{"cited_paper":"/paper/2410.02504","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:ca10373b71eab7b4baa630314a0505b63ec2a1ba9ef4b496b32c666e27b51a99","observation_id":"11e2c045-38c1-4fd7-85f6-88d51aca9b29","resolution":{"observed_at":"2026-08-07T15:33:52.622227Z","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-07T15:33:52.795149Z","title":"Peft: State-of-the-art parameter-efficient fine-tuning methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.795149Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:48d779f03fdfb9b68a62cdd3238ca6c38d8a7612b9a7de399caea81dece98121","observation_id":"df986964-b692-4a24-92f0-95cb5c07d13a","resolution":{"observed_at":"2026-08-07T15:33:52.795149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05922","last_updated":"2022-04-27T18:25:19Z","snapshot_observed_at":"2026-07-06T11:56:56.738395Z","submitted_at":"2021-10-12T12:09:59Z","title":"Trivial or impossible -- dichotomous data difficulty masks model differences (on ImageNet and beyond)","version":3},"cited_work":{"arxiv_id":"2110.05922","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.05922","snapshot_observed_at":"2026-08-07T15:33:56.248380Z","title":"Trivial or impossible -- dichotomous data difficulty masks model differences (on ImageNet and beyond)","venue":"cs.CV","work_id":"072f2a80-32f2-41ed-842b-259a546151d8","year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:52.929278Z"},"links":{"cited_paper":"/paper/2110.05922","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:15b0f921deb1c5221d28453207ef8f2fee7389c34d6553a3e83fdaa4a914fd2a","observation_id":"79fcef58-9e46-4540-ac9f-6617a2db6e4d","resolution":{"observed_at":"2026-08-07T15:33:56.330976Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:59.748200Z","title":"S., and Dean, J","venue":null,"work_id":"f7e8abe8-c168-4029-a6a8-363619c48ee3","year":2013},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.004777Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:ba96f8cb6a188de9ec6d4cbbe0bab394576ebf717f51ec003cec911563a7e9c3","observation_id":"b7cd40f1-9e20-4086-b05c-5f5af4492c3e","resolution":{"observed_at":"2026-08-07T15:33:59.839731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:59.547104Z","title":"Prioritized training on points that are learnable, worth learning, and not yet learnt","venue":null,"work_id":"8cfc4642-6c92-446a-a106-d11aeec9e2db","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.114717Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:27c67aefb853ba6c20e51632268ed4e5e3ba0c708b685ef9f08967898eaf38ed","observation_id":"1e9e8a58-a9c4-46ae-af55-da9d1fdc3dad","resolution":{"observed_at":"2026-08-07T15:33:59.642934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10623","last_updated":"2023-09-05T16:34:10Z","snapshot_observed_at":"2026-07-06T15:29:01.076710Z","submitted_at":"2023-05-18T00:21:04Z","title":"The star-shaped space of solutions of the spherical negative perceptron","version":2},"cited_work":{"arxiv_id":"2305.10623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.10623","snapshot_observed_at":"2026-08-07T15:33:56.051142Z","title":"The star-shaped space of solutions of the spherical negative perceptron","venue":"cond-mat.dis-nn","work_id":"96f60eb0-0848-4622-9f32-ad974b8d0a8d","year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.224174Z"},"links":{"cited_paper":"/paper/2305.10623","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:f3854699b7fdb6e5671f8f2f7741c6fd061572e6dde5bf3b16b667fc64e0a136","observation_id":"572be791-6b49-425e-bb1c-fa4610de8ccf","resolution":{"observed_at":"2026-08-07T15:33:56.128852Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:59.294114Z","title":"Optimal design for human preference elicitation","venue":null,"work_id":"1ab9d91d-07e3-421f-add4-c53a6de14252","year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.335769Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:f2e926929e0058901387be6b135644fa695ea5ac88272cbaa08f64c3b9f54778","observation_id":"4cc89c8e-a620-4d37-8b83-0ff9f53369c6","resolution":{"observed_at":"2026-08-07T15:33:59.435562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:59.062331Z","title":"L., Wolsey, L","venue":null,"work_id":"9b695d27-4d9d-40f4-b140-19cc44127a7c","year":1978},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.417518Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:8b609e952ca5aa7a92bb5e2a4650953d72349bdedc7ef17bc9f249c701454511","observation_id":"de061543-acf5-46c6-9b9d-8f06fc21807a","resolution":{"observed_at":"2026-08-07T15:33:59.171920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:58.855002Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":"91d0a6b1-3c10-4164-8892-7d9d4dd4a007","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.541745Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:4efd52cb50c11750f315c08de5263a59ed17828bf76396363279cf49f33cb045","observation_id":"77fca0d3-9b9e-4280-b16c-95e8b1e666e1","resolution":{"observed_at":"2026-08-07T15:33:58.951173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:58.566036Z","title":null,"venue":null,"work_id":"6dbbcc57-71c4-4a80-a3a8-87e6a3c299f2","year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.646729Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:2c7e8f825debc3c7622b5fc0090da80e70c0fcdd59ac6243eacc5931d2fe553d","observation_id":"b6fea7d4-6d13-46f5-8e20-86f44525c2f7","resolution":{"observed_at":"2026-08-07T15:33:58.699653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:58.269514Z","title":null,"venue":null,"work_id":"049a503b-ae67-4c06-a92a-aee4305748ce","year":2017},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.761624Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:6eba00b69d87472d8d23c183c5abd4c93aec6cb52c8c33f8582450510d869a8d","observation_id":"13517ba4-ba3e-442a-81ae-5d12ae33a063","resolution":{"observed_at":"2026-08-07T15:33:58.416602Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:58.016125Z","title":"Optimal Design of Experiments, volume 50 of Classics in Applied Mathematics","venue":null,"work_id":"4ab6c3a6-1cc1-46c6-885c-cdca657ea22b","year":2006},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.841150Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:079a0bac46f5da4cc869e01aa6768c1164c7d8f9ba5f1292982bea86e1e16c09","observation_id":"9d6e6a10-bf62-4d2e-99a2-a92d521ce1e2","resolution":{"observed_at":"2026-08-07T15:33:58.108840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:57.789747Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":"5a493a43-1a12-46f1-b104-66ae12de8695","year":2019},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:53.968315Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:46857fc6707b8a68f09a39337bd5639d54ddc0ce1b87a1b2b34b06dee65f62fd","observation_id":"94379257-47b7-4a15-8c47-503f79d20f98","resolution":{"observed_at":"2026-08-07T15:33:57.859146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:57.642663Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":"4b1f848d-12d2-4399-bda1-f6dbe08b48ea","year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.059317Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:94a12a96f76f0ef28ad282124b14070b56050cdc7f10114314ee766c8bf93f61","observation_id":"db80c7d6-3f9c-4ad1-8d2e-e5bff9fed775","resolution":{"observed_at":"2026-08-07T15:33:57.718365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.04984","last_updated":"2021-07-11T07:00:19Z","snapshot_observed_at":"2026-08-03T02:19:12.379007Z","submitted_at":"2021-07-11T07:00:19Z","title":"SVP-CF: Selection via Proxy for Collaborative Filtering Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.04984","snapshot_observed_at":"2026-08-07T15:33:54.228168Z","title":"SVP - CF : Selection via proxy for collaborative filtering data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.228168Z"},"links":{"cited_paper":"/paper/2107.04984","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:63885255667a36c871e4e7a9ad84605c86efb4b44ee270e874b8b029de19fdfc","observation_id":"05c8e0f8-fa83-4633-9b7b-aa91d74cacef","resolution":{"observed_at":"2026-08-07T15:33:54.228168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09668","last_updated":"2024-02-15T02:27:57Z","snapshot_observed_at":"2026-08-07T11:18:58.227690Z","submitted_at":"2024-02-15T02:27:57Z","title":"How to Train Data-Efficient LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09668","snapshot_observed_at":"2026-08-07T15:33:54.356737Z","title":"H., Caverlee, J., and Cheng, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.356737Z"},"links":{"cited_paper":"/paper/2402.09668","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:2270abb2f0ef37568b64ecf3d5991086e111f0e34b6bce5a4f1d724538649556","observation_id":"75691a37-0af0-4eb6-8cbb-6578d75e4297","resolution":{"observed_at":"2026-08-07T15:33:54.356737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17055","last_updated":"2024-10-23T12:55:39Z","snapshot_observed_at":"2026-08-03T19:40:12.558709Z","submitted_at":"2024-10-22T14:36:44Z","title":"Optimal Design for Reward Modeling in RLHF","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17055","snapshot_observed_at":"2026-08-07T15:33:54.491558Z","title":"Optimal design for reward modeling in RLHF","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.491558Z"},"links":{"cited_paper":"/paper/2410.17055","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:3f3f505abb18451627260abef9ce5cfaa9a03dd343e83595b1c193530b091fef","observation_id":"c58e1577-1621-4ef2-9eb0-c87452a42a56","resolution":{"observed_at":"2026-08-07T15:33:54.491558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:57.485139Z","title":null,"venue":null,"work_id":"af13120f-136f-4132-80eb-55106f388bca","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.652169Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:1765caf355b73b56925a458c7604eb76d5121888b5e0012224943f37b637a13c","observation_id":"f9715298-d517-417e-b192-2b2340faf1e2","resolution":{"observed_at":"2026-08-07T15:33:57.554704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:57.350384Z","title":"and Yang, M","venue":null,"work_id":"a8ed7309-a69e-486f-b8fb-f2208e69d991","year":2012},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.730925Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:ebaea21530c5d87dc53eaf08250ef371d5fe6b67ad8e9624e37e9d5f99af570a","observation_id":"16d7da80-b2c7-4f87-8fec-eb8b86ae27cc","resolution":{"observed_at":"2026-08-07T15:33:57.419423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19396","last_updated":"2024-12-27T01:10:17Z","snapshot_observed_at":"2026-08-07T16:49:17.391873Z","submitted_at":"2024-12-27T01:10:17Z","title":"Comparing Few to Rank Many: Active Human Preference Learning using Randomized Frank-Wolfe","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19396","snapshot_observed_at":"2026-08-07T15:33:54.880840Z","title":"Comparing few to rank many: Active human preference learning using randomized Frank-Wolfe","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:54.880840Z"},"links":{"cited_paper":"/paper/2412.19396","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:9eae348ecc6b5874f3e1ea43ce0e680cd5bb012f809bc568844d90274da4fe67","observation_id":"64413cef-0d91-4807-9ca8-f8e52ee96539","resolution":{"observed_at":"2026-08-07T15:33:54.880840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12284","last_updated":"2023-08-23T17:58:14Z","snapshot_observed_at":"2026-08-02T00:26:43.445762Z","submitted_at":"2023-08-23T17:58:14Z","title":"D4: Improving LLM Pretraining via Document De-Duplication and Diversification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12284","snapshot_observed_at":"2026-08-07T15:33:55.009360Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.009360Z"},"links":{"cited_paper":"/paper/2308.12284","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:d88707c782896344d14127eda20c44f47aa8020f27ddb32bf59f4e842344385d","observation_id":"cc034977-d9fb-489d-9ff7-ad39c71ea6ce","resolution":{"observed_at":"2026-08-07T15:33:55.009360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:57.112991Z","title":"On coresets for support vector machines","venue":null,"work_id":"e4fcac4a-5bbd-402a-a80e-e7e3fa919121","year":2021},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.132746Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:53524e629e5c9086403e975771edabb5ea242f8bf5d874f4fa1c70ddb77c1fbe","observation_id":"f0bc88ca-ac6d-4833-9c01-9e5f391100cd","resolution":{"observed_at":"2026-08-07T15:33:57.238907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:33:56.913069Z","title":"W., Lester, B., Du, N., Dai, A., and Le, Q","venue":null,"work_id":"5d759157-0d93-4540-84b3-1dcff4a1691f","year":2022},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.280820Z"},"links":{"citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:04d5ff15e64138a473a829834accbe8245868bf45a7977f41c9f1bb4dd5612ce","observation_id":"0b35729e-5db2-4b13-8ab3-097ecd82dbef","resolution":{"observed_at":"2026-08-07T15:33:57.000752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.00359","last_updated":"2019-11-15T00:03:54Z","snapshot_observed_at":"2026-07-06T08:34:04.911718Z","submitted_at":"2019-11-01T13:09:28Z","title":"CCNet: Extracting High Quality Monolingual Datasets from Web Crawl Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.00359","snapshot_observed_at":"2026-08-07T15:33:55.441839Z","title":"Ccnet: Extracting high quality monolingual datasets from web crawl data","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.441839Z"},"links":{"cited_paper":"/paper/1911.00359","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:21b7e0480184cf2e30acb8d12ab8cda41f05c84a9a374164f9bf6a549dbd129f","observation_id":"253f9be1-f33b-44e4-8048-6bebdc1a3247","resolution":{"observed_at":"2026-08-07T15:33:55.441839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-07T15:33:55.546557Z","title":"L., Gugger, S., Drame, M., Lhoest, Q., and Rush, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.546557Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:1cfdf01fedfc3308b8ce4fb87af8499b7e9dda9d66c6785a66ba0761807fb946","observation_id":"de0b357e-c288-41aa-af0f-e59281d439fe","resolution":{"observed_at":"2026-08-07T15:33:55.546557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11270","last_updated":"2024-02-08T04:16:52Z","snapshot_observed_at":"2026-07-06T14:45:00.730733Z","submitted_at":"2023-01-26T18:07:21Z","title":"Principled Reinforcement Learning with Human Feedback from Pairwise or $K$-wise Comparisons","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11270","snapshot_observed_at":"2026-08-07T15:33:55.702118Z","title":"Principled reinforcement learning with human feedback from pairwise or K -wise comparisons","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:33:55.702118Z"},"links":{"cited_paper":"/paper/2301.11270","citing_paper":"/paper/2505.14826"},"observation_digest":"sha256:4cd19547fcfdf5213ca09b6502e11abbace7d29b5d2c1b4788308d40befc5b85","observation_id":"8b16b78e-9cf1-419d-94fc-e7029f1716da","resolution":{"observed_at":"2026-08-07T15:33:55.702118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.14826","last_updated":"2025-05-20T18:41:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:26:43.583135Z","submitted_at":"2025-05-20T18:41:34Z","title":"FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":2,"verified_fuzzy":24},"total_outbound_references":51},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 2 inbound Pith citation observations for arXiv:2505.14826."}