{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZXWDJBQFOFHNRUQIGMO2VIFV7E","short_pith_number":"pith:ZXWDJBQF","schema_version":"1.0","canonical_sha256":"cdec348605714ed8d208331daaa0b5f9306e4f493f62f85f71218d1425b90a3f","source":{"kind":"arxiv","id":"2006.13326","version":1},"attestation_state":"computed","paper":{"title":"Safe Learning under Uncertain Objectives and Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Aryan Mokhtari, Hamed Hassani, Mohammad Fereydounian, Zebang Shen","submitted_at":"2020-06-23T20:51:00Z","abstract_excerpt":"In this paper, we consider non-convex optimization problems under \\textit{unknown} yet safety-critical constraints. Such problems naturally arise in a variety of domains including robotics, manufacturing, and medical procedures, where it is infeasible to know or identify all the constraints. Therefore, the parameter space should be explored in a conservative way to ensure that none of the constraints are violated during the optimization process once we start from a safe initialization point. To this end, we develop an algorithm called Reliable Frank-Wolfe (Reliable-FW). Given a general non-con"},"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":"2006.13326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-23T20:51:00Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"7e5badd87e048aa16300d96441a47385c5ef3399e214e1ddcb0296cba2c69aed","abstract_canon_sha256":"7230f85629cf1b39d85f15c8115d0af06b43d96fe2d676f19a9cfb3dbe93ce71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:14.663757Z","signature_b64":"bnQlnv/tbF30MvfcZHztWqbOUdpHhLBmkkKY7dAm0GwWGfbVOV5hfubDcTjd/rimPrV8WYctkcZJNBM3dtf4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdec348605714ed8d208331daaa0b5f9306e4f493f62f85f71218d1425b90a3f","last_reissued_at":"2026-07-05T01:13:14.663214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:14.663214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Learning under Uncertain Objectives and Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Aryan Mokhtari, Hamed Hassani, Mohammad Fereydounian, Zebang Shen","submitted_at":"2020-06-23T20:51:00Z","abstract_excerpt":"In this paper, we consider non-convex optimization problems under \\textit{unknown} yet safety-critical constraints. Such problems naturally arise in a variety of domains including robotics, manufacturing, and medical procedures, where it is infeasible to know or identify all the constraints. Therefore, the parameter space should be explored in a conservative way to ensure that none of the constraints are violated during the optimization process once we start from a safe initialization point. To this end, we develop an algorithm called Reliable Frank-Wolfe (Reliable-FW). Given a general non-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13326","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/2006.13326/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":"2006.13326","created_at":"2026-07-05T01:13:14.663289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13326v1","created_at":"2026-07-05T01:13:14.663289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13326","created_at":"2026-07-05T01:13:14.663289+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXWDJBQFOFHN","created_at":"2026-07-05T01:13:14.663289+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXWDJBQFOFHNRUQI","created_at":"2026-07-05T01:13:14.663289+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXWDJBQF","created_at":"2026-07-05T01:13:14.663289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09349","citing_title":"Safe Primal-Dual Optimization with a Single Smooth Constraint","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E","json":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E.json","graph_json":"https://pith.science/api/pith-number/ZXWDJBQFOFHNRUQIGMO2VIFV7E/graph.json","events_json":"https://pith.science/api/pith-number/ZXWDJBQFOFHNRUQIGMO2VIFV7E/events.json","paper":"https://pith.science/paper/ZXWDJBQF"},"agent_actions":{"view_html":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E","download_json":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E.json","view_paper":"https://pith.science/paper/ZXWDJBQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13326&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXWDJBQFOFHNRUQIGMO2VIFV7E/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXWDJBQFOFHNRUQIGMO2VIFV7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E/action/storage_attestation","attest_author":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E/action/author_attestation","sign_citation":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E/action/citation_signature","submit_replication":"https://pith.science/pith/ZXWDJBQFOFHNRUQIGMO2VIFV7E/action/replication_record"}},"created_at":"2026-07-05T01:13:14.663289+00:00","updated_at":"2026-07-05T01:13:14.663289+00:00"}