{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EBYD5SWY4NYY4VVXKTYJWYTOAO","short_pith_number":"pith:EBYD5SWY","schema_version":"1.0","canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","source":{"kind":"arxiv","id":"2401.13840","version":1},"attestation_state":"computed","paper":{"title":"An Almost Feasible Sequential Linear Programming Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Astudillo, Charlie Vanaret, David Kiessling, Jan Swevers, Wilm Decre","submitted_at":"2024-01-24T22:32:04Z","abstract_excerpt":"This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Linear Programming (FSLP) methods are discussed along with illustrative examples. Then, we present a generalization of FSLP based on a tolerance-tube method that addresses the shortcomings of FSLP. The proposed algorithm afSLP consists of two phases. Phase I starts from random infeasible points and iterates towards a relaxation of the feasible set. Once the tolerance-tube around the feasible set is reached, phase II is s"},"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":"2401.13840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-24T22:32:04Z","cross_cats_sorted":[],"title_canon_sha256":"f61b6f480bc1355b0e9e6ee8258936781a2393b0a12a670f0765e1a80d6e0f88","abstract_canon_sha256":"146b013560b7db524363ac8f9ba387ad1bed0d4bf3be112b1689cae7d8ceaaa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:18.241380Z","signature_b64":"EM1rsRv4mO/Juc2P+ZbiCpd/bP/jZrDIdUNOldeJjAknZmmk1KaWDbOqQk3LiSiiBTN04hzRezbijcLRM2BPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","last_reissued_at":"2026-07-05T07:37:18.240939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:18.240939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Almost Feasible Sequential Linear Programming Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Astudillo, Charlie Vanaret, David Kiessling, Jan Swevers, Wilm Decre","submitted_at":"2024-01-24T22:32:04Z","abstract_excerpt":"This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Linear Programming (FSLP) methods are discussed along with illustrative examples. Then, we present a generalization of FSLP based on a tolerance-tube method that addresses the shortcomings of FSLP. The proposed algorithm afSLP consists of two phases. Phase I starts from random infeasible points and iterates towards a relaxation of the feasible set. Once the tolerance-tube around the feasible set is reached, phase II is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13840","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/2401.13840/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":"2401.13840","created_at":"2026-07-05T07:37:18.240993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13840v1","created_at":"2026-07-05T07:37:18.240993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13840","created_at":"2026-07-05T07:37:18.240993+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBYD5SWY4NYY","created_at":"2026-07-05T07:37:18.240993+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBYD5SWY4NYY4VVX","created_at":"2026-07-05T07:37:18.240993+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBYD5SWY","created_at":"2026-07-05T07:37:18.240993+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/EBYD5SWY4NYY4VVXKTYJWYTOAO","json":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO.json","graph_json":"https://pith.science/api/pith-number/EBYD5SWY4NYY4VVXKTYJWYTOAO/graph.json","events_json":"https://pith.science/api/pith-number/EBYD5SWY4NYY4VVXKTYJWYTOAO/events.json","paper":"https://pith.science/paper/EBYD5SWY"},"agent_actions":{"view_html":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO","download_json":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO.json","view_paper":"https://pith.science/paper/EBYD5SWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13840&json=true","fetch_graph":"https://pith.science/api/pith-number/EBYD5SWY4NYY4VVXKTYJWYTOAO/graph.json","fetch_events":"https://pith.science/api/pith-number/EBYD5SWY4NYY4VVXKTYJWYTOAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/action/storage_attestation","attest_author":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/action/author_attestation","sign_citation":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/action/citation_signature","submit_replication":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/action/replication_record"}},"created_at":"2026-07-05T07:37:18.240993+00:00","updated_at":"2026-07-05T07:37:18.240993+00:00"}