{"as_of":"2026-08-15T06:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0239030c85d1b2feb0a8c26f75b963d0859495b5e51ac2c37a7b1ef9c42792d8","coverage":[{"denominator":117,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:43:54.429969Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2506.13187/citation-record","integrity":"/paper/2506.13187/integrity","json":"/paper/2506.13187/citation-record.json","paper":"/paper/2506.13187"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","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-07T00:43:41.663472Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:41.663472Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6d7fedaf4d447fb55906410dc565146ca3eb5a2d238b3413bb3b894f03e30ced","observation_id":"4e0a7087-bcc0-4b2b-8203-0b86ef389586","resolution":{"observed_at":"2026-08-07T00:43:41.663472Z","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-07T00:43:41.758749Z","title":"Improving language understanding by generative pre-training,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:41.758749Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:46c63dcfc1902587289458e09644cdf76a27936ce9d0c748b8450c4b1c2093a4","observation_id":"79f56404-f2f0-4ebd-aafd-c891f644d0a6","resolution":{"observed_at":"2026-08-07T00:43:41.758749Z","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-07T00:43:41.975686Z","title":"Language models are few-shot learners,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:41.975686Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:038a2cfd9a37533859d0913e9be263e58489b0e15eb6c98e95244d9642442042","observation_id":"078231ff-b815-4419-8ce0-f4dd28a8d524","resolution":{"observed_at":"2026-08-07T00:43:41.975686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05317","last_updated":"2019-06-14T20:13:16Z","snapshot_observed_at":"2026-08-14T16:16:35.884746Z","submitted_at":"2019-06-12T18:11:20Z","title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05317","snapshot_observed_at":"2026-08-07T00:43:42.093689Z","title":"Comet: Commonsense transformers for automatic knowledge graph construction,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.093689Z"},"links":{"cited_paper":"/paper/1906.05317","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:766020e56dbf49dc38a6ad6923e02b849d4c7799115f10169ae6fa8dfd312d42","observation_id":"6a2977ca-3840-4e77-bac4-3d363ee91696","resolution":{"observed_at":"2026-08-07T00:43:42.093689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.08593","last_updated":"2020-01-08T23:02:36Z","snapshot_observed_at":"2026-08-15T00:23:48.160874Z","submitted_at":"2019-09-18T17:33:39Z","title":"Fine-Tuning Language Models from Human Preferences","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.08593","snapshot_observed_at":"2026-08-07T00:43:42.262629Z","title":"Fine-tuning language models from human preferences,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.262629Z"},"links":{"cited_paper":"/paper/1909.08593","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:02699147ccb782374be024ef54d858059cb9fdef760388c74ecd854eabcbe27e","observation_id":"0cd2d397-f8df-4c78-b46f-4a58d77e7e41","resolution":{"observed_at":"2026-08-07T00:43:42.262629Z","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-07T00:43:42.387737Z","title":"Parameter-efficient transfer learning for nlp,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.387737Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:9c11720c7cdd5bd92dc29f5939392b69e4f8759c316a5d875b9101b27b2eb923","observation_id":"470da126-4227-4cf7-a245-fd92fa5a53da","resolution":{"observed_at":"2026-08-07T00:43:42.387737Z","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-07T00:43:42.536331Z","title":"LoRA: Low-rank adaptation of large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.536331Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:b16c958512e7226700245fbffb054fcef308899b9524c2f0be7f7867270b4781","observation_id":"d6c5e5a8-f9ae-4426-a283-146fcab8f47c","resolution":{"observed_at":"2026-08-07T00:43:42.536331Z","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-07T00:43:42.678194Z","title":"Towards a unified view of parameter-efficient transfer learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.678194Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:d5114a526ef151747baf183363466285f08e36c750056047a66862cb27e774bd","observation_id":"06c2021e-96b7-4b50-b07b-daea9d9a21ba","resolution":{"observed_at":"2026-08-07T00:43:42.678194Z","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-07T00:43:42.870649Z","title":"The power of scale for parameter-efficient prompt tuning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:42.870649Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:e4cf2c80f10eb546363a5927d6c7cda6d00b70a6f224f46dab48f436204e3be9","observation_id":"c613ce88-b4d5-47ae-9015-d98bdd675a28","resolution":{"observed_at":"2026-08-07T00:43:42.870649Z","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-07T00:43:43.071158Z","title":"Prefix-tuning: Optimizing continuous prompts for generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.071158Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6ea6ad7e175a23447e5ed4d1d5b8f424ea4b27b6e65433f3cccd6e40ffc20015","observation_id":"5b5d111a-35bb-4948-92d7-3d3dc1b921ec","resolution":{"observed_at":"2026-08-07T00:43:43.071158Z","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-07T00:43:43.216295Z","title":"Residual prompt tuning: improving prompt tuning with residual reparameterization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.216295Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:8a40534c6a09b76b7ab0562e10f5f1dea9f11bf373120de7870bff0a83da723b","observation_id":"b1e740bc-5d3c-4c78-9221-67cc839eb6a3","resolution":{"observed_at":"2026-08-07T00:43:43.216295Z","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-07T00:43:43.291207Z","title":"Adaptive budget allocation for parameter-efficient fine- tuning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.291207Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7cbfd56fea25245296ec7a83f0536c6d3cb5cef4080365818b53618bcbe88c70","observation_id":"b2f57976-85c4-4386-9cc0-861a464054d7","resolution":{"observed_at":"2026-08-07T00:43:43.291207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07558","last_updated":"2023-04-19T04:28:24Z","snapshot_observed_at":"2026-08-13T14:05:21.644318Z","submitted_at":"2022-10-14T06:29:22Z","title":"DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07558","snapshot_observed_at":"2026-08-07T00:43:43.356345Z","title":"Dylora: Parameter efficient tuning of pre-trained models using dynamic search- free low-rank adaptation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.356345Z"},"links":{"cited_paper":"/paper/2210.07558","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:f42cd2999545e15e40ce0bf03c26894ad6aa9023a2719e88f653ddd4c6d64c1f","observation_id":"f2202779-1d69-40fa-828f-5f1e8e89cb22","resolution":{"observed_at":"2026-08-07T00:43:43.356345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12043","last_updated":"2023-08-23T10:08:10Z","snapshot_observed_at":"2026-08-13T10:29:08.210961Z","submitted_at":"2023-08-23T10:08:10Z","title":"IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12043","snapshot_observed_at":"2026-08-07T00:43:43.429659Z","title":"Increlora: Incremental parameter allocation method for parameter-efficient fine- tuning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.429659Z"},"links":{"cited_paper":"/paper/2308.12043","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:8d687c7a2803c9ec54011fe0604211cf1b988a7d4c5e2e65e0a14071453c7eb5","observation_id":"29f949df-8960-4b21-8b3f-a8334591c684","resolution":{"observed_at":"2026-08-07T00:43:43.429659Z","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-07T00:43:43.623738Z","title":"Dora: Weight-decomposed low-rank adaptation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.623738Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:98f2849de5af1c173821d7f7999529e392741a5184169c27d0f8cf946538f7de","observation_id":"de6400a7-d2f0-4f7c-9f39-af460740e612","resolution":{"observed_at":"2026-08-07T00:43:43.623738Z","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-07T00:43:43.781815Z","title":"Lora+: efficient low rank adaptation of large models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.781815Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:2f9d4d09a3f4d9bb51972e7a5abcf276879ee45e65f6f68f4be7e12fbbb2a80b","observation_id":"d5b78b46-802e-43c3-b06a-47973eac256c","resolution":{"observed_at":"2026-08-07T00:43:43.781815Z","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-07T00:43:43.957025Z","title":"Vera: Vector-based random matrix adaptation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:43.957025Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:dfa3e171999455b8f3da64d96ea16185d984b852838fccea1ddcc17c943e8ae1","observation_id":"a3e162fb-4ee5-475f-a20c-46227fa720f3","resolution":{"observed_at":"2026-08-07T00:43:43.957025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09578","last_updated":"2024-04-12T23:15:51Z","snapshot_observed_at":"2026-08-13T05:24:11.208172Z","submitted_at":"2023-11-16T05:29:39Z","title":"Tied-Lora: Enhancing parameter efficiency of LoRA with weight tying","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.09578","snapshot_observed_at":"2026-08-07T00:43:44.025509Z","title":"Tied-lora: Enhac- ing parameter efficiency of lora with weight tying,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.025509Z"},"links":{"cited_paper":"/paper/2311.09578","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:ad7d4185e38325df645cede3a6bd9bc2a8ed7b9fcd1f669734f76db0f22318ea","observation_id":"63941320-43f5-4db7-9455-b8752eadc724","resolution":{"observed_at":"2026-08-07T00:43:44.025509Z","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-07T00:43:44.213608Z","title":"Qlora: Efficient finetuning of quantized llms,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.213608Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:34425cabf6c3f7689f70db5b191f932165d184e809384b0860c5095f89c90867","observation_id":"8e2f3010-7400-45d6-be70-b059f51e2a07","resolution":{"observed_at":"2026-08-07T00:43:44.213608Z","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-07T00:43:44.345557Z","title":"QA-loRA: Quantization-aware low-rank adaptation of large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.345557Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7f1e307af2fec6f7c574db69d6d0c2a8aa04604351e02242d8c7963d1e778d14","observation_id":"28de4d86-2c2b-4a60-b88b-a17bbe7a10a6","resolution":{"observed_at":"2026-08-07T00:43:44.345557Z","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-07T00:43:44.505765Z","title":"Loftq: LoRA-fine-tuning-aware quantization for large language mod- els,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.505765Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:b623f0aec937c5f5016e0ae09fba2179ec075ecb49e3ba6c29d9db7736eb1bbb","observation_id":"752f0f01-f8d6-4d84-bfe6-5f33013c99c8","resolution":{"observed_at":"2026-08-07T00:43:44.505765Z","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-07T00:43:44.630189Z","title":"LoRAPrune: Structured pruning meets low-rank parameter-efficient fine-tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.630189Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:e933c5915165b45bee11ed017e16e630b8a9c9d0648e3715111ab10d0aa07470","observation_id":"96f27793-f045-421f-bdc4-99b1652f1b50","resolution":{"observed_at":"2026-08-07T00:43:44.630189Z","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-07T00:43:44.750186Z","title":"NOLA: Compressing loRA using linear combination of random basis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.750186Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6d7b109acbecc72e0a2ae3b36d7a887904e8db51ebd057bee308e5361b886995","observation_id":"abbdad79-ac6e-4298-83a8-d0393659d362","resolution":{"observed_at":"2026-08-07T00:43:44.750186Z","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-07T00:43:44.870951Z","title":"VB-loRA: Extreme parameter efficient fine- tuning with vector banks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:44.870951Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:788c09e653562e9a5586e4140783afe23f877013acf994ded44ea094fe46ccc0","observation_id":"cf34da90-e542-46a0-b2dd-8e872df59471","resolution":{"observed_at":"2026-08-07T00:43:44.870951Z","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-07T00:43:45.060890Z","title":"The impact of initialization on lora finetuning dynamics,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.060890Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:3fd590b7c7dc0b9cd515d9fe0616401d1eefcaa00536bdec1645bd44991ac2a5","observation_id":"807fec6d-af6a-4a73-87d3-626713b8bf2b","resolution":{"observed_at":"2026-08-07T00:43:45.060890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17604","last_updated":"2025-08-19T19:14:56Z","snapshot_observed_at":"2026-08-12T23:56:46.255255Z","submitted_at":"2024-05-27T19:07:13Z","title":"LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17604","snapshot_observed_at":"2026-08-07T00:43:45.168599Z","title":"Lora-xs: Low-rank adaptation with extremely small number of parameters,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.168599Z"},"links":{"cited_paper":"/paper/2405.17604","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:025588e8fd3add77d1f096e417d737535943094c9dc84a86caf9b2541f33bbaa","observation_id":"7d63506e-f843-499f-b50b-437159d7e42f","resolution":{"observed_at":"2026-08-07T00:43:45.168599Z","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-07T00:43:45.272532Z","title":"Pissa: Principal singular values and singular vectors adaptation of large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.272532Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:ba5c9a48c8f6b1cf50c683357e5333cfc1a23cbf6bb5a210ec43bb526a256745","observation_id":"a76a5d8c-74c8-4af0-8331-784f3399e6cd","resolution":{"observed_at":"2026-08-07T00:43:45.272532Z","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-07T00:43:45.449976Z","title":"Latent retrieval for weakly supervised open domain question answering,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.449976Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:99ecf6735d459d4d0a0d3f59cecc8e2d2a7fe94b6783ad8c96d105890d660147","observation_id":"8b1272a1-45fe-4c00-b7ba-a6c3129d238a","resolution":{"observed_at":"2026-08-07T00:43:45.449976Z","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-07T00:43:45.590233Z","title":"TriviaQA: A large scale distantly supervised challenge dataset for reading comprehen- sion,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.590233Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:84364a3ebf57b05e8c8e4e3b1b9058a3e8d8e90ed76a8733a2044e6bb0d1999a","observation_id":"cf4443ec-8d61-44b0-a3fa-34d21983a6e3","resolution":{"observed_at":"2026-08-07T00:43:45.590233Z","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-07T00:43:45.733965Z","title":"Metamath: Bootstrap your own mathematical questions for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.733965Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:eb280008cb2f5ef8b3846eb602fca728e31d8753e406997c83e036f9f1d82031","observation_id":"526d93c5-dacd-49ed-9eeb-23e6efc18627","resolution":{"observed_at":"2026-08-07T00:43:45.733965Z","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-07T00:43:45.826055Z","title":"Corda: Context-oriented decomposition adaptation of large language models for task-aware parameter-efficient fine-tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.826055Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:5b48064cbe1f91d9b637ded554850c6d9a9fe980cc8209462a290286f21f4d9f","observation_id":"58dbdb54-eea4-4aa4-a6eb-864ee87877d5","resolution":{"observed_at":"2026-08-07T00:43:45.826055Z","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-07T00:43:45.937895Z","title":"Towards theoretically inspired neural initialization optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:45.937895Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:dfd06d7ab48b5d197c275a8bd979bc7d0625b7bcb24081010b28250cc3d25da5","observation_id":"7d7b1ef5-d504-44a7-901c-5c8373173957","resolution":{"observed_at":"2026-08-07T00:43:45.937895Z","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-14T02:43:01.480086Z","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-07T00:43:46.071032Z","title":"Training verifiers to solve math word problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.071032Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:86c8ad51e7f6d7082f9613ab9818d966f249116f5aa390790124a3c9b2f4ae98","observation_id":"1db21544-2cd0-4497-acd2-1d50a9f1b370","resolution":{"observed_at":"2026-08-07T00:43:46.071032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-07T00:43:46.219537Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.219537Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:eb170318a7d8708fd751eea2c8bdda9b6726db816680a78123e584d67f9e0db4","observation_id":"599a5b93-8a79-4c67-b1da-8ff56df37a76","resolution":{"observed_at":"2026-08-07T00:43:46.219537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-07T00:43:46.352915Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.352915Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:89310475e0b0a0ccf70ab8c44654281d26f8446454842877be8dc0a815e91279","observation_id":"5bdbe9b7-16c1-4ad6-9079-cc0aaa37d97a","resolution":{"observed_at":"2026-08-07T00:43:46.352915Z","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-07T00:43:46.476352Z","title":"Judging llm-as-a-judge with mt- bench and chatbot arena,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.476352Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:c0f3c98dfaefc50272cfeeff9d4e338b6f3d0384af1df17dca0ccbbf470be0a4","observation_id":"602b617c-fbab-4519-bd99-bf67ea370990","resolution":{"observed_at":"2026-08-07T00:43:46.476352Z","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-07T00:43:46.552081Z","title":"Semantic parsing on freebase from question-answer pairs,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.552081Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7eabf1a0eab4aaaa18a63e99b8973251e2512de91b5f6671113f0cf6dfeaa0c2","observation_id":"f36bbe2e-3f9b-4fea-93fb-b751b62710e4","resolution":{"observed_at":"2026-08-07T00:43:46.552081Z","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-07T00:43:46.694536Z","title":"8-bit optimiz- ers via block-wise quantization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.694536Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:4d594ad984165a025514fd80ec84bcfdac1c018c594570aba1c0ec906b3487fb","observation_id":"1b35a448-2ec4-4534-ad0c-61e213788370","resolution":{"observed_at":"2026-08-07T00:43:46.694536Z","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-07T00:43:46.860234Z","title":"Visual instruction tuning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:46.860234Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7a05791a0e72b99d4485a09dfa4b4486a6b869d7a7dea13930d35a6fc1eecd31","observation_id":"57e5b943-0cd8-4089-850d-8f59633a7ea9","resolution":{"observed_at":"2026-08-07T00:43:46.860234Z","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-07T00:43:47.032117Z","title":"Improved baselines with visual instruction tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.032117Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:de4680b7e1b1017cf56f9d9904a7fb4454699b9d8dfaa6c919b7af101dd2dbf6","observation_id":"403b8a25-f73d-4c1b-b29c-cefaf1047c40","resolution":{"observed_at":"2026-08-07T00:43:47.032117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T00:43:47.137729Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.137729Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6e82a877218cdaccbbcc0ca9afedcadfbe95f4a4da1cb2e9e7a0f51b0fd9f94a","observation_id":"95ba06a0-82e2-4b46-a708-7234b158b16f","resolution":{"observed_at":"2026-08-07T00:43:47.137729Z","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-07T00:43:47.270986Z","title":"Renaissance: A survey into ai text-to-image generation in the era of large model,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.270986Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:4cc2e8ca2b698aa1ae41300069c11828068ae4783cf0b1ee325d1d8a17d06bc1","observation_id":"ae745f12-f78d-4573-a2f9-a6f864f92021","resolution":{"observed_at":"2026-08-07T00:43:47.270986Z","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-07T00:43:47.411846Z","title":"Galore: Memory-efficient llm training by gradient low-rank projec- tion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.411846Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:2574f437dd9f05d068b4b3da757992915a2a0f82ee8fe562118ce7b27c853ad8","observation_id":"d5041a96-7ec2-48db-8b41-dd24fae9a6de","resolution":{"observed_at":"2026-08-07T00:43:47.411846Z","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-07T00:43:47.556445Z","title":"Towards interpretable deep local learning with successive gradient reconciliation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.556445Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:d57ca6c2ae4643c2bc1434d7b6b6edc2d33c70717eb1c7a9af9ed0428c5137c3","observation_id":"d99d4a52-9469-4c4a-9871-67aa73ac0cca","resolution":{"observed_at":"2026-08-07T00:43:47.556445Z","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-07T00:43:47.682249Z","title":"Parameter-efficient fine-tuning of large-scale pre-trained language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.682249Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:1c831e58e3c38074451c6d51efd609388ef4ed710dd673255ab8c522b82fc743","observation_id":"707d2288-3217-43a2-b8c1-ecb2b96c5137","resolution":{"observed_at":"2026-08-07T00:43:47.682249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.12148","last_updated":"2023-12-19T13:31:24Z","snapshot_observed_at":"2026-08-13T04:58:35.298301Z","submitted_at":"2023-12-19T13:31:24Z","title":"Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.12148","snapshot_observed_at":"2026-08-07T00:43:47.862146Z","title":"Parameter- efficient fine-tuning methods for pretrained language models: A critical review and assessment,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:47.862146Z"},"links":{"cited_paper":"/paper/2312.12148","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:23b25881b005a258f344a95f48b3be160c45f237889c17b3109a0c1a8a0e02a5","observation_id":"5bb92f7f-cf35-491a-a69c-cf8f49e6a57c","resolution":{"observed_at":"2026-08-07T00:43:47.862146Z","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-07T00:43:48.045694Z","title":"Conditional adapters: Parameter-efficient transfer learning with fast inference,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.045694Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:d608aed8e5e38de15535e497b19ae837181db188baf5c9fd96c64ceb614b9ae9","observation_id":"d726ee3b-f17d-4d9f-a9d3-f934110b9edf","resolution":{"observed_at":"2026-08-07T00:43:48.045694Z","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-07T00:43:48.155607Z","title":"Parameter- efficient multi-task fine-tuning for transformers via shared hypernet- works,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.155607Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:3844281bc21b414f70ed9aebc43e77c9ed8d1ce06ae5f86dfebef65cc6664911","observation_id":"53c9bd6b-7b74-4246-b57d-314de8b9709c","resolution":{"observed_at":"2026-08-07T00:43:48.155607Z","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-07T00:43:48.267211Z","title":"Adapter- fusion: Non-destructive task composition for transfer learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.267211Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:27fe9de9c10ad9a6feb9a38eb8d91cbf99795121bb7dee052d641c798715d45a","observation_id":"b308ec1f-3b87-4324-8f80-6cce7d6b255e","resolution":{"observed_at":"2026-08-07T00:43:48.267211Z","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-07T00:44:09.245301Z","title":"Compacter: Ef- ficient low-rank hypercomplex adapter layers,","venue":null,"work_id":"d95b4d12-eaae-4cbc-8947-c5ccbe3d9998","year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.424299Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7e1fb4b7634fe8ecd4acf3b0fe25de45e3048f24bcc6a2c75a192db84f36e18a","observation_id":"8fd1b579-94d9-46dd-a095-911331733c5a","resolution":{"observed_at":"2026-08-07T00:44:09.439931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:08.951142Z","title":"SPT: Learning to selectively insert prompts for better prompt tuning,","venue":null,"work_id":"8fe2197c-8ae9-4adf-819d-00e426f54ca8","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.554856Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:09ad5eec86dbb1b7b5b4009c5838b1644936ac1fc310e33a76269f15f6870ad9","observation_id":"fc840a86-b389-4978-9452-a3ce5b62694f","resolution":{"observed_at":"2026-08-07T00:44:09.121353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:08.635575Z","title":"Measuring the intrinsic dimension of objective landscapes,","venue":null,"work_id":"98d94f22-0e4f-43fd-8f82-4c0b62eb5d07","year":2018},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.693707Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:9ab0b8bce8d1f1749cc835aff68c590a427d9144d6fe69b38ec607ff6b47f7ce","observation_id":"598468e7-7a14-429f-9b03-2f1120acd109","resolution":{"observed_at":"2026-08-07T00:44:08.778303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13255","last_updated":"2020-12-22T07:42:30Z","snapshot_observed_at":"2026-08-14T01:48:39.766084Z","submitted_at":"2020-12-22T07:42:30Z","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13255","snapshot_observed_at":"2026-08-07T00:43:48.811606Z","title":"Intrinsic dimension- ality explains the effectiveness of language model fine-tuning,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:48.811606Z"},"links":{"cited_paper":"/paper/2012.13255","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:5ae62401378b77e9dbde40395e8f727455dc8f7ac5c340961b2bbfa8a2845a07","observation_id":"47218487-b391-4fa6-9710-2c135d10332c","resolution":{"observed_at":"2026-08-07T00:43:48.811606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07967","last_updated":"2023-10-16T15:52:20Z","snapshot_observed_at":"2026-08-14T07:04:49.109501Z","submitted_at":"2023-06-13T17:59:32Z","title":"One-for-All: Generalized LoRA for Parameter-Efficient Fine-tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.07967","snapshot_observed_at":"2026-08-07T00:43:49.017057Z","title":"One-for-all: Generalized lora for parameter-efficient fine-tuning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.017057Z"},"links":{"cited_paper":"/paper/2306.07967","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6a67a829dab51a499512e2fa64f229fdcbc28b721acf0e73bde656b4d1ba0290","observation_id":"e23c0c18-8c86-4e49-aca5-d78808f26ce8","resolution":{"observed_at":"2026-08-07T00:43:49.017057Z","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-07T00:44:08.283622Z","title":"Controlling text-to-image diffusion by orthogonal finetuning,","venue":null,"work_id":"019b2551-0e35-47d4-bb2e-90f0de61aa50","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.185475Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6adbee01d974ceaaba39a996a5bf205154ae8ffb946295e0b2b7a62cc847842b","observation_id":"c4242758-8d1c-4712-9334-04e26cff2271","resolution":{"observed_at":"2026-08-07T00:44:08.484502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:07.998434Z","title":"LQ-loRA: Low-rank plus quantized matrix decomposition for efficient language model finetuning,","venue":null,"work_id":"e272e8a8-9402-4eaf-a2a8-23df265c5768","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.294882Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:2a5e8fd1f3f6555f16591f5c3623127a4c0043c9d14228f738326c3b8d795188","observation_id":"b47ea63a-1d5f-443c-b30b-e31dd18b5807","resolution":{"observed_at":"2026-08-07T00:44:08.178882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18339","last_updated":"2024-05-31T07:56:08Z","snapshot_observed_at":"2026-08-13T05:44:02.778687Z","submitted_at":"2023-10-21T17:18:09Z","title":"When MOE Meets LLMs: Parameter Efficient Fine-tuning for Multi-task Medical Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18339","snapshot_observed_at":"2026-08-07T00:43:49.397014Z","title":"Moelora: An moe-based parameter efficient fine-tuning method for multi-task medical applications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.397014Z"},"links":{"cited_paper":"/paper/2310.18339","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:b8398bcb40bf6f9b83b0ae751c8cc3751f88ace1a769aece29768f6d29ce453a","observation_id":"5bdf4043-ac58-4559-abf6-d6b2ca1018a1","resolution":{"observed_at":"2026-08-07T00:43:49.397014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09979","last_updated":"2024-03-08T13:13:54Z","snapshot_observed_at":"2026-08-13T13:36:40.444758Z","submitted_at":"2023-12-15T17:45:06Z","title":"LoRAMoE: Alleviate World Knowledge Forgetting in Large Language Models via MoE-Style Plugin","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.09979","snapshot_observed_at":"2026-08-07T00:43:49.467029Z","title":"Loramoe: Alleviate world knowledge for- getting in largelanguage models via moe-style plugin,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.467029Z"},"links":{"cited_paper":"/paper/2312.09979","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:1eb9e9fdec4a0699d27eaee5061d51f1d29ae1e520b3ca211392b0336475c795","observation_id":"2e5cc9b6-1a07-43ca-8599-e6d67a76d7e1","resolution":{"observed_at":"2026-08-07T00:43:49.467029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09044","last_updated":"2025-03-02T04:45:56Z","snapshot_observed_at":"2026-08-13T20:18:52.716723Z","submitted_at":"2024-06-13T12:30:02Z","title":"MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09044","snapshot_observed_at":"2026-08-07T00:43:49.601007Z","title":"Milora: Harnessing minor singular components for parameter-efficient llm finetuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.601007Z"},"links":{"cited_paper":"/paper/2406.09044","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:b2b4c640f4083a10c91a733622817a736a24ee111fc8d09e9f075eff7ce39b4e","observation_id":"eda3c0dd-bf0b-47b8-bf5a-cd10c8eb27d5","resolution":{"observed_at":"2026-08-07T00:43:49.601007Z","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-07T00:44:07.662587Z","title":"Awq: Activation-aware weight quanti- zation for llm compression and acceleration,","venue":null,"work_id":"7f1f23cd-b296-4dd9-aa2d-7f83d89bcf29","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.756684Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:44841ee7895c4013eafc9d641bdf7434158893c8cf2867e3721451c6906fc86b","observation_id":"03cde7a9-0cf9-46f2-a7ab-89da80c5df7f","resolution":{"observed_at":"2026-08-07T00:44:07.805437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05821","last_updated":"2025-08-28T03:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-10T08:41:24Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-08-07T00:43:49.873768Z","title":"Asvd: Activation-aware singular value decomposition for compressing large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.873768Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:5f445592207f58601af19681cc5d0873807f32a8fb62e35e0dcc6974bbfcb041","observation_id":"a04e5bdb-bc39-4688-ab60-6b098d39b26d","resolution":{"observed_at":"2026-08-07T00:43:49.873768Z","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-07T00:44:07.392073Z","title":"Owq: Outlier-aware weight quantization for efficient fine-tuning and inference of large language models,","venue":null,"work_id":"86b88a48-a675-4314-90e3-a8a06640d1bf","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:49.986005Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:08ec1fa53f2eb0904df0eb898a3aeeaed8326ec92530f27d0ab3d420025eb924","observation_id":"8b07358b-176a-4838-b29d-fe5e53fe0728","resolution":{"observed_at":"2026-08-07T00:44:07.535099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6211","last_updated":"2015-03-04T01:43:31Z","snapshot_observed_at":"2026-08-14T23:50:42.566579Z","submitted_at":"2013-12-21T06:31:41Z","title":"An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6211","snapshot_observed_at":"2026-08-07T00:43:50.102023Z","title":"An empirical investigation of catastrophic forgetting in gradient-based neural networks,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.102023Z"},"links":{"cited_paper":"/paper/1312.6211","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:fcb66b5514863ca3670188a4546833a6418b0286bb01cf0e18fff975c1ccdad6","observation_id":"d01f5ad9-2c8a-48a6-9f1b-c39504544701","resolution":{"observed_at":"2026-08-07T00:43:50.102023Z","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-07T00:44:07.069915Z","title":"icarl: Incremental classifier and representation learning,","venue":null,"work_id":"84684a8b-f96b-4c98-b56e-ce2d04446955","year":2017},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.218398Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:19cc8e84d047bf0e2d5b72b867d9641377caa5e5c9e0e2da0784c0acfd3fffe2","observation_id":"87027867-d6a8-425c-8508-c9b18e59dadf","resolution":{"observed_at":"2026-08-07T00:44:07.221333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:43:50.319220Z","title":"Overcoming catastrophic forgetting in neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.319220Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:06da6cc2781593e6685c342167550cbb32e098cdb50fe29bb3050846853818dd","observation_id":"6b665f51-91bf-4960-8c86-3c38aacf6644","resolution":{"observed_at":"2026-08-07T00:43:50.319220Z","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-07T00:44:06.714940Z","title":"Continual unsupervised representation learning,","venue":null,"work_id":"953c8120-ffe1-4a6c-9f0c-1fc97a6c9603","year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.412360Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:de5c006b9f69d674ce118c9b647132e3637ae25729738a22b7140d77f944ef78","observation_id":"ee3f5f4b-82f3-4791-941e-3d56b7576207","resolution":{"observed_at":"2026-08-07T00:44:06.916826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:06.428491Z","title":"Gradient episodic memory for contin- ual learning,","venue":null,"work_id":"71e019eb-d98b-42b7-a6d7-1126286905f4","year":2017},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.500532Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:480c6dcd20ba803b723ca9ef416e0e637e181437b614a39ac836fdf740f3d702","observation_id":"134abdc0-dac7-4e01-88bc-3b5265753b42","resolution":{"observed_at":"2026-08-07T00:44:06.588358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:06.102087Z","title":"Neural collapse inspired feature-classifier alignment for few-shot class incremental learning,","venue":null,"work_id":"555ed97f-6850-46aa-a6c3-b1162c1a925d","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.639231Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:affae5a4bca292c6e6c4302109e63fdbae4e634943ba4ea58c5ebc5bc305996e","observation_id":"280d89fe-59c3-4d26-9f59-0120837c0f9c","resolution":{"observed_at":"2026-08-07T00:44:06.249090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01746","last_updated":"2023-08-03T13:09:59Z","snapshot_observed_at":"2026-08-13T10:41:52.309712Z","submitted_at":"2023-08-03T13:09:59Z","title":"Neural Collapse Terminus: A Unified Solution for Class Incremental Learning and Its Variants","version":1},"cited_work":{"arxiv_id":"2308.01746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.01746","snapshot_observed_at":"2026-08-07T00:43:56.671083Z","title":"Neural Collapse Terminus: A Unified Solution for Class Incremental Learning and Its Variants","venue":"cs.LG","work_id":"21095e84-3713-491b-8532-e3eaca30ab1f","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.778198Z"},"links":{"cited_paper":"/paper/2308.01746","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:d613d080e8d86fb3c5dfa2611a49d7def69804e48e40525353e37947146bba4e","observation_id":"923929a5-82ee-41d7-a95f-7c29e9c8ddf4","resolution":{"observed_at":"2026-08-07T00:43:56.790321Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:05.833060Z","title":"Enhancing online continual learning with plug-and-play state space model and class-conditional mixture of discretization,","venue":null,"work_id":"2b54b728-ab1e-4fc9-8f8e-5beaafa94f35","year":2025},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:50.924322Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:a4072168dbb8f994fc15bf38d824689b9427926241cc0c3259e54346dde91af6","observation_id":"a823e471-a185-4420-b858-6d67bb28161c","resolution":{"observed_at":"2026-08-07T00:44:05.961176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:05.580497Z","title":"Learning without forgetting,","venue":null,"work_id":"066c166c-e07e-4a05-ba9d-c3a167b24973","year":2017},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.025526Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:36e48677fc9d45952ab8c47dbc5ecdb06bfd29cd3ace8a5b2713ed0d1aa74dbe","observation_id":"e50ad91a-f484-4ec4-9c77-3cc13776029c","resolution":{"observed_at":"2026-08-07T00:44:05.683857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:05.254630Z","title":"Learning a unified classifier incrementally via rebalancing,","venue":null,"work_id":"d4f09b96-19af-4a89-be98-2c47acd08e3f","year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.120540Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6ac55d6e11c8639bd609330b81ca6a437653a4ac7eb68eb52b70017cff103fc5","observation_id":"3840cfc6-1e3d-4eee-945c-062d2cf48c7b","resolution":{"observed_at":"2026-08-07T00:44:05.436484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:04.973709Z","title":"Learning to learn without forgetting by maximizing transfer and minimizing interference,","venue":null,"work_id":"b0d60fef-c87c-4fcf-8204-7b98581c76c7","year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.230271Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:a33efe2c69a2196dd3d0df9a7b0769973a261f7cdbbc02398440e28134e2d14e","observation_id":"5854041b-f440-441f-81d0-210f7f0c49f9","resolution":{"observed_at":"2026-08-07T00:44:05.104704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:04.700308Z","title":"Der: Dynamically expandable representation for class incremental learning,","venue":null,"work_id":"af8185cd-d8d5-49f4-ac6f-9fbf4dfaa1e1","year":2021},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.368743Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:bce9ecf4dc9ffa5551915e84248c314aacb4fa9708b855d85f4383b764f8f5a4","observation_id":"c88400c1-3b00-426a-89be-3423fa2745d5","resolution":{"observed_at":"2026-08-07T00:44:04.843100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01364","last_updated":"2024-02-07T07:14:39Z","snapshot_observed_at":"2026-08-13T04:28:26.809992Z","submitted_at":"2024-02-02T12:34:09Z","title":"Continual Learning for Large Language Models: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01364","snapshot_observed_at":"2026-08-07T00:43:51.513729Z","title":"Con- tinual learning for large language models: A survey,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.513729Z"},"links":{"cited_paper":"/paper/2402.01364","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:0fc82baa637fc999f748473c0074bb42b7f886913fb1f596fed820a59eaed36e","observation_id":"10af06ab-1c71-4686-9b39-c95862ac5a4d","resolution":{"observed_at":"2026-08-07T00:43:51.513729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16206","last_updated":"2023-11-27T15:04:48Z","snapshot_observed_at":"2026-08-14T16:15:34.655112Z","submitted_at":"2023-11-27T15:04:48Z","title":"Continual Instruction Tuning for Large Multimodal Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16206","snapshot_observed_at":"2026-08-07T00:43:51.674160Z","title":"Continual instruction tuning for large multimodal models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.674160Z"},"links":{"cited_paper":"/paper/2311.16206","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7e98137d106133adf2a8f57e387960f005fd19342103815ef6f16055fade6569","observation_id":"e2b33d26-f614-4f2f-88d2-49433c214497","resolution":{"observed_at":"2026-08-07T00:43:51.674160Z","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-07T00:44:04.435138Z","title":"Investi- gating the catastrophic forgetting in multimodal large language model fine-tuning,","venue":null,"work_id":"b420a044-6f33-4556-83f7-8819e099e7a4","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.853855Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:5124f78103720791dbb3123a2bc9a4cd718445398e076ef83d1c301a9d6fb8c5","observation_id":"3b54e5bd-307d-4093-99c8-e7e7d3168f98","resolution":{"observed_at":"2026-08-07T00:44:04.551931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:04.102193Z","title":"Fine-tuned language models are continual learners,","venue":null,"work_id":"9d1c0422-e0fd-4195-afd1-5675510fc360","year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:51.993008Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:06930813e35ea031d28267f882f074d1666b109a41e8c5f636772df4db83dc1e","observation_id":"eb028ab5-6cda-46f2-a0f3-5d15df05cc09","resolution":{"observed_at":"2026-08-07T00:44:04.279934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:03.835345Z","title":"Continual pre-training of large language models: How to re-warm your model?","venue":null,"work_id":"5ee26967-73d2-4c38-8b3f-cc44e7f6841f","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.131111Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:c2af40f0dc5257c0503b84a1e7ca620f6a8360ebc651e91eb8083e69e206e696","observation_id":"af4c1015-42a6-40e1-bf9a-deff4a36f8bf","resolution":{"observed_at":"2026-08-07T00:44:03.980770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08763","last_updated":"2024-09-04T16:13:18Z","snapshot_observed_at":"2026-08-14T11:04:35.135794Z","submitted_at":"2024-03-13T17:58:57Z","title":"Simple and Scalable Strategies to Continually Pre-train Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08763","snapshot_observed_at":"2026-08-07T00:43:52.260130Z","title":"Simple and scalable strategies to continu- ally pre-train large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.260130Z"},"links":{"cited_paper":"/paper/2403.08763","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:1cf2d9e339c8f81ae87cc50dcc66e4f44d163f8ccf21aaf12744f3892140e57d","observation_id":"07dc000e-6f66-4c22-ae45-3bb023404480","resolution":{"observed_at":"2026-08-07T00:43:52.260130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02415","last_updated":"2024-05-30T04:45:34Z","snapshot_observed_at":"2026-08-14T08:08:42.077710Z","submitted_at":"2024-01-04T18:59:12Z","title":"LLaMA Pro: Progressive LLaMA with Block Expansion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02415","snapshot_observed_at":"2026-08-07T00:43:52.400027Z","title":"Llama pro: Progressive llama with block expansion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.400027Z"},"links":{"cited_paper":"/paper/2401.02415","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:40403f6e99187700b3ed9f8cbef582c7df5ce6f8ce66fefd2dc4ed0d54b57903","observation_id":"b573473a-ce02-49e1-b873-e91e21ac2724","resolution":{"observed_at":"2026-08-07T00:43:52.400027Z","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-07T00:44:03.510774Z","title":"Composing parameter-efficient modules with arithmetic operation,","venue":null,"work_id":"01282278-f645-4514-9c3a-d05b46e475d2","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.513377Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:6f59709e7454c00063eb0912f3fdf944d32bba1476815b6feaa8043cbd808dbb","observation_id":"52b5eab1-6738-49f9-a552-ba9669285cce","resolution":{"observed_at":"2026-08-07T00:44:03.673889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:03.221216Z","title":"Language models are super mario: Absorbing abilities from homologous models as a free lunch,","venue":null,"work_id":"2af93677-3d03-4977-a4df-13607f0fb227","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.620728Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:58b91b0ed9faf2cdd888b1a9b0f6b9de152706877e4fd09092f4078e21d2273b","observation_id":"a8e9b597-3d99-4a93-94ba-d5d62d14038b","resolution":{"observed_at":"2026-08-07T00:44:03.376211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:02.945872Z","title":"Model tailor: Mitigating catastrophic forgetting in multi-modal large language models,","venue":null,"work_id":"718c1be8-b419-4135-94dd-64fbecb899f9","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.676699Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7b925baa9fa4575a17c2ca50715c8fe2021a42d3c033bf3e3cd7be5d30cb3d0d","observation_id":"f788424e-5026-405a-956c-ce29412f4424","resolution":{"observed_at":"2026-08-07T00:44:03.050389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:02.605782Z","title":"Language model compression with weighted low-rank factorization,","venue":null,"work_id":"cd086369-0286-4c35-b0b0-1857667ec713","year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.774122Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:06a410e9e69e4f98aae8947223dbb56a5cafc29043da2921c9298d3b1b81e6a5","observation_id":"801abad0-1370-4dec-bda5-62e6a5d74dbb","resolution":{"observed_at":"2026-08-07T00:44:02.793373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:02.322244Z","title":"SVD-LLM: Truncation- aware singular value decomposition for large language model compres- sion,","venue":null,"work_id":"1c48703a-6dfc-41e3-9adc-f0e555bef7f5","year":2025},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:52.874419Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7be7c8c50aa585375d000c0496f7511ee2ee597d07d3202db0340b28bcbc0df1","observation_id":"73cf7f4b-9073-4ad7-b512-a9e32ebef77a","resolution":{"observed_at":"2026-08-07T00:44:02.459725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15092","last_updated":"2025-02-20T23:18:39Z","snapshot_observed_at":"2026-08-07T18:00:27.217467Z","submitted_at":"2025-02-20T23:18:39Z","title":"Optimizing Singular Spectrum for Large Language Model Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15092","snapshot_observed_at":"2026-08-07T00:43:53.000581Z","title":"Optimizing singular spectrum for large language model compression,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.000581Z"},"links":{"cited_paper":"/paper/2502.15092","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:f1a18d146ac9a574753846593e019a97d4ec4b00e41a741516cee65f3ae116ae","observation_id":"c418a7bf-e8f0-454b-a482-cf80ceabed3d","resolution":{"observed_at":"2026-08-07T00:43:53.000581Z","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-07T00:44:02.036362Z","title":"Exploring post-training quantization in llms from comprehensive study to low rank compensa- tion,","venue":null,"work_id":"f27a67f2-2dd6-4eb0-af1c-002e78f2f418","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.159615Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:0234b45805f39fa2456c0f95c76aec2f9af1a376201a5f5b4f18c8486f4310bb","observation_id":"db661954-551f-4a82-a752-2519b7e7a25d","resolution":{"observed_at":"2026-08-07T00:44:02.172522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:01.780783Z","title":"SVDQuant: Absorbing outliers by low-rank component for 4-bit diffusion models,","venue":null,"work_id":"2e6dc1fd-bfea-4091-b2e9-dbb6a1577127","year":2025},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.296436Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:1c4e02661bf06cb697d9203399ae56852c6148da0c701f450f37778c526a016f","observation_id":"b72617bb-fbf8-479a-8199-33daa7d48306","resolution":{"observed_at":"2026-08-07T00:44:01.881213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:43:53.440903Z","title":"Delving deep into rectifiers: Surpassing human-level performance on imagenet classification,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.440903Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:72c7b49aad22cfab0011e75ebf408f9e1ce1bf3c86210eccd838f0d171065e39","observation_id":"dd930b33-efde-4281-900b-43e9ec7b923d","resolution":{"observed_at":"2026-08-07T00:43:53.440903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-07T00:43:53.564627Z","title":"Pointer sentinel mixture models,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.564627Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:ef842b4746d7c7ea181ebf4e5f199b8d90cc8bedbed1070ca1522631d597788f","observation_id":"4069392f-eeff-48b6-a2de-8825e37f2205","resolution":{"observed_at":"2026-08-07T00:43:53.564627Z","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-07T00:44:01.512255Z","title":"Building a large annotated corpus of english: The penn treebank,","venue":null,"work_id":"a54ede2c-f15a-4711-8a36-938eb0af91d0","year":1993},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.662985Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:97d8defb65091593d0c585e080cbfcf597c1907e68137bda3208d3dd2eddb01e","observation_id":"27ffa1e0-0fb4-4701-a2c8-176b54787184","resolution":{"observed_at":"2026-08-07T00:44:01.647561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:43:53.752677Z","title":"Natural questions: a benchmark for question answering research,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.752677Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:7932c86371dda6968fff9f6062adf68faa357e46e12fe219a490ee1e62f5b7e3","observation_id":"7fa2b942-2726-43d3-919e-e0f6e64417b6","resolution":{"observed_at":"2026-08-07T00:43:53.752677Z","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-07T00:44:01.244734Z","title":"Gpt3.int8(): 8-bit matrix multiplication for transformers at scale,","venue":null,"work_id":"75aec209-0357-4154-b976-1b870367fc55","year":2022},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:53.890048Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:31bcbab939644891947a4dda21713828a8c72f45c730ac7a9d73a24266b0c6e4","observation_id":"239d11d4-a6c8-4c2c-b2e8-a4f8908f0264","resolution":{"observed_at":"2026-08-07T00:44:01.393482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:00.933353Z","title":"Smoothquant: Accurate and efficient post-training quantization for large language models,","venue":null,"work_id":"da4f7092-dc52-44e8-ab43-4a8e7ea84fd7","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.001134Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:fc807c309a4d14b8411146fc3473a2f8c3cfd61f8dee8ed36dd465595c1099ef","observation_id":"09b2abaa-5599-4420-a901-ce510db742a2","resolution":{"observed_at":"2026-08-07T00:44:01.079579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T00:43:54.091090Z","title":"Llama 2: Open foundation and fine-tuned chat models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.091090Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:fca9ac2a3bfb507895b57c4de6936af8366d971b0415d45cfdb23b27a553663e","observation_id":"9c0de6f7-a178-4468-93e9-64621ff76a27","resolution":{"observed_at":"2026-08-07T00:43:54.091090Z","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-07T00:43:54.146385Z","title":"Gemma 2: Improving open language models at a practical size,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.146385Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:0d55a33beaf89ecc3700a6b290db2c45cbab83e5a23df5217549e3ed5ee7ef64","observation_id":"c5352022-b6c0-494d-b56d-2096def99028","resolution":{"observed_at":"2026-08-07T00:43:54.146385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14658","last_updated":"2025-01-07T05:37:04Z","snapshot_observed_at":"2026-08-14T20:57:51.689202Z","submitted_at":"2024-02-22T16:06:23Z","title":"OpenCodeInterpreter: Integrating Code Generation with Execution and Refinement","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14658","snapshot_observed_at":"2026-08-07T00:43:54.234553Z","title":"Opencodeinterpreter: Integrating code generation with execution and refinement,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.234553Z"},"links":{"cited_paper":"/paper/2402.14658","citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:01cd97bc82ac930d40c4c60cadfa8442719bd76c69a4908195c45e032875198c","observation_id":"548cae34-c6b5-4ab7-ae0c-881582be1418","resolution":{"observed_at":"2026-08-07T00:43:54.234553Z","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-07T00:44:00.607564Z","title":"WizardLM: Empowering large pre-trained language models to follow complex instructions,","venue":null,"work_id":"141af4d4-ac07-4c07-9b31-dee233dc1200","year":2024},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.330307Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:b362a3c73e0da923d0bb02dbab70a61f96792d65dac7505b31346eb55225b264","observation_id":"2a149dba-c1df-4c25-811c-62b3e5a3f958","resolution":{"observed_at":"2026-08-07T00:44:00.759259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:44:00.290687Z","title":"Judging LLM-as-a-judge with MT-bench and chatbot arena,","venue":null,"work_id":"100a3438-a875-47e5-8d8c-3df8da830027","year":2023},"citing_paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:54.429969Z"},"links":{"citing_paper":"/paper/2506.13187"},"observation_digest":"sha256:d16b3b0b30f69d8c7d2679703a32ab0b508483c725e8e30602b926e366d4ea81","observation_id":"a69e3f49-909e-4dcc-95fa-285996447255","resolution":{"observed_at":"2026-08-07T00:44:00.445069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.13187","last_updated":"2025-06-16T07:55:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T21:55:06.493665Z","submitted_at":"2025-06-16T07:55:14Z","title":"Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":68,"verified_exact":1,"verified_fuzzy":31},"total_outbound_references":117},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 117 outbound references and 0 inbound Pith citation observations for arXiv:2506.13187."}