{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WIWSHSRGVKQ4RXTNT2QZTNA3TX","short_pith_number":"pith:WIWSHSRG","schema_version":"1.0","canonical_sha256":"b22d23ca26aaa1c8de6d9ea199b41b9df7e46e6ddb13418e1580e2d547b4fa92","source":{"kind":"arxiv","id":"2110.01858","version":1},"attestation_state":"computed","paper":{"title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ali Ghodsi, Benyamin Ghojogh, Fakhri Karray, Mark Crowley","submitted_at":"2021-10-05T07:50:37Z","abstract_excerpt":"This is a tutorial and survey paper on Karush-Kuhn-Tucker (KKT) conditions, first-order and second-order numerical optimization, and distributed optimization. After a brief review of history of optimization, we start with some preliminaries on properties of sets, norms, functions, and concepts of optimization. Then, we introduce the optimization problem, standard optimization problems (including linear programming, quadratic programming, and semidefinite programming), and convex problems. We also introduce some techniques such as eliminating inequality, equality, and set constraints, adding sl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2110.01858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-05T07:50:37Z","cross_cats_sorted":["cs.DC","cs.LG","cs.NA","math.NA"],"title_canon_sha256":"827d36176fac5058451bbc94b1a7aee81bc8f42096f06800ae1980753a3fbd04","abstract_canon_sha256":"e54a267a7ec26b7f292a9bcfa78cdb76e0a1c0b12eb28b447a0ac7a8236d7a3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:07.068310Z","signature_b64":"Vt52OAW5vXTjfyMwoc9sUYqOvQeCZ7RCKAxbUiajzHMwl9ydm55Airws8VYdPvNZRoaukYh8v3dKE5dXk5LFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22d23ca26aaa1c8de6d9ea199b41b9df7e46e6ddb13418e1580e2d547b4fa92","last_reissued_at":"2026-07-05T03:20:07.067791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:07.067791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ali Ghodsi, Benyamin Ghojogh, Fakhri Karray, Mark Crowley","submitted_at":"2021-10-05T07:50:37Z","abstract_excerpt":"This is a tutorial and survey paper on Karush-Kuhn-Tucker (KKT) conditions, first-order and second-order numerical optimization, and distributed optimization. After a brief review of history of optimization, we start with some preliminaries on properties of sets, norms, functions, and concepts of optimization. Then, we introduce the optimization problem, standard optimization problems (including linear programming, quadratic programming, and semidefinite programming), and convex problems. We also introduce some techniques such as eliminating inequality, equality, and set constraints, adding sl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01858","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/2110.01858/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2110.01858","created_at":"2026-07-05T03:20:07.067853+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.01858v1","created_at":"2026-07-05T03:20:07.067853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01858","created_at":"2026-07-05T03:20:07.067853+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIWSHSRGVKQ4","created_at":"2026-07-05T03:20:07.067853+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIWSHSRGVKQ4RXTN","created_at":"2026-07-05T03:20:07.067853+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIWSHSRG","created_at":"2026-07-05T03:20:07.067853+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00738","citing_title":"SORA: Free Second-Order Attacks in Fast Adversarial Training","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02279","citing_title":"Foundations of Riemannian Geometry for Riemannian Optimization: A Monograph with Detailed Derivations","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX","json":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX.json","graph_json":"https://pith.science/api/pith-number/WIWSHSRGVKQ4RXTNT2QZTNA3TX/graph.json","events_json":"https://pith.science/api/pith-number/WIWSHSRGVKQ4RXTNT2QZTNA3TX/events.json","paper":"https://pith.science/paper/WIWSHSRG"},"agent_actions":{"view_html":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX","download_json":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX.json","view_paper":"https://pith.science/paper/WIWSHSRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.01858&json=true","fetch_graph":"https://pith.science/api/pith-number/WIWSHSRGVKQ4RXTNT2QZTNA3TX/graph.json","fetch_events":"https://pith.science/api/pith-number/WIWSHSRGVKQ4RXTNT2QZTNA3TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX/action/storage_attestation","attest_author":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX/action/author_attestation","sign_citation":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX/action/citation_signature","submit_replication":"https://pith.science/pith/WIWSHSRGVKQ4RXTNT2QZTNA3TX/action/replication_record"}},"created_at":"2026-07-05T03:20:07.067853+00:00","updated_at":"2026-07-05T03:20:07.067853+00:00"}