{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PYV34C4QU4TRCGZODXDN4NDQOS","short_pith_number":"pith:PYV34C4Q","schema_version":"1.0","canonical_sha256":"7e2bbe0b90a727111b2e1dc6de34707491fb1cac8f20bb687332a87dcfe34964","source":{"kind":"arxiv","id":"2004.04250","version":1},"attestation_state":"computed","paper":{"title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Sam Chiu-wai Wong, Yin Tat Lee, Zhao Song","submitted_at":"2020-04-08T20:56:40Z","abstract_excerpt":"Given a separation oracle for a convex set $K \\subset \\mathbb{R}^n$ that is contained in a box of radius $R$, the goal is to either compute a point in $K$ or prove that $K$ does not contain a ball of radius $\\epsilon$. We propose a new cutting plane algorithm that uses an optimal $O(n \\log (\\kappa))$ evaluations of the oracle and an additional $O(n^2)$ time per evaluation, where $\\kappa = nR/\\epsilon$.\n  $\\bullet$ This improves upon Vaidya's $O( \\text{SO} \\cdot n \\log (\\kappa) + n^{\\omega+1} \\log (\\kappa))$ time algorithm [Vaidya, FOCS 1989a] in terms of polynomial dependence on $n$, where $\\o"},"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":"2004.04250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-08T20:56:40Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c99a165ee408a4eddd134727c513ab63826c81ce0bbe62d3c181d7ba983515f9","abstract_canon_sha256":"3b8b368aa9e837514d98eb4d1f478b647fcb7fdae4cef011f23c0d06ffda1cc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:06.085180Z","signature_b64":"xSwdbANSdxu+seYUERC/3V88ohbKG2wpD/5o/PmpWaOH6eKraG6vY7/K+WLcLjc2muTamvTUlwLfeWoINTYjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e2bbe0b90a727111b2e1dc6de34707491fb1cac8f20bb687332a87dcfe34964","last_reissued_at":"2026-07-05T00:54:06.084706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:06.084706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Sam Chiu-wai Wong, Yin Tat Lee, Zhao Song","submitted_at":"2020-04-08T20:56:40Z","abstract_excerpt":"Given a separation oracle for a convex set $K \\subset \\mathbb{R}^n$ that is contained in a box of radius $R$, the goal is to either compute a point in $K$ or prove that $K$ does not contain a ball of radius $\\epsilon$. We propose a new cutting plane algorithm that uses an optimal $O(n \\log (\\kappa))$ evaluations of the oracle and an additional $O(n^2)$ time per evaluation, where $\\kappa = nR/\\epsilon$.\n  $\\bullet$ This improves upon Vaidya's $O( \\text{SO} \\cdot n \\log (\\kappa) + n^{\\omega+1} \\log (\\kappa))$ time algorithm [Vaidya, FOCS 1989a] in terms of polynomial dependence on $n$, where $\\o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04250","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/2004.04250/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":"2004.04250","created_at":"2026-07-05T00:54:06.084764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04250v1","created_at":"2026-07-05T00:54:06.084764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04250","created_at":"2026-07-05T00:54:06.084764+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYV34C4QU4TR","created_at":"2026-07-05T00:54:06.084764+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYV34C4QU4TRCGZO","created_at":"2026-07-05T00:54:06.084764+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYV34C4Q","created_at":"2026-07-05T00:54:06.084764+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12441","citing_title":"Numerical Pruning for Efficient Autoregressive Models","ref_index":74,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS","json":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS.json","graph_json":"https://pith.science/api/pith-number/PYV34C4QU4TRCGZODXDN4NDQOS/graph.json","events_json":"https://pith.science/api/pith-number/PYV34C4QU4TRCGZODXDN4NDQOS/events.json","paper":"https://pith.science/paper/PYV34C4Q"},"agent_actions":{"view_html":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS","download_json":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS.json","view_paper":"https://pith.science/paper/PYV34C4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04250&json=true","fetch_graph":"https://pith.science/api/pith-number/PYV34C4QU4TRCGZODXDN4NDQOS/graph.json","fetch_events":"https://pith.science/api/pith-number/PYV34C4QU4TRCGZODXDN4NDQOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS/action/storage_attestation","attest_author":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS/action/author_attestation","sign_citation":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS/action/citation_signature","submit_replication":"https://pith.science/pith/PYV34C4QU4TRCGZODXDN4NDQOS/action/replication_record"}},"created_at":"2026-07-05T00:54:06.084764+00:00","updated_at":"2026-07-05T00:54:06.084764+00:00"}