{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZUKCYEMOXWECGHLCWMHDIKX7T2","short_pith_number":"pith:ZUKCYEMO","canonical_record":{"source":{"id":"1508.04874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-20T04:44:51Z","cross_cats_sorted":["cs.DM","math.NA","math.OC"],"title_canon_sha256":"7ade500a7cdc098dc6ef8124dcf2c1b6b2fc2adf48e1fd070ee232b7940c4024","abstract_canon_sha256":"cb915615146327322449b87e4ab730517dad6a1d54bc032a6cc9573ccda56c97"},"schema_version":"1.0"},"canonical_sha256":"cd142c118ebd88231d62b30e342aff9eaee0170e1935ef77509d78d59e488310","source":{"kind":"arxiv","id":"1508.04874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04874","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04874v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04874","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZUKCYEMOXWEC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZUKCYEMOXWECGHLC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZUKCYEMO","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZUKCYEMOXWECGHLCWMHDIKX7T2","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-20T04:44:51Z","cross_cats_sorted":["cs.DM","math.NA","math.OC"],"title_canon_sha256":"7ade500a7cdc098dc6ef8124dcf2c1b6b2fc2adf48e1fd070ee232b7940c4024","abstract_canon_sha256":"cb915615146327322449b87e4ab730517dad6a1d54bc032a6cc9573ccda56c97"},"schema_version":"1.0"},"canonical_sha256":"cd142c118ebd88231d62b30e342aff9eaee0170e1935ef77509d78d59e488310","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:45.708185Z","signature_b64":"m1DcL6ihuhxWJZndpn9LqsusOho2zHoqq2BJra7L9fn2AagPRjZ9nf8F4kk621eW+ZpGLUuVBlio6Pg8LMJWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd142c118ebd88231d62b30e342aff9eaee0170e1935ef77509d78d59e488310","last_reissued_at":"2026-05-18T01:27:45.707630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:45.707630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04874","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zhtz6P3EV+8L6vdxxvScQC55PE7W9pu89ZJ4BE7vBSNUgUxIwSBg8Dtc3hoY54ZKtM6MA7Larkwj/hhdDOz5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:53:56.713655Z"},"content_sha256":"ba1631d2a3619b4b423b7929a11a4b11461786fd9a55b80f7d1b3883edc49c40","schema_version":"1.0","event_id":"sha256:ba1631d2a3619b4b423b7929a11a4b11461786fd9a55b80f7d1b3883edc49c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZUKCYEMOXWECGHLCWMHDIKX7T2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Sam Chiu-wai Wong, Yin Tat Lee","submitted_at":"2015-08-20T04:44:51Z","abstract_excerpt":"We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\\subset \\mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a point in $K$ or prove that $K$ does not contain a ball of radius $\\epsilon$ using an expected $O(n\\log(nR/\\epsilon))$ oracle evaluations and additional time $O(n^3\\log^{O(1)}(nR/\\epsilon))$. This matches the oracle complexity and improves upon the $O(n^{\\omega+1}\\log(nR/\\epsilon))$ additional time of the previous fastest algorithm achieved over 25 years ago"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04874","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+WBkycSvndazrtH5zO6s9MKzcF+qJJa1/Cwe0kSDcxC+t6ex3vE3Vi6nQn9JTLsLROLGSaoAAtgS7mp7IM29CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:53:56.714119Z"},"content_sha256":"ce9310920865afde6bd82948e737630af5eddb187df655a0d4c713a7815c12c4","schema_version":"1.0","event_id":"sha256:ce9310920865afde6bd82948e737630af5eddb187df655a0d4c713a7815c12c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/bundle.json","state_url":"https://pith.science/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T14:53:56Z","links":{"resolver":"https://pith.science/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2","bundle":"https://pith.science/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/bundle.json","state":"https://pith.science/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUKCYEMOXWECGHLCWMHDIKX7T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZUKCYEMOXWECGHLCWMHDIKX7T2","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":"cb915615146327322449b87e4ab730517dad6a1d54bc032a6cc9573ccda56c97","cross_cats_sorted":["cs.DM","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-20T04:44:51Z","title_canon_sha256":"7ade500a7cdc098dc6ef8124dcf2c1b6b2fc2adf48e1fd070ee232b7940c4024"},"schema_version":"1.0","source":{"id":"1508.04874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04874","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04874v2","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04874","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZUKCYEMOXWEC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZUKCYEMOXWECGHLC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZUKCYEMO","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:ce9310920865afde6bd82948e737630af5eddb187df655a0d4c713a7815c12c4","target":"graph","created_at":"2026-05-18T01:27:45Z","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"},"paper":{"abstract_excerpt":"We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\\subset \\mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a point in $K$ or prove that $K$ does not contain a ball of radius $\\epsilon$ using an expected $O(n\\log(nR/\\epsilon))$ oracle evaluations and additional time $O(n^3\\log^{O(1)}(nR/\\epsilon))$. This matches the oracle complexity and improves upon the $O(n^{\\omega+1}\\log(nR/\\epsilon))$ additional time of the previous fastest algorithm achieved over 25 years ago","authors_text":"Aaron Sidford, Sam Chiu-wai Wong, Yin Tat Lee","cross_cats":["cs.DM","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-20T04:44:51Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04874","kind":"arxiv","version":2},"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:ba1631d2a3619b4b423b7929a11a4b11461786fd9a55b80f7d1b3883edc49c40","target":"record","created_at":"2026-05-18T01:27:45Z","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":"cb915615146327322449b87e4ab730517dad6a1d54bc032a6cc9573ccda56c97","cross_cats_sorted":["cs.DM","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-20T04:44:51Z","title_canon_sha256":"7ade500a7cdc098dc6ef8124dcf2c1b6b2fc2adf48e1fd070ee232b7940c4024"},"schema_version":"1.0","source":{"id":"1508.04874","kind":"arxiv","version":2}},"canonical_sha256":"cd142c118ebd88231d62b30e342aff9eaee0170e1935ef77509d78d59e488310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd142c118ebd88231d62b30e342aff9eaee0170e1935ef77509d78d59e488310","first_computed_at":"2026-05-18T01:27:45.707630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:45.707630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m1DcL6ihuhxWJZndpn9LqsusOho2zHoqq2BJra7L9fn2AagPRjZ9nf8F4kk621eW+ZpGLUuVBlio6Pg8LMJWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:45.708185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba1631d2a3619b4b423b7929a11a4b11461786fd9a55b80f7d1b3883edc49c40","sha256:ce9310920865afde6bd82948e737630af5eddb187df655a0d4c713a7815c12c4"],"state_sha256":"acefe3e229399e0ba88bd7e972e6b897ae989eb6de28a7db4651c9281942e974"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbL0AJ1FoL353k09HQARzF0uCuUzG1vEolg9IbZI7W840ghdO88KH5NEeMB8ROO+IC1xH47gO2jeaTUY2GdTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:53:56.717707Z","bundle_sha256":"c6ccf613b8ca5678404e588c19934da8c58e5c4f8e30e2f2d4de26eecaa7603f"}}