{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FI4YCRNCUWWKSUUBLWRQXGXBY7","short_pith_number":"pith:FI4YCRNC","canonical_record":{"source":{"id":"2606.23568","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:33:16Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"11814eadde0458dfe422f9cf26a99dbd6a8280affde13bf7eb10c73b8cabebce","abstract_canon_sha256":"7a8bf199930c953ba1b6e0506939ee02418a42601043a8030c8d0666624f38b6"},"schema_version":"1.0"},"canonical_sha256":"2a398145a2a5aca952815da30b9ae1c7e48929b6f9b181f4839ffdc58add8a21","source":{"kind":"arxiv","id":"2606.23568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23568","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23568v1","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23568","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"FI4YCRNCUWWK","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"FI4YCRNCUWWKSUUB","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"FI4YCRNC","created_at":"2026-06-23T03:14:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FI4YCRNCUWWKSUUBLWRQXGXBY7","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23568","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:33:16Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"11814eadde0458dfe422f9cf26a99dbd6a8280affde13bf7eb10c73b8cabebce","abstract_canon_sha256":"7a8bf199930c953ba1b6e0506939ee02418a42601043a8030c8d0666624f38b6"},"schema_version":"1.0"},"canonical_sha256":"2a398145a2a5aca952815da30b9ae1c7e48929b6f9b181f4839ffdc58add8a21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:31.133897Z","signature_b64":"SgwC54bjGWNjTqzXogpprfTpUYzur1aiit3ETfQ/sxUiQmBvERXepY6bvYI7N3mEoPERztOOGKJa1bEBllYvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a398145a2a5aca952815da30b9ae1c7e48929b6f9b181f4839ffdc58add8a21","last_reissued_at":"2026-06-23T03:14:31.133543Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:31.133543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23568","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-06-23T03:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9GCdtpy8OFWkt0m2YGayOWPv5jRFQM5gbxKwrvWLF5mEi9Qq343kHdgfhC9mdmoSUK5B+QsGKRVNEaedXjKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:30:46.832016Z"},"content_sha256":"16c61e33f5c05ab44e1a99961bcaa8ccb4e3722e761186ce8b7703f1760c2df7","schema_version":"1.0","event_id":"sha256:16c61e33f5c05ab44e1a99961bcaa8ccb4e3722e761186ce8b7703f1760c2df7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FI4YCRNCUWWKSUUBLWRQXGXBY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Frank Hutter, Mahmoud Safari","submitted_at":"2026-06-22T16:33:16Z","abstract_excerpt":"Large language models (LLMs) achieve remarkable performance across a wide range of tasks, but their deployment is constrained by substantial memory and compute requirements. Low-rank compression via singular value decomposition (SVD) is an effective remedy, but existing methods focus on how to factorize and which components to keep. We introduce SVD-Surgeon, a training-free method that brings the Optimal Brain Surgeon (OBS) framework to the singular-value basis. Treating each singular value as a parameter, it computes a closed-form update of the retained singular values that compensates, to se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23568","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/2606.23568/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-23T03:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kp2xpOzZc6yHwVIzw+HyrYHS49rzzqt8JwFRcPwlqxMpqxOAnQWBzvS5I765YwgekEUbxPn5fvWxrYSaMDuxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:30:46.832516Z"},"content_sha256":"53d6bfb9c8a1f0b5b98801952f7cafc5b136eda09f2f139a3ef2936f736ea68b","schema_version":"1.0","event_id":"sha256:53d6bfb9c8a1f0b5b98801952f7cafc5b136eda09f2f139a3ef2936f736ea68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/bundle.json","state_url":"https://pith.science/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/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-22T04:30:46Z","links":{"resolver":"https://pith.science/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7","bundle":"https://pith.science/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/bundle.json","state":"https://pith.science/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FI4YCRNCUWWKSUUBLWRQXGXBY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FI4YCRNCUWWKSUUBLWRQXGXBY7","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":"7a8bf199930c953ba1b6e0506939ee02418a42601043a8030c8d0666624f38b6","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:33:16Z","title_canon_sha256":"11814eadde0458dfe422f9cf26a99dbd6a8280affde13bf7eb10c73b8cabebce"},"schema_version":"1.0","source":{"id":"2606.23568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23568","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23568v1","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23568","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"FI4YCRNCUWWK","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"FI4YCRNCUWWKSUUB","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"FI4YCRNC","created_at":"2026-06-23T03:14:31Z"}],"graph_snapshots":[{"event_id":"sha256:53d6bfb9c8a1f0b5b98801952f7cafc5b136eda09f2f139a3ef2936f736ea68b","target":"graph","created_at":"2026-06-23T03:14:31Z","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/2606.23568/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) achieve remarkable performance across a wide range of tasks, but their deployment is constrained by substantial memory and compute requirements. Low-rank compression via singular value decomposition (SVD) is an effective remedy, but existing methods focus on how to factorize and which components to keep. We introduce SVD-Surgeon, a training-free method that brings the Optimal Brain Surgeon (OBS) framework to the singular-value basis. Treating each singular value as a parameter, it computes a closed-form update of the retained singular values that compensates, to se","authors_text":"Frank Hutter, Mahmoud Safari","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:33:16Z","title":"SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23568","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:16c61e33f5c05ab44e1a99961bcaa8ccb4e3722e761186ce8b7703f1760c2df7","target":"record","created_at":"2026-06-23T03:14:31Z","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":"7a8bf199930c953ba1b6e0506939ee02418a42601043a8030c8d0666624f38b6","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:33:16Z","title_canon_sha256":"11814eadde0458dfe422f9cf26a99dbd6a8280affde13bf7eb10c73b8cabebce"},"schema_version":"1.0","source":{"id":"2606.23568","kind":"arxiv","version":1}},"canonical_sha256":"2a398145a2a5aca952815da30b9ae1c7e48929b6f9b181f4839ffdc58add8a21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a398145a2a5aca952815da30b9ae1c7e48929b6f9b181f4839ffdc58add8a21","first_computed_at":"2026-06-23T03:14:31.133543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:31.133543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgwC54bjGWNjTqzXogpprfTpUYzur1aiit3ETfQ/sxUiQmBvERXepY6bvYI7N3mEoPERztOOGKJa1bEBllYvCw==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:31.133897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c61e33f5c05ab44e1a99961bcaa8ccb4e3722e761186ce8b7703f1760c2df7","sha256:53d6bfb9c8a1f0b5b98801952f7cafc5b136eda09f2f139a3ef2936f736ea68b"],"state_sha256":"fc3fcc3031957720b0fc0fc4753848521c4b299e3cede4831b74dfc596ab000d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APmX9YOgpOaO4wOoYQsMqKUixT9qfz/3ZaL0+6qSbgZoK6jU6rZVsZWlR8PvCgn0woPr2qNKpqDC6RUmrEWLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:30:46.837511Z","bundle_sha256":"1e3e597dc1604a6ff3bb840d9f4ab49bf1d3bfd15bb301bb603b1af7d55c9e6a"}}