{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4NH7WJZC3NJF4QC42XLF5ILUQ5","short_pith_number":"pith:4NH7WJZC","canonical_record":{"source":{"id":"1209.0430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8c651b19c1fff450033a9e435d27ccfc46a5434bcec20a46f546ce8367380d5d","abstract_canon_sha256":"d3b8d026e6f5a6a8355c785b70ecfe8dc314e356f3ff8b0371b0b5850f1f2310"},"schema_version":"1.0"},"canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","source":{"kind":"arxiv","id":"1209.0430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0430","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0430v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0430","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"4NH7WJZC3NJF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4NH7WJZC3NJF4QC4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4NH7WJZC","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4NH7WJZC3NJF4QC42XLF5ILUQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8c651b19c1fff450033a9e435d27ccfc46a5434bcec20a46f546ce8367380d5d","abstract_canon_sha256":"d3b8d026e6f5a6a8355c785b70ecfe8dc314e356f3ff8b0371b0b5850f1f2310"},"schema_version":"1.0"},"canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.853549Z","signature_b64":"JTS/zyh0juV6gsg5rFcQZIPpbHbld/YTePoYrYyU4XRLsnP8qijxKuLuEpwva+z+ESMb3j3+ncmERqvuTOyIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","last_reissued_at":"2026-05-18T03:27:13.852774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.852774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0430","source_version":2,"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-05-18T03:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tc73SmVQCRo9aD8yodHJ1cjDPy9VlFpG5e2R98kWAnLrqAPxyClvJePIn8Yh6pPymRPnPJ8j1cq2PhUswhJLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:57:06.087289Z"},"content_sha256":"af37fffa6e0a186990bf4372b487f7b9d1f80e180b62104cf3a3a7951eaa843a","schema_version":"1.0","event_id":"sha256:af37fffa6e0a186990bf4372b487f7b9d1f80e180b62104cf3a3a7951eaa843a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4NH7WJZC3NJF4QC42XLF5ILUQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"B. Mishra, G. Meyer, R. Sepulchre, S. Bonnabel","submitted_at":"2012-09-03T18:48:37Z","abstract_excerpt":"Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0430","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7ZlhmfeJou/6G/C8BiF746NKVjdvITgTJYlVsZunGGiBde9iyJ3k5OfEJmjmw59S/jQ/oNqltO3b7UvehedBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:57:06.087659Z"},"content_sha256":"0b90b7d48098e8bedf443c10e1f6886062a775c2b92e2c7758ca32f62bb1c68a","schema_version":"1.0","event_id":"sha256:0b90b7d48098e8bedf443c10e1f6886062a775c2b92e2c7758ca32f62bb1c68a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/bundle.json","state_url":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/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-02T20:57:06Z","links":{"resolver":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5","bundle":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/bundle.json","state":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4NH7WJZC3NJF4QC42XLF5ILUQ5","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":"d3b8d026e6f5a6a8355c785b70ecfe8dc314e356f3ff8b0371b0b5850f1f2310","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","title_canon_sha256":"8c651b19c1fff450033a9e435d27ccfc46a5434bcec20a46f546ce8367380d5d"},"schema_version":"1.0","source":{"id":"1209.0430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0430","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0430v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0430","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"4NH7WJZC3NJF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4NH7WJZC3NJF4QC4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4NH7WJZC","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:0b90b7d48098e8bedf443c10e1f6886062a775c2b92e2c7758ca32f62bb1c68a","target":"graph","created_at":"2026-05-18T03:27:13Z","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"},"paper":{"abstract_excerpt":"Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fix","authors_text":"B. Mishra, G. Meyer, R. Sepulchre, S. Bonnabel","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0430","kind":"arxiv","version":2},"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:af37fffa6e0a186990bf4372b487f7b9d1f80e180b62104cf3a3a7951eaa843a","target":"record","created_at":"2026-05-18T03:27:13Z","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":"d3b8d026e6f5a6a8355c785b70ecfe8dc314e356f3ff8b0371b0b5850f1f2310","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","title_canon_sha256":"8c651b19c1fff450033a9e435d27ccfc46a5434bcec20a46f546ce8367380d5d"},"schema_version":"1.0","source":{"id":"1209.0430","kind":"arxiv","version":2}},"canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","first_computed_at":"2026-05-18T03:27:13.852774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:13.852774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTS/zyh0juV6gsg5rFcQZIPpbHbld/YTePoYrYyU4XRLsnP8qijxKuLuEpwva+z+ESMb3j3+ncmERqvuTOyIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:13.853549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af37fffa6e0a186990bf4372b487f7b9d1f80e180b62104cf3a3a7951eaa843a","sha256:0b90b7d48098e8bedf443c10e1f6886062a775c2b92e2c7758ca32f62bb1c68a"],"state_sha256":"36b8ae1944ddc14ccb2ee6148b5d3e6d461607aa762f81c28a8afc62d12fc95e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt0bG8qpo5D1f31vmtbJbzORKNL4Mwzg7w6czNuaOtWAT9nfIf7QBidsy/lrOYvJeBTTPmvdwH9yH+H8NhtJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:57:06.089600Z","bundle_sha256":"097d1d895dac6e9889a0dfcc9b698f58960b3c893d327e333ef646ca83736ead"}}