{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:D6PRI2OXORE6SNMYQE4FGERUU5","short_pith_number":"pith:D6PRI2OX","canonical_record":{"source":{"id":"2505.09349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T12:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"ef69d7c06b0b95fecebe153e7c25807fa754359dcf467c82834b032c07c9f929","abstract_canon_sha256":"d6ca75383e7d480032f22236aa081913c02aed45b9c4d1b2aeaedc3c77c58297"},"schema_version":"1.0"},"canonical_sha256":"1f9f1469d77449e935988138531234a745137d6d4b7c8ebee2a923b366f9a1d6","source":{"kind":"arxiv","id":"2505.09349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09349","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09349v1","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09349","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"D6PRI2OXORE6","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"D6PRI2OXORE6SNMY","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"D6PRI2OX","created_at":"2026-07-05T11:03:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:D6PRI2OXORE6SNMYQE4FGERUU5","target":"record","payload":{"canonical_record":{"source":{"id":"2505.09349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T12:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"ef69d7c06b0b95fecebe153e7c25807fa754359dcf467c82834b032c07c9f929","abstract_canon_sha256":"d6ca75383e7d480032f22236aa081913c02aed45b9c4d1b2aeaedc3c77c58297"},"schema_version":"1.0"},"canonical_sha256":"1f9f1469d77449e935988138531234a745137d6d4b7c8ebee2a923b366f9a1d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:06.819453Z","signature_b64":"dUZUzotEqVLVgeh12k9XASb/gm6VqUTD96gYq+NKG2SMYl+JaxHYa5KEEPfZuoAWrUQjXoSEyN/x0K0fPi6cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f9f1469d77449e935988138531234a745137d6d4b7c8ebee2a923b366f9a1d6","last_reissued_at":"2026-07-05T11:03:06.819033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:06.819033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.09349","source_version":1,"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:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQZ8og3QMegvEgYhSmkY4IA1IHIw4Xpeq0Q/IhahbCYpmCg9F8ieqkUdx0vx/r688y1WergZtC3HPOd4emg4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:31:19.285821Z"},"content_sha256":"24853a66ad0957d3486ee51fac2f5b675650aa4b287d7841053892d49b18ad32","schema_version":"1.0","event_id":"sha256:24853a66ad0957d3486ee51fac2f5b675650aa4b287d7841053892d49b18ad32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:D6PRI2OXORE6SNMYQE4FGERUU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ilnura Usmanova, Kfir Yehuda Levy","submitted_at":"2025-05-14T12:54:29Z","abstract_excerpt":"This paper addresses the problem of safe optimization under a single smooth constraint, a scenario that arises in diverse real-world applications such as robotics and autonomous navigation. The objective of safe optimization is to solve a black-box minimization problem while strictly adhering to a safety constraint throughout the learning process. Existing methods often suffer from high sample complexity due to their noise sensitivity or poor scalability with number of dimensions, limiting their applicability. We propose a novel primal-dual optimization method that, by carefully adjusting dual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09349","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.09349/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:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T3ZQbVnY0D4o2sdPZkenIFGb3au6pNPKecWZ3Jxb6DpILlR0YGHlXCMcxzEyr1oYBUQTijhNOaaw3Ye3SkFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:31:19.332334Z"},"content_sha256":"8c4b47b9459950d6a0f42d09a97895f121f1a5dc22f2d6130c19248ca5a17427","schema_version":"1.0","event_id":"sha256:8c4b47b9459950d6a0f42d09a97895f121f1a5dc22f2d6130c19248ca5a17427"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6PRI2OXORE6SNMYQE4FGERUU5/bundle.json","state_url":"https://pith.science/pith/D6PRI2OXORE6SNMYQE4FGERUU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6PRI2OXORE6SNMYQE4FGERUU5/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-17T14:31:19Z","links":{"resolver":"https://pith.science/pith/D6PRI2OXORE6SNMYQE4FGERUU5","bundle":"https://pith.science/pith/D6PRI2OXORE6SNMYQE4FGERUU5/bundle.json","state":"https://pith.science/pith/D6PRI2OXORE6SNMYQE4FGERUU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6PRI2OXORE6SNMYQE4FGERUU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D6PRI2OXORE6SNMYQE4FGERUU5","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":"d6ca75383e7d480032f22236aa081913c02aed45b9c4d1b2aeaedc3c77c58297","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T12:54:29Z","title_canon_sha256":"ef69d7c06b0b95fecebe153e7c25807fa754359dcf467c82834b032c07c9f929"},"schema_version":"1.0","source":{"id":"2505.09349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09349","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09349v1","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09349","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"D6PRI2OXORE6","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_16","alias_value":"D6PRI2OXORE6SNMY","created_at":"2026-07-05T11:03:06Z"},{"alias_kind":"pith_short_8","alias_value":"D6PRI2OX","created_at":"2026-07-05T11:03:06Z"}],"graph_snapshots":[{"event_id":"sha256:8c4b47b9459950d6a0f42d09a97895f121f1a5dc22f2d6130c19248ca5a17427","target":"graph","created_at":"2026-07-05T11:03:06Z","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/2505.09349/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the problem of safe optimization under a single smooth constraint, a scenario that arises in diverse real-world applications such as robotics and autonomous navigation. The objective of safe optimization is to solve a black-box minimization problem while strictly adhering to a safety constraint throughout the learning process. Existing methods often suffer from high sample complexity due to their noise sensitivity or poor scalability with number of dimensions, limiting their applicability. We propose a novel primal-dual optimization method that, by carefully adjusting dual","authors_text":"Ilnura Usmanova, Kfir Yehuda Levy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T12:54:29Z","title":"Safe Primal-Dual Optimization with a Single Smooth Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09349","kind":"arxiv","version":1},"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:24853a66ad0957d3486ee51fac2f5b675650aa4b287d7841053892d49b18ad32","target":"record","created_at":"2026-07-05T11:03:06Z","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":"d6ca75383e7d480032f22236aa081913c02aed45b9c4d1b2aeaedc3c77c58297","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T12:54:29Z","title_canon_sha256":"ef69d7c06b0b95fecebe153e7c25807fa754359dcf467c82834b032c07c9f929"},"schema_version":"1.0","source":{"id":"2505.09349","kind":"arxiv","version":1}},"canonical_sha256":"1f9f1469d77449e935988138531234a745137d6d4b7c8ebee2a923b366f9a1d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f9f1469d77449e935988138531234a745137d6d4b7c8ebee2a923b366f9a1d6","first_computed_at":"2026-07-05T11:03:06.819033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:06.819033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dUZUzotEqVLVgeh12k9XASb/gm6VqUTD96gYq+NKG2SMYl+JaxHYa5KEEPfZuoAWrUQjXoSEyN/x0K0fPi6cDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:06.819453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24853a66ad0957d3486ee51fac2f5b675650aa4b287d7841053892d49b18ad32","sha256:8c4b47b9459950d6a0f42d09a97895f121f1a5dc22f2d6130c19248ca5a17427"],"state_sha256":"c794f7c7a07d17efd33091d9a3695162f4b6857f4468cc48e67d3d5f4cf998e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjV9txXCJjcogicKPjrvkBi6NwaR9dHrDu8i90mw3I4CrgAMKCutgVFQdgxpQQ92kKRSdDbSFOk4/AZfHJHXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T14:31:19.449785Z","bundle_sha256":"046f81e148015758ed90ee7cfb05f05a333eb7fc051915546c35c09a29593c89"}}