{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:F5MCLOH54SBBTNUIUZURARYJRY","short_pith_number":"pith:F5MCLOH5","canonical_record":{"source":{"id":"2408.12857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:54:53Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"d4013f690c85641ef3636a6a2b93bd6478255a60ba659bbd2d36d68c4ee14973","abstract_canon_sha256":"2a04bdbdcbf3ad0f7fc635034d11ec91d2b8e0cfa6ab5607d887b30b324d8f9b"},"schema_version":"1.0"},"canonical_sha256":"2f5825b8fde48219b688a6691047098e293afba6d7cd3da9f660116b7bb32a7c","source":{"kind":"arxiv","id":"2408.12857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12857","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12857v1","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12857","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"F5MCLOH54SBB","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"F5MCLOH54SBBTNUI","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"F5MCLOH5","created_at":"2026-07-05T08:58:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:F5MCLOH54SBBTNUIUZURARYJRY","target":"record","payload":{"canonical_record":{"source":{"id":"2408.12857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:54:53Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"d4013f690c85641ef3636a6a2b93bd6478255a60ba659bbd2d36d68c4ee14973","abstract_canon_sha256":"2a04bdbdcbf3ad0f7fc635034d11ec91d2b8e0cfa6ab5607d887b30b324d8f9b"},"schema_version":"1.0"},"canonical_sha256":"2f5825b8fde48219b688a6691047098e293afba6d7cd3da9f660116b7bb32a7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:31.665070Z","signature_b64":"PDU3j812/g9GXQQqys+FbnpY4iOzZQ3u4rGkda8R03gDA2EQZd+g3+z6fvgQMg8olz5jueKEWUbKqO6I9an5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5825b8fde48219b688a6691047098e293afba6d7cd3da9f660116b7bb32a7c","last_reissued_at":"2026-07-05T08:58:31.664580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:31.664580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.12857","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-05T08:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGmisyt5DKCc+avlD6MxJUillHolnhi5rvkSJ7xFpGJDwY/0III1jReWt1vlmClss3qqxI0zc/669WfD6+aFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:55:56.986761Z"},"content_sha256":"2d7ccfc900f4184119230ddc401aad377c334c1b7a347de43198fdd1ce2389ca","schema_version":"1.0","event_id":"sha256:2d7ccfc900f4184119230ddc401aad377c334c1b7a347de43198fdd1ce2389ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:F5MCLOH54SBBTNUIUZURARYJRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-Efficient LLM Training with Online Subspace Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Bo Liu, Kaizhao Liang, Lizhang Chen, Qiang Liu","submitted_at":"2024-08-23T05:54:53Z","abstract_excerpt":"Recently, a wide range of memory-efficient LLM training algorithms have gained substantial popularity. These methods leverage the low-rank structure of gradients to project optimizer states into a subspace using projection matrix found by singular value decomposition (SVD). However, convergence of these algorithms is highly dependent on the update rules of their projection matrix. In this work, we provide the \\emph{first} convergence guarantee for arbitrary update rules of projection matrix. This guarantee is generally applicable to optimizers that can be analyzed with Hamiltonian Descent, inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12857","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/2408.12857/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-05T08:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naRKS4/WZPsOq3N7trqW9OL0mBT9f9khy/iUVdFcyxFIhd4nPiiaEZUnp9MDrYy6DDoEoSVMLUKehzQ5uvNiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:55:56.987185Z"},"content_sha256":"125c8a80590aa7162ef43893d8e70061452ceb2be0fe40bbddeb9f56f812a7c4","schema_version":"1.0","event_id":"sha256:125c8a80590aa7162ef43893d8e70061452ceb2be0fe40bbddeb9f56f812a7c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5MCLOH54SBBTNUIUZURARYJRY/bundle.json","state_url":"https://pith.science/pith/F5MCLOH54SBBTNUIUZURARYJRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5MCLOH54SBBTNUIUZURARYJRY/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-07-07T14:55:56Z","links":{"resolver":"https://pith.science/pith/F5MCLOH54SBBTNUIUZURARYJRY","bundle":"https://pith.science/pith/F5MCLOH54SBBTNUIUZURARYJRY/bundle.json","state":"https://pith.science/pith/F5MCLOH54SBBTNUIUZURARYJRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5MCLOH54SBBTNUIUZURARYJRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:F5MCLOH54SBBTNUIUZURARYJRY","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":"2a04bdbdcbf3ad0f7fc635034d11ec91d2b8e0cfa6ab5607d887b30b324d8f9b","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:54:53Z","title_canon_sha256":"d4013f690c85641ef3636a6a2b93bd6478255a60ba659bbd2d36d68c4ee14973"},"schema_version":"1.0","source":{"id":"2408.12857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12857","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12857v1","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12857","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"F5MCLOH54SBB","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"F5MCLOH54SBBTNUI","created_at":"2026-07-05T08:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"F5MCLOH5","created_at":"2026-07-05T08:58:31Z"}],"graph_snapshots":[{"event_id":"sha256:125c8a80590aa7162ef43893d8e70061452ceb2be0fe40bbddeb9f56f812a7c4","target":"graph","created_at":"2026-07-05T08:58: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/2408.12857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, a wide range of memory-efficient LLM training algorithms have gained substantial popularity. These methods leverage the low-rank structure of gradients to project optimizer states into a subspace using projection matrix found by singular value decomposition (SVD). However, convergence of these algorithms is highly dependent on the update rules of their projection matrix. In this work, we provide the \\emph{first} convergence guarantee for arbitrary update rules of projection matrix. This guarantee is generally applicable to optimizers that can be analyzed with Hamiltonian Descent, inc","authors_text":"Bo Liu, Kaizhao Liang, Lizhang Chen, Qiang Liu","cross_cats":["cs.AI","cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:54:53Z","title":"Memory-Efficient LLM Training with Online Subspace Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12857","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:2d7ccfc900f4184119230ddc401aad377c334c1b7a347de43198fdd1ce2389ca","target":"record","created_at":"2026-07-05T08:58: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":"2a04bdbdcbf3ad0f7fc635034d11ec91d2b8e0cfa6ab5607d887b30b324d8f9b","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T05:54:53Z","title_canon_sha256":"d4013f690c85641ef3636a6a2b93bd6478255a60ba659bbd2d36d68c4ee14973"},"schema_version":"1.0","source":{"id":"2408.12857","kind":"arxiv","version":1}},"canonical_sha256":"2f5825b8fde48219b688a6691047098e293afba6d7cd3da9f660116b7bb32a7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f5825b8fde48219b688a6691047098e293afba6d7cd3da9f660116b7bb32a7c","first_computed_at":"2026-07-05T08:58:31.664580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:31.664580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PDU3j812/g9GXQQqys+FbnpY4iOzZQ3u4rGkda8R03gDA2EQZd+g3+z6fvgQMg8olz5jueKEWUbKqO6I9an5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:31.665070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.12857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d7ccfc900f4184119230ddc401aad377c334c1b7a347de43198fdd1ce2389ca","sha256:125c8a80590aa7162ef43893d8e70061452ceb2be0fe40bbddeb9f56f812a7c4"],"state_sha256":"e1c3710746d26012cd36a0b3af79cd570acfeab6794606cade196274f211cfa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRFtQ3K3EUCIY8cB8gpFl3QTL2Lzv+Xdpb3Vmoe1VkxgrALuwWsgZxbhG4BlSAKEoyrMs82qmBvg/mPPWwSPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:55:56.989425Z","bundle_sha256":"4ee18d4e4800b10e638fa13c4823bb16102d6d23ba96efec88a4b4cab1399798"}}