{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SAZCJNOZ37NEKDBNB6LAV676C4","short_pith_number":"pith:SAZCJNOZ","schema_version":"1.0","canonical_sha256":"903224b5d9dfda450c2d0f960afbfe1705ae7987b28d8e58c8c272628c93067c","source":{"kind":"arxiv","id":"2002.08907","version":5},"attestation_state":"computed","paper":{"title":"Second-order Conditional Gradient Sliding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alejandro Carderera, Sebastian Pokutta","submitted_at":"2020-02-20T17:52:18Z","abstract_excerpt":"Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained quadratic subproblem at every iteration. We present the \\emph{Second-Order Conditional Gradient Sliding} (SOCGS) algorithm, which uses a projection-free algorithm to solve the constrained quadratic subproblems inexactly. When the feasible region is a polytope the algorithm converges quadratically in primal gap after a finite number of linearly convergent iterations."},"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":"2002.08907","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-20T17:52:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d8f06cf3555d2a908fe725ba971a472201a81d6270273ee0b4a4bb4d0fd10b75","abstract_canon_sha256":"d29232fcc10b49d9be234d229d036161608eee21df60c998b76951b27d6e9299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:00.536390Z","signature_b64":"p1aMoFU3OsQrDpPYwLdE4uoy9UP6qyjQWHPzGsh7E6pSQ8js3C+HXYUZLN4ofjqG8YbV9l9apf9CPAgfe0AfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903224b5d9dfda450c2d0f960afbfe1705ae7987b28d8e58c8c272628c93067c","last_reissued_at":"2026-07-05T11:20:00.535984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:00.535984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-order Conditional Gradient Sliding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alejandro Carderera, Sebastian Pokutta","submitted_at":"2020-02-20T17:52:18Z","abstract_excerpt":"Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained quadratic subproblem at every iteration. We present the \\emph{Second-Order Conditional Gradient Sliding} (SOCGS) algorithm, which uses a projection-free algorithm to solve the constrained quadratic subproblems inexactly. When the feasible region is a polytope the algorithm converges quadratically in primal gap after a finite number of linearly convergent iterations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08907","kind":"arxiv","version":5},"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/2002.08907/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":"2002.08907","created_at":"2026-07-05T11:20:00.536040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.08907v5","created_at":"2026-07-05T11:20:00.536040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08907","created_at":"2026-07-05T11:20:00.536040+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAZCJNOZ37NE","created_at":"2026-07-05T11:20:00.536040+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAZCJNOZ37NEKDBN","created_at":"2026-07-05T11:20:00.536040+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAZCJNOZ","created_at":"2026-07-05T11:20:00.536040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4","json":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4.json","graph_json":"https://pith.science/api/pith-number/SAZCJNOZ37NEKDBNB6LAV676C4/graph.json","events_json":"https://pith.science/api/pith-number/SAZCJNOZ37NEKDBNB6LAV676C4/events.json","paper":"https://pith.science/paper/SAZCJNOZ"},"agent_actions":{"view_html":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4","download_json":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4.json","view_paper":"https://pith.science/paper/SAZCJNOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.08907&json=true","fetch_graph":"https://pith.science/api/pith-number/SAZCJNOZ37NEKDBNB6LAV676C4/graph.json","fetch_events":"https://pith.science/api/pith-number/SAZCJNOZ37NEKDBNB6LAV676C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4/action/storage_attestation","attest_author":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4/action/author_attestation","sign_citation":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4/action/citation_signature","submit_replication":"https://pith.science/pith/SAZCJNOZ37NEKDBNB6LAV676C4/action/replication_record"}},"created_at":"2026-07-05T11:20:00.536040+00:00","updated_at":"2026-07-05T11:20:00.536040+00:00"}