{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PYV34C4QU4TRCGZODXDN4NDQOS","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":"3b8b368aa9e837514d98eb4d1f478b647fcb7fdae4cef011f23c0d06ffda1cc3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-08T20:56:40Z","title_canon_sha256":"c99a165ee408a4eddd134727c513ab63826c81ce0bbe62d3c181d7ba983515f9"},"schema_version":"1.0","source":{"id":"2004.04250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.04250","created_at":"2026-07-05T00:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"2004.04250v1","created_at":"2026-07-05T00:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04250","created_at":"2026-07-05T00:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"PYV34C4QU4TR","created_at":"2026-07-05T00:54:06Z"},{"alias_kind":"pith_short_16","alias_value":"PYV34C4QU4TRCGZO","created_at":"2026-07-05T00:54:06Z"},{"alias_kind":"pith_short_8","alias_value":"PYV34C4Q","created_at":"2026-07-05T00:54:06Z"}],"graph_snapshots":[{"event_id":"sha256:475cfef2f9895e6c7b1494a7ddbd3e79c5203738ba857aafaa2a195b5cd4d1a3","target":"graph","created_at":"2026-07-05T00:54:06Z","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/2004.04250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haotian Jiang, Sam Chiu-wai Wong, Yin Tat Lee, Zhao Song","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-08T20:56:40Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04250","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:3ee910aa2dafd10208f6993aa04b6a815175b52dafe09aabd2de7fba5c7f6d9b","target":"record","created_at":"2026-07-05T00:54:06Z","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":"3b8b368aa9e837514d98eb4d1f478b647fcb7fdae4cef011f23c0d06ffda1cc3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-08T20:56:40Z","title_canon_sha256":"c99a165ee408a4eddd134727c513ab63826c81ce0bbe62d3c181d7ba983515f9"},"schema_version":"1.0","source":{"id":"2004.04250","kind":"arxiv","version":1}},"canonical_sha256":"7e2bbe0b90a727111b2e1dc6de34707491fb1cac8f20bb687332a87dcfe34964","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e2bbe0b90a727111b2e1dc6de34707491fb1cac8f20bb687332a87dcfe34964","first_computed_at":"2026-07-05T00:54:06.084706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:06.084706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSwdbANSdxu+seYUERC/3V88ohbKG2wpD/5o/PmpWaOH6eKraG6vY7/K+WLcLjc2muTamvTUlwLfeWoINTYjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:06.085180Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.04250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ee910aa2dafd10208f6993aa04b6a815175b52dafe09aabd2de7fba5c7f6d9b","sha256:475cfef2f9895e6c7b1494a7ddbd3e79c5203738ba857aafaa2a195b5cd4d1a3"],"state_sha256":"0618396d3adef0f3df85723dec70a698203080c8e7e758ab6cd56513b9878b86"}