{"as_of":"2026-08-18T08:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8bbad2db1ef757f9861a8a0730e59c8dfb4f893e6d61e48a03b9af447129fd59","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:42:33.267383Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:36:38.762189Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T22:38:49.042498Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"cited_work":{"arxiv_id":"2501.15065","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.15065","snapshot_observed_at":"2026-08-10T22:38:49.042498Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","venue":"cs.LG","work_id":"8f584045-8c64-4579-8149-50a22147c95a","year":2025},"citing_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-08-16T04:21:25.392242Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:48.728035Z"},"links":{"cited_paper":"/paper/2501.15065","citing_paper":"/paper/2501.01230"},"observation_digest":"sha256:766861137491b52e0590243aada1dcc75575928c2586f78cba5dd20a9a5b9742","observation_id":"509998ce-7697-4e78-a706-f23335adbc56","resolution":{"observed_at":"2026-08-10T22:38:49.048202Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15065","snapshot_observed_at":"2026-08-15T22:36:38.762189Z","title":"Task arithmetic in trust region: A training-free model merging approach to navigate knowledge conflicts","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.06977","last_updated":"2025-05-14T14:11:52Z","snapshot_observed_at":"2026-08-15T22:25:55.093402Z","submitted_at":"2025-05-11T13:24:09Z","title":"CAT Merging: A Training-Free Approach for Resolving Conflicts in Model Merging","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T22:36:38.762189Z"},"links":{"cited_paper":"/paper/2501.15065","citing_paper":"/paper/2505.06977"},"observation_digest":"sha256:805653eab843bf9373e08411ed61237cfe9f01d4dd205db4803514a6bdbb8a4d","observation_id":"bb399fbf-e998-498e-bf8b-8133f446a8f4","resolution":{"observed_at":"2026-08-15T22:36:38.762189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.15065/citation-record","integrity":"/paper/2501.15065/integrity","json":"/paper/2501.15065/citation-record.json","paper":"/paper/2501.15065"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:42:32.995379Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:32.995379Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:62b770988d612e5325b176002e84014b005a687fb3482dad857d67f2b1b344a0","observation_id":"86265cf6-a246-4c95-a19a-881a7a71cc0f","resolution":{"observed_at":"2026-08-10T14:42:32.995379Z","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-10T14:42:34.867501Z","title":"Ensemble of averages: Improving model selection and boosting performance in domain generalization","venue":null,"work_id":"c6c20a51-bc2a-4e2a-bab1-ebde74601390","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.001837Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:e55dcbb5684e3408aa05e1aecc3d15225d1c774a119c9bac67e48ec39f35e91b","observation_id":"79a2d612-ff1f-4a47-95fa-d2e8b03c3fb3","resolution":{"observed_at":"2026-08-10T14:42:34.871998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.853367Z","title":"Swad: Domain generalization by seeking flat minima","venue":null,"work_id":"ce3fc940-4da0-4caa-a4b6-61c759e490b9","year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.006676Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:de74a1f99aa548eab5935b50ffd12c1cf25e29e2687c5d7f71a8b2ec5df2065f","observation_id":"2548e344-03c7-4aec-8ea7-43d18dd4bc43","resolution":{"observed_at":"2026-08-10T14:42:34.857874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.839300Z","title":"Weighted training for cross-task learning","venue":null,"work_id":"69b3c53f-24b8-4b47-aec3-75f58874762e","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.011843Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2c161ba879a7e534a8e0ebfe7f2873f2cfc1c0b07378c24d1b1b368fd6c708e7","observation_id":"8eafec29-95eb-4475-bbeb-1725480f9570","resolution":{"observed_at":"2026-08-10T14:42:34.843919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.825187Z","title":"The principle of diversity: Training stronger vision transformers calls for reducing all levels of redundancy","venue":null,"work_id":"ebb4cabe-d982-4200-a187-f668913d322e","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.016458Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:55801e02f0acae0b5a5b11ef9e18e19b0b668470b5bc8b01bc169ee349ec2e4b","observation_id":"cb53cecc-e3fe-4a29-a50d-2bf1eef4f75a","resolution":{"observed_at":"2026-08-10T14:42:34.829807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.809590Z","title":"G rad N orm: Gradient normalization for adaptive loss balancing in deep multitask networks","venue":null,"work_id":"a56c8801-e009-4603-a852-397c28cbac71","year":2018},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.021111Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:dc114fde763c6bd4b42cee415d2dd61c3029567669ffaa63f668b0410cec6555","observation_id":"2850f405-759c-418d-a5d5-6bdcf27a0b82","resolution":{"observed_at":"2026-08-10T14:42:34.814699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.794474Z","title":"Just pick a sign: Optimizing deep multitask models with gradient sign dropout","venue":null,"work_id":"9345ba4e-66ff-4530-965c-6086748a957d","year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.025954Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:337737c486c0a77f5a95614305a5c22c3f50dd14117e370f9b29eb08792907e6","observation_id":"f005fc31-59db-46f5-9ee4-eaca80455f85","resolution":{"observed_at":"2026-08-10T14:42:34.798938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.031170Z","title":"Remote sensing image scene classification: Benchmark and state of the art","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.031170Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2e30a8901a51d66f4e2511da3c5e5b89d7cd58f9ef69736ea9cc4d954b130087","observation_id":"6ab02369-8361-46b9-9393-3e160358e96b","resolution":{"observed_at":"2026-08-10T14:42:33.031170Z","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-10T14:42:34.780430Z","title":"Describing textures in the wild","venue":null,"work_id":"40d1704f-7044-402e-a6d4-cac04760135a","year":2014},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.035615Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:f8fa25041af86b14cb61ce438085f6e1f709e8fa2b21e8b9ba7c8f24f5a72fb1","observation_id":"c2711dca-159e-4b20-b512-2589146842b0","resolution":{"observed_at":"2026-08-10T14:42:34.785122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.040153Z","title":"Analyzing redundancy in pretrained transformer models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.040153Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:9eb57ab3eb133e46c2e760a886f905aeb8c4741c2378c465c798e7139a802742","observation_id":"306753a5-aba3-487e-b9f0-823f3e0aa59c","resolution":{"observed_at":"2026-08-10T14:42:33.040153Z","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-10T14:42:33.044875Z","title":"Mssm: A multiple-level sparse sharing model for efficient multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.044875Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:890fbefc78ff171dcf5d7958aef55b2ed6f937226e0a294bc263516f1cce606c","observation_id":"93a1bf10-fa64-43c8-b9c9-296104403bb4","resolution":{"observed_at":"2026-08-10T14:42:33.044875Z","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-10T14:42:34.766542Z","title":"Theory of statistical estimation","venue":null,"work_id":"19c9f589-78cf-4652-8c3d-e6cd5e444258","year":1925},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.049424Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:f8793bb6e4c40ed9a3439bec8490262eb964f19fbc9112f777c7261a7b7da0a6","observation_id":"34b607f4-25d0-4ef5-801e-3323d5fd047a","resolution":{"observed_at":"2026-08-10T14:42:34.770878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.752323Z","title":"Mtl-nas: Task-agnostic neural architecture search towards general-purpose multi-task learning","venue":null,"work_id":"4212383a-2d84-4daa-a96c-01a9c930f100","year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.053774Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:bbebd1cdc390aeeafffed47806907967ccb38155e13b828a41dc088a157d727c","observation_id":"0af12efd-af7f-4bec-bf14-da708d75b683","resolution":{"observed_at":"2026-08-10T14:42:34.756954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.736844Z","title":"Dselect-k: Differentiable selection in the mixture of experts with applications to multi-task learning","venue":null,"work_id":"90bd3c04-a116-4c76-8eba-ecfa6bdcdd21","year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.058155Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:fe964914a92a429af646b26c397919bb925377e6e8268ff16dacd0f859d95440","observation_id":"b7c23325-0daf-48e6-a4f8-fc119ac7f5cb","resolution":{"observed_at":"2026-08-10T14:42:34.741905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.062582Z","title":"Metabalance: Improving multi-task recommendations via adapting gradient magnitudes of auxiliary tasks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.062582Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2e99840a2c30a595ade2fdb80cc02fca94cc34396f4214189dd86f089ebd4110","observation_id":"09ce6577-08df-416e-b3f4-beab3dd44b03","resolution":{"observed_at":"2026-08-10T14:42:33.062582Z","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-10T14:42:33.067391Z","title":"Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.067391Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:4b2f597245fd7733bb16e1a5c00ed5f4c881fe45492a6be74cc3daf90d743921","observation_id":"e79c8a00-9d21-4e7c-98b9-0735f434d970","resolution":{"observed_at":"2026-08-10T14:42:33.067391Z","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-10T14:42:33.071449Z","title":"Lo RA : Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.071449Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:a5d76a8969ec9622a87acedb7de4eef9d2705aed5642132152bc0991c10ce086","observation_id":"9906bfa5-7343-4492-8047-5c309eaebd9b","resolution":{"observed_at":"2026-08-10T14:42:33.071449Z","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-10T14:42:34.712829Z","title":"Revisiting scalarization in multi-task learning: A theoretical perspective","venue":null,"work_id":"b67876d3-c8ff-4866-a600-2fdd4d85372e","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.075923Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:9636b4a99248b0222ff080533121b9697aa1ab449486de7da832a527ab8f4b9f","observation_id":"bb9d2f1b-c771-4fde-b478-bca98f086ca5","resolution":{"observed_at":"2026-08-10T14:42:34.717477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.697936Z","title":"Editing models with task arithmetic","venue":null,"work_id":"e1d07d69-b718-422b-b869-c0d7ae86ea14","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.080239Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:d3d736f19a6fc7de61e83de1a02ece68bf7651826194396338562620247381fa","observation_id":"43ad5b62-06cf-4b05-9634-a214ef24074a","resolution":{"observed_at":"2026-08-10T14:42:34.702400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.682407Z","title":"Editing models with task arithmetic","venue":null,"work_id":"06fabe98-6ddc-4e60-ad46-ce93a224fd06","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.085164Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:1ca40cfe73c78463dac6139e1bd67b2b492e8950a3ba0f2576f3c0771528b54c","observation_id":"53fb4b63-7b5b-4abf-beee-bc943588ebe1","resolution":{"observed_at":"2026-08-10T14:42:34.687582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.667072Z","title":"Averaging weights leads to wider optima and better generalization","venue":null,"work_id":"1e10ec36-a953-4578-8754-556a67156bac","year":2018},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.090405Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2247c653e91f9572315fd667d27c8a4c7588b60f6eebbc9ee1fcacb537ed12e7","observation_id":"c1823d2c-a900-477f-921c-cbd30ae2a3b7","resolution":{"observed_at":"2026-08-10T14:42:34.671964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.653032Z","title":"Neural tangent kernel: Convergence and generalization in neural networks","venue":null,"work_id":"23ec1880-b1a4-447c-8b0f-a37ad299b0bd","year":2018},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.094771Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2e10bac278cef9075abcc156d92cc64174e121d2d0638b90b1324ef0bd794455","observation_id":"a0aacf01-bdcd-4a91-a63a-e4beffe73a4a","resolution":{"observed_at":"2026-08-10T14:42:34.657615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.638698Z","title":"Rotograd: Gradient homogenization in multitask learning","venue":null,"work_id":"630f6bcb-a0d6-4cce-ad93-356b7059e64f","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.099074Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:5f332edf26312f4e36b5deb078bdc2b9f525a186d01c0a598af8e3e16a0408ab","observation_id":"83bafc81-30c1-4beb-ba08-ab918e062bd6","resolution":{"observed_at":"2026-08-10T14:42:34.643461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.622639Z","title":"Dataless knowledge fusion by merging weights of language models","venue":null,"work_id":"a91682d2-cadd-4f7a-a9c7-3f44d5f9f94f","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.103528Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:9c395f9f271cf0cdad64a275d5b1e7c095e206d8d9ef8b12d65f5b04022c9e77","observation_id":"634079a8-4358-4b29-9a1a-198473ab123a","resolution":{"observed_at":"2026-08-10T14:42:34.628238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-10T14:42:33.107714Z","title":"Scaling laws for neural language models","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.107714Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:5d8cb406859b51965460725538e48bbe144a249efa38b073216f4b008bd2ce35","observation_id":"047cd0f5-34bd-4012-8d0e-d47132acf7a4","resolution":{"observed_at":"2026-08-10T14:42:33.107714Z","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-10T14:42:34.608031Z","title":"3d object representations for fine-grained categorization","venue":null,"work_id":"cc5c1fea-11b3-4343-b5ca-3004999e54ed","year":2013},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.112733Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:510a7d971bb7199ebd470c88a9906537929b86f7d35e514d2e91bffaf8787065","observation_id":"59b36be7-ab6b-4b48-ad4d-9c7403d5d422","resolution":{"observed_at":"2026-08-10T14:42:34.612860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.117065Z","title":"MNIST handwritten digit database","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.117065Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:4dbda2964e344f129562bbb2f2f036d39ecc1bd60264ea1fec2b0d630c012679","observation_id":"ed7f0487-7635-4516-8fa9-02a85d1dc09b","resolution":{"observed_at":"2026-08-10T14:42:33.117065Z","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-10T14:42:34.583570Z","title":"Conflict-averse gradient descent for multi-task learning","venue":null,"work_id":"6700ce90-26a2-49e8-a54a-6fe67ea3270a","year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.122456Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:7ff5f83ae836c912ac877c871ae41f24b58aac619b7bd3c77877fb1b4cb9d0b5","observation_id":"7c889a4b-3bd7-4a3a-936d-53d378440721","resolution":{"observed_at":"2026-08-10T14:42:34.588430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.569364Z","title":"Conflict-averse gradient descent for multi-task learning","venue":null,"work_id":"8d53f238-2df7-4901-b144-d1f15cec2f43","year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.127837Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:727e65767d75d912f7461bc032cb1addf0aab0a1fbee3dcb219c794f2f2af40c","observation_id":"797c69b3-c48c-4235-9808-73c192324065","resolution":{"observed_at":"2026-08-10T14:42:34.573865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/p17-1001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:42:33.315989Z","title":"Adversarial multi-task learning for text classification","venue":null,"work_id":"1ffcb595-0db5-4ef1-a2b0-78c2ed9727e1","year":2017},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.132217Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:08dbe5f09b41e0ca3117da0949d9b8289a0440935e12b804da189300afe3d972","observation_id":"6d88d668-6b70-48b0-8f84-cf7d67fa35b6","resolution":{"observed_at":"2026-08-10T14:42:33.320985Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.555638Z","title":null,"venue":null,"work_id":"9df63d97-e641-4195-84ba-a0faa14893a4","year":2019},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.136675Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:6ef15cd729848d9b6eb0713e34396c1b69c8a2ba55843435a7b00bdb600cac56","observation_id":"44d9fe58-42bf-4bb6-bea2-6f41823c94d4","resolution":{"observed_at":"2026-08-10T14:42:34.560187Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.541770Z","title":"Auto-lambda: Disentangling dynamic task relationships","venue":null,"work_id":"7b5d1905-cd3d-42d2-ad7e-7f07e5ce0d60","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.141024Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:c47e22a70a79965b5d02fb0fca4b54c3edf6a47e6add7d3b69c19e49836583d3","observation_id":"35428133-edfe-4f5e-bdc0-d01212c16bad","resolution":{"observed_at":"2026-08-10T14:42:34.546203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.145588Z","title":null,"venue":null,"work_id":null,"year":1930},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.145588Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:1f112920745ef2666e5d813bb1a31ece664b54130a7f2e9f1303a5f3fdba8b26","observation_id":"d6b10716-4904-4cfd-996e-fb43d5fb82fa","resolution":{"observed_at":"2026-08-10T14:42:33.145588Z","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-10T14:42:34.527575Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":"04a68d96-04b3-45e4-9f8e-1c174fecdcd5","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.149727Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:9650b110e5baabef71139f1893898508db0c649479221a404b9729c9f514601a","observation_id":"ae4babe3-408b-424a-8791-0015347e4731","resolution":{"observed_at":"2026-08-10T14:42:34.532313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.153835Z","title":"Multi-task distillation: Towards mitigating the negative transfer in multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.153835Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:cb86c983afc07044ea185525729fe213f92f71e07887c3f851887d3c71c4d62e","observation_id":"09b27bb1-b8b1-4d89-8035-b918f480d3bd","resolution":{"observed_at":"2026-08-10T14:42:33.153835Z","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-10T14:42:34.513361Z","title":"Multi-task learning as a bargaining game","venue":null,"work_id":"b932c480-26f6-42b6-9209-a491d1fa4762","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.158376Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:38403148765aa82b0c311c5ae4e77193cbb371770fc8498118d4c7f1a4214695","observation_id":"c23e5f32-6938-4ad2-a4c8-f698af91b690","resolution":{"observed_at":"2026-08-10T14:42:34.517812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.498988Z","title":"Reading digits in natural images with unsupervised feature learning","venue":null,"work_id":"e3f92a68-c42f-44ab-b4d8-da4a3dcb60c9","year":2011},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.162811Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:74dc46a5ddf0c4dcc4217c0f60a548ca46cdb24247e9d3bbeff5d2a8cb0f0400","observation_id":"038db960-82ff-4314-8c9a-cd8070cad81f","resolution":{"observed_at":"2026-08-10T14:42:34.503867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.484148Z","title":"Task arithmetic in the tangent space: Improved editing of pre-trained models","venue":null,"work_id":"77214b91-8921-4e8d-8af1-e8aff2598c5c","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.167686Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2c3ac2ded7a3c8f85a52adad98d8569e2ff47f7a9b3ccda6257d4866650476ce","observation_id":"ecdcbdbb-5c2e-4203-8521-d4db64618234","resolution":{"observed_at":"2026-08-10T14:42:34.488948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.469370Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"e90b5953-d643-473a-9a64-adb681952f1c","year":2021},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.172260Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:d9d2f0d46882ac4266c21201648d38644636735a0642d71e384dc03b1fc8775f","observation_id":"d8a0dcea-3789-49e2-9ad4-85ce64f99382","resolution":{"observed_at":"2026-08-10T14:42:34.474120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04747","last_updated":"2017-06-15T13:21:04Z","snapshot_observed_at":"2026-08-15T03:49:17.013617Z","submitted_at":"2016-09-15T17:32:34Z","title":"An overview of gradient descent optimization algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04747","snapshot_observed_at":"2026-08-10T14:42:33.176756Z","title":"An overview of gradient descent optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.176756Z"},"links":{"cited_paper":"/paper/1609.04747","citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:afeb0b3196ff3fcd7eda5a85c7d2b0d93e6c9ec9597f8490fe17df74d896d106","observation_id":"51887331-b80e-453a-84f2-de6f896b9e96","resolution":{"observed_at":"2026-08-10T14:42:33.176756Z","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-10T14:42:34.455053Z","title":"Multi-task learning as multi-objective optimization","venue":null,"work_id":"4205fa72-74d4-4364-8613-b7ffa314adbc","year":2018},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.181400Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:2bf1e0410141c14f7c5a0b897720fae1b880263f7d7e436c4a72c3007d54d123","observation_id":"6000b7d6-d3b6-4edc-af0b-c2e26a85c8f2","resolution":{"observed_at":"2026-08-10T14:42:34.459601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.439781Z","title":"The german traffic sign recognition benchmark: A multi-class classification competition","venue":null,"work_id":"b94b02bf-3758-48bf-be6f-6ab4fb9bcb43","year":2011},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.186218Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:587e077bd6ab20df26695177812b1961336257c104fd6b14aba7813bfe94be87","observation_id":"d6e9a8e2-049f-4dd3-b96d-267dfa8e325d","resolution":{"observed_at":"2026-08-10T14:42:34.444851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18639","last_updated":"2024-03-19T08:45:53Z","snapshot_observed_at":"2026-08-16T14:48:04.090055Z","submitted_at":"2023-10-28T08:48:44Z","title":"Towards Plastic and Stable Exemplar-Free Incremental Learning: A Dual-Learner Framework with Cumulative Parameter Averaging","version":3},"cited_work":{"arxiv_id":"2310.18639","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.18639","snapshot_observed_at":"2026-08-10T14:42:33.645592Z","title":"Towards Plastic and Stable Exemplar-Free Incremental Learning: A Dual-Learner Framework with Cumulative Parameter Averaging","venue":"cs.CV","work_id":"085e0109-4132-45ed-a511-f1cc00d1ffc2","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.190398Z"},"links":{"cited_paper":"/paper/2310.18639","citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:399fc3dfc3f3278c968e09d348f4ea03b30b4224e56c948f97d6ce1bfe1c5b9b","observation_id":"8ff1f41b-2bab-42de-9e24-ac85c970a9aa","resolution":{"observed_at":"2026-08-10T14:42:33.651393Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.424221Z","title":"Adashare: Learning what to share for efficient deep multi-task learning","venue":null,"work_id":"4ee79280-6e12-40bd-b383-70c5f65bc081","year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.195363Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:dcb9ec7d38cdde690e7621d32c8e79a6b342e06b997c75351ebdc478d98fe11f","observation_id":"b6fc508f-15fc-4e95-828f-032f51d5d71c","resolution":{"observed_at":"2026-08-10T14:42:34.429315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.408076Z","title":"Merging multi-task models via weight-ensembling mixture of experts","venue":null,"work_id":"4325714e-20ad-42eb-b0f2-28cf5a1a9622","year":2024},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.200588Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:89a502b3b6feb7f85b73c9699e90c6e4650d0cfbcac16dbd9e8cfeabb1cc61f1","observation_id":"1516890c-c938-4a69-b056-cb9848a17e71","resolution":{"observed_at":"2026-08-10T14:42:34.413046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.204751Z","title":"Progressive layered extraction (ple): A novel multi-task learning (mtl) model for personalized recommendations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.204751Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:63e05170ae74eb45f00042f3a6fe5576f3d2397d97bee1c8976d5296e5339716","observation_id":"a06ff7af-45be-4cf4-874e-61e1e102c77f","resolution":{"observed_at":"2026-08-10T14:42:33.204751Z","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-10T14:42:34.393342Z","title":"Hacking task confounder in meta-learning","venue":null,"work_id":"5de279b4-0041-4434-9ce5-8a7aa8767ed0","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.208931Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:8b64fbf6a924fb2f78c1871066c20ab93ce350054a7b32c9b900051473821837","observation_id":"ad18836e-adef-4138-935b-a654c0790e7c","resolution":{"observed_at":"2026-08-10T14:42:34.397765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.378532Z","title":"Localizing task information for improved model merging and compression","venue":null,"work_id":"e894030d-959c-4df6-9444-e37fb064eabd","year":2024},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.213082Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:170a128ea634e7cd0e1ef32668ee9713955c81734e88498c7ba43a89f5c61b8a","observation_id":"e75f50e7-7199-440c-8637-628466063427","resolution":{"observed_at":"2026-08-10T14:42:34.383367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.363935Z","title":"All of statistics: A concise course in statistical inference, 2013","venue":null,"work_id":"41573588-f5eb-4599-a691-9fb46efd941b","year":2013},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.217110Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:a0a1935b48e9c61258f8923667339e76eb2a158a862eea6568924e7fbf0b4d35","observation_id":"455e7a30-7a9d-4a87-ab13-2df28649b32b","resolution":{"observed_at":"2026-08-10T14:42:34.368697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.349236Z","title":"Mixture of lo RA experts","venue":null,"work_id":"3acd70bb-f488-418a-a635-e77da29c3bf5","year":2024},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.221124Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:5e74a6fb7bf510c45557920cb59be7dd5691d4ad66127b36c8f58a43d9e8ec53","observation_id":"2a879e88-7f74-41fb-a2cb-e61a108768b0","resolution":{"observed_at":"2026-08-10T14:42:34.353902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.225336Z","title":"Sun database: Exploring a large collection of scene categories","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.225336Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:a967d2ffcf60ebd0c8d99e8bc19eac857943d43de368f09ddd3e3604b6e22517","observation_id":"c18086b7-a0a9-455b-97ca-6536d42e402e","resolution":{"observed_at":"2026-08-10T14:42:33.225336Z","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-10T14:42:34.323625Z","title":"TIES -merging: Resolving interference when merging models","venue":null,"work_id":"c522e438-9311-4d68-95e4-cc496434f167","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.230053Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:a05e9deb44c58fd6541617b4b7f7be66c65cef567124e5c036ae145d3074dcb3","observation_id":"804569de-baaf-4544-ab39-bd642f890f06","resolution":{"observed_at":"2026-08-10T14:42:34.328839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v36i4.20352","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:42:33.298924Z","title":"Cross-task knowledge distillation in multi-task recommendation","venue":null,"work_id":"ea05b3f8-1d14-410e-b466-d8b5c3e43a84","year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.234819Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:bf92468f5161a8527eed5f4c234caa8e0f58d4991a454d45a7a4ab9bd9c60f50","observation_id":"c983a123-12b3-4e45-b858-031349daa408","resolution":{"observed_at":"2026-08-10T14:42:33.305573Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.307436Z","title":"Adatask: A task-aware adaptive learning rate approach to multi-task learning","venue":null,"work_id":"65e8b3b2-ab0a-4e1c-b7be-09892439e519","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.239558Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:c20788510bcf0fdc2a8ba7ef0dfa478b808be190df7adc91853d208d80c65889","observation_id":"868d9cbd-928d-4e21-a7da-6f09c2fbd892","resolution":{"observed_at":"2026-08-10T14:42:34.312380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.292650Z","title":"Representation surgery for multi-task model merging","venue":null,"work_id":"cb764da2-3734-4172-87a1-b9a14ab95511","year":2024},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.243847Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:4ae833e8d27208cca8b5289a9e4d63db1133f4da20cf2d4ab8f5324d5b6874fd","observation_id":"eb47fc54-554f-4f61-b8be-60afddc62ecd","resolution":{"observed_at":"2026-08-10T14:42:34.297517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.276719Z","title":"Adamerging: Adaptive model merging for multi-task learning","venue":null,"work_id":"f32dcf23-48e6-4184-b132-e2cd078836f3","year":2024},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.248286Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:7cf215ea6f44045e2847c026d4317cd88db2224a35a938b1c85fab789af712df","observation_id":"6b226dbb-7efc-479b-b686-8a48dbead4b4","resolution":{"observed_at":"2026-08-10T14:42:34.281619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.260792Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"d392ea91-464d-45ef-8a51-11b78359e841","year":2020},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.252656Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:95b4a28dde042d27c0be03e8bef5c0562dc4c04eb57ddff89f7c7337282979e4","observation_id":"74d3087f-75ba-40ca-bbaa-40ee234ebc59","resolution":{"observed_at":"2026-08-10T14:42:34.266300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:34.146102Z","title":"Composing parameter-efficient modules with arithmetic operation","venue":null,"work_id":"5bfcb06b-8cfc-4203-92e0-250910f3efab","year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.257125Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:8e8f6c8f02a3aab9cba17af44ed7aa2af3ec5fecaf86c5f466ca1c3d1a136185","observation_id":"279bcf89-f243-4fdf-a138-a197815aa0fe","resolution":{"observed_at":"2026-08-10T14:42:34.150921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:42:33.262663Z","title":"A survey on negative transfer","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.262663Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:a9862c8e6071e0de3e7dfec73efeac0b97f2cca2f784e2f9a51160145e9992d2","observation_id":"25f12ffc-1002-4d76-bd48-96febfd45600","resolution":{"observed_at":"2026-08-10T14:42:33.262663Z","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-10T14:42:33.267383Z","title":"A survey on multi-task learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-10T14:42:33.267383Z"},"links":{"citing_paper":"/paper/2501.15065"},"observation_digest":"sha256:af3a976f787b37e4d4652499e84b796f77212ddaaf6ba3ae8594b4d0cc3c9633","observation_id":"677506ce-190c-4fa2-967e-a8fc279e7171","resolution":{"observed_at":"2026-08-10T14:42:33.267383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.15065","last_updated":"2025-01-25T04:09:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T22:30:06.678846Z","submitted_at":"2025-01-25T04:09:56Z","title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":3,"verified_fuzzy":40},"total_outbound_references":60},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 2 inbound Pith citation observations for arXiv:2501.15065."}