{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VOZYYDXBMDGWZZKPADQSFJTECJ","short_pith_number":"pith:VOZYYDXB","canonical_record":{"source":{"id":"2303.16510","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-29T07:36:54Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"f5625e338524d1475a4abb47d6f3fd4ff144b15932c4ac9a57a147455cd5c376","abstract_canon_sha256":"5b6eb263f7aff4e8dc9a0169fa99ee76c5d3391a84ad1021b297e79863af5f4f"},"schema_version":"1.0"},"canonical_sha256":"abb38c0ee160cd6ce54f00e122a664126fc0244918338c0b496eac05b71d0ea9","source":{"kind":"arxiv","id":"2303.16510","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16510","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16510v2","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16510","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_12","alias_value":"VOZYYDXBMDGW","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_16","alias_value":"VOZYYDXBMDGWZZKP","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_8","alias_value":"VOZYYDXB","created_at":"2026-07-05T11:49:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VOZYYDXBMDGWZZKPADQSFJTECJ","target":"record","payload":{"canonical_record":{"source":{"id":"2303.16510","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-29T07:36:54Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"f5625e338524d1475a4abb47d6f3fd4ff144b15932c4ac9a57a147455cd5c376","abstract_canon_sha256":"5b6eb263f7aff4e8dc9a0169fa99ee76c5d3391a84ad1021b297e79863af5f4f"},"schema_version":"1.0"},"canonical_sha256":"abb38c0ee160cd6ce54f00e122a664126fc0244918338c0b496eac05b71d0ea9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:43.297698Z","signature_b64":"T2tusjPegYnUzB6eXsT1jg6oREpIJ7+XAEu+Pv15xkmmNW3dxZDEKDT7Rf4NmTstdx9i8LxBKKgPtGVNtYDuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb38c0ee160cd6ce54f00e122a664126fc0244918338c0b496eac05b71d0ea9","last_reissued_at":"2026-07-05T11:49:43.297215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:43.297215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.16510","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-07-05T11:49:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zXWTYBD7xPqBzfyNzugvFoFvvgfSPfrRtOKo3p6YakVmBpqblmcpIgXw/TlAb7N3mEd7gOAmHd4NXMa/DaPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:46:22.824739Z"},"content_sha256":"8222a16972deaaae81d36b4959f32d37801e0ee7df688d880ca1fc3962c7931f","schema_version":"1.0","event_id":"sha256:8222a16972deaaae81d36b4959f32d37801e0ee7df688d880ca1fc3962c7931f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VOZYYDXBMDGWZZKPADQSFJTECJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bin Gao, P.-A. Absil, Pierre Ablin, Simon Vary","submitted_at":"2023-03-29T07:36:54Z","abstract_excerpt":"Orthogonality constraints naturally appear in many machine learning problems, from principal component analysis to robust neural network training. They are usually solved using Riemannian optimization algorithms, which minimize the objective function while enforcing the constraint. However, enforcing the orthogonality constraint can be the most time-consuming operation in such algorithms. Recently, Ablin & Peyr\\'e (2022) proposed the landing algorithm, a method with cheap iterations that does not enforce the orthogonality constraints but is attracted towards the manifold in a smooth manner. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16510","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.16510/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-05T11:49:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppk5AiDpBHRDfvHHsnSetkpXujfSnMxXlg7R0V72V9nYLNKuOJHKRQqiOlGFXbMihIpkld5ns5Ij5KG/kVafDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:46:22.825238Z"},"content_sha256":"08d96da2f6dd118e020a5a03152b4bb0ebccdc2763f4e057e0fa6bf85d53ac53","schema_version":"1.0","event_id":"sha256:08d96da2f6dd118e020a5a03152b4bb0ebccdc2763f4e057e0fa6bf85d53ac53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/bundle.json","state_url":"https://pith.science/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/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-22T13:46:22Z","links":{"resolver":"https://pith.science/pith/VOZYYDXBMDGWZZKPADQSFJTECJ","bundle":"https://pith.science/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/bundle.json","state":"https://pith.science/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOZYYDXBMDGWZZKPADQSFJTECJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VOZYYDXBMDGWZZKPADQSFJTECJ","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":"5b6eb263f7aff4e8dc9a0169fa99ee76c5d3391a84ad1021b297e79863af5f4f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-29T07:36:54Z","title_canon_sha256":"f5625e338524d1475a4abb47d6f3fd4ff144b15932c4ac9a57a147455cd5c376"},"schema_version":"1.0","source":{"id":"2303.16510","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16510","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16510v2","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16510","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_12","alias_value":"VOZYYDXBMDGW","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_16","alias_value":"VOZYYDXBMDGWZZKP","created_at":"2026-07-05T11:49:43Z"},{"alias_kind":"pith_short_8","alias_value":"VOZYYDXB","created_at":"2026-07-05T11:49:43Z"}],"graph_snapshots":[{"event_id":"sha256:08d96da2f6dd118e020a5a03152b4bb0ebccdc2763f4e057e0fa6bf85d53ac53","target":"graph","created_at":"2026-07-05T11:49:43Z","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/2303.16510/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Orthogonality constraints naturally appear in many machine learning problems, from principal component analysis to robust neural network training. They are usually solved using Riemannian optimization algorithms, which minimize the objective function while enforcing the constraint. However, enforcing the orthogonality constraint can be the most time-consuming operation in such algorithms. Recently, Ablin & Peyr\\'e (2022) proposed the landing algorithm, a method with cheap iterations that does not enforce the orthogonality constraints but is attracted towards the manifold in a smooth manner. Th","authors_text":"Bin Gao, P.-A. Absil, Pierre Ablin, Simon Vary","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-29T07:36:54Z","title":"Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16510","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:8222a16972deaaae81d36b4959f32d37801e0ee7df688d880ca1fc3962c7931f","target":"record","created_at":"2026-07-05T11:49:43Z","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":"5b6eb263f7aff4e8dc9a0169fa99ee76c5d3391a84ad1021b297e79863af5f4f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-29T07:36:54Z","title_canon_sha256":"f5625e338524d1475a4abb47d6f3fd4ff144b15932c4ac9a57a147455cd5c376"},"schema_version":"1.0","source":{"id":"2303.16510","kind":"arxiv","version":2}},"canonical_sha256":"abb38c0ee160cd6ce54f00e122a664126fc0244918338c0b496eac05b71d0ea9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abb38c0ee160cd6ce54f00e122a664126fc0244918338c0b496eac05b71d0ea9","first_computed_at":"2026-07-05T11:49:43.297215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:43.297215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2tusjPegYnUzB6eXsT1jg6oREpIJ7+XAEu+Pv15xkmmNW3dxZDEKDT7Rf4NmTstdx9i8LxBKKgPtGVNtYDuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:43.297698Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.16510","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8222a16972deaaae81d36b4959f32d37801e0ee7df688d880ca1fc3962c7931f","sha256:08d96da2f6dd118e020a5a03152b4bb0ebccdc2763f4e057e0fa6bf85d53ac53"],"state_sha256":"298fb4ba5d5419b0b03ce56ce32896ad439e6006a86cc575a7c903a13b8a537e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHGX4qRRab6RWc8S75L+GRB9VHAstVXFBqR0ww3+0hPY2nSBv4Ekk+40oevFW4HhaaP9ATDntN8zBOJOBO6aCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:46:22.829864Z","bundle_sha256":"d5001ec4436cdf03264731ff0913e2fb240fa312586065e9ac8e79791d2ae651"}}