{"as_of":"2026-08-10T02:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3a0d24ea3a7a944c270db17250723571b4d288687c734941d39bfa8c251a0df","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:36:04.620053Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:53:42.543595Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:53:45.038200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"cited_work":{"arxiv_id":"2502.01378","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.01378","snapshot_observed_at":"2026-08-07T04:53:45.038200Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","venue":"cs.LG","work_id":"f75d393f-0014-4592-9a26-222d6e288f14","year":2025},"citing_paper":{"arxiv_id":"2506.11141","last_updated":"2025-06-11T02:39:08Z","snapshot_observed_at":"2026-08-09T21:33:04.297777Z","submitted_at":"2025-06-11T02:39:08Z","title":"From over-reliance to smart integration: using Large-Language Models as translators between specialized modeling and simulation tools","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T04:53:42.543595Z"},"links":{"cited_paper":"/paper/2502.01378","citing_paper":"/paper/2506.11141"},"observation_digest":"sha256:662a3661dd9ed8fda256e315d53dd71d298dfd842e24dabf82e481709fead33b","observation_id":"f666ed42-bca9-4958-aeaa-5aa3a8b2ff96","resolution":{"observed_at":"2026-08-07T04:53:45.137947Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01378/citation-record","integrity":"/paper/2502.01378/integrity","json":"/paper/2502.01378/citation-record.json","paper":"/paper/2502.01378"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-09T15:36:04.410687Z","title":"On the opportunities and risks of foundation models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.410687Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2c0dc8110a1b4593204b802f75f9967da4f771a08bc9f2298a55c10808c84238","observation_id":"7a99774b-1535-48d4-aff4-ec432bf0b684","resolution":{"observed_at":"2026-08-09T15:36:04.410687Z","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-09T15:36:04.414410Z","title":"Instruction tuning for large language models: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.414410Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2d1c5c59f163d4d451ea1e5686883f0892751464d8ccbd00dff0e7f915ea12e1","observation_id":"b374afaf-2a6c-4e7f-b23c-a16a5ca5012c","resolution":{"observed_at":"2026-08-09T15:36:04.414410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14608","last_updated":"2024-09-16T02:54:50Z","snapshot_observed_at":"2026-08-04T09:07:42.158421Z","submitted_at":"2024-03-21T17:55:50Z","title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14608","snapshot_observed_at":"2026-08-09T15:36:04.418330Z","title":"Parameter-efficient fine-tuning for large models: A comprehensive survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.418330Z"},"links":{"cited_paper":"/paper/2403.14608","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:0d2173c54576a561df188a8575b31d7429d78d4ccd5f43799c1cb955afdf5d99","observation_id":"2d138c26-9b1d-4a67-a0c0-a548582c3d2e","resolution":{"observed_at":"2026-08-09T15:36:04.418330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-09T15:36:04.422233Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.422233Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:ac96da325f95082ac548350f4498f0ef4eb062d3f46210585f97d147c1885c33","observation_id":"5d6740cb-8757-4397-a187-de45c8499f91","resolution":{"observed_at":"2026-08-09T15:36:04.422233Z","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-09T15:36:05.495315Z","title":"Fast monte carlo algorithms for matrices i: Approximating matrix multiplication","venue":null,"work_id":"2a5f855a-f58c-4482-afa3-4b896dfb9ffe","year":2006},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.426042Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:fd96ee14a35deb2e3e537d04d2e95397fb504f3dd54ac6fe42a2402130fb96a9","observation_id":"f8cbc10f-3f9a-4eba-a107-4f7af0d997a5","resolution":{"observed_at":"2026-08-09T15:36:05.499023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:05.484805Z","title":"Accelerating large language models through partially linear feed-forward network","venue":null,"work_id":"09342e2b-3b7e-4e01-b483-a0bf98ba6245","year":2025},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.429576Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:c73ecfdaa85f203ef441b669d571ad0c91fc784bcf215f1b2d454d2941e4a8e8","observation_id":"0d736b1c-f510-4699-95a1-8a7ed4df2900","resolution":{"observed_at":"2026-08-09T15:36:05.488132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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.11393","last_updated":"2024-08-21T07:38:51Z","snapshot_observed_at":"2026-08-09T23:16:13.362778Z","submitted_at":"2024-08-21T07:38:51Z","title":"First Activations Matter: Training-Free Methods for Dynamic Activation in Large Language Models","version":1},"cited_work":{"arxiv_id":"2408.11393","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.11393","snapshot_observed_at":"2026-08-09T15:36:04.918771Z","title":"First Activations Matter: Training-Free Methods for Dynamic Activation in Large Language Models","venue":"cs.CL","work_id":"2e5cfd1f-ed3e-4819-b07b-0fb038788292","year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.433269Z"},"links":{"cited_paper":"/paper/2408.11393","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:bd3e4266115efa82b5b5ae18cc3cbcae60262ec7dc1bfa28a115110991246d34","observation_id":"42e27d34-5e5c-4151-97a6-a70ab70c01d5","resolution":{"observed_at":"2026-08-09T15:36:04.922900Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2407.11239","last_updated":"2025-06-07T06:59:36Z","snapshot_observed_at":"2026-08-04T13:43:35.284914Z","submitted_at":"2024-07-15T21:05:20Z","title":"From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11239","snapshot_observed_at":"2026-08-09T15:36:04.436881Z","title":"From galore to welore: How low-rank weights non-uniformly emerge from low-rank gradients","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.436881Z"},"links":{"cited_paper":"/paper/2407.11239","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:65a43fb2e87def4d6f2e3f4572d802ff62c2148cdb7029ff779de566d35ee446","observation_id":"56d9ee7b-bcd1-435f-99cd-ea56ddb9ad75","resolution":{"observed_at":"2026-08-09T15:36:04.436881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18135","last_updated":"2025-05-06T11:41:37Z","snapshot_observed_at":"2026-07-06T20:12:31.283474Z","submitted_at":"2024-12-24T03:43:15Z","title":"LSAQ: Layer-Specific Adaptive Quantization for Large Language Model Deployment","version":2},"cited_work":{"arxiv_id":"2412.18135","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.18135","snapshot_observed_at":"2026-08-09T15:36:04.891974Z","title":"LSAQ: Layer-Specific Adaptive Quantization for Large Language Model Deployment","venue":"cs.CL","work_id":"596e06d3-7eb2-4745-99e1-6f55f075b352","year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.440594Z"},"links":{"cited_paper":"/paper/2412.18135","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:0a3b8e797e55a1b6758ce6075785990fd5f09ea80e5cb60474e3383e7ae43278","observation_id":"053bfaed-9abf-489c-bb52-339420b18400","resolution":{"observed_at":"2026-08-09T15:36:04.897649Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2411.17525","last_updated":"2024-11-26T15:35:44Z","snapshot_observed_at":"2026-07-06T19:57:18.481261Z","submitted_at":"2024-11-26T15:35:44Z","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17525","snapshot_observed_at":"2026-08-09T15:36:04.444303Z","title":"Pushing the limits of large language model quantization via the linearity theorem.arXiv preprint arXiv:2411.17525, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.444303Z"},"links":{"cited_paper":"/paper/2411.17525","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:da34e915bf752ff614687f7a7d43051f3fdedee9592c5ef25e0e305a698f647f","observation_id":"26d22641-5be1-453b-bcca-af9996668f5f","resolution":{"observed_at":"2026-08-09T15:36:04.444303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08296","last_updated":"2024-07-11T08:42:58Z","snapshot_observed_at":"2026-07-06T18:44:41.370135Z","submitted_at":"2024-07-11T08:42:58Z","title":"Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08296","snapshot_observed_at":"2026-08-09T15:36:04.448111Z","title":"Q-galore: Quantized galore with int4 projection and layer-adaptive low-rank gradients","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.448111Z"},"links":{"cited_paper":"/paper/2407.08296","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:ee266091ae917a9159a3dffbeffc2eacd150768b4d7a7e22ebfac420609c95de","observation_id":"c11586e7-efe1-4040-8e5d-32a54250d0bc","resolution":{"observed_at":"2026-08-09T15:36:04.448111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14690","last_updated":"2025-02-25T21:00:50Z","snapshot_observed_at":"2026-07-06T19:06:19.400102Z","submitted_at":"2024-08-26T23:30:15Z","title":"Training-Free Activation Sparsity in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14690","snapshot_observed_at":"2026-08-09T15:36:04.451732Z","title":"Training-free activation sparsity in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.451732Z"},"links":{"cited_paper":"/paper/2408.14690","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:b26dacbb33033d75cc4572e753590613641d68f0125f42d4ba355959c6687e5c","observation_id":"e86f556c-2ba9-45b0-9480-61098180e33a","resolution":{"observed_at":"2026-08-09T15:36:04.451732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01933","last_updated":"2023-10-09T15:38:46Z","snapshot_observed_at":"2026-08-09T04:45:14.956800Z","submitted_at":"2023-04-04T16:31:37Z","title":"LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01933","snapshot_observed_at":"2026-08-09T15:36:04.455245Z","title":"Llm-adapters: An adapter family for parameter-efficient fine-tuning of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.455245Z"},"links":{"cited_paper":"/paper/2304.01933","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:bd9443383cf722260aec5e97e01cc5299db55181c2ee6f300e4e4ca2b9921428","observation_id":"02a9849c-69e5-4728-a0db-a743ccbcbe25","resolution":{"observed_at":"2026-08-09T15:36:04.455245Z","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-09T15:36:05.474138Z","title":null,"venue":null,"work_id":"3d50d560-5b5d-4654-a600-d0dec08b18b3","year":2019},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.458886Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:d4574e8f353f2bbef87bbb0753d01ee070a0d5b1df5744d6cc1c929be98ae561","observation_id":"3dfa33b9-e66c-46cc-9151-9ec1a845eb0c","resolution":{"observed_at":"2026-08-09T15:36:05.477950Z","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-09T15:36:05.463308Z","title":"Dolan and Chris Brockett","venue":null,"work_id":"cb33fc0a-3bfb-4970-bfa0-9868de14d7e8","year":2005},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.462384Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:c893e62a5264a217748a1c42a9be5c0390e36c9344ec3f755840f6cf537566a3","observation_id":"b5e68911-353a-40b8-91ea-89cef1e505db","resolution":{"observed_at":"2026-08-09T15:36:05.467099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:05.452410Z","title":null,"venue":null,"work_id":"57b15fc5-dc51-4d5c-9e09-a0429c46f8d5","year":2019},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.465834Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2bd9481b47b945b83f8cc135208d7b1519772fa86a8c2110e3b99b24eabe2e98","observation_id":"004d61e4-e93d-4ec9-a92d-4a16360dc3a7","resolution":{"observed_at":"2026-08-09T15:36:05.456109Z","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-09T15:36:05.440959Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":"58ab4116-1492-4144-9954-19f3e584af58","year":2019},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.469175Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:21f78357790ffa53a2739cc9aa8166c4c2360cb41c6d68b9a03b7ef497ed35d5","observation_id":"49532871-cfae-462d-b631-bc9d06910a5b","resolution":{"observed_at":"2026-08-09T15:36:05.444842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:04.472566Z","title":"Piqa: Reasoning about phys- ical commonsense in natural language","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.472566Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2558cc6a4b651a4bf9a0140a3b5755c106652edd10f037ca3b112aaacba75858","observation_id":"ef933af0-e74b-4b49-9c25-d00bd8288461","resolution":{"observed_at":"2026-08-09T15:36:04.472566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09728","last_updated":"2019-09-09T17:29:55Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-04-22T05:36:37Z","title":"SocialIQA: Commonsense Reasoning about Social Interactions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09728","snapshot_observed_at":"2026-08-09T15:36:04.476090Z","title":"Socialiqa: Com- monsense reasoning about social interactions","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.476090Z"},"links":{"cited_paper":"/paper/1904.09728","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:1b13d940411338199c8cc28b1dc3cf8d7e6a0ea826bff2c2ef22f5569f12a870","observation_id":"a7f429e3-185e-47ce-bae0-732a356b76ac","resolution":{"observed_at":"2026-08-09T15:36:04.476090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-09T15:36:04.480293Z","title":"Hellaswag: Can a machine really finish your sentence? arXiv preprint arXiv:1905.07830, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.480293Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:c95e4308903a46a0591b9ee406c93853458188049f0f019544cf3b06ce39179b","observation_id":"a487be32-e9df-4b2f-bdf2-21825767e103","resolution":{"observed_at":"2026-08-09T15:36:04.480293Z","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-09T15:36:04.484204Z","title":"Winogrande: An adversarial winograd schema challenge at scale","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.484204Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:833753c46877e410a3cef8b9a477679f9d1ba73b8febc02379824f0b6e00825e","observation_id":"88eae423-85ee-4608-8743-d23f73943131","resolution":{"observed_at":"2026-08-09T15:36:04.484204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-09T15:36:04.487020Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.487020Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:54cbb6f58926bc349e6bf07734b068dbf932f48986e4433dcc2bf8f4242c10af","observation_id":"ce8b0b48-48b6-4c80-a99d-838a19683567","resolution":{"observed_at":"2026-08-09T15:36:04.487020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-08-08T02:19:52.596062Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-09T15:36:04.490182Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.490182Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:067149f6d2286acc9aebb8ab863d74f729293708bcdc0f8d1086bd2d31d83f40","observation_id":"ecc1dff6-be7a-4d7b-aa89-880a23302ca2","resolution":{"observed_at":"2026-08-09T15:36:04.490182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.01413","last_updated":"2016-08-20T11:50:41Z","snapshot_observed_at":"2026-08-09T10:12:36.401845Z","submitted_at":"2016-08-04T01:47:23Z","title":"Solving General Arithmetic Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.01413","snapshot_observed_at":"2026-08-09T15:36:04.493340Z","title":"Solving general arithmetic word problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.493340Z"},"links":{"cited_paper":"/paper/1608.01413","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:19d69dc6083dd91aac6c14ae5b2bdbbbdaea0121d9657a804375dc9215e093cb","observation_id":"7e52f85e-e1a6-4a72-a7fd-810aeb40f650","resolution":{"observed_at":"2026-08-09T15:36:04.493340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-09T15:36:04.496474Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.496474Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:ab9b207449bfdccaf90efbdd1f5eaef8ceb4cf233dfa823efcc94e8307722837","observation_id":"dcd6a529-f118-489c-897e-dc45e5114cc1","resolution":{"observed_at":"2026-08-09T15:36:04.496474Z","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-09T15:36:05.415979Z","title":"Learning to solve arithmetic word problems with verb categorization","venue":null,"work_id":"6679e40b-4b82-4a20-985d-0f4b8861402a","year":2014},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.499709Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:66c0e05873ee391387286ccb652537d7fb9a502749687c7d9a45cc3371f91c68","observation_id":"7cd19fc0-b7a5-452d-b5ff-9015eacd5ca8","resolution":{"observed_at":"2026-08-09T15:36:05.420344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:05.404435Z","title":"Program induction by rationale generation: Learning to solve and explain algebraic word problems","venue":null,"work_id":"7a8ec750-4dfb-48d4-a6ce-cbfa6fa43c51","year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.503299Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:faf559bdd3b371f16a8f674c363658ab97778bf7d655166f7dc9a68f0956cba5","observation_id":"5120e42f-836b-4cf5-bc13-e0379b6e6fda","resolution":{"observed_at":"2026-08-09T15:36:05.408255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:04.510195Z","title":"Parsing algebraic word problems into equations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.510195Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2c3a503ef0eafef9c286c40b81dfd560a73f2c8ba6435bfdb3b0254c63d820a6","observation_id":"8a3a4dcc-5bf0-4a2f-9943-24926d6da7ba","resolution":{"observed_at":"2026-08-09T15:36:04.510195Z","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-09T15:36:05.380971Z","title":null,"venue":null,"work_id":"708a9eb4-c2b4-4464-8baa-79ec125d0546","year":2021},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.513740Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:c3a2c9c1d131d0fa4fd44dd6f55d5c2486776431a721d636978c5618b1c646ca","observation_id":"d4aab167-4347-4a18-b0d1-6567589f69c2","resolution":{"observed_at":"2026-08-09T15:36:05.384727Z","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-09T15:36:05.369827Z","title":"MAWPS: A math word problem repository","venue":null,"work_id":"f068a5fb-55e9-4e30-bfab-dabdac75ab25","year":2016},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.517167Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:aa57676b720770efdf5d919c92e889f1a560db06e1e4cb12318b9f1817a97c43","observation_id":"8a8982f4-86c7-4029-b7eb-153b53ec0bc4","resolution":{"observed_at":"2026-08-09T15:36:05.373645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:04.520269Z","title":"Llama 2: Open foundation and fine-tuned chat models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.520269Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:73383414d50fd1256f6c0b88e94869abfb2b654fdd494b5529bbef1803e265ad","observation_id":"796d26dd-92fb-445d-b2e1-e52056049789","resolution":{"observed_at":"2026-08-09T15:36:04.520269Z","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-09T15:36:04.523564Z","title":"Llama 3 model card","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.523564Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:5070b4881269983caa05a52f859555e7d9340598c607f3ca2da85be9355c0442","observation_id":"71479d94-dfef-42d1-9708-ab453b7b9174","resolution":{"observed_at":"2026-08-09T15:36:04.523564Z","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-09T15:36:04.526711Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.526711Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:3e213f28432106edae1d334fb1d1374bddf60f7e2a271c0fe5010186649ecc8a","observation_id":"11b5314d-38b4-46a4-b6ab-eb045cb51925","resolution":{"observed_at":"2026-08-09T15:36:04.526711Z","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-09T15:36:04.530091Z","title":"Improving language understanding by generative pre-training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.530091Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:c378d7208fc760beb9fd92da012405f42116b91cf7d0d164936a84e32bd75899","observation_id":"906cc04e-9410-4e80-a887-8eb1e57b0711","resolution":{"observed_at":"2026-08-09T15:36:04.530091Z","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-09T15:36:04.533313Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.533313Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:b625ca513a9e663d5d1c75767026955a3e756bc4b0baeff4cd9f943d97a838ad","observation_id":"cde9661f-7e2a-4b15-af4d-7b67c1b20c2b","resolution":{"observed_at":"2026-08-09T15:36:04.533313Z","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-09T15:36:04.536602Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.536602Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:22b133009796e8332835d9275b9f585cccfdcde070bc8ee19a7ba368dc5d2156","observation_id":"c86edbe3-7a32-4c3a-840c-d3f60995661d","resolution":{"observed_at":"2026-08-09T15:36:04.536602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-09T15:36:04.539969Z","title":"Opt: Open pre-trained transformer language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.539969Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:f87abbf064b84aff8b35f05a4e76e3e39080a38ac68ea6393340ba6af3bcaad9","observation_id":"c1dd38b1-9c3a-4c41-874c-9696f866578e","resolution":{"observed_at":"2026-08-09T15:36:04.539969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-09T15:36:04.543675Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.543675Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:5ec10c671dffb221fe4dcdb19915bfdb76e1c9524f5efd024260a8d7107dd52d","observation_id":"19309529-df6a-4457-bcd3-bea4486e426e","resolution":{"observed_at":"2026-08-09T15:36:04.543675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-09T15:36:04.547121Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.547121Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:ff515c9f3fc7e7e0133be811ad992155f854dd03b44a2f4bb5117a6c2e733aa4","observation_id":"4f1c1232-f414-4e3e-bed3-74c31b37b8f5","resolution":{"observed_at":"2026-08-09T15:36:04.547121Z","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-09T15:36:04.550728Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.550728Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:3d2fb6043e0b9387066d7d53817f93ac5543951a9bb10d083fdee046ff0ba5a8","observation_id":"b791e550-9fce-42cd-8ef9-33c354a64def","resolution":{"observed_at":"2026-08-09T15:36:04.550728Z","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-09T15:36:05.320318Z","title":"Bloom: A 176b-parameter open-access multilingual language model","venue":null,"work_id":"cce8de6d-85d2-4572-b61c-fbeb3db4c11a","year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.554248Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:78b9c0fde5b805981e9e23e85fba8bd90143d5ab44018d0728ed5be5c03e5c7f","observation_id":"cb9227cc-62e5-438a-bfdc-6b29ac800c0b","resolution":{"observed_at":"2026-08-09T15:36:05.324192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:04.558116Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.558116Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:3b075917facc5611d813db39c450c2dfc192d3a4367288e88a07225b3a452ec6","observation_id":"2a648d4e-cc30-483e-8642-ede31c079dff","resolution":{"observed_at":"2026-08-09T15:36:04.558116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01116","last_updated":"2023-06-01T20:03:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-01T20:03:56Z","title":"The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Only","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01116","snapshot_observed_at":"2026-08-09T15:36:04.561844Z","title":"The refinedweb dataset for falcon llm: outperforming curated corpora with web data, and web data only","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.561844Z"},"links":{"cited_paper":"/paper/2306.01116","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:f857bb5ceff1102d58d2d9d66231e0881be97967cb8a8299fd4f9cf79505a08b","observation_id":"f3ae2700-0bca-4105-8dfa-cc8ac20764d1","resolution":{"observed_at":"2026-08-09T15:36:04.561844Z","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-09T15:36:04.565822Z","title":"Parameter-efficient transfer learning for nlp","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.565822Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:65a817b10b0a03b73d1d5b6a71e517185a6fe605cb22bedc4405ab45e88cbcc9","observation_id":"9ab0943b-1e86-4ac2-894c-369b9ddf5a22","resolution":{"observed_at":"2026-08-09T15:36:04.565822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07779","last_updated":"2020-10-06T10:16:39Z","snapshot_observed_at":"2026-07-06T09:38:29.271727Z","submitted_at":"2020-07-15T15:56:05Z","title":"AdapterHub: A Framework for Adapting Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.07779","snapshot_observed_at":"2026-08-09T15:36:04.569028Z","title":"Adapterhub: A framework for adapting transformers","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.569028Z"},"links":{"cited_paper":"/paper/2007.07779","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:a5f34cf13f681cdbb5bf597a912676c1d904df090b3b5d3f4626674a58cba11a","observation_id":"3a80791f-8fa5-4756-8f50-68105d016cfb","resolution":{"observed_at":"2026-08-09T15:36:04.569028Z","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-09T15:36:04.572728Z","title":"Relora: High- rank training through low-rank updates","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.572728Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:243d1cff7ed307e8fe1ae74f32cb11182305ad5278532bb2c4b8cfb6f9904c6d","observation_id":"f6f0e3fd-d2c0-4beb-bd59-181a6cf11535","resolution":{"observed_at":"2026-08-09T15:36:04.572728Z","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-09T15:36:05.292989Z","title":"S$^{2}$FT: Efficient, scalable and generalizable LLM fine-tuning by structured sparsity","venue":null,"work_id":"6fc3209c-8a37-480d-9b12-e740414451e2","year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.576349Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:d6997c8a245a30ff282b59bd92f2c763bd9395cc65ade15c1ccf7c4a7c8652aa","observation_id":"abc781bc-f05c-4772-a1f8-6438a374a6ed","resolution":{"observed_at":"2026-08-09T15:36:05.297632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2406.02214","last_updated":"2024-11-02T06:00:03Z","snapshot_observed_at":"2026-08-09T23:15:37.277013Z","submitted_at":"2024-06-04T11:14:21Z","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02214","snapshot_observed_at":"2026-08-09T15:36:04.579549Z","title":"Sltrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.579549Z"},"links":{"cited_paper":"/paper/2406.02214","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:b561eda8c8c556cde0757458a41da86d942f90c8b5fcec1b270bf41720064b25","observation_id":"828a1067-31be-409d-bf22-9cdd11ee32d0","resolution":{"observed_at":"2026-08-09T15:36:04.579549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17919","last_updated":"2024-12-25T19:03:23Z","snapshot_observed_at":"2026-07-06T17:51:28.420385Z","submitted_at":"2024-03-26T17:55:02Z","title":"LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17919","snapshot_observed_at":"2026-08-09T15:36:04.583127Z","title":"Lisa: Layerwise importance sampling for memory-efficient large language model fine-tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.583127Z"},"links":{"cited_paper":"/paper/2403.17919","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:bf163dccd1749138966517f024bf8211bc5c5ca8342c1ba170cd8036db8ce1ea","observation_id":"5b35d931-cb0a-4ea5-ae22-bd8a186a8584","resolution":{"observed_at":"2026-08-09T15:36:04.583127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03507","last_updated":"2024-06-02T21:24:12Z","snapshot_observed_at":"2026-07-06T17:40:15.746482Z","submitted_at":"2024-03-06T07:29:57Z","title":"GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03507","snapshot_observed_at":"2026-08-09T15:36:04.586608Z","title":"Galore: Memory-efficient llm training by gradient low-rank projection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.586608Z"},"links":{"cited_paper":"/paper/2403.03507","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:aec489085026f94f40a5cde8af94ffd957e4e67a87061d2e5ab63e48708383bd","observation_id":"8163b80d-d668-4393-ac9d-ae4bab343c4a","resolution":{"observed_at":"2026-08-09T15:36:04.586608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-08-09T15:36:04.589680Z","title":"Subspace optimization for large language models with convergence guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.589680Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:9bf76029cb757e5e2800248d016571e2c6c5d63dfebf2dc3e9f63802b7158fc1","observation_id":"dfac57be-e5e6-4ba9-8383-5e67cd2b3517","resolution":{"observed_at":"2026-08-09T15:36:04.589680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03293","last_updated":"2024-06-12T22:17:37Z","snapshot_observed_at":"2026-08-05T09:55:40.815776Z","submitted_at":"2024-02-05T18:50:39Z","title":"Flora: Low-Rank Adapters Are Secretly Gradient Compressors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03293","snapshot_observed_at":"2026-08-09T15:36:04.592683Z","title":"Flora: Low-rank adapters are secretly gradient compressors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.592683Z"},"links":{"cited_paper":"/paper/2402.03293","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:0e255cf73df217ef7c85097e82ba83cd01acb6e4954235b5ef47c9191471dbab","observation_id":"90c3e789-de35-4d12-ba7f-00a8d4aed1e0","resolution":{"observed_at":"2026-08-09T15:36:04.592683Z","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-09T15:36:05.179001Z","title":"Back razor: Memory-efficient transfer learning by self-sparsified backpropagation","venue":null,"work_id":"56126f45-211b-431d-83da-6961c185b14e","year":2022},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.595492Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:d5aca759d652ca3bbeabf03d85f209cafe9773e76710dd8a2eb2ea0846d17f2f","observation_id":"e0758e33-bda0-4aca-9cb0-f0d89f52189c","resolution":{"observed_at":"2026-08-09T15:36:05.182835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T15:36:05.168801Z","title":"Sheared back- propagation for fine-tuning foundation models","venue":null,"work_id":"cec2d8f7-d74b-445e-892d-63e7b57c5a73","year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.598687Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:52a4bd6d65d7e0e815d97aacded8c6f1968a375ab5567d85fa49b417531a7b4f","observation_id":"a1e9e345-4ecc-47db-8603-01d3f18c8a71","resolution":{"observed_at":"2026-08-09T15:36:05.172074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1710.03740","last_updated":"2018-02-15T20:04:02Z","snapshot_observed_at":"2026-07-06T06:03:37.247241Z","submitted_at":"2017-10-10T17:42:04Z","title":"Mixed Precision Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.03740","snapshot_observed_at":"2026-08-09T15:36:04.601816Z","title":"Mixed precision training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.601816Z"},"links":{"cited_paper":"/paper/1710.03740","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:2c9739b5f6cb81a6a436699bf449da0a75bb5eb1f5227b9622f5801e6b10fdec","observation_id":"634db3ce-5d63-410d-98fd-a21824293f93","resolution":{"observed_at":"2026-08-09T15:36:04.601816Z","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-09T15:36:04.605737Z","title":"Qlora: Efficient finetuning of quantized llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.605737Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:fe313e7d73cb25af55a74d6664955514355b3224af555ccb1d2edb85d48f1ee5","observation_id":"4f345764-70c8-4294-9e7e-b086a8e8e989","resolution":{"observed_at":"2026-08-09T15:36:04.605737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05270","last_updated":"2025-02-17T08:27:58Z","snapshot_observed_at":"2026-08-06T09:09:00.082930Z","submitted_at":"2024-12-06T18:55:34Z","title":"APOLLO: SGD-like Memory, AdamW-level Performance","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.05270","snapshot_observed_at":"2026-08-09T15:36:04.609015Z","title":"Apollo: Sgd-like memory, adamw-level performance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.609015Z"},"links":{"cited_paper":"/paper/2412.05270","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:7dfb47a232145f369d5963569f9155bccebdf4e5d9e98536ad7a817913438f43","observation_id":"5f0b7288-dee8-4114-b32d-914e834b639b","resolution":{"observed_at":"2026-08-09T15:36:04.609015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17812","last_updated":"2025-02-28T12:53:34Z","snapshot_observed_at":"2026-07-06T17:36:27.931373Z","submitted_at":"2024-02-27T14:51:11Z","title":"DropBP: Accelerating Fine-Tuning of Large Language Models by Dropping Backward Propagation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17812","snapshot_observed_at":"2026-08-09T15:36:04.612958Z","title":"Dropbp: Accelerating fine-tuning of large language models by dropping backward propagation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.612958Z"},"links":{"cited_paper":"/paper/2402.17812","citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:1538d5efa44d3c713fe5db4c799dcc9b6dddc0324028bf77f619646591bb53ec","observation_id":"dde316be-93f3-4f55-bfb5-36f4c2dd0173","resolution":{"observed_at":"2026-08-09T15:36:04.612958Z","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-09T15:36:05.152131Z","title":null,"venue":null,"work_id":"55592033-ac09-4d5e-8f87-51cdb3dd2746","year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.616640Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:db2b203065a8a59000f72e41f53f8407ef9fc0cc9d4bcd9da40aa10abbcff68a","observation_id":"9faff1bb-5271-4124-88c3-f2164ea7bcb8","resolution":{"observed_at":"2026-08-09T15:36:05.155291Z","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-09T15:36:05.141853Z","title":null,"venue":null,"work_id":"86362980-21d8-4eff-8bbe-5649d15c14f5","year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.620053Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:af4dcad8b92471bdf82ae354c08626a5f2323ec56d336012b91a87c9501f6401","observation_id":"7b4b0cc1-937e-4c1b-ba6a-274839a4ecba","resolution":{"observed_at":"2026-08-09T15:36:05.145269Z","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-09T15:36:04.506781Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-09T15:36:04.506781Z"},"links":{"citing_paper":"/paper/2502.01378"},"observation_digest":"sha256:b19191368271d98bd2fe9ae56957bc02d4e05042355884462c94d22c1152336a","observation_id":"edce4c6c-da2f-4de1-94a8-67175cca20e2","resolution":{"observed_at":"2026-08-09T15:36:04.506781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.01378","last_updated":"2025-02-03T14:15:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T23:16:13.908333Z","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":61},"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 61 of 61 outbound references and 1 inbound Pith citation observation for arXiv:2502.01378."}