{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SAC44E7JJD7IIHBNFSEWBLJBSZ","short_pith_number":"pith:SAC44E7J","canonical_record":{"source":{"id":"2502.01015","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T03:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"cb36645f8f42a78c3844456957b88e0a0106e1c8e8896caeace9c2039216d6ee","abstract_canon_sha256":"67f0ef62066034bcff8ecd7b34d763bf3eb6c226d869f70647838889ce6e1edb"},"schema_version":"1.0"},"canonical_sha256":"9005ce13e948fe841c2d2c8960ad21965119c7c3cd71545be8d2c219bfbc8cb9","source":{"kind":"arxiv","id":"2502.01015","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01015","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01015v5","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01015","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"SAC44E7JJD7I","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"SAC44E7JJD7IIHBN","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"SAC44E7J","created_at":"2026-06-24T01:14:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SAC44E7JJD7IIHBNFSEWBLJBSZ","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01015","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T03:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"cb36645f8f42a78c3844456957b88e0a0106e1c8e8896caeace9c2039216d6ee","abstract_canon_sha256":"67f0ef62066034bcff8ecd7b34d763bf3eb6c226d869f70647838889ce6e1edb"},"schema_version":"1.0"},"canonical_sha256":"9005ce13e948fe841c2d2c8960ad21965119c7c3cd71545be8d2c219bfbc8cb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:19.707204Z","signature_b64":"n+R89+VcGCuQusDP45t9lYQvJn22o7AW178revFKjvfxARq3A7uToCpcw/DBfBFEoDIs+zDH72eGKU0Q7vFCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9005ce13e948fe841c2d2c8960ad21965119c7c3cd71545be8d2c219bfbc8cb9","last_reissued_at":"2026-06-24T01:14:19.706705Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:19.706705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01015","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1GmU56JhTKtOWYWPoOgayHaESyhRo0eOJg4YDPUNIlwK5IZ7ei+hy+rV5uhCxDxP5om3A38cglkf41iwmYVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:20:43.756246Z"},"content_sha256":"f1f72d7757d337932aef0a836f368952f1bb58348793317fac5399f5125f98a2","schema_version":"1.0","event_id":"sha256:f1f72d7757d337932aef0a836f368952f1bb58348793317fac5399f5125f98a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SAC44E7JJD7IIHBNFSEWBLJBSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Han Zhao, Makoto Yamada, Meitong Liu, Siqi Zeng, Weiqiu You, Yao-Hung Hubert Tsai, Yifan Hao, Yifei He","submitted_at":"2025-02-03T03:18:26Z","abstract_excerpt":"Task arithmetic, representing downstream tasks through linear operations on task vectors, has emerged as a simple yet powerful paradigm for transferring knowledge across diverse settings. However, maintaining a large collection of task vectors introduces scalability challenges in both storage and computation. We propose Task Vector Bases, a framework compressing $T$ task vectors into $M < T$ basis vectors while preserving the functionality of task arithmetic. By representing each task vector as a structured linear combination of basis atoms, our approach supports standard operations such as ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01015","kind":"arxiv","version":5},"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/2502.01015/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+8hN+C5Fbul6Xx2Eeq8iXI1ejjIEDWWEeDJoQ9gbg+JIFAlZ/SlbgsvuqvQD/02Bbj4BliYHet2g2mJ4l0LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:20:43.756634Z"},"content_sha256":"200feb926527fab930d6900ab8103f388f4c28a0a57f4b8c54f7b63e0a5291e4","schema_version":"1.0","event_id":"sha256:200feb926527fab930d6900ab8103f388f4c28a0a57f4b8c54f7b63e0a5291e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/bundle.json","state_url":"https://pith.science/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T18:20:43Z","links":{"resolver":"https://pith.science/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ","bundle":"https://pith.science/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/bundle.json","state":"https://pith.science/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAC44E7JJD7IIHBNFSEWBLJBSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SAC44E7JJD7IIHBNFSEWBLJBSZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"67f0ef62066034bcff8ecd7b34d763bf3eb6c226d869f70647838889ce6e1edb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T03:18:26Z","title_canon_sha256":"cb36645f8f42a78c3844456957b88e0a0106e1c8e8896caeace9c2039216d6ee"},"schema_version":"1.0","source":{"id":"2502.01015","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01015","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01015v5","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01015","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"SAC44E7JJD7I","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"SAC44E7JJD7IIHBN","created_at":"2026-06-24T01:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"SAC44E7J","created_at":"2026-06-24T01:14:19Z"}],"graph_snapshots":[{"event_id":"sha256:200feb926527fab930d6900ab8103f388f4c28a0a57f4b8c54f7b63e0a5291e4","target":"graph","created_at":"2026-06-24T01:14:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.01015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Task arithmetic, representing downstream tasks through linear operations on task vectors, has emerged as a simple yet powerful paradigm for transferring knowledge across diverse settings. However, maintaining a large collection of task vectors introduces scalability challenges in both storage and computation. We propose Task Vector Bases, a framework compressing $T$ task vectors into $M < T$ basis vectors while preserving the functionality of task arithmetic. By representing each task vector as a structured linear combination of basis atoms, our approach supports standard operations such as ad","authors_text":"Han Zhao, Makoto Yamada, Meitong Liu, Siqi Zeng, Weiqiu You, Yao-Hung Hubert Tsai, Yifan Hao, Yifei He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T03:18:26Z","title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01015","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f1f72d7757d337932aef0a836f368952f1bb58348793317fac5399f5125f98a2","target":"record","created_at":"2026-06-24T01:14:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"67f0ef62066034bcff8ecd7b34d763bf3eb6c226d869f70647838889ce6e1edb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T03:18:26Z","title_canon_sha256":"cb36645f8f42a78c3844456957b88e0a0106e1c8e8896caeace9c2039216d6ee"},"schema_version":"1.0","source":{"id":"2502.01015","kind":"arxiv","version":5}},"canonical_sha256":"9005ce13e948fe841c2d2c8960ad21965119c7c3cd71545be8d2c219bfbc8cb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9005ce13e948fe841c2d2c8960ad21965119c7c3cd71545be8d2c219bfbc8cb9","first_computed_at":"2026-06-24T01:14:19.706705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:19.706705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n+R89+VcGCuQusDP45t9lYQvJn22o7AW178revFKjvfxARq3A7uToCpcw/DBfBFEoDIs+zDH72eGKU0Q7vFCCA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:19.707204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01015","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f72d7757d337932aef0a836f368952f1bb58348793317fac5399f5125f98a2","sha256:200feb926527fab930d6900ab8103f388f4c28a0a57f4b8c54f7b63e0a5291e4"],"state_sha256":"d4705cc3930c5bad6c8e65f0f15adb869af85a59f1d5b24e2972599e0162178b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruX0iIeyZwf2ZXZJFNZCR+rzRRGZo17VUm5nQ5J6xBsFaCQxDKlUWNeTZ2KYqzDF0UZfCTZiWTf2Ybk7E5nvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:20:43.758571Z","bundle_sha256":"6f6f97f5d774513145f43fd9b0c073ddd869a3f382bc0748a5e96b0aa42ff6dd"}}