{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:54ZM44WB2RZ5KEZFTJYLWTIZWA","short_pith_number":"pith:54ZM44WB","schema_version":"1.0","canonical_sha256":"ef32ce72c1d473d513259a70bb4d19b01643d380c5da6c7eeebcd954b976e0f9","source":{"kind":"arxiv","id":"2303.16040","version":1},"attestation_state":"computed","paper":{"title":"First-order optimization on stratified sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Guillaume Olikier, Kyle A. Gallivan, P.-A. Absil","submitted_at":"2023-03-28T15:16:11Z","abstract_excerpt":"We consider the problem of minimizing a differentiable function with locally Lipschitz continuous gradient on a stratified set and present a first-order algorithm designed to find a stationary point of that problem. Our assumptions on the stratified set are satisfied notably by the determinantal variety (i.e., matrices of bounded rank), its intersection with the cone of positive-semidefinite matrices, and the set of nonnegative sparse vectors. The iteration map of the proposed algorithm applies a step of projected-projected gradient descent with backtracking line search, as proposed by Schneid"},"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":"2303.16040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-28T15:16:11Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"c32a097a91b9259b0ffb849f693bc42ec0386d1a61e62398fe56a8cba2628d1c","abstract_canon_sha256":"1918331107000a9f535723d194ff3344ce9d05f535e414893821e1716e7475d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:31.110990Z","signature_b64":"6vdoMCMNSSlWHkDS17HntZZ7SYzUsoXf3X480cEZD1y9Od89fTF9Ix3Nqk4v6JY9c8CrsGTx7t11o5hWXL7ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef32ce72c1d473d513259a70bb4d19b01643d380c5da6c7eeebcd954b976e0f9","last_reissued_at":"2026-07-05T05:55:31.110522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:31.110522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-order optimization on stratified sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Guillaume Olikier, Kyle A. Gallivan, P.-A. Absil","submitted_at":"2023-03-28T15:16:11Z","abstract_excerpt":"We consider the problem of minimizing a differentiable function with locally Lipschitz continuous gradient on a stratified set and present a first-order algorithm designed to find a stationary point of that problem. Our assumptions on the stratified set are satisfied notably by the determinantal variety (i.e., matrices of bounded rank), its intersection with the cone of positive-semidefinite matrices, and the set of nonnegative sparse vectors. The iteration map of the proposed algorithm applies a step of projected-projected gradient descent with backtracking line search, as proposed by Schneid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16040","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/2303.16040/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":"2303.16040","created_at":"2026-07-05T05:55:31.110580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16040v1","created_at":"2026-07-05T05:55:31.110580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16040","created_at":"2026-07-05T05:55:31.110580+00:00"},{"alias_kind":"pith_short_12","alias_value":"54ZM44WB2RZ5","created_at":"2026-07-05T05:55:31.110580+00:00"},{"alias_kind":"pith_short_16","alias_value":"54ZM44WB2RZ5KEZF","created_at":"2026-07-05T05:55:31.110580+00:00"},{"alias_kind":"pith_short_8","alias_value":"54ZM44WB","created_at":"2026-07-05T05:55:31.110580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.04523","citing_title":"First-order methods on bounded-rank tensors converging to stationary points","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA","json":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA.json","graph_json":"https://pith.science/api/pith-number/54ZM44WB2RZ5KEZFTJYLWTIZWA/graph.json","events_json":"https://pith.science/api/pith-number/54ZM44WB2RZ5KEZFTJYLWTIZWA/events.json","paper":"https://pith.science/paper/54ZM44WB"},"agent_actions":{"view_html":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA","download_json":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA.json","view_paper":"https://pith.science/paper/54ZM44WB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16040&json=true","fetch_graph":"https://pith.science/api/pith-number/54ZM44WB2RZ5KEZFTJYLWTIZWA/graph.json","fetch_events":"https://pith.science/api/pith-number/54ZM44WB2RZ5KEZFTJYLWTIZWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA/action/storage_attestation","attest_author":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA/action/author_attestation","sign_citation":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA/action/citation_signature","submit_replication":"https://pith.science/pith/54ZM44WB2RZ5KEZFTJYLWTIZWA/action/replication_record"}},"created_at":"2026-07-05T05:55:31.110580+00:00","updated_at":"2026-07-05T05:55:31.110580+00:00"}