{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OQB5OM2A2XGTOMT2CLGSEQ3NPL","short_pith_number":"pith:OQB5OM2A","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"},"canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","source":{"kind":"arxiv","id":"1609.05011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05011","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05011v2","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05011","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"OQB5OM2A2XGT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OQB5OM2A2XGTOMT2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OQB5OM2A","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OQB5OM2A2XGTOMT2CLGSEQ3NPL","target":"record","payload":{"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"},"canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","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"},"source_kind":"arxiv","source_id":"1609.05011","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-18T00:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEtonQgYFg5m1oiPD8vyKuUHNCxz8mfq5ykG/DxxPZOLrMbOZmW9MqKkjnJqra3lUcDdD44hdeppIC9tiWe3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:45:38.494544Z"},"content_sha256":"a2208b88f4b23a7b77631fa94825ec9d613cc72d9f390113e4ee3eb44c72690f","schema_version":"1.0","event_id":"sha256:a2208b88f4b23a7b77631fa94825ec9d613cc72d9f390113e4ee3eb44c72690f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OQB5OM2A2XGTOMT2CLGSEQ3NPL","target":"graph","payload":{"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"},"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-18T00:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iW1LWoj4uD/3AxAWsz7llZ6xcexflyaC2yomW+FMXd6IvPC/Uc4qteyj4uZNrZlmbqOdUHZbTfqZqxWkYsfvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:45:38.495506Z"},"content_sha256":"8ee5df3dd4f256be64510a1471c62fff168fb48d4e096db5adc2476748c016b7","schema_version":"1.0","event_id":"sha256:8ee5df3dd4f256be64510a1471c62fff168fb48d4e096db5adc2476748c016b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/bundle.json","state_url":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/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-05-24T19:45:38Z","links":{"resolver":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL","bundle":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/bundle.json","state":"https://pith.science/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQB5OM2A2XGTOMT2CLGSEQ3NPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OQB5OM2A2XGTOMT2CLGSEQ3NPL","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":"fef3fef147624cf6f7ea7627d8aacad922453e0e0ec87a41599d4eeec265578b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-16T11:43:59Z","title_canon_sha256":"99609c4b8d5ca305f0670fc59b2488a0055bcbd2cd9cbcd0c70f969ca029d873"},"schema_version":"1.0","source":{"id":"1609.05011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05011","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05011v2","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05011","created_at":"2026-05-18T00:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"OQB5OM2A2XGT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OQB5OM2A2XGTOMT2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OQB5OM2A","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:8ee5df3dd4f256be64510a1471c62fff168fb48d4e096db5adc2476748c016b7","target":"graph","created_at":"2026-05-18T00:53:20Z","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 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","authors_text":"Miguel Navascues, Stephen Brierley, Tamas Vertesi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-16T11:43:59Z","title":"Convex separation from convex optimization for large-scale problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05011","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:a2208b88f4b23a7b77631fa94825ec9d613cc72d9f390113e4ee3eb44c72690f","target":"record","created_at":"2026-05-18T00:53:20Z","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":"fef3fef147624cf6f7ea7627d8aacad922453e0e0ec87a41599d4eeec265578b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-16T11:43:59Z","title_canon_sha256":"99609c4b8d5ca305f0670fc59b2488a0055bcbd2cd9cbcd0c70f969ca029d873"},"schema_version":"1.0","source":{"id":"1609.05011","kind":"arxiv","version":2}},"canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7403d73340d5cd37327a12cd22436d7acaa1441038d37443c34f3cd31205f1a0","first_computed_at":"2026-05-18T00:53:20.678189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:20.678189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Qcu0kBsZhvGe8YJTyjguKw6duUUCLVkhvLpwFVh2IoSw+dCdEPQFe63DhQx5B6SfFmIrOGGLy/3axWlQdxrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:20.678583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2208b88f4b23a7b77631fa94825ec9d613cc72d9f390113e4ee3eb44c72690f","sha256:8ee5df3dd4f256be64510a1471c62fff168fb48d4e096db5adc2476748c016b7"],"state_sha256":"9b2156b117675c44ad7493a99c496705ffc49165c55b338d00724d78e41ebd67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GeS7xVJcMw1cGPg1jkWn8ZuEaM190GR1BEUvIkzE65lvhxfQ0dFzU4NeWOqib3/4xkgAdtAsBGztEkHUJn/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T19:45:38.499191Z","bundle_sha256":"3e953433fdffacca0250d1b4bbbb31008ce4168d54eb4b196747b5af6997d4e7"}}