{"as_of":"2026-08-10T05:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9b74baccaf6bd01060e2cee124728575c5b49d81a268a89df619e10ddeebca0","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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-08T17:37:43.606906Z","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:fc47564e1bf2cbd031c02d7adc2feb95d8fa0dcf3e755fa8621fc024a9ee40f7","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-08T17:37:43.606906Z","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:f31c25abf9f990cfda7187c5c2f12fb60b27fd97b58451d6e2c53cd28e564930","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-08T17:37:43.606906Z","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:db167e44f973f49bca45e8d6ebc04faf147a7c0bd384b04d1f09c02f74e7b415","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-08T17:37:43.606906Z","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:28362a7dd95d0aa0f31cadc214502444c568330c5973f4856a9e5301526a3f1f","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-08T17:37:43.606906Z","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:ec0846d627c811bdf5dce7a0cceb119369a3fa354da70990f75413bc7aa3d78c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:343c548fe9b2d253c9b3f336a6fbb328ff9a9ca996aab8c8afc5586d9f28f047","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:d50e132b0f3a99a9c4a2dcd294f73f4a0421406731f857606fa7ce7986011731","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-08T17:37:43.606906Z","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:d3c77a0344a672aa89f6e55ad9ec92515f58968d19297aa4fdd8ae5bd9507e38","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:091805c52257c6651b36c0257eec0254ed9ff88b10ef583b9232e9d3c723af1f","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-08T17:37:43.606906Z","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:3646320d11645e9d29a44f4d03260c4b18588758b9ba5c7b6c3de69e7ed80769","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-08T17:37:43.606906Z","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:cedf9cc66b9ca4f0b0d9de7df707131cf1c32fbc07af0948478cca90d2a0bc44","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-08T17:37:43.606906Z","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:c6aa44f8b0e98b8e6cb9a1464bd17cc73ae289c3226575ed4dca4bb2f02314af","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-08T17:37:43.606906Z","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:9bee348bea81c17dddc0ebefdcb9ad0c2b92a94680795382e06bdb4eb2b32f6b","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:b6b739af874208319e65606a6a60963284f414dd335fde2ed969513ebda436ab","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:779b4780c53e98eb27112cb2cdc9df5b3345fcc3175bd2f9879569d0913ebfac","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-08T17:37:43.606906Z","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:1ab6620cb8b5371631392ac503647cf71e00196dd97e64727b87099a8b879a4c","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-08T17:37:43.606906Z","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:70aa667c1268a83d2c28ab8e33839cc09b50da811f8d00b38679e5650619dd4d","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-08T17:37:43.606906Z","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:742f1d4a11d171c76d2ebd7419dd6d4c3467d242f51bf10e6090b13f623dafee","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-08T17:37:43.606906Z","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:2f18c4838114f39feb024baaf31ece79d689d4cdedc13e7cc825974dfdea9a2c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:63768417c5dea7333c1e0acf5398ac7f3af961f206aab9adef381c6e0011566f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:3c82b47ad6de31ec859ea7f20d05884753b8bedcb9cc8f8bb1d7f93d38666b95","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-08T17:37:43.606906Z","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:62ebff963416ac5610bc39d5e35afeef4c37e27fd30b5a177c06a92decb6f3aa","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-08T17:37:43.606906Z","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:760492b8ad91a0074089d9a21500f3d073618b6ccf3fc2eba78f19f2ae3b5518","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:9843edb8f302882b3a7fed8ad733ef297eb7c58072740884bc7d10e026ec1735","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-08T17:37:43.606906Z","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:da8a5ce84958c3c5cc913902338f1879a0775320815c24f7cef8b7371bb624ba","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:536419935a2fafae485c4fa1b46a1c64327e911816d1eaebf20878e4b5c7b88e","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:79e9dd59cbd8e14ecf8438620794818ff37c6abedf64606820efe5fb377039da","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-08T17:37:43.606906Z","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:3567f744f97fe0bdf9a7b0b57aab9076fb62c2ce0ab5278efcb534d6144dc7ea","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-08T17:37:43.606906Z","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:32afc27fddd0812dbfbf672b06d2de6a6ce7baec53bed3eaa37eebc458bb0e99","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-08T17:37:43.606906Z","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:c1f2e8e90459f3d42ac59c44ae6ece18e72c4807f42cb48323ef2693e049c4c2","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-08T17:37:43.606906Z","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:2e2e9df3af3b52b285b08967efdc9395202835930c76198d2f3c43f478e07581","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-08T17:37:43.606906Z","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:36bedb8b6e57ca14aa8f470d9b37060f7899c0fa14ed89146be188c0bda5e68b","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-08T17:37:43.606906Z","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:5a2e0520140cf8610ebab8a9e0a2102eb656af970f1de3c5b747856f4a77a02c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:8c08b16adbef04416c6d4dbf9a319d8c7d94b93dbde01d1591419beb2f87379f","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-08T17:37:43.606906Z","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:d4818b8790dce0d99e00cfcafd2c5cf6c2e93ef670007300ec027aaaa8e59c37","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-08T17:37:43.606906Z","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:7e4e0cd377146b2c0f4635bf82e47a3442c0102f4253cea0e4d08eecff0eeaa2","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-08T17:37:43.606906Z","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:51552412b6c88730fd9e2044c1f65228979c418f009eb53f6259e60f9b29a57d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:febbb67b8fba885924cf01f078bb7e47cab7efad6ca345febbb0c133f19aaa4e","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-08T17:37:43.606906Z","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:8d48de05fd0a28aa0b706533f56feb17444252e659919568e5259904e39b83f5","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-08T17:37:43.606906Z","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:2b179fa0f3b7891274012071391768af852b00604aa8cd06c16dad6ce649fec3","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-08T17:37:43.606906Z","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:7651816a121be81a21d91c8e48d2b8fe3ff45d7bcd9207b3d87eb54e142bdbfc","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-08T17:37:43.606906Z","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:3bcb312093a38867ac4e40ad9588f5050882fd05fd4527f6eb2379312407a1e1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:207b1e6a03a876671484dc0132ea4ec70d6469a86babd242be32e7c473d5d812","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-08T17:37:43.606906Z","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:abbb9b4908a5ec953a2e8798c21c6cf30cf949e9945c76b3973e73b8537c7b59","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-08T17:37:43.606906Z","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:348088877fbbdc4ca71adf7803931f740cc6c12f63cc925a5b447342ba1bdd3c","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-08T17:37:43.606906Z","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:d0f155d5f7a64625631bcc2d3b2ca952ffdd243953a51bc1207a8fcb38be8a64","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-08T17:37:43.606906Z","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:3bb6dc6c10100d602f21f9c7fefef22910da02e4f19fa122f8f8fd862a576031","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-08T17:37:43.606906Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2509.01221."}