{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IUCAJPPXPEQFYOXHKOUYTFHEYQ","short_pith_number":"pith:IUCAJPPX","canonical_record":{"source":{"id":"2502.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-02T20:23:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2ec75294f38b46cf749a3f8712f7415fc26f9bc72c2ecbf648cd1a22a6b3c45e","abstract_canon_sha256":"919136d9be35b987db7d5a7ae0aa388d77902a677bb0b24439a3347322bd0d14"},"schema_version":"1.0"},"canonical_sha256":"450404bdf779205c3ae753a98994e4c415cdcc765236a231aa421dd8a7e1ad5e","source":{"kind":"arxiv","id":"2502.00899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00899","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00899v1","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00899","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_12","alias_value":"IUCAJPPXPEQF","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_16","alias_value":"IUCAJPPXPEQFYOXH","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_8","alias_value":"IUCAJPPX","created_at":"2026-07-05T10:08:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IUCAJPPXPEQFYOXHKOUYTFHEYQ","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-02T20:23:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2ec75294f38b46cf749a3f8712f7415fc26f9bc72c2ecbf648cd1a22a6b3c45e","abstract_canon_sha256":"919136d9be35b987db7d5a7ae0aa388d77902a677bb0b24439a3347322bd0d14"},"schema_version":"1.0"},"canonical_sha256":"450404bdf779205c3ae753a98994e4c415cdcc765236a231aa421dd8a7e1ad5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:39.854441Z","signature_b64":"NRp0Ga3tBD6QhjbxFAzlbLVSTEm9C/xAHZnk4/06PsHwVjmP37f+ODvbajllqMyvtK64H3HuDjesZ/50deW9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450404bdf779205c3ae753a98994e4c415cdcc765236a231aa421dd8a7e1ad5e","last_reissued_at":"2026-07-05T10:08:39.853945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:39.853945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00899","source_version":1,"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-07-05T10:08:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNSHeNYRd74uCfxn70vtUo8i+EglLpFEv+BgfZM0oSyda6ce1NE/na5+tAk0bTC5RnQznVxo5h8ABAN5zuZZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:46:56.746307Z"},"content_sha256":"4a5c9d298d1c3884d928e1cec9a54fc53f4a5043e18297ab80af5e400a46b93c","schema_version":"1.0","event_id":"sha256:4a5c9d298d1c3884d928e1cec9a54fc53f4a5043e18297ab80af5e400a46b93c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IUCAJPPXPEQFYOXHKOUYTFHEYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kayhan Behdin, Mehdi Makni, Natalia Ponomareva, Rahul Mazumder, Zheng Xu","submitted_at":"2025-02-02T20:23:32Z","abstract_excerpt":"The impressive capabilities of large foundation models come at a cost of substantial computing resources to serve them. Compressing these pre-trained models is of practical interest as it can democratize deploying them to the machine learning community at large by lowering the costs associated with inference. A promising compression scheme is to decompose foundation models' dense weights into a sum of sparse plus low-rank matrices. In this paper, we design a unified framework coined HASSLE-free for (semi-structured) sparse plus low-rank matrix decomposition of foundation models. Our framework "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00899","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/2502.00899/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-07-05T10:08:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xD+rOlGBS0ZYB4r/++5Yooj3UuCyZ6NNCLlQh5y6bcfzhxBMQ0+cUXGbHk1DhmPaMgQC1LAxcWUaB8tbauqdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:46:56.747203Z"},"content_sha256":"ef69522d2f17260da04ceb87a68ff33a23361c0a7309599c9a1ffc2dc28e174c","schema_version":"1.0","event_id":"sha256:ef69522d2f17260da04ceb87a68ff33a23361c0a7309599c9a1ffc2dc28e174c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/bundle.json","state_url":"https://pith.science/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/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-08-10T10:46:56Z","links":{"resolver":"https://pith.science/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ","bundle":"https://pith.science/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/bundle.json","state":"https://pith.science/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUCAJPPXPEQFYOXHKOUYTFHEYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IUCAJPPXPEQFYOXHKOUYTFHEYQ","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":"919136d9be35b987db7d5a7ae0aa388d77902a677bb0b24439a3347322bd0d14","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-02T20:23:32Z","title_canon_sha256":"2ec75294f38b46cf749a3f8712f7415fc26f9bc72c2ecbf648cd1a22a6b3c45e"},"schema_version":"1.0","source":{"id":"2502.00899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00899","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00899v1","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00899","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_12","alias_value":"IUCAJPPXPEQF","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_16","alias_value":"IUCAJPPXPEQFYOXH","created_at":"2026-07-05T10:08:39Z"},{"alias_kind":"pith_short_8","alias_value":"IUCAJPPX","created_at":"2026-07-05T10:08:39Z"}],"graph_snapshots":[{"event_id":"sha256:ef69522d2f17260da04ceb87a68ff33a23361c0a7309599c9a1ffc2dc28e174c","target":"graph","created_at":"2026-07-05T10:08:39Z","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.00899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The impressive capabilities of large foundation models come at a cost of substantial computing resources to serve them. Compressing these pre-trained models is of practical interest as it can democratize deploying them to the machine learning community at large by lowering the costs associated with inference. A promising compression scheme is to decompose foundation models' dense weights into a sum of sparse plus low-rank matrices. In this paper, we design a unified framework coined HASSLE-free for (semi-structured) sparse plus low-rank matrix decomposition of foundation models. Our framework ","authors_text":"Kayhan Behdin, Mehdi Makni, Natalia Ponomareva, Rahul Mazumder, Zheng Xu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-02T20:23:32Z","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00899","kind":"arxiv","version":1},"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:4a5c9d298d1c3884d928e1cec9a54fc53f4a5043e18297ab80af5e400a46b93c","target":"record","created_at":"2026-07-05T10:08:39Z","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":"919136d9be35b987db7d5a7ae0aa388d77902a677bb0b24439a3347322bd0d14","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-02T20:23:32Z","title_canon_sha256":"2ec75294f38b46cf749a3f8712f7415fc26f9bc72c2ecbf648cd1a22a6b3c45e"},"schema_version":"1.0","source":{"id":"2502.00899","kind":"arxiv","version":1}},"canonical_sha256":"450404bdf779205c3ae753a98994e4c415cdcc765236a231aa421dd8a7e1ad5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450404bdf779205c3ae753a98994e4c415cdcc765236a231aa421dd8a7e1ad5e","first_computed_at":"2026-07-05T10:08:39.853945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:39.853945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NRp0Ga3tBD6QhjbxFAzlbLVSTEm9C/xAHZnk4/06PsHwVjmP37f+ODvbajllqMyvtK64H3HuDjesZ/50deW9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:39.854441Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5c9d298d1c3884d928e1cec9a54fc53f4a5043e18297ab80af5e400a46b93c","sha256:ef69522d2f17260da04ceb87a68ff33a23361c0a7309599c9a1ffc2dc28e174c"],"state_sha256":"6ecaabd207beb98fb49f493ef30aad3804462feeb6c5a87b914a2a218a88e17e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unT94CSBUF07EdzHTrZZ/a4pVZxMAyFmWc5tG/VFSZdaVj3Cl0tOgY9t+s+MXU5xny9RrFF71e55zoU7nkh/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:46:56.754321Z","bundle_sha256":"49662853f55c5c195922185096639b506093fc1e40ce5ed5781de67342fa0917"}}