{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RYMK33P62ENZAUCG7TOWOD6T7Q","short_pith_number":"pith:RYMK33P6","schema_version":"1.0","canonical_sha256":"8e18adedfed11b905046fcdd670fd3fc191902e0d2db10fb73497ff18d2989dc","source":{"kind":"arxiv","id":"2207.10415","version":2},"attestation_state":"computed","paper":{"title":"Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andreas Krause, Ilnura Usmanova, Maryam Kamgarpour, Yarden As","submitted_at":"2022-07-21T11:14:47Z","abstract_excerpt":"Optimizing noisy functions online, when evaluating the objective requires experiments on a deployed system, is a crucial task arising in manufacturing, robotics and many others. Often, constraints on safe inputs are unknown ahead of time, and we only obtain noisy information, indicating how close we are to violating the constraints. Yet, safety must be guaranteed at all times, not only for the final output of the algorithm.\n  We introduce a general approach for seeking a stationary point in high dimensional non-linear stochastic optimization problems in which maintaining safety during learning"},"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":"2207.10415","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-07-21T11:14:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6e56eb85e4a39198f1d6f50bb3c2c8f7b0c6d08107aa3ba7204ea53a0c6b1e59","abstract_canon_sha256":"98f3524a081774e030e8fa9658eb8329ae976e7faaf585e0644c164d9a9eac95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:00.884098Z","signature_b64":"LOchazyLBLseJoCddEUnf2fE1pDLx/d347p0+vkN7wSWhS6Ujh67XtuJlg0iNMrn1WMOWt4LwGutEUqAAIYFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e18adedfed11b905046fcdd670fd3fc191902e0d2db10fb73497ff18d2989dc","last_reissued_at":"2026-07-05T06:17:00.883697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:00.883697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andreas Krause, Ilnura Usmanova, Maryam Kamgarpour, Yarden As","submitted_at":"2022-07-21T11:14:47Z","abstract_excerpt":"Optimizing noisy functions online, when evaluating the objective requires experiments on a deployed system, is a crucial task arising in manufacturing, robotics and many others. Often, constraints on safe inputs are unknown ahead of time, and we only obtain noisy information, indicating how close we are to violating the constraints. Yet, safety must be guaranteed at all times, not only for the final output of the algorithm.\n  We introduce a general approach for seeking a stationary point in high dimensional non-linear stochastic optimization problems in which maintaining safety during learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.10415","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.10415/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.10415","created_at":"2026-07-05T06:17:00.883756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.10415v2","created_at":"2026-07-05T06:17:00.883756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10415","created_at":"2026-07-05T06:17:00.883756+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYMK33P62ENZ","created_at":"2026-07-05T06:17:00.883756+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYMK33P62ENZAUCG","created_at":"2026-07-05T06:17:00.883756+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYMK33P6","created_at":"2026-07-05T06:17:00.883756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04828","citing_title":"Safe Planning and Policy Optimization via World Model Learning","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q","json":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q.json","graph_json":"https://pith.science/api/pith-number/RYMK33P62ENZAUCG7TOWOD6T7Q/graph.json","events_json":"https://pith.science/api/pith-number/RYMK33P62ENZAUCG7TOWOD6T7Q/events.json","paper":"https://pith.science/paper/RYMK33P6"},"agent_actions":{"view_html":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q","download_json":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q.json","view_paper":"https://pith.science/paper/RYMK33P6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.10415&json=true","fetch_graph":"https://pith.science/api/pith-number/RYMK33P62ENZAUCG7TOWOD6T7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RYMK33P62ENZAUCG7TOWOD6T7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q/action/storage_attestation","attest_author":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q/action/author_attestation","sign_citation":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q/action/citation_signature","submit_replication":"https://pith.science/pith/RYMK33P62ENZAUCG7TOWOD6T7Q/action/replication_record"}},"created_at":"2026-07-05T06:17:00.883756+00:00","updated_at":"2026-07-05T06:17:00.883756+00:00"}