{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AX3PAJOKP2KH7HSTSJ6SYARS6X","short_pith_number":"pith:AX3PAJOK","schema_version":"1.0","canonical_sha256":"05f6f025ca7e947f9e53927d2c0232f5eff38c816551af37a341d652fb51d664","source":{"kind":"arxiv","id":"1403.1861","version":2},"attestation_state":"computed","paper":{"title":"Credible Autocoding of Convex Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Didier Henrion, Eric Feron, Marc Pantel, Pierre-Loic Garoche, Romain Jobredeaux, Timothy Wang","submitted_at":"2014-03-07T20:04:11Z","abstract_excerpt":"The efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety critical roles. There is a considerable body of mathematical proofs on on-line optimization programs which can be leveraged to assist in the development and verification of their implementation. In this paper, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional properties at the level of the code, thereby making it accessible for the formal methods community. The"},"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":"1403.1861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-07T20:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"2071476d5c589453d4f448141d682044db7ce47dc8455d90355ccba028e203c0","abstract_canon_sha256":"4b4c747c96b59cf9c05dad3d3e580b85f8070679e3f884f4a4ece38f7bea374c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.983345Z","signature_b64":"aQAjYiPDvm1dp20X2okyfar/6lC6z+gulra9Kl0HoRZ7cFkFm4tbW177VTBdhkmJPO+vjj1Xqva0Tm2mx3WzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f6f025ca7e947f9e53927d2c0232f5eff38c816551af37a341d652fb51d664","last_reissued_at":"2026-05-18T02:43:46.981699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.981699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Credible Autocoding of Convex Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Didier Henrion, Eric Feron, Marc Pantel, Pierre-Loic Garoche, Romain Jobredeaux, Timothy Wang","submitted_at":"2014-03-07T20:04:11Z","abstract_excerpt":"The efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety critical roles. There is a considerable body of mathematical proofs on on-line optimization programs which can be leveraged to assist in the development and verification of their implementation. In this paper, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional properties at the level of the code, thereby making it accessible for the formal methods community. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1861","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":""},"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":"1403.1861","created_at":"2026-05-18T02:43:46.981765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1861v2","created_at":"2026-05-18T02:43:46.981765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1861","created_at":"2026-05-18T02:43:46.981765+00:00"},{"alias_kind":"pith_short_12","alias_value":"AX3PAJOKP2KH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AX3PAJOKP2KH7HST","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AX3PAJOK","created_at":"2026-05-18T12:28:19.803747+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/AX3PAJOKP2KH7HSTSJ6SYARS6X","json":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X.json","graph_json":"https://pith.science/api/pith-number/AX3PAJOKP2KH7HSTSJ6SYARS6X/graph.json","events_json":"https://pith.science/api/pith-number/AX3PAJOKP2KH7HSTSJ6SYARS6X/events.json","paper":"https://pith.science/paper/AX3PAJOK"},"agent_actions":{"view_html":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X","download_json":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X.json","view_paper":"https://pith.science/paper/AX3PAJOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1861&json=true","fetch_graph":"https://pith.science/api/pith-number/AX3PAJOKP2KH7HSTSJ6SYARS6X/graph.json","fetch_events":"https://pith.science/api/pith-number/AX3PAJOKP2KH7HSTSJ6SYARS6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X/action/storage_attestation","attest_author":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X/action/author_attestation","sign_citation":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X/action/citation_signature","submit_replication":"https://pith.science/pith/AX3PAJOKP2KH7HSTSJ6SYARS6X/action/replication_record"}},"created_at":"2026-05-18T02:43:46.981765+00:00","updated_at":"2026-05-18T02:43:46.981765+00:00"}