{"as_of":"2026-08-08T03:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:141e69b7c8ee85f5f2ac90607f00b2eae6fdbf3cafd0d5112969bab9ee3c731a","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:52:01.739790Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"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/2509.01221/citation-record","integrity":"/paper/2509.01221/integrity","json":"/paper/2509.01221/citation-record.json","paper":"/paper/2509.01221"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.14219","last_updated":"2024-08-30T21:17:17Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T14:32:33Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14219","snapshot_observed_at":"2026-08-05T12:52:00.307981Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.307981Z"},"links":{"cited_paper":"/paper/2404.14219","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:bef0fbc33af6034faef7ea56463c572f6c50c4ba95c309103aea32207a74c74e","observation_id":"fd1e501f-6b6b-41ac-9a06-6032bac820b8","resolution":{"observed_at":"2026-08-05T12:52:00.307981Z","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-05T12:52:00.370133Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.370133Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:2f66ec80c45d2fee61fb58f8072839f180da3478cafbfc979e6cd82f4060ea65","observation_id":"4bd63303-3296-4cb5-b385-45d7a30435d7","resolution":{"observed_at":"2026-08-05T12:52:00.370133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17297","last_updated":"2024-03-26T00:53:24Z","snapshot_observed_at":"2026-08-02T11:10:24.263044Z","submitted_at":"2024-03-26T00:53:24Z","title":"InternLM2 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17297","snapshot_observed_at":"2026-08-05T12:52:00.462898Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.462898Z"},"links":{"cited_paper":"/paper/2403.17297","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:51f2d342dd9fc80d5464e60167906b0178dbc3036715e9f8fe9ebb6cfed88546","observation_id":"1151e1ed-d782-4e73-b7f9-3c3a786e3bbd","resolution":{"observed_at":"2026-08-05T12:52:00.462898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08701","snapshot_observed_at":"2026-08-05T12:52:00.544450Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.544450Z"},"links":{"cited_paper":"/paper/2307.08701","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:d82fd54ad865c4aef772c5234b577f222c11f292d59d2e5e0caecef7c7ee5ae0","observation_id":"a97e75c8-df03-4b82-88f7-a0d5762605b6","resolution":{"observed_at":"2026-08-05T12:52:00.544450Z","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-05T12:52:02.195560Z","title":null,"venue":null,"work_id":"ee2472a1-e29c-4729-8272-8b7d17aa58b8","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.609958Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:3109855e9e9d436052f9ca327c3e1fad2a3687a9a27401f6f251a8530b64f005","observation_id":"0858208a-dbed-473b-ba78-c2e7ff36ad0f","resolution":{"observed_at":"2026-08-05T12:52:02.198725Z","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-08-05T12:52:02.185626Z","title":null,"venue":null,"work_id":"2185a85b-6f18-42ba-a949-282b5313192e","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.696717Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:baa8a41955ea51195ddb73392f39da801199ccea849fd74bbb24daac1012ffd4","observation_id":"b1fb55f3-3b88-400a-827a-dd0013ab7198","resolution":{"observed_at":"2026-08-05T12:52:02.188827Z","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":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-05T12:52:00.788298Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.788298Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:2e2c8c23a1b2df32554e052f58235c68de71b00462b222e8b2af10cde3d6806c","observation_id":"f2306716-fc0c-426f-a1c4-5f45a0acf619","resolution":{"observed_at":"2026-08-05T12:52:00.788298Z","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-05T12:52:02.175622Z","title":null,"venue":null,"work_id":"820f529e-159c-497a-bd54-8df68f105ec9","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:00.920282Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:25c0cb530bfc93f843a5ad4a34ffc93432da9d09cec8e2fae06920e1a25f955f","observation_id":"ae9db110-f4af-4009-b153-00e9349366d8","resolution":{"observed_at":"2026-08-05T12:52:02.178922Z","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":"2311.15653","last_updated":"2023-11-27T09:33:13Z","snapshot_observed_at":"2026-07-06T16:52:57.823137Z","submitted_at":"2023-11-27T09:33:13Z","title":"MoDS: Model-oriented Data Selection for Instruction Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15653","snapshot_observed_at":"2026-08-05T12:52:01.002494Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.002494Z"},"links":{"cited_paper":"/paper/2311.15653","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:7331309d3ebc4e53d549b5e2b243d7937a0fa9955b54001d4e3b9103b54ecfe9","observation_id":"2c6005bb-6faf-4a17-99c6-11629a656cc0","resolution":{"observed_at":"2026-08-05T12:52:01.002494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-05T12:52:01.053236Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.053236Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:16aa275bdd4f55e088b1840a6d7fd5700af1e32694521684d8796b27d3d78d10","observation_id":"d522d9bb-1a8d-4172-92f0-a0b5d13ff28e","resolution":{"observed_at":"2026-08-05T12:52:01.053236Z","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-05T12:52:01.150053Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.150053Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:c3a66f8ac2f076cfacd2386df053c983d24196e8bc682fb005ab019d6d7609ff","observation_id":"37f7d3ab-193a-4d9c-a843-2aee21133b36","resolution":{"observed_at":"2026-08-05T12:52:01.150053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12793","last_updated":"2024-07-30T03:58:11Z","snapshot_observed_at":"2026-08-07T13:56:34.167869Z","submitted_at":"2024-06-18T16:58:21Z","title":"ChatGLM: A Family of Large Language Models from GLM-130B to GLM-4 All Tools","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12793","snapshot_observed_at":"2026-08-05T12:52:01.276548Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.276548Z"},"links":{"cited_paper":"/paper/2406.12793","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:d6d6afa1e5bddbbf06df1ddba5c2b5e0987efd58482e502d64a5cedb74f508da","observation_id":"10f38b33-2d87-45f5-b605-46c65fd25795","resolution":{"observed_at":"2026-08-05T12:52:01.276548Z","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-05T12:52:02.165740Z","title":null,"venue":null,"work_id":"5eac1d05-0a58-4c5e-8775-4008425d04be","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.369895Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:2379e5d80bb90e746477caf986d84e60c081455e576de2413770ce7373c3855b","observation_id":"06b0b4cc-cab0-48d6-9b16-941676a99fc8","resolution":{"observed_at":"2026-08-05T12:52:02.169041Z","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-08-05T12:52:02.155628Z","title":null,"venue":null,"work_id":"6913b0b9-9918-4f4b-b719-a47c7f6244a2","year":2021},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.483962Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:44964099f9cf05079a95b0f5db78036cc7b87bd8788af8aecf34788ea2772a05","observation_id":"04e0c957-49d4-4937-bfa1-ab4a206f45ae","resolution":{"observed_at":"2026-08-05T12:52:02.158822Z","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":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-05T12:52:01.580506Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.580506Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:81c7b4f4b46937e8d56638bae80caaca86e7b3ed889d338848712adcb48abc46","observation_id":"05d38e98-e8b2-46ce-8121-bd69e63a7ac0","resolution":{"observed_at":"2026-08-05T12:52:01.580506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05736","last_updated":"2023-12-06T17:02:25Z","snapshot_observed_at":"2026-08-06T08:38:21.368130Z","submitted_at":"2023-10-09T14:10:21Z","title":"LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05736","snapshot_observed_at":"2026-08-05T12:52:01.641529Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.641529Z"},"links":{"cited_paper":"/paper/2310.05736","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:cb4feccae960fcfca06a0ae27936fa37a0886520bfceb0ae89d876a8c48cba69","observation_id":"9c490a55-a641-41ed-979e-524003d7b96a","resolution":{"observed_at":"2026-08-05T12:52:01.641529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06839","last_updated":"2024-08-12T03:53:35Z","snapshot_observed_at":"2026-08-06T17:12:58.658176Z","submitted_at":"2023-10-10T17:59:58Z","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06839","snapshot_observed_at":"2026-08-05T12:52:01.645572Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.645572Z"},"links":{"cited_paper":"/paper/2310.06839","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:363de16b5ab383d6f67287d2bf1f8a869b79c3d2f3544761f56fc1d8bfe762ef","observation_id":"746e3f41-ee3d-4bde-8d1b-5fcbf1ce73b3","resolution":{"observed_at":"2026-08-05T12:52:01.645572Z","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-05T12:52:01.648777Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.648777Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:72d89e0840643a4fbb0030b37da57c960fec2398828b4a25de128998554e83a2","observation_id":"efe61822-a609-4c58-9762-d91d7fa8eab0","resolution":{"observed_at":"2026-08-05T12:52:01.648777Z","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-05T12:52:02.139579Z","title":null,"venue":null,"work_id":"39fa936c-8563-4876-a730-ab3155e6bc23","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.651821Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:846367baa5f373deff74e9662443b0fd4d1128b4abfd42c1d93ed75381c31a2b","observation_id":"b357ccc4-704e-4149-9ed0-e8f91c1b6453","resolution":{"observed_at":"2026-08-05T12:52:02.143086Z","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-08-05T12:52:02.130070Z","title":null,"venue":null,"work_id":"8ce5e68f-2157-4b6d-8807-4516dbf13755","year":2019},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.654849Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:06326ec4c49444d9cb5494fb46a7d5d6d27d9eaa768c7d5d00cb2ad6a2eb5d4e","observation_id":"ed287b6c-1f19-4452-922d-a181890f85fd","resolution":{"observed_at":"2026-08-05T12:52:02.133333Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:52:01.657642Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.657642Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:4bd37cb064860ab3fb28c3839f1ebf511c35091ae7dac6ca420e2cbf71ba4dca","observation_id":"b784772c-7f2e-4edf-93af-6a57fbe4a776","resolution":{"observed_at":"2026-08-05T12:52:01.657642Z","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-05T12:52:01.660529Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.660529Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:3105f0e29b0450f5889c088460f66df4afe94f21cce3e9465d58ac0ad1210b2a","observation_id":"67cc92bb-61bf-4b6b-b122-d75c4e43c3f3","resolution":{"observed_at":"2026-08-05T12:52:01.660529Z","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-05T12:52:02.112340Z","title":null,"venue":null,"work_id":"7d96e463-86b2-4dfc-886c-09601ec8abfb","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.663629Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:60829a106374bb5c04522282601d34141422c933b1d9617ae69d60b7a847bba3","observation_id":"0be0653d-3394-43d2-9de9-50c48ed56c8d","resolution":{"observed_at":"2026-08-05T12:52:02.115666Z","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":"2402.01881","last_updated":"2025-02-26T13:57:13Z","snapshot_observed_at":"2026-07-06T17:24:37.090243Z","submitted_at":"2024-02-02T20:12:05Z","title":"Large Language Model Agent for Hyper-Parameter Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01881","snapshot_observed_at":"2026-08-05T12:52:01.666699Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.666699Z"},"links":{"cited_paper":"/paper/2402.01881","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:e4137ebcdce0f6e006e55d67da9668b7d79de2e1877ff92ff4aa3fb5311c6c08","observation_id":"8c8b45cd-c843-4394-b986-9c4ade0f5882","resolution":{"observed_at":"2026-08-05T12:52:01.666699Z","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-05T12:52:02.101854Z","title":null,"venue":null,"work_id":"5c0dc825-5ba9-44c2-9e1b-d94b84de78e7","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.669933Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:8967e4bf9e04c45bcdd6e4183959df4fb6472d22526636b0dcd6ee6c2a1b470f","observation_id":"0fa2f2a5-d537-4ac9-849c-99571b361128","resolution":{"observed_at":"2026-08-05T12:52:02.105145Z","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-08-05T12:52:02.090548Z","title":null,"venue":null,"work_id":"c26fee7e-9931-45a0-b4ef-38d8bb5ab60f","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.673207Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:f13df0b3168fe3abdfe6534060973a1d53d2df0919943cfc4f97d1024aa1ab59","observation_id":"5a50fa02-844c-47c3-ae89-b09e4bb64c73","resolution":{"observed_at":"2026-08-05T12:52:02.094133Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:52:01.676539Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.676539Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:4ea0bf5941a778eaedf0cbe3f63b49ef7d20c5ea24c1095fd782d247952c445c","observation_id":"60e4bf11-73e1-422a-a89d-ad4476df37d4","resolution":{"observed_at":"2026-08-05T12:52:01.676539Z","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-05T12:52:01.679447Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.679447Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:8899f4ea05ad63fd16e43c7707eaf0a594f9e177d4bdc74679601a125044deac","observation_id":"0b96dc91-9508-4bf2-9d97-4030ed1cb369","resolution":{"observed_at":"2026-08-05T12:52:01.679447Z","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-05T12:52:01.682459Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.682459Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:650d6c5fe0cb8a3ea6eef56c8a31e77e6b081c21c1e7190fc9338e302f833d5e","observation_id":"6f9a4bd6-8a9f-415e-8a61-530c455fbacc","resolution":{"observed_at":"2026-08-05T12:52:01.682459Z","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-05T12:52:01.685452Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.685452Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:850efbfe38c0344b35149f642ff0d95860978d985120d02ef0c771dd8920ebaf","observation_id":"4f9b9cc1-177e-4d75-9bf1-3b157a91739f","resolution":{"observed_at":"2026-08-05T12:52:01.685452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-05T12:52:01.688447Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.688447Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:89b580ff311b98928bbab60e46d55a78d2003362dcf9102413bc2db6113317e9","observation_id":"d824c1ce-8083-4e83-a731-4fd4e26e2d65","resolution":{"observed_at":"2026-08-05T12:52:01.688447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03863","last_updated":"2024-05-23T06:08:37Z","snapshot_observed_at":"2026-08-02T01:09:26.116796Z","submitted_at":"2023-12-06T19:18:42Z","title":"Efficient Large Language Models: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03863","snapshot_observed_at":"2026-08-05T12:52:01.691397Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.691397Z"},"links":{"cited_paper":"/paper/2312.03863","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:e94992cb4d5bea29abe9a3be71aaf61fd07c154faa997494eade5f24d09eebe7","observation_id":"f98ecfeb-3a36-4d30-8512-c444a8fa88ca","resolution":{"observed_at":"2026-08-05T12:52:01.691397Z","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-05T12:52:02.060451Z","title":null,"venue":null,"work_id":"e73ae458-eddb-4d1f-a088-219c6225f7e5","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.694867Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:9fb046cf9878ba1942763d5981724ff2e35fac4b9feae33ee7de9ed90092614d","observation_id":"c4f244c7-9697-4f9a-a489-0c5e8d5479dc","resolution":{"observed_at":"2026-08-05T12:52:02.063650Z","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":"2402.13116","last_updated":"2024-10-21T16:22:33Z","snapshot_observed_at":"2026-08-02T17:17:56.296462Z","submitted_at":"2024-02-20T16:17:37Z","title":"A Survey on Knowledge Distillation of Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13116","snapshot_observed_at":"2026-08-05T12:52:01.697822Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.697822Z"},"links":{"cited_paper":"/paper/2402.13116","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:7ae074a491b959ee46bbda47929ebe7861cb5ec9a0abc785065786e09f088c56","observation_id":"4437a03c-0235-40e8-bb0f-87d1d3e6ac69","resolution":{"observed_at":"2026-08-05T12:52:01.697822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10305","last_updated":"2025-04-17T08:34:42Z","snapshot_observed_at":"2026-08-06T06:52:14.558389Z","submitted_at":"2023-09-19T04:13:22Z","title":"Baichuan 2: Open Large-scale Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10305","snapshot_observed_at":"2026-08-05T12:52:01.701489Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.701489Z"},"links":{"cited_paper":"/paper/2309.10305","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:6be49aee2869ec13a75929a7355e1b3de54d015ca3aac5aba2f1d2e558d60c6a","observation_id":"1211bfa5-f4fc-4cf3-8c17-244f41b1e2c3","resolution":{"observed_at":"2026-08-05T12:52:01.701489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-05T12:52:01.704911Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.704911Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:9bd5d0f307a6a1fc29e214cef51fc820dacc289393e6768e105a1e939a7e96c4","observation_id":"aa8900d2-673a-4128-8f6f-9956113c1753","resolution":{"observed_at":"2026-08-05T12:52:01.704911Z","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-05T12:52:02.050006Z","title":null,"venue":null,"work_id":"4076b604-54e4-44f4-964e-08af9625092d","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.707882Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:30f7a65f28931c54ae00d1d2850420fa3e70895db55978f8859801532362cce1","observation_id":"c24cf4ad-6768-4a50-b214-4fec62a392e9","resolution":{"observed_at":"2026-08-05T12:52:02.053477Z","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":"2402.11187","last_updated":"2024-10-15T01:58:58Z","snapshot_observed_at":"2026-08-02T23:45:33.761426Z","submitted_at":"2024-02-17T04:16:30Z","title":"LaCo: Large Language Model Pruning via Layer Collapse","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11187","snapshot_observed_at":"2026-08-05T12:52:01.711194Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.711194Z"},"links":{"cited_paper":"/paper/2402.11187","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:e926ba3280226e5d99845ebbba22ff25cfe2607b026175c0bdb9903a9e536324","observation_id":"ddae4f8b-b218-4b77-85d3-392f032d56c3","resolution":{"observed_at":"2026-08-05T12:52:01.711194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04652","last_updated":"2025-01-21T10:12:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-07T16:52:49Z","title":"Yi: Open Foundation Models by 01.AI","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04652","snapshot_observed_at":"2026-08-05T12:52:01.714554Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.714554Z"},"links":{"cited_paper":"/paper/2403.04652","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:633704271ee22c3de2b242588701c2f38c5e62bac564728f836bb76c06ca598b","observation_id":"2fe4e478-21a1-49ce-89c7-ea7dc2b185a7","resolution":{"observed_at":"2026-08-05T12:52:01.714554Z","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-05T12:52:01.717722Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.717722Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:4b6a6a46757cab217f91422351286ec8ddb169a751800753fe5a433329394e67","observation_id":"66fcaeab-ea5c-43ed-bb05-79e300c2ae54","resolution":{"observed_at":"2026-08-05T12:52:01.717722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09675","last_updated":"2020-02-24T18:59:28Z","snapshot_observed_at":"2026-07-29T15:42:51.774083Z","submitted_at":"2019-04-21T23:08:53Z","title":"BERTScore: Evaluating Text Generation with BERT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09675","snapshot_observed_at":"2026-08-05T12:52:01.721027Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.721027Z"},"links":{"cited_paper":"/paper/1904.09675","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:73303a9eea7546ef61de5fba3be766f095b3a9ff6828ca2dffd0b255b460a9c1","observation_id":"a76ef17d-53ac-44e4-8170-2b9a48a0a631","resolution":{"observed_at":"2026-08-05T12:52:01.721027Z","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-05T12:52:02.039239Z","title":null,"venue":null,"work_id":"e94e3fe2-afa7-44fd-bfb6-2e9e1f5e6607","year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.724124Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:0f69e7194cfd31b88cfb13668839f98ca1c2eab66a53f352fdf4a04b3be60181","observation_id":"842a0458-b4f1-4962-833e-5d702136de7e","resolution":{"observed_at":"2026-08-05T12:52:02.042618Z","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":"2408.05517","last_updated":"2025-05-19T06:50:53Z","snapshot_observed_at":"2026-08-05T14:11:37.629456Z","submitted_at":"2024-08-10T11:00:13Z","title":"SWIFT:A Scalable lightWeight Infrastructure for Fine-Tuning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05517","snapshot_observed_at":"2026-08-05T12:52:01.727269Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.727269Z"},"links":{"cited_paper":"/paper/2408.05517","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:f39c71701895ece6690db3125876690b1616d347ff2ade26f2c3759a667eaabd","observation_id":"882936b6-41ab-4fed-bd7c-ecfcdc81ac49","resolution":{"observed_at":"2026-08-05T12:52:01.727269Z","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-05T12:52:02.026927Z","title":null,"venue":null,"work_id":"49afdcf6-6329-45ff-b1fc-f6aedb5d74dc","year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.730335Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:988128c56986ef01b6afdb775a5b2c8f5d339381ee599f6d84c192b2e0258f9e","observation_id":"49385e70-e66f-402f-982a-bd5ba27c6b61","resolution":{"observed_at":"2026-08-05T12:52:02.031380Z","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":"2308.07633","last_updated":"2024-07-30T13:14:55Z","snapshot_observed_at":"2026-08-06T06:16:16.015146Z","submitted_at":"2023-08-15T08:31:05Z","title":"A Survey on Model Compression for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07633","snapshot_observed_at":"2026-08-05T12:52:01.733295Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.733295Z"},"links":{"cited_paper":"/paper/2308.07633","citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:927bfe9f2398fe5c6d99e6d92bf696092674f7e33ae9a6c8c34a3fd03c02496e","observation_id":"7d1220cd-4c89-4ff3-8003-db1ce7f96456","resolution":{"observed_at":"2026-08-05T12:52:01.733295Z","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-05T12:52:01.736408Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.736408Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:d5e5df59b54c5fa5bd7a586b4b1b8230d9921068f3bcc08290c721be0c8a3109","observation_id":"d218b725-2d7a-4f64-a1b2-1e71be66ac60","resolution":{"observed_at":"2026-08-05T12:52:01.736408Z","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-05T12:52:01.739790Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T12:52:01.739790Z"},"links":{"citing_paper":"/paper/2509.01221"},"observation_digest":"sha256:497623c6c7b142d6f539821d2f8ef7a61a15b92d8ffc403ca32f4757b8f19754","observation_id":"2400fb82-fa2a-4a0d-8d9d-08cbb48416c4","resolution":{"observed_at":"2026-08-05T12:52:01.739790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.01221","last_updated":"2025-09-04T09:30:16Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T10:55:12.173457Z","submitted_at":"2025-09-01T08:06:49Z","title":"DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"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 8 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2509.01221."}