{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G3YCP4BVU7OGOJSGEBDIPU3N4Z","short_pith_number":"pith:G3YCP4BV","canonical_record":{"source":{"id":"1705.04895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-13T23:05:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f6f6b8fe5dd578c1abe8ca31c516b97de6f416b1f25bfbdb27473b4792ec384f","abstract_canon_sha256":"d817335078fccddf038733e98a3d2ff0ce14958bc549d0bc477eee3d207c2964"},"schema_version":"1.0"},"canonical_sha256":"36f027f035a7dc672646204687d36de67ed48bb50900f099e2bb5d8926ca57db","source":{"kind":"arxiv","id":"1705.04895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04895","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04895v1","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04895","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"G3YCP4BVU7OG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3YCP4BVU7OGOJSG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3YCP4BV","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G3YCP4BVU7OGOJSGEBDIPU3N4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-13T23:05:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f6f6b8fe5dd578c1abe8ca31c516b97de6f416b1f25bfbdb27473b4792ec384f","abstract_canon_sha256":"d817335078fccddf038733e98a3d2ff0ce14958bc549d0bc477eee3d207c2964"},"schema_version":"1.0"},"canonical_sha256":"36f027f035a7dc672646204687d36de67ed48bb50900f099e2bb5d8926ca57db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:37.178133Z","signature_b64":"auX28FkpbOjH5ylG4GiAKh8mCCcbnVJjAyQSdmXVA357sGWVrJPbKhmeP779OzlK/q4FUkqVl98dtbntKXkpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f027f035a7dc672646204687d36de67ed48bb50900f099e2bb5d8926ca57db","last_reissued_at":"2026-05-18T00:34:37.177681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:37.177681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04895","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-05-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S58tKc5kC63EC/djEBfWCzTyQ1KzS2HBcvRqUG9lZJVeoh9+ehIRUdh4a4HyPNXuu+tXW+0FthuH9IO4uiGwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:21:41.153702Z"},"content_sha256":"7bb5b1d70ffb334c60793f21fe5a9d511137f2f0b6e2806ed31a0ba794292057","schema_version":"1.0","event_id":"sha256:7bb5b1d70ffb334c60793f21fe5a9d511137f2f0b6e2806ed31a0ba794292057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G3YCP4BVU7OGOJSGEBDIPU3N4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $\\chi$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nick Gould, Philippe L Toint","submitted_at":"2017-05-13T23:05:32Z","abstract_excerpt":"Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of $O(\\epsilon^{-3/2})$ proved by Cartis, Gould and Toint (IMAJNA 32(4) 2012, pp.1662-1695) for computing an $\\epsilon$-approximate first-order critical point can be obtained under significantly weaker assumptions. Moreover, the result is generalized to the case where high-order derivatives are used, resulting in a bound of $O(\\epsilon^{-(p+1)/p})$ evaluations whenever derivatives of order $p$ are available. It is also shown that the bound of $O(\\epsilon_P^{-1/2}\\epsilon_D^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04895","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":""},"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:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQkDfBbOps0ryWQwjPLHDeCISBf9s6qTY6M1p0GwZeTI2UBuVrGDAr+9JoxLl6m383hJ2TwCA11diOlqTThIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:21:41.154048Z"},"content_sha256":"41b79e1d27fe0fc063a224d48c3bd976035126b520b890beb6d9c5d236074419","schema_version":"1.0","event_id":"sha256:41b79e1d27fe0fc063a224d48c3bd976035126b520b890beb6d9c5d236074419"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/bundle.json","state_url":"https://pith.science/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/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-04T13:21:41Z","links":{"resolver":"https://pith.science/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z","bundle":"https://pith.science/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/bundle.json","state":"https://pith.science/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3YCP4BVU7OGOJSGEBDIPU3N4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G3YCP4BVU7OGOJSGEBDIPU3N4Z","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":"d817335078fccddf038733e98a3d2ff0ce14958bc549d0bc477eee3d207c2964","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-13T23:05:32Z","title_canon_sha256":"f6f6b8fe5dd578c1abe8ca31c516b97de6f416b1f25bfbdb27473b4792ec384f"},"schema_version":"1.0","source":{"id":"1705.04895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04895","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04895v1","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04895","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"G3YCP4BVU7OG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3YCP4BVU7OGOJSG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3YCP4BV","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:41b79e1d27fe0fc063a224d48c3bd976035126b520b890beb6d9c5d236074419","target":"graph","created_at":"2026-05-18T00:34:37Z","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":"Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of $O(\\epsilon^{-3/2})$ proved by Cartis, Gould and Toint (IMAJNA 32(4) 2012, pp.1662-1695) for computing an $\\epsilon$-approximate first-order critical point can be obtained under significantly weaker assumptions. Moreover, the result is generalized to the case where high-order derivatives are used, resulting in a bound of $O(\\epsilon^{-(p+1)/p})$ evaluations whenever derivatives of order $p$ are available. It is also shown that the bound of $O(\\epsilon_P^{-1/2}\\epsilon_D^","authors_text":"Coralia Cartis, Nick Gould, Philippe L Toint","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-13T23:05:32Z","title":"Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $\\chi$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04895","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:7bb5b1d70ffb334c60793f21fe5a9d511137f2f0b6e2806ed31a0ba794292057","target":"record","created_at":"2026-05-18T00:34:37Z","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":"d817335078fccddf038733e98a3d2ff0ce14958bc549d0bc477eee3d207c2964","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-13T23:05:32Z","title_canon_sha256":"f6f6b8fe5dd578c1abe8ca31c516b97de6f416b1f25bfbdb27473b4792ec384f"},"schema_version":"1.0","source":{"id":"1705.04895","kind":"arxiv","version":1}},"canonical_sha256":"36f027f035a7dc672646204687d36de67ed48bb50900f099e2bb5d8926ca57db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36f027f035a7dc672646204687d36de67ed48bb50900f099e2bb5d8926ca57db","first_computed_at":"2026-05-18T00:34:37.177681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:37.177681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auX28FkpbOjH5ylG4GiAKh8mCCcbnVJjAyQSdmXVA357sGWVrJPbKhmeP779OzlK/q4FUkqVl98dtbntKXkpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:37.178133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bb5b1d70ffb334c60793f21fe5a9d511137f2f0b6e2806ed31a0ba794292057","sha256:41b79e1d27fe0fc063a224d48c3bd976035126b520b890beb6d9c5d236074419"],"state_sha256":"097cad75e8f58d124aa6e12516ffeb602d6ea80816251fd1b13f747e6b0c96a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"641QAG7RsamfcDzHEHQqgORfwwwuQmO2EyWN/skAfj/ACB8uGmMGROgEH6BDQQ8U22958l8Shqv8u49BJAFUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:21:41.155967Z","bundle_sha256":"ebb5645a4a3f8825272986dcbe21147c9a8cafb37065dd92e9d86d8f8fe2bdcd"}}