{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EPU62UVUSCLW2OPHCTIC22EEAL","short_pith_number":"pith:EPU62UVU","schema_version":"1.0","canonical_sha256":"23e9ed52b490976d39e714d02d688402f0ff6dc2a4b9a44f54e5288af874a053","source":{"kind":"arxiv","id":"2501.15065","version":1},"attestation_state":"computed","paper":{"title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boyang Li, Qingyong Li, Wenju Sun, Wen Wang, Yangli-ao Geng","submitted_at":"2025-01-25T04:09:56Z","abstract_excerpt":"Multi-task model merging offers an efficient solution for integrating knowledge from multiple fine-tuned models, mitigating the significant computational and storage demands associated with multi-task training. As a key technique in this field, Task Arithmetic (TA) defines task vectors by subtracting the pre-trained model ($\\theta_{\\text{pre}}$) from the fine-tuned task models in parameter space, then adjusting the weight between these task vectors and $\\theta_{\\text{pre}}$ to balance task-generalized and task-specific knowledge. Despite the promising performance of TA, conflicts can arise amo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.15065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-25T04:09:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c85eda2a10acb8ec71f3f2141d53906bec8d740643a13f3f38357bd8de67077","abstract_canon_sha256":"46aad155ddd4146cb9910d8b8b7a3ee12c2b0954110c68e02dcf3289a20e9cbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:23.832115Z","signature_b64":"w3nfN9ttOHFtCZ2hXE5MxsQ0gUzu2HeLw2yVxnfA8rt8Hx5yqRRNiznV3OkQSvPwMmu0b+fdPJxA70z1IJzqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e9ed52b490976d39e714d02d688402f0ff6dc2a4b9a44f54e5288af874a053","last_reissued_at":"2026-07-05T10:05:23.831638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:23.831638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boyang Li, Qingyong Li, Wenju Sun, Wen Wang, Yangli-ao Geng","submitted_at":"2025-01-25T04:09:56Z","abstract_excerpt":"Multi-task model merging offers an efficient solution for integrating knowledge from multiple fine-tuned models, mitigating the significant computational and storage demands associated with multi-task training. As a key technique in this field, Task Arithmetic (TA) defines task vectors by subtracting the pre-trained model ($\\theta_{\\text{pre}}$) from the fine-tuned task models in parameter space, then adjusting the weight between these task vectors and $\\theta_{\\text{pre}}$ to balance task-generalized and task-specific knowledge. Despite the promising performance of TA, conflicts can arise amo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15065","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.15065/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.15065","created_at":"2026-07-05T10:05:23.831695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15065v1","created_at":"2026-07-05T10:05:23.831695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15065","created_at":"2026-07-05T10:05:23.831695+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPU62UVUSCLW","created_at":"2026-07-05T10:05:23.831695+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPU62UVUSCLW2OPH","created_at":"2026-07-05T10:05:23.831695+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPU62UVU","created_at":"2026-07-05T10:05:23.831695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01230","citing_title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL","json":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL.json","graph_json":"https://pith.science/api/pith-number/EPU62UVUSCLW2OPHCTIC22EEAL/graph.json","events_json":"https://pith.science/api/pith-number/EPU62UVUSCLW2OPHCTIC22EEAL/events.json","paper":"https://pith.science/paper/EPU62UVU"},"agent_actions":{"view_html":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL","download_json":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL.json","view_paper":"https://pith.science/paper/EPU62UVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15065&json=true","fetch_graph":"https://pith.science/api/pith-number/EPU62UVUSCLW2OPHCTIC22EEAL/graph.json","fetch_events":"https://pith.science/api/pith-number/EPU62UVUSCLW2OPHCTIC22EEAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL/action/storage_attestation","attest_author":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL/action/author_attestation","sign_citation":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL/action/citation_signature","submit_replication":"https://pith.science/pith/EPU62UVUSCLW2OPHCTIC22EEAL/action/replication_record"}},"created_at":"2026-07-05T10:05:23.831695+00:00","updated_at":"2026-07-05T10:05:23.831695+00:00"}