{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q5IC7JPPGNRXCODQ4J5FV53RKP","short_pith_number":"pith:Q5IC7JPP","canonical_record":{"source":{"id":"2607.24122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-27T08:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"efec5cdb9b7adcff9043af81bd82afe01af919aacc298a695f1e119be43090c7","abstract_canon_sha256":"2982a50d0119978f22118fc0acd8ba764cd7e3ba27a2e191bf63826435f385f3"},"schema_version":"1.0"},"canonical_sha256":"87502fa5ef3363713870e27a5af77153fed1c46001e26d38d2a59bcafc9dfaf4","source":{"kind":"arxiv","id":"2607.24122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24122","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24122v1","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24122","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"Q5IC7JPPGNRX","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5IC7JPPGNRXCODQ","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5IC7JPP","created_at":"2026-07-28T01:23:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q5IC7JPPGNRXCODQ4J5FV53RKP","target":"record","payload":{"canonical_record":{"source":{"id":"2607.24122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-27T08:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"efec5cdb9b7adcff9043af81bd82afe01af919aacc298a695f1e119be43090c7","abstract_canon_sha256":"2982a50d0119978f22118fc0acd8ba764cd7e3ba27a2e191bf63826435f385f3"},"schema_version":"1.0"},"canonical_sha256":"87502fa5ef3363713870e27a5af77153fed1c46001e26d38d2a59bcafc9dfaf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:46.227556Z","signature_b64":"iNfolvYUFQ0jjTTq29mn15BnT5C2flq/TXEGprNSPGuligVgXCXXew77VjTGYy7y39hnLiO7B2SRzx7XUrDzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87502fa5ef3363713870e27a5af77153fed1c46001e26d38d2a59bcafc9dfaf4","last_reissued_at":"2026-07-28T01:23:46.226708Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:46.226708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.24122","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-28T01:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DXKWGpJUbK3fL7I/6LKgs/yt9p2qGcvfQS/GCg/gW9rT5u0G1WHu4+LBC+RIIlmCmiWRyw2FEOUPNojc/YQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:40:17.640017Z"},"content_sha256":"4c32f53a3c15d403de37cacfaf598ebf54fe4009ccf6d7f8029a089d9f25eaac","schema_version":"1.0","event_id":"sha256:4c32f53a3c15d403de37cacfaf598ebf54fe4009ccf6d7f8029a089d9f25eaac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q5IC7JPPGNRXCODQ4J5FV53RKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jiewen Guan","submitted_at":"2026-07-27T08:01:40Z","abstract_excerpt":"In this paper, we exhibit a randomized first-order algorithm to compute Goldstein approximate second-order stationary points of $L$-smooth functions, using tools from randomized smoothing. The algorithm has oracle complexity $\\widetilde{O}({ n^2}/{\\varepsilon^9}+{ n^3}/{\\varepsilon^7})$, where $n=1,2,\\ldots$ is the input dimension and $\\varepsilon>0$ is the (common) tolerance. We also present extensions to weakly convex functions and applications to bilevel optimization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24122","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/2607.24122/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-28T01:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eqSxMnK+CcRWGkGqoxG1jMI8xP0lOn0Jl+11oSCGQaqYHI5n7AwnALwfTLtTIEDTL673YylDN54WXLMH/F8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:40:17.640350Z"},"content_sha256":"ec1210af03cb0c997e6d253ca7131216da59a94674eaf8a199329f90bf6f5043","schema_version":"1.0","event_id":"sha256:ec1210af03cb0c997e6d253ca7131216da59a94674eaf8a199329f90bf6f5043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/bundle.json","state_url":"https://pith.science/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/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-18T21:40:17Z","links":{"resolver":"https://pith.science/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP","bundle":"https://pith.science/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/bundle.json","state":"https://pith.science/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5IC7JPPGNRXCODQ4J5FV53RKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q5IC7JPPGNRXCODQ4J5FV53RKP","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":"2982a50d0119978f22118fc0acd8ba764cd7e3ba27a2e191bf63826435f385f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-27T08:01:40Z","title_canon_sha256":"efec5cdb9b7adcff9043af81bd82afe01af919aacc298a695f1e119be43090c7"},"schema_version":"1.0","source":{"id":"2607.24122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24122","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24122v1","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24122","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"Q5IC7JPPGNRX","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5IC7JPPGNRXCODQ","created_at":"2026-07-28T01:23:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5IC7JPP","created_at":"2026-07-28T01:23:46Z"}],"graph_snapshots":[{"event_id":"sha256:ec1210af03cb0c997e6d253ca7131216da59a94674eaf8a199329f90bf6f5043","target":"graph","created_at":"2026-07-28T01:23:46Z","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/2607.24122/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we exhibit a randomized first-order algorithm to compute Goldstein approximate second-order stationary points of $L$-smooth functions, using tools from randomized smoothing. The algorithm has oracle complexity $\\widetilde{O}({ n^2}/{\\varepsilon^9}+{ n^3}/{\\varepsilon^7})$, where $n=1,2,\\ldots$ is the input dimension and $\\varepsilon>0$ is the (common) tolerance. We also present extensions to weakly convex functions and applications to bilevel optimization.","authors_text":"Anthony Man-Cho So, Jiewen Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-27T08:01:40Z","title":"On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24122","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:4c32f53a3c15d403de37cacfaf598ebf54fe4009ccf6d7f8029a089d9f25eaac","target":"record","created_at":"2026-07-28T01:23:46Z","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":"2982a50d0119978f22118fc0acd8ba764cd7e3ba27a2e191bf63826435f385f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-27T08:01:40Z","title_canon_sha256":"efec5cdb9b7adcff9043af81bd82afe01af919aacc298a695f1e119be43090c7"},"schema_version":"1.0","source":{"id":"2607.24122","kind":"arxiv","version":1}},"canonical_sha256":"87502fa5ef3363713870e27a5af77153fed1c46001e26d38d2a59bcafc9dfaf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87502fa5ef3363713870e27a5af77153fed1c46001e26d38d2a59bcafc9dfaf4","first_computed_at":"2026-07-28T01:23:46.226708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T01:23:46.226708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iNfolvYUFQ0jjTTq29mn15BnT5C2flq/TXEGprNSPGuligVgXCXXew77VjTGYy7y39hnLiO7B2SRzx7XUrDzAg==","signature_status":"signed_v1","signed_at":"2026-07-28T01:23:46.227556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c32f53a3c15d403de37cacfaf598ebf54fe4009ccf6d7f8029a089d9f25eaac","sha256:ec1210af03cb0c997e6d253ca7131216da59a94674eaf8a199329f90bf6f5043"],"state_sha256":"46eb4d5209db57d7e4e0558e466356e7d069a060922f80891ef88e9b005b4610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tnv+53OGIlmlqrp2lNf1lXvfpuV8Q0evN8OzosqBIuhBTEbvDsfVe72O5BfAabKJCzvgtZio6Kd1tEIDkd74AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T21:40:17.644614Z","bundle_sha256":"770343d5c4d597767db67576b15da0fad1bd1fb93bb83d1011d75853b4f3f96d"}}