{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OQB5OM2A2XGTOMT2CLGSEQ3NPL","short_pith_number":"pith:OQB5OM2A","schema_version":"1.0","canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","source":{"kind":"arxiv","id":"1609.05011","version":2},"attestation_state":"computed","paper":{"title":"Convex separation from convex optimization for large-scale problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Miguel Navascues, Stephen Brierley, Tamas Vertesi","submitted_at":"2016-09-16T11:43:59Z","abstract_excerpt":"We present a scheme, based on Gilbert's algorithm for quadratic minimization [SIAM J. Contrl., vol. 4, pp. 61-80, 1966], to prove separation between a point and an arbitrary convex set $S\\subset\\mathbb{R}^{n}$ via calls to an oracle able to perform linear optimizations over $S$. Compared to other methods, our scheme has almost negligible memory requirements and the number of calls to the optimization oracle does not depend on the dimensionality $n$ of the underlying space. We study the speed of convergence of the scheme under different promises on the shape of the set $S$ and/or the location 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":"1609.05011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-16T11:43:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"99609c4b8d5ca305f0670fc59b2488a0055bcbd2cd9cbcd0c70f969ca029d873","abstract_canon_sha256":"fef3fef147624cf6f7ea7627d8aacad922453e0e0ec87a41599d4eeec265578b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:20.678583Z","signature_b64":"/Qcu0kBsZhvGe8YJTyjguKw6duUUCLVkhvLpwFVh2IoSw+dCdEPQFe63DhQx5B6SfFmIrOGGLy/3axWlQdxrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","last_reissued_at":"2026-05-18T00:53:20.678189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:20.678189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex separation from convex optimization for large-scale problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Miguel Navascues, Stephen Brierley, Tamas Vertesi","submitted_at":"2016-09-16T11:43:59Z","abstract_excerpt":"We present a scheme, based on Gilbert's algorithm for quadratic minimization [SIAM J. Contrl., vol. 4, pp. 61-80, 1966], to prove separation between a point and an arbitrary convex set $S\\subset\\mathbb{R}^{n}$ via calls to an oracle able to perform linear optimizations over $S$. Compared to other methods, our scheme has almost negligible memory requirements and the number of calls to the optimization oracle does not depend on the dimensionality $n$ of the underlying space. We study the speed of convergence of the scheme under different promises on the shape of the set $S$ and/or the location o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05011","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.05011","created_at":"2026-05-18T00:53:20.678252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05011v2","created_at":"2026-05-18T00:53:20.678252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05011","created_at":"2026-05-18T00:53:20.678252+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQB5OM2A2XGT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQB5OM2A2XGTOMT2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQB5OM2A","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2504.07814","citing_title":"Estimating the best separable approximation of non-pure spin-squeezed states","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2512.11118","citing_title":"Network-Irreducible Multiparty Entanglement in Quantum Matter","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03194","citing_title":"Mapping correlations between quantum discord and Bell non-locality","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL","json":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL.json","graph_json":"https://pith.science/api/pith-number/OQB5OM2A2XGTOMT2CLGSEQ3NPL/graph.json","events_json":"https://pith.science/api/pith-number/OQB5OM2A2XGTOMT2CLGSEQ3NPL/events.json","paper":"https://pith.science/paper/OQB5OM2A"},"agent_actions":{"view_html":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL","download_json":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL.json","view_paper":"https://pith.science/paper/OQB5OM2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05011&json=true","fetch_graph":"https://pith.science/api/pith-number/OQB5OM2A2XGTOMT2CLGSEQ3NPL/graph.json","fetch_events":"https://pith.science/api/pith-number/OQB5OM2A2XGTOMT2CLGSEQ3NPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/action/storage_attestation","attest_author":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/action/author_attestation","sign_citation":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/action/citation_signature","submit_replication":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/action/replication_record"}},"created_at":"2026-05-18T00:53:20.678252+00:00","updated_at":"2026-05-18T00:53:20.678252+00:00"}