{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IWWJ4YVYKTK6BBBFMKM5KX4UZL","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":"d9a499b42d82a30354345241f94246a87fc670b5229865ac21f6fd5cfaa95a47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-29T14:12:33Z","title_canon_sha256":"688b91cc5d246af1279d42c0fef02c4923446f23602f040b5a11bd6bc10098c4"},"schema_version":"1.0","source":{"id":"2404.18724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.18724","created_at":"2026-07-05T08:13:19Z"},{"alias_kind":"arxiv_version","alias_value":"2404.18724v1","created_at":"2026-07-05T08:13:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18724","created_at":"2026-07-05T08:13:19Z"},{"alias_kind":"pith_short_12","alias_value":"IWWJ4YVYKTK6","created_at":"2026-07-05T08:13:19Z"},{"alias_kind":"pith_short_16","alias_value":"IWWJ4YVYKTK6BBBF","created_at":"2026-07-05T08:13:19Z"},{"alias_kind":"pith_short_8","alias_value":"IWWJ4YVY","created_at":"2026-07-05T08:13:19Z"}],"graph_snapshots":[{"event_id":"sha256:12d7c614ba191413a64eb0e7e06993d5e85abc0668f64da5071c974b4728d095","target":"graph","created_at":"2026-07-05T08:13:19Z","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/2404.18724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and second-order methods for non-convex optimization problems with general convex set constraints and linear constraints. Our methods attain a suitably defined class of approximate first- or second-order KKT points with the worst-case iteration complexity similar to unconstrained problems, namely $O(\\varepsilon^{-2})$ (first-order) and $O(\\varepsilon^{-3/2})$ (second-orde","authors_text":"Mathias Staudigl, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-29T14:12:33Z","title":"Barrier Algorithms for Constrained Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18724","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:c40c62fe0975cc691aedf23d55a9ca009311fc5468bb9b535269192413a1e117","target":"record","created_at":"2026-07-05T08:13:19Z","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":"d9a499b42d82a30354345241f94246a87fc670b5229865ac21f6fd5cfaa95a47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-29T14:12:33Z","title_canon_sha256":"688b91cc5d246af1279d42c0fef02c4923446f23602f040b5a11bd6bc10098c4"},"schema_version":"1.0","source":{"id":"2404.18724","kind":"arxiv","version":1}},"canonical_sha256":"45ac9e62b854d5e084256299d55f94cad0b393b173dd1d9da10ade5d504014f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45ac9e62b854d5e084256299d55f94cad0b393b173dd1d9da10ade5d504014f8","first_computed_at":"2026-07-05T08:13:19.868285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:13:19.868285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmdONRjD6bNeTNyUU+3d292bG9Vyt7jEc5efnNJozE2rlrF/o2e8AjA565xn7IDkK5FT9x5tWEk92NiaeLqJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:13:19.868700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.18724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c40c62fe0975cc691aedf23d55a9ca009311fc5468bb9b535269192413a1e117","sha256:12d7c614ba191413a64eb0e7e06993d5e85abc0668f64da5071c974b4728d095"],"state_sha256":"2b033491a13b737539b8834700e81a1602ba916c6a10f3112d36d4d9e3b21587"}