{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FCGCXO2QKVZLMH3MUQKXSS6ENL","short_pith_number":"pith:FCGCXO2Q","canonical_record":{"source":{"id":"1802.01062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-04T02:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"a72a3db25ae4c792756e6d722e6d0d5c108bb39973d66056e177f781129d732c","abstract_canon_sha256":"bdf4e0622822c1133897b4fe05995fcb7d32c3bbe8a2f5c50c4620c14de765cc"},"schema_version":"1.0"},"canonical_sha256":"288c2bbb505572b61f6ca415794bc46ae2e916233bb4af7357ec3e2d325bf417","source":{"kind":"arxiv","id":"1802.01062","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01062","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01062v2","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01062","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"FCGCXO2QKVZL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCGCXO2QKVZLMH3M","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCGCXO2Q","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FCGCXO2QKVZLMH3MUQKXSS6ENL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-04T02:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"a72a3db25ae4c792756e6d722e6d0d5c108bb39973d66056e177f781129d732c","abstract_canon_sha256":"bdf4e0622822c1133897b4fe05995fcb7d32c3bbe8a2f5c50c4620c14de765cc"},"schema_version":"1.0"},"canonical_sha256":"288c2bbb505572b61f6ca415794bc46ae2e916233bb4af7357ec3e2d325bf417","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:21.891434Z","signature_b64":"suaiqgp1u2ZBUdxkpHzOKeU81aK9XaZCE4IlPlLmHy9yszJtZsV3aCbIKW5oys0hagx6XlWFH8PuBY7QTa9GBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288c2bbb505572b61f6ca415794bc46ae2e916233bb4af7357ec3e2d325bf417","last_reissued_at":"2026-05-18T00:07:21.890708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:21.890708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01062","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-05-18T00:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pT66D+tL+ZbmWxbysG8iblG7dSNULHAbM4Bq3kYnx7YDEthDhaXFgc+7Plo1RRP/+i7JGLKh3YHYO0dhG6ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:37:03.202906Z"},"content_sha256":"c79668bfd986f63aa3ef16e1b0faf5376dedee8b60099062c0606ea1f38e7aaf","schema_version":"1.0","event_id":"sha256:c79668bfd986f63aa3ef16e1b0faf5376dedee8b60099062c0606ea1f38e7aaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FCGCXO2QKVZLMH3MUQKXSS6ENL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis","submitted_at":"2018-02-04T02:31:56Z","abstract_excerpt":"A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems. Contemporary analyses characterize worst-case performance by providing, under certain assumptions on an objective function, an upper bound on the number of iterations (or function or derivative evaluations) required until a pth-order stationarity condition is approximately satisfied. This arguably leads to conservative characterizations based on anomalous objectives rather than on ones that are typically encountered in practice. By contrast, the strategy propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01062","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":""},"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-05-18T00:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg6fuinPE1oBHi7SZKu3Ea2WmlQvU8jlt3sgnzg2bePxcyffceupeHuO4lrVlPwcTxXzYYfdXaWbL5Q3QeeTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:37:03.203246Z"},"content_sha256":"bed3ed57252256a5202a850744626d72182b7c56466e444d60abf62a815074bb","schema_version":"1.0","event_id":"sha256:bed3ed57252256a5202a850744626d72182b7c56466e444d60abf62a815074bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/bundle.json","state_url":"https://pith.science/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/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-06-03T14:37:03Z","links":{"resolver":"https://pith.science/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL","bundle":"https://pith.science/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/bundle.json","state":"https://pith.science/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCGCXO2QKVZLMH3MUQKXSS6ENL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FCGCXO2QKVZLMH3MUQKXSS6ENL","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":"bdf4e0622822c1133897b4fe05995fcb7d32c3bbe8a2f5c50c4620c14de765cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-04T02:31:56Z","title_canon_sha256":"a72a3db25ae4c792756e6d722e6d0d5c108bb39973d66056e177f781129d732c"},"schema_version":"1.0","source":{"id":"1802.01062","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01062","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01062v2","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01062","created_at":"2026-05-18T00:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"FCGCXO2QKVZL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCGCXO2QKVZLMH3M","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCGCXO2Q","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:bed3ed57252256a5202a850744626d72182b7c56466e444d60abf62a815074bb","target":"graph","created_at":"2026-05-18T00:07:21Z","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"},"paper":{"abstract_excerpt":"A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems. Contemporary analyses characterize worst-case performance by providing, under certain assumptions on an objective function, an upper bound on the number of iterations (or function or derivative evaluations) required until a pth-order stationarity condition is approximately satisfied. This arguably leads to conservative characterizations based on anomalous objectives rather than on ones that are typically encountered in practice. By contrast, the strategy propos","authors_text":"Daniel P. Robinson, Frank E. Curtis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-04T02:31:56Z","title":"Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01062","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:c79668bfd986f63aa3ef16e1b0faf5376dedee8b60099062c0606ea1f38e7aaf","target":"record","created_at":"2026-05-18T00:07:21Z","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":"bdf4e0622822c1133897b4fe05995fcb7d32c3bbe8a2f5c50c4620c14de765cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-04T02:31:56Z","title_canon_sha256":"a72a3db25ae4c792756e6d722e6d0d5c108bb39973d66056e177f781129d732c"},"schema_version":"1.0","source":{"id":"1802.01062","kind":"arxiv","version":2}},"canonical_sha256":"288c2bbb505572b61f6ca415794bc46ae2e916233bb4af7357ec3e2d325bf417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"288c2bbb505572b61f6ca415794bc46ae2e916233bb4af7357ec3e2d325bf417","first_computed_at":"2026-05-18T00:07:21.890708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:21.890708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"suaiqgp1u2ZBUdxkpHzOKeU81aK9XaZCE4IlPlLmHy9yszJtZsV3aCbIKW5oys0hagx6XlWFH8PuBY7QTa9GBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:21.891434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01062","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c79668bfd986f63aa3ef16e1b0faf5376dedee8b60099062c0606ea1f38e7aaf","sha256:bed3ed57252256a5202a850744626d72182b7c56466e444d60abf62a815074bb"],"state_sha256":"1c95c819df59ad528762680e96c8842d7d42c3184bd11b325038e12758ba0312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kTIc+MSfG1BzaCLftERaz5ru18PF+PyRnGVl4aYrfk6Qv4K1Ci3dYEFYHIPeXjkDMmhnoYEX1OpC6gc6F14BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:37:03.205205Z","bundle_sha256":"23c809b8937a057e1d091e9e91ff66f9fb455af5d3131556b5b08dd82f8fa263"}}