{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MWO7MKGNWJKN3MW264FMAHG27F","short_pith_number":"pith:MWO7MKGN","canonical_record":{"source":{"id":"1811.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-03T14:04:35Z","cross_cats_sorted":["cs.AI","cs.CC","cs.NA","math.NA"],"title_canon_sha256":"34bf124a4ca3cebe907fcc7790e0a49f3199c6346997c2bd05bad54ce0901dc4","abstract_canon_sha256":"36803ab6eab5f800e5fdd9a9fa0b712dcbd422ae4bd31f339f41b7012f7fd335"},"schema_version":"1.0"},"canonical_sha256":"659df628cdb254ddb2daf70ac01cdaf94e617e3345b0babf45d6e06341d90dab","source":{"kind":"arxiv","id":"1811.01220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01220","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01220v1","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01220","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"MWO7MKGNWJKN","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_16","alias_value":"MWO7MKGNWJKN3MW2","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_8","alias_value":"MWO7MKGN","created_at":"2026-06-04T20:13:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MWO7MKGNWJKN3MW264FMAHG27F","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-03T14:04:35Z","cross_cats_sorted":["cs.AI","cs.CC","cs.NA","math.NA"],"title_canon_sha256":"34bf124a4ca3cebe907fcc7790e0a49f3199c6346997c2bd05bad54ce0901dc4","abstract_canon_sha256":"36803ab6eab5f800e5fdd9a9fa0b712dcbd422ae4bd31f339f41b7012f7fd335"},"schema_version":"1.0"},"canonical_sha256":"659df628cdb254ddb2daf70ac01cdaf94e617e3345b0babf45d6e06341d90dab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:39.339484Z","signature_b64":"10QwJAhk4p5bGPs7uXin8vByUW0L0i1vy7dOCorTx9Z2h9Eep2lw76MnBv6FrDKMDleNzhWE7lqaNmmgFCUECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659df628cdb254ddb2daf70ac01cdaf94e617e3345b0babf45d6e06341d90dab","last_reissued_at":"2026-06-04T20:13:39.339038Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:39.339038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01220","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-06-04T20:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B72N++kx1nrzzRD6Aw3TnctpwfkEe9g6GIbO+az9rf7rQgW26tju3GIra8f7PW6QjzJlqtBqgRrteqUf6YjGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:16:32.122007Z"},"content_sha256":"5797c009b06bf0db620ff06d7420dfc48ea6fb652a66ec7372d3d0fc11659ae1","schema_version":"1.0","event_id":"sha256:5797c009b06bf0db620ff06d7420dfc48ea6fb652a66ec7372d3d0fc11659ae1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MWO7MKGNWJKN3MW264FMAHG27F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nick I. M. Gould, Philippe L. Toint","submitted_at":"2018-11-03T14:04:35Z","abstract_excerpt":"We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, is negligible compared to that of evaluating the objective function. These bounds unify, extend or improve all known upper and lower complexity bounds for unconstrained and convexly-constrained problems. It is shown that, given an accuracy level $\\epsilon$, a degree of highest available Lipschitz continuous derivatives $p$ and a desired optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01220","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/1811.01220/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-06-04T20:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpU8tu9XgLV4DzGK+JS31rxcL1S3NQL03I64YeBwjHxBY8XR/7N1gJF62P7ubx2A3JHfTmVbK+UiFF9m3hYEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:16:32.122415Z"},"content_sha256":"d0bfec94d00b10912cfd7e876591678ac6e437928e6a0ac95f10e0fe7c44a19d","schema_version":"1.0","event_id":"sha256:d0bfec94d00b10912cfd7e876591678ac6e437928e6a0ac95f10e0fe7c44a19d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWO7MKGNWJKN3MW264FMAHG27F/bundle.json","state_url":"https://pith.science/pith/MWO7MKGNWJKN3MW264FMAHG27F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWO7MKGNWJKN3MW264FMAHG27F/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-04T10:16:32Z","links":{"resolver":"https://pith.science/pith/MWO7MKGNWJKN3MW264FMAHG27F","bundle":"https://pith.science/pith/MWO7MKGNWJKN3MW264FMAHG27F/bundle.json","state":"https://pith.science/pith/MWO7MKGNWJKN3MW264FMAHG27F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWO7MKGNWJKN3MW264FMAHG27F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MWO7MKGNWJKN3MW264FMAHG27F","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":"36803ab6eab5f800e5fdd9a9fa0b712dcbd422ae4bd31f339f41b7012f7fd335","cross_cats_sorted":["cs.AI","cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-03T14:04:35Z","title_canon_sha256":"34bf124a4ca3cebe907fcc7790e0a49f3199c6346997c2bd05bad54ce0901dc4"},"schema_version":"1.0","source":{"id":"1811.01220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01220","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01220v1","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01220","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"MWO7MKGNWJKN","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_16","alias_value":"MWO7MKGNWJKN3MW2","created_at":"2026-06-04T20:13:39Z"},{"alias_kind":"pith_short_8","alias_value":"MWO7MKGN","created_at":"2026-06-04T20:13:39Z"}],"graph_snapshots":[{"event_id":"sha256:d0bfec94d00b10912cfd7e876591678ac6e437928e6a0ac95f10e0fe7c44a19d","target":"graph","created_at":"2026-06-04T20:13:39Z","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/1811.01220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, is negligible compared to that of evaluating the objective function. These bounds unify, extend or improve all known upper and lower complexity bounds for unconstrained and convexly-constrained problems. It is shown that, given an accuracy level $\\epsilon$, a degree of highest available Lipschitz continuous derivatives $p$ and a desired optima","authors_text":"Coralia Cartis, Nick I. M. Gould, Philippe L. Toint","cross_cats":["cs.AI","cs.CC","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-03T14:04:35Z","title":"Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01220","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:5797c009b06bf0db620ff06d7420dfc48ea6fb652a66ec7372d3d0fc11659ae1","target":"record","created_at":"2026-06-04T20:13:39Z","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":"36803ab6eab5f800e5fdd9a9fa0b712dcbd422ae4bd31f339f41b7012f7fd335","cross_cats_sorted":["cs.AI","cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-03T14:04:35Z","title_canon_sha256":"34bf124a4ca3cebe907fcc7790e0a49f3199c6346997c2bd05bad54ce0901dc4"},"schema_version":"1.0","source":{"id":"1811.01220","kind":"arxiv","version":1}},"canonical_sha256":"659df628cdb254ddb2daf70ac01cdaf94e617e3345b0babf45d6e06341d90dab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659df628cdb254ddb2daf70ac01cdaf94e617e3345b0babf45d6e06341d90dab","first_computed_at":"2026-06-04T20:13:39.339038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:39.339038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"10QwJAhk4p5bGPs7uXin8vByUW0L0i1vy7dOCorTx9Z2h9Eep2lw76MnBv6FrDKMDleNzhWE7lqaNmmgFCUECw==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:39.339484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5797c009b06bf0db620ff06d7420dfc48ea6fb652a66ec7372d3d0fc11659ae1","sha256:d0bfec94d00b10912cfd7e876591678ac6e437928e6a0ac95f10e0fe7c44a19d"],"state_sha256":"56c3351160c23d5dc1f75675b6b956a750079da32f9be2a465e6a87ee86fbdf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFFLiAqIr/aMzFCHZnJZDHOOgByrDCOc76EJ8OXQicqEVaPozvfDA1q619L5hkuUOrl9UKRLFNyRtZlV5tMlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:16:32.124402Z","bundle_sha256":"28d6d983760404c978b070fbfb231d68f71e61dea17628635148e0da87802c88"}}