{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:B5MWPAVDZ6JBJ4TRGNFPRBODI5","short_pith_number":"pith:B5MWPAVD","canonical_record":{"source":{"id":"2211.09873","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-17T20:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"f0ee0029a119fd1fa6490329de7f9c9ec24e8d113a1079dde2c39a8cb62cf8cd","abstract_canon_sha256":"f0940bdfcf6e818daa27a9bd131964eaa2e336b335c70d88a3e9e55da0b89ac1"},"schema_version":"1.0"},"canonical_sha256":"0f596782a3cf9214f271334af885c347562a2a779aaac668d80bd3562ef3c1b8","source":{"kind":"arxiv","id":"2211.09873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.09873","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"2211.09873v1","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09873","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"B5MWPAVDZ6JB","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_16","alias_value":"B5MWPAVDZ6JBJ4TR","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_8","alias_value":"B5MWPAVD","created_at":"2026-07-05T05:17:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:B5MWPAVDZ6JBJ4TRGNFPRBODI5","target":"record","payload":{"canonical_record":{"source":{"id":"2211.09873","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-17T20:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"f0ee0029a119fd1fa6490329de7f9c9ec24e8d113a1079dde2c39a8cb62cf8cd","abstract_canon_sha256":"f0940bdfcf6e818daa27a9bd131964eaa2e336b335c70d88a3e9e55da0b89ac1"},"schema_version":"1.0"},"canonical_sha256":"0f596782a3cf9214f271334af885c347562a2a779aaac668d80bd3562ef3c1b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:15.037460Z","signature_b64":"q4PIppcW3elkIzSnY8HdQzv9rZJC7YL95m4o5r5deiI1V/bc+COgJFkg4EJD/v99CDkTyH1Ift4WeEl8zgZzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f596782a3cf9214f271334af885c347562a2a779aaac668d80bd3562ef3c1b8","last_reissued_at":"2026-07-05T05:17:15.036977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:15.036977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.09873","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-07-05T05:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPGVoADs/0RVwZmLUISZH0shrjvx6K1QUBfEX/TByFqbxNMhRGkL6YwdtszAXKixevJjkujQmhuOAKs+uhETBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T02:20:00.263183Z"},"content_sha256":"6b5ec15ef421276c3454128d4bfb07ff3bf9147da6be63e8f1974572de767d3f","schema_version":"1.0","event_id":"sha256:6b5ec15ef421276c3454128d4bfb07ff3bf9147da6be63e8f1974572de767d3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:B5MWPAVDZ6JBJ4TRGNFPRBODI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomised subspace methods for non-convex optimization, with applications to nonlinear least-squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Jaroslav Fowkes, Zhen Shao","submitted_at":"2022-11-17T20:24:48Z","abstract_excerpt":"We propose a general random subspace framework for unconstrained nonconvex optimization problems that requires a weak probabilistic assumption on the subspace gradient, which we show to be satisfied by various random matrix ensembles, such as Gaussian and sparse sketching, using Johnson-Lindenstrauss embedding properties. We show that, when safeguarded with trust region or quadratic regularization, this random subspace approach satisfies, with high probability, a complexity bound of order $\\mathcal{O}(\\epsilon^{-2})$ to drive the (full) gradient below $\\epsilon$; matching in the accuracy order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09873","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/2211.09873/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-05T05:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLlhiLvMRtiN6+dZwqlT60Civ8iATQEg4XC2gcukoBCUOZOYncbQOrPKysM4WGWhHlJfIoykXV7idy80NcYfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T02:20:00.263568Z"},"content_sha256":"85afb453b9169846b38d894318306c844bb82f9ca456564af17f6775e57367cc","schema_version":"1.0","event_id":"sha256:85afb453b9169846b38d894318306c844bb82f9ca456564af17f6775e57367cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/bundle.json","state_url":"https://pith.science/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/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-21T02:20:00Z","links":{"resolver":"https://pith.science/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5","bundle":"https://pith.science/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/bundle.json","state":"https://pith.science/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5MWPAVDZ6JBJ4TRGNFPRBODI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B5MWPAVDZ6JBJ4TRGNFPRBODI5","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":"f0940bdfcf6e818daa27a9bd131964eaa2e336b335c70d88a3e9e55da0b89ac1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-17T20:24:48Z","title_canon_sha256":"f0ee0029a119fd1fa6490329de7f9c9ec24e8d113a1079dde2c39a8cb62cf8cd"},"schema_version":"1.0","source":{"id":"2211.09873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.09873","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"2211.09873v1","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09873","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"B5MWPAVDZ6JB","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_16","alias_value":"B5MWPAVDZ6JBJ4TR","created_at":"2026-07-05T05:17:15Z"},{"alias_kind":"pith_short_8","alias_value":"B5MWPAVD","created_at":"2026-07-05T05:17:15Z"}],"graph_snapshots":[{"event_id":"sha256:85afb453b9169846b38d894318306c844bb82f9ca456564af17f6775e57367cc","target":"graph","created_at":"2026-07-05T05:17:15Z","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/2211.09873/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a general random subspace framework for unconstrained nonconvex optimization problems that requires a weak probabilistic assumption on the subspace gradient, which we show to be satisfied by various random matrix ensembles, such as Gaussian and sparse sketching, using Johnson-Lindenstrauss embedding properties. We show that, when safeguarded with trust region or quadratic regularization, this random subspace approach satisfies, with high probability, a complexity bound of order $\\mathcal{O}(\\epsilon^{-2})$ to drive the (full) gradient below $\\epsilon$; matching in the accuracy order","authors_text":"Coralia Cartis, Jaroslav Fowkes, Zhen Shao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-17T20:24:48Z","title":"Randomised subspace methods for non-convex optimization, with applications to nonlinear least-squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09873","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:6b5ec15ef421276c3454128d4bfb07ff3bf9147da6be63e8f1974572de767d3f","target":"record","created_at":"2026-07-05T05:17:15Z","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":"f0940bdfcf6e818daa27a9bd131964eaa2e336b335c70d88a3e9e55da0b89ac1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-17T20:24:48Z","title_canon_sha256":"f0ee0029a119fd1fa6490329de7f9c9ec24e8d113a1079dde2c39a8cb62cf8cd"},"schema_version":"1.0","source":{"id":"2211.09873","kind":"arxiv","version":1}},"canonical_sha256":"0f596782a3cf9214f271334af885c347562a2a779aaac668d80bd3562ef3c1b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f596782a3cf9214f271334af885c347562a2a779aaac668d80bd3562ef3c1b8","first_computed_at":"2026-07-05T05:17:15.036977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:15.036977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4PIppcW3elkIzSnY8HdQzv9rZJC7YL95m4o5r5deiI1V/bc+COgJFkg4EJD/v99CDkTyH1Ift4WeEl8zgZzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:15.037460Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.09873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b5ec15ef421276c3454128d4bfb07ff3bf9147da6be63e8f1974572de767d3f","sha256:85afb453b9169846b38d894318306c844bb82f9ca456564af17f6775e57367cc"],"state_sha256":"9cc41eb7eab606857f104a6c82951c5abc60400446c020bf85faed407c2ab4cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4YxL0yeA6YK0NE7oqz8k9a9Co4y/UQ7JW+pqOMkBd3bzKOpju4/+mRPAcdM+9AUMSrFeYJTyx8AJiBPMdfGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T02:20:00.265867Z","bundle_sha256":"31647bd533e84ee864a1ed0fb6202285e52004bc8a000553f660e7d6918e1994"}}