{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BNOYNWVDPRPMWIZSH6J7T4MRY7","short_pith_number":"pith:BNOYNWVD","schema_version":"1.0","canonical_sha256":"0b5d86daa37c5ecb23323f93f9f191c7cd85e16b44968cc2ee1dede33192843a","source":{"kind":"arxiv","id":"1404.7282","version":4},"attestation_state":"computed","paper":{"title":"Formal Proofs for Nonlinear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Benjamin Werner, St\\'ephane Gaubert, Victor Magron, Xavier Allamigeon","submitted_at":"2014-04-29T09:19:51Z","abstract_excerpt":"We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of $f$ over $K$. This method allows to bound in a modular way some of the constituents of $f$ by suprema of quadratic forms with a well chosen curvature. Thus, we reduce the initial goal to a hierarchy of semialgebraic optimization problems, solved by sums of squares relaxations. Our implementation tool interleaves semialgebraic approximations wi"},"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":"1404.7282","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-29T09:19:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c6c865a845abe13d797306014dc43ab7cbb43a0d99146422f6b2f52fa7013086","abstract_canon_sha256":"28479d4dac6f2964099e11eb37ccfef4ada3f1b4c3f9a4ce0d16b93166105766"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.300629Z","signature_b64":"7iBtU2y2q6Ca13wNpuS//dt4AIAAcaXOTqL1mwpDzRgsugIBxYYKabEgoEBqcUR0dXiSucMu+T/KckRcQNiDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5d86daa37c5ecb23323f93f9f191c7cd85e16b44968cc2ee1dede33192843a","last_reissued_at":"2026-05-18T02:30:08.300170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.300170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Proofs for Nonlinear Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LO","authors_text":"Benjamin Werner, St\\'ephane Gaubert, Victor Magron, Xavier Allamigeon","submitted_at":"2014-04-29T09:19:51Z","abstract_excerpt":"We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of $f$ over $K$. This method allows to bound in a modular way some of the constituents of $f$ by suprema of quadratic forms with a well chosen curvature. Thus, we reduce the initial goal to a hierarchy of semialgebraic optimization problems, solved by sums of squares relaxations. Our implementation tool interleaves semialgebraic approximations wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7282","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.7282","created_at":"2026-05-18T02:30:08.300246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7282v4","created_at":"2026-05-18T02:30:08.300246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7282","created_at":"2026-05-18T02:30:08.300246+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNOYNWVDPRPM","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNOYNWVDPRPMWIZS","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNOYNWVD","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7","json":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7.json","graph_json":"https://pith.science/api/pith-number/BNOYNWVDPRPMWIZSH6J7T4MRY7/graph.json","events_json":"https://pith.science/api/pith-number/BNOYNWVDPRPMWIZSH6J7T4MRY7/events.json","paper":"https://pith.science/paper/BNOYNWVD"},"agent_actions":{"view_html":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7","download_json":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7.json","view_paper":"https://pith.science/paper/BNOYNWVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7282&json=true","fetch_graph":"https://pith.science/api/pith-number/BNOYNWVDPRPMWIZSH6J7T4MRY7/graph.json","fetch_events":"https://pith.science/api/pith-number/BNOYNWVDPRPMWIZSH6J7T4MRY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7/action/storage_attestation","attest_author":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7/action/author_attestation","sign_citation":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7/action/citation_signature","submit_replication":"https://pith.science/pith/BNOYNWVDPRPMWIZSH6J7T4MRY7/action/replication_record"}},"created_at":"2026-05-18T02:30:08.300246+00:00","updated_at":"2026-05-18T02:30:08.300246+00:00"}