{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EBYD5SWY4NYY4VVXKTYJWYTOAO","short_pith_number":"pith:EBYD5SWY","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"},"canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","source":{"kind":"arxiv","id":"2401.13840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.13840","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"2401.13840v1","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13840","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"EBYD5SWY4NYY","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_16","alias_value":"EBYD5SWY4NYY4VVX","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_8","alias_value":"EBYD5SWY","created_at":"2026-07-05T07:37:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EBYD5SWY4NYY4VVXKTYJWYTOAO","target":"record","payload":{"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"},"canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","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"},"source_kind":"arxiv","source_id":"2401.13840","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsQYyLpYmgkHUXtFHb/oPCb6jJX8IXvTBiZTZ82w6hURgIXcfpugJbvO+TeZ6EfVqfLsCdX5ULNNnt/mAIa9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:26:52.476453Z"},"content_sha256":"211107dc0aafa192eed9e5e2537eee6aa90b24c9b5f0d1b7fb694af6a2f8bb46","schema_version":"1.0","event_id":"sha256:211107dc0aafa192eed9e5e2537eee6aa90b24c9b5f0d1b7fb694af6a2f8bb46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EBYD5SWY4NYY4VVXKTYJWYTOAO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvG8lHIy3nhVEXdlf1ob1rkVyTsPlEwETWcTR6hRhSpIGIRSnpblnbRTzhAdmth6Yo7o05AmY6g2w7rz6OuQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:26:52.477094Z"},"content_sha256":"c7d0e238282a382fb2c3d1160aa7e83591493d927016c7878e977b44bae543d3","schema_version":"1.0","event_id":"sha256:c7d0e238282a382fb2c3d1160aa7e83591493d927016c7878e977b44bae543d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/bundle.json","state_url":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T05:26:52Z","links":{"resolver":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO","bundle":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/bundle.json","state":"https://pith.science/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBYD5SWY4NYY4VVXKTYJWYTOAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EBYD5SWY4NYY4VVXKTYJWYTOAO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"146b013560b7db524363ac8f9ba387ad1bed0d4bf3be112b1689cae7d8ceaaa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-24T22:32:04Z","title_canon_sha256":"f61b6f480bc1355b0e9e6ee8258936781a2393b0a12a670f0765e1a80d6e0f88"},"schema_version":"1.0","source":{"id":"2401.13840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.13840","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"2401.13840v1","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13840","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"EBYD5SWY4NYY","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_16","alias_value":"EBYD5SWY4NYY4VVX","created_at":"2026-07-05T07:37:18Z"},{"alias_kind":"pith_short_8","alias_value":"EBYD5SWY","created_at":"2026-07-05T07:37:18Z"}],"graph_snapshots":[{"event_id":"sha256:c7d0e238282a382fb2c3d1160aa7e83591493d927016c7878e977b44bae543d3","target":"graph","created_at":"2026-07-05T07:37:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.13840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alejandro Astudillo, Charlie Vanaret, David Kiessling, Jan Swevers, Wilm Decre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-24T22:32:04Z","title":"An Almost Feasible Sequential Linear Programming Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:211107dc0aafa192eed9e5e2537eee6aa90b24c9b5f0d1b7fb694af6a2f8bb46","target":"record","created_at":"2026-07-05T07:37:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"146b013560b7db524363ac8f9ba387ad1bed0d4bf3be112b1689cae7d8ceaaa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-24T22:32:04Z","title_canon_sha256":"f61b6f480bc1355b0e9e6ee8258936781a2393b0a12a670f0765e1a80d6e0f88"},"schema_version":"1.0","source":{"id":"2401.13840","kind":"arxiv","version":1}},"canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20703ecad8e3718e56b754f09b626e039355a29171db314a44d7676b7b52ef18","first_computed_at":"2026-07-05T07:37:18.240939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:37:18.240939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EM1rsRv4mO/Juc2P+ZbiCpd/bP/jZrDIdUNOldeJjAknZmmk1KaWDbOqQk3LiSiiBTN04hzRezbijcLRM2BPCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:37:18.241380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.13840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:211107dc0aafa192eed9e5e2537eee6aa90b24c9b5f0d1b7fb694af6a2f8bb46","sha256:c7d0e238282a382fb2c3d1160aa7e83591493d927016c7878e977b44bae543d3"],"state_sha256":"82d08b5f216bcef950a317fa289077fbdaf47eac63ac1f73bef11f0425b21428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFp1NubPBPUJ4I5wuM3Hoo9u7n4tm6Bnm6zN7qV96brx0ZdVfHklQ4q9a6tmjQ2pNQaZpuXUDuI2QSoTPARmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:26:52.482254Z","bundle_sha256":"72b73e26b5a8f9bb9bf89b6cb01b4b4bb90beda2aeba333f100501082df9697e"}}