{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PEOM375UR3HZXWNB2GTD7ZYLJV","short_pith_number":"pith:PEOM375U","canonical_record":{"source":{"id":"2606.02328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"77e813f30704302f40e8bdaee595bd483d32dea6d9fb7ca5fbd4107361284881","abstract_canon_sha256":"33908af3abc56afbc8eabb9107aebdb780ef02414c5bf03b474344ad489a9736"},"schema_version":"1.0"},"canonical_sha256":"791ccdffb48ecf9bd9a1d1a63fe70b4d76d02914d364084284e7332d24ffd516","source":{"kind":"arxiv","id":"2606.02328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02328","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02328v1","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02328","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"PEOM375UR3HZ","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"PEOM375UR3HZXWNB","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"PEOM375U","created_at":"2026-06-02T03:04:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PEOM375UR3HZXWNB2GTD7ZYLJV","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"77e813f30704302f40e8bdaee595bd483d32dea6d9fb7ca5fbd4107361284881","abstract_canon_sha256":"33908af3abc56afbc8eabb9107aebdb780ef02414c5bf03b474344ad489a9736"},"schema_version":"1.0"},"canonical_sha256":"791ccdffb48ecf9bd9a1d1a63fe70b4d76d02914d364084284e7332d24ffd516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:56.251102Z","signature_b64":"651JCmDPG2pp3h89J0hdJf7l7xHqwcL7KQdt4we9fGIJJUuyY8ImkgkUZkGnobaA0kIh7+RkbN5SrBS0BpeFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791ccdffb48ecf9bd9a1d1a63fe70b4d76d02914d364084284e7332d24ffd516","last_reissued_at":"2026-06-02T03:04:56.250774Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:56.250774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02328","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-02T03:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRWjvAJC61FL1dKBAmuTW2Ldk/I52OylcgJPOgWKBo+0bZAC5E4sqdWpmzaX+bxybgYubPIA3n7X5JLGcLhBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:13:04.008595Z"},"content_sha256":"971c0b859d49f9974e8ecb2d6c4c09a0c950090725fbc38a1a1d40d9a64dd863","schema_version":"1.0","event_id":"sha256:971c0b859d49f9974e8ecb2d6c4c09a0c950090725fbc38a1a1d40d9a64dd863"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PEOM375UR3HZXWNB2GTD7ZYLJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Riemannian Gradient Descent for Low-Rank Architectures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nicholas Knight","submitted_at":"2026-06-01T14:40:00Z","abstract_excerpt":"We explore Riemannian optimization techniques for rank-factored matrix parameters, targeting contemporary deep learning applications. We examine ten points in the algorithm design space: two geometries for rank-$r$ matrices, three geometries for rank-$r$ partial isometries, and block-matrix variants of these five, where factors are shared across block-rows and block-columns. We apply our methods to the multihead attention parameters in small language models. After tuning learning rates, our methods do not conclusively outperform an AdamW baseline. Our implementations are available online."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02328","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.02328/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-02T03:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wi+MHnYFFTq0kNQAWtgOv3hfHH2Zep39CFNJbLXTcgTa9yMHHw9bAaQIgPwx+B4Z9A38t8vxjN/0WcKIQ86zBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:13:04.008979Z"},"content_sha256":"455474686b17ff9a0c5dcb05420eb23e96c4a685c7840be850ed14b67eecfc25","schema_version":"1.0","event_id":"sha256:455474686b17ff9a0c5dcb05420eb23e96c4a685c7840be850ed14b67eecfc25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/bundle.json","state_url":"https://pith.science/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/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-02T19:13:04Z","links":{"resolver":"https://pith.science/pith/PEOM375UR3HZXWNB2GTD7ZYLJV","bundle":"https://pith.science/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/bundle.json","state":"https://pith.science/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEOM375UR3HZXWNB2GTD7ZYLJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PEOM375UR3HZXWNB2GTD7ZYLJV","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":"33908af3abc56afbc8eabb9107aebdb780ef02414c5bf03b474344ad489a9736","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:40:00Z","title_canon_sha256":"77e813f30704302f40e8bdaee595bd483d32dea6d9fb7ca5fbd4107361284881"},"schema_version":"1.0","source":{"id":"2606.02328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02328","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02328v1","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02328","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"PEOM375UR3HZ","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"PEOM375UR3HZXWNB","created_at":"2026-06-02T03:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"PEOM375U","created_at":"2026-06-02T03:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:455474686b17ff9a0c5dcb05420eb23e96c4a685c7840be850ed14b67eecfc25","target":"graph","created_at":"2026-06-02T03:04:56Z","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.02328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We explore Riemannian optimization techniques for rank-factored matrix parameters, targeting contemporary deep learning applications. We examine ten points in the algorithm design space: two geometries for rank-$r$ matrices, three geometries for rank-$r$ partial isometries, and block-matrix variants of these five, where factors are shared across block-rows and block-columns. We apply our methods to the multihead attention parameters in small language models. After tuning learning rates, our methods do not conclusively outperform an AdamW baseline. Our implementations are available online.","authors_text":"Nicholas Knight","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:40:00Z","title":"Riemannian Gradient Descent for Low-Rank Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02328","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:971c0b859d49f9974e8ecb2d6c4c09a0c950090725fbc38a1a1d40d9a64dd863","target":"record","created_at":"2026-06-02T03:04:56Z","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":"33908af3abc56afbc8eabb9107aebdb780ef02414c5bf03b474344ad489a9736","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:40:00Z","title_canon_sha256":"77e813f30704302f40e8bdaee595bd483d32dea6d9fb7ca5fbd4107361284881"},"schema_version":"1.0","source":{"id":"2606.02328","kind":"arxiv","version":1}},"canonical_sha256":"791ccdffb48ecf9bd9a1d1a63fe70b4d76d02914d364084284e7332d24ffd516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"791ccdffb48ecf9bd9a1d1a63fe70b4d76d02914d364084284e7332d24ffd516","first_computed_at":"2026-06-02T03:04:56.250774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:56.250774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"651JCmDPG2pp3h89J0hdJf7l7xHqwcL7KQdt4we9fGIJJUuyY8ImkgkUZkGnobaA0kIh7+RkbN5SrBS0BpeFBA==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:56.251102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:971c0b859d49f9974e8ecb2d6c4c09a0c950090725fbc38a1a1d40d9a64dd863","sha256:455474686b17ff9a0c5dcb05420eb23e96c4a685c7840be850ed14b67eecfc25"],"state_sha256":"40800269f1e486a70717fcc058ff14fe7df439a2613d22ccbfbc035dc93779b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2vNI61KTuRlaa2yIi5EuYwhTFIn9YdAoyxAtQtrjkPOISr2k/DW5xzwlsuL55NSe5WM4QS9hxwZJjyEBbyvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T19:13:04.011149Z","bundle_sha256":"0d0bd4ef472baa8d49ee881ff26bef55a9fbc4004440822f321d3973fd5efe60"}}