{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CPTGRSL2JG4YHOGKR2ERUEVRP4","short_pith_number":"pith:CPTGRSL2","schema_version":"1.0","canonical_sha256":"13e668c97a49b983b8ca8e891a12b17f3dfd6c829b659dbf8f56c64049a84043","source":{"kind":"arxiv","id":"2605.31505","version":1},"attestation_state":"computed","paper":{"title":"The sketched landing method for large-scale optimization under orthogonality constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Florentin Goyens, Pierre-Antoine Absil, Simon Mataigne","submitted_at":"2026-05-29T16:25:34Z","abstract_excerpt":"We propose the \\emph{sketched landing method}, a randomized variant of the landing method for optimization under orthogonality constraints. Each landing step consists of the sum of a \\emph{normal} component, which reduces infeasibility, and a \\emph{tangent} component, which decreases the objective function. Our main contribution is the introduction of low-dimensional random \\emph{sketch matrices} to reduce the computational cost of these directions. We consider both dense (Gaussian) and sparse (subsampling) sketch matrices, and show how they reduce the per-iteration cost while preserving conve"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.31505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T16:25:34Z","cross_cats_sorted":[],"title_canon_sha256":"cfc90b30d58ca33938c896d81ec491b86c075a1885db857ae88c94ac53fd3314","abstract_canon_sha256":"2594b9c4cfacefaef129055ba4c54b20130fd087d0c5b1c51fa1650a33dc9e14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:09.801921Z","signature_b64":"tHVtf4VtlxRiFEAdq9eZyL1/ULgTE4O4CLMDaDkGf6DWd3QgDuH7uXKqF7zgLefVtXlY/fTQzbAFNbczIqJWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e668c97a49b983b8ca8e891a12b17f3dfd6c829b659dbf8f56c64049a84043","last_reissued_at":"2026-06-01T02:04:09.800843Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:09.800843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sketched landing method for large-scale optimization under orthogonality constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Florentin Goyens, Pierre-Antoine Absil, Simon Mataigne","submitted_at":"2026-05-29T16:25:34Z","abstract_excerpt":"We propose the \\emph{sketched landing method}, a randomized variant of the landing method for optimization under orthogonality constraints. Each landing step consists of the sum of a \\emph{normal} component, which reduces infeasibility, and a \\emph{tangent} component, which decreases the objective function. Our main contribution is the introduction of low-dimensional random \\emph{sketch matrices} to reduce the computational cost of these directions. We consider both dense (Gaussian) and sparse (subsampling) sketch matrices, and show how they reduce the per-iteration cost while preserving conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31505","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/2605.31505/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.31505","created_at":"2026-06-01T02:04:09.801032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31505v1","created_at":"2026-06-01T02:04:09.801032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31505","created_at":"2026-06-01T02:04:09.801032+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPTGRSL2JG4Y","created_at":"2026-06-01T02:04:09.801032+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPTGRSL2JG4YHOGK","created_at":"2026-06-01T02:04:09.801032+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPTGRSL2","created_at":"2026-06-01T02:04:09.801032+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4","json":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4.json","graph_json":"https://pith.science/api/pith-number/CPTGRSL2JG4YHOGKR2ERUEVRP4/graph.json","events_json":"https://pith.science/api/pith-number/CPTGRSL2JG4YHOGKR2ERUEVRP4/events.json","paper":"https://pith.science/paper/CPTGRSL2"},"agent_actions":{"view_html":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4","download_json":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4.json","view_paper":"https://pith.science/paper/CPTGRSL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31505&json=true","fetch_graph":"https://pith.science/api/pith-number/CPTGRSL2JG4YHOGKR2ERUEVRP4/graph.json","fetch_events":"https://pith.science/api/pith-number/CPTGRSL2JG4YHOGKR2ERUEVRP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4/action/storage_attestation","attest_author":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4/action/author_attestation","sign_citation":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4/action/citation_signature","submit_replication":"https://pith.science/pith/CPTGRSL2JG4YHOGKR2ERUEVRP4/action/replication_record"}},"created_at":"2026-06-01T02:04:09.801032+00:00","updated_at":"2026-06-01T02:04:09.801032+00:00"}