{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3JNFBD6A43OQPVZ76QW4FEWXCG","short_pith_number":"pith:3JNFBD6A","canonical_record":{"source":{"id":"2307.14181","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-26T13:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"a6b7ef1752381d273e29c4d34c2e5132ec8488a9aa7877f355bb8dcd140090a5","abstract_canon_sha256":"1f6564be8ec8ac3068f0ae08e8f0c405d6a07143e24a9d3012670315dad7f446"},"schema_version":"1.0"},"canonical_sha256":"da5a508fc0e6dd07d73ff42dc292d7119661f42753b1f9fc9a9ffdce951bb535","source":{"kind":"arxiv","id":"2307.14181","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.14181","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"2307.14181v3","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14181","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"3JNFBD6A43OQ","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_16","alias_value":"3JNFBD6A43OQPVZ7","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_8","alias_value":"3JNFBD6A","created_at":"2026-07-05T11:18:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3JNFBD6A43OQPVZ76QW4FEWXCG","target":"record","payload":{"canonical_record":{"source":{"id":"2307.14181","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-26T13:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"a6b7ef1752381d273e29c4d34c2e5132ec8488a9aa7877f355bb8dcd140090a5","abstract_canon_sha256":"1f6564be8ec8ac3068f0ae08e8f0c405d6a07143e24a9d3012670315dad7f446"},"schema_version":"1.0"},"canonical_sha256":"da5a508fc0e6dd07d73ff42dc292d7119661f42753b1f9fc9a9ffdce951bb535","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:57.011862Z","signature_b64":"8mKswUcwm2YH9/JtGSIt9wBhmZm8BXVn66LW9JsDX6xRpR/FB7rtnkP4zsgunoCS761EwZt1iLmUIlgOyN5JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5a508fc0e6dd07d73ff42dc292d7119661f42753b1f9fc9a9ffdce951bb535","last_reissued_at":"2026-07-05T11:18:57.011380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:57.011380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.14181","source_version":3,"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-07-05T11:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ghlnz8noC4WqsPttrBoaFS7OBrpVxOk4nYs9REM28hS1D8p1hOzvsCIpujGtxNOy0gNzc+TvvQnmo9fThH06DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:52:29.147323Z"},"content_sha256":"17320a33f08464aeca38753e4340696980de04ed1fc04b18499b1af0ef1ff109","schema_version":"1.0","event_id":"sha256:17320a33f08464aeca38753e4340696980de04ed1fc04b18499b1af0ef1ff109"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3JNFBD6A43OQPVZ76QW4FEWXCG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex semi-infinite programming algorithms with inexact separation oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antoine Oustry, Martina Cerulli","submitted_at":"2023-07-26T13:13:45Z","abstract_excerpt":"Solving convex Semi-Infinite Programming (SIP) problems is challenging when the separation problem, i.e., the problem of finding the most violated constraint, is computationally hard. We propose to tackle this difficulty by solving the separation problem approximately, i.e., by using an inexact oracle. Our focus lies in two algorithms for SIP, namely the Cutting-Planes (CP) and the Inner-Outer Approximation (IOA) algorithms. We prove the CP convergence rate to be in O(1/k), where k is the number of calls to the limited-accuracy oracle, if the objective function is strongly convex. Compared to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14181","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.14181/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wq7YA4H8eCg9tO+LRfYZd+rsVBKL+S2OBNEJCpeXU4wyJSxIGnq9/pL/ZAutpJdbaAKP560uLdd79cOlX/7MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:52:29.148136Z"},"content_sha256":"7c249445f3d7396e33aabc392485b834fb117099fff5fb7b47630461d4439c8f","schema_version":"1.0","event_id":"sha256:7c249445f3d7396e33aabc392485b834fb117099fff5fb7b47630461d4439c8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/bundle.json","state_url":"https://pith.science/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/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-21T03:52:29Z","links":{"resolver":"https://pith.science/pith/3JNFBD6A43OQPVZ76QW4FEWXCG","bundle":"https://pith.science/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/bundle.json","state":"https://pith.science/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JNFBD6A43OQPVZ76QW4FEWXCG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3JNFBD6A43OQPVZ76QW4FEWXCG","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":"1f6564be8ec8ac3068f0ae08e8f0c405d6a07143e24a9d3012670315dad7f446","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-26T13:13:45Z","title_canon_sha256":"a6b7ef1752381d273e29c4d34c2e5132ec8488a9aa7877f355bb8dcd140090a5"},"schema_version":"1.0","source":{"id":"2307.14181","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.14181","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"2307.14181v3","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14181","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"3JNFBD6A43OQ","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_16","alias_value":"3JNFBD6A43OQPVZ7","created_at":"2026-07-05T11:18:57Z"},{"alias_kind":"pith_short_8","alias_value":"3JNFBD6A","created_at":"2026-07-05T11:18:57Z"}],"graph_snapshots":[{"event_id":"sha256:7c249445f3d7396e33aabc392485b834fb117099fff5fb7b47630461d4439c8f","target":"graph","created_at":"2026-07-05T11:18:57Z","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/2307.14181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solving convex Semi-Infinite Programming (SIP) problems is challenging when the separation problem, i.e., the problem of finding the most violated constraint, is computationally hard. We propose to tackle this difficulty by solving the separation problem approximately, i.e., by using an inexact oracle. Our focus lies in two algorithms for SIP, namely the Cutting-Planes (CP) and the Inner-Outer Approximation (IOA) algorithms. We prove the CP convergence rate to be in O(1/k), where k is the number of calls to the limited-accuracy oracle, if the objective function is strongly convex. Compared to ","authors_text":"Antoine Oustry, Martina Cerulli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-26T13:13:45Z","title":"Convex semi-infinite programming algorithms with inexact separation oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14181","kind":"arxiv","version":3},"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:17320a33f08464aeca38753e4340696980de04ed1fc04b18499b1af0ef1ff109","target":"record","created_at":"2026-07-05T11:18:57Z","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":"1f6564be8ec8ac3068f0ae08e8f0c405d6a07143e24a9d3012670315dad7f446","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-26T13:13:45Z","title_canon_sha256":"a6b7ef1752381d273e29c4d34c2e5132ec8488a9aa7877f355bb8dcd140090a5"},"schema_version":"1.0","source":{"id":"2307.14181","kind":"arxiv","version":3}},"canonical_sha256":"da5a508fc0e6dd07d73ff42dc292d7119661f42753b1f9fc9a9ffdce951bb535","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da5a508fc0e6dd07d73ff42dc292d7119661f42753b1f9fc9a9ffdce951bb535","first_computed_at":"2026-07-05T11:18:57.011380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:57.011380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8mKswUcwm2YH9/JtGSIt9wBhmZm8BXVn66LW9JsDX6xRpR/FB7rtnkP4zsgunoCS761EwZt1iLmUIlgOyN5JDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:57.011862Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.14181","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17320a33f08464aeca38753e4340696980de04ed1fc04b18499b1af0ef1ff109","sha256:7c249445f3d7396e33aabc392485b834fb117099fff5fb7b47630461d4439c8f"],"state_sha256":"1f8027b931b82e7c418d25531d01247857cd805a3baebe0938e0965eb0e79459"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWiQCg+aCaeR0Ws5g2h+q4oozGfclr5lf3bnV2KBpi11+DqdiWEetZUK17qzZhQ51UtYqkI8RASO7QHCZufjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T03:52:29.153187Z","bundle_sha256":"88e7cdab3c2e46b60eb6d7f2631e4f86cb1b01e9881733824a6a53ed5d80a959"}}