{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CUUL7SWBGQI5HGM2VWZUIJKBVH","short_pith_number":"pith:CUUL7SWB","schema_version":"1.0","canonical_sha256":"1528bfcac13411d3999aadb3442541a9d1a915ae4e20210b2c2c39451991808c","source":{"kind":"arxiv","id":"1706.07357","version":1},"attestation_state":"computed","paper":{"title":"Efficient Convex Optimization with Membership Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Santosh S. Vempala, Yin Tat Lee","submitted_at":"2017-06-22T15:07:24Z","abstract_excerpt":"We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with $\\tilde{O}(n^2)$ oracle calls and $\\tilde{O}(n^3)$ additional arithmetic operations. Using this result, we obtain more efficient reductions among the five basic oracles for convex sets and functions defined by Gr\\\"otschel, Lovasz and Schrijver."},"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":"1706.07357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T15:07:24Z","cross_cats_sorted":["cs.CG","math.OC"],"title_canon_sha256":"317810c0d434c71f34b76d10ef8ff2099610ef2533f2a6390d7385d1de9fe68c","abstract_canon_sha256":"9a330e18841855508d06e6945c4880f65f6df546dec74cbc9b52d68590e733a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:51.906194Z","signature_b64":"qng++m0M7gIXkDA9Ko25ZjPlUUqqaZWWTK15NDK9Vf4z4Ff8A37yXbzJKGUxCvBviAdURDYM3vxftXiPCbK8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1528bfcac13411d3999aadb3442541a9d1a915ae4e20210b2c2c39451991808c","last_reissued_at":"2026-05-18T00:41:51.905657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:51.905657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Convex Optimization with Membership Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Santosh S. Vempala, Yin Tat Lee","submitted_at":"2017-06-22T15:07:24Z","abstract_excerpt":"We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with $\\tilde{O}(n^2)$ oracle calls and $\\tilde{O}(n^3)$ additional arithmetic operations. Using this result, we obtain more efficient reductions among the five basic oracles for convex sets and functions defined by Gr\\\"otschel, Lovasz and Schrijver."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07357","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":""},"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":"1706.07357","created_at":"2026-05-18T00:41:51.905738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07357v1","created_at":"2026-05-18T00:41:51.905738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07357","created_at":"2026-05-18T00:41:51.905738+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUUL7SWBGQI5","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUUL7SWBGQI5HGM2","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUUL7SWB","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03903","citing_title":"Quantum algorithm for estimating volumes of convex bodies","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH","json":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH.json","graph_json":"https://pith.science/api/pith-number/CUUL7SWBGQI5HGM2VWZUIJKBVH/graph.json","events_json":"https://pith.science/api/pith-number/CUUL7SWBGQI5HGM2VWZUIJKBVH/events.json","paper":"https://pith.science/paper/CUUL7SWB"},"agent_actions":{"view_html":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH","download_json":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH.json","view_paper":"https://pith.science/paper/CUUL7SWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07357&json=true","fetch_graph":"https://pith.science/api/pith-number/CUUL7SWBGQI5HGM2VWZUIJKBVH/graph.json","fetch_events":"https://pith.science/api/pith-number/CUUL7SWBGQI5HGM2VWZUIJKBVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH/action/storage_attestation","attest_author":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH/action/author_attestation","sign_citation":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH/action/citation_signature","submit_replication":"https://pith.science/pith/CUUL7SWBGQI5HGM2VWZUIJKBVH/action/replication_record"}},"created_at":"2026-05-18T00:41:51.905738+00:00","updated_at":"2026-05-18T00:41:51.905738+00:00"}