{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ONDJ5X7CLPK2SGQMVPBLHMW27A","short_pith_number":"pith:ONDJ5X7C","canonical_record":{"source":{"id":"2405.01984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-03T10:37:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa94b8e3576cbeb9580d8dea69bc0920fbbcdee25c9ee703557f777f0fb4ac68","abstract_canon_sha256":"749500635765bb48e324aec22a1c416751541c85f1d5b035f8bce42a8a8fba59"},"schema_version":"1.0"},"canonical_sha256":"73469edfe25bd5a91a0cabc2b3b2daf816d9e2b05ed48c0949fb125c6a2a633a","source":{"kind":"arxiv","id":"2405.01984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.01984","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"2405.01984v1","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01984","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"ONDJ5X7CLPK2","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_16","alias_value":"ONDJ5X7CLPK2SGQM","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_8","alias_value":"ONDJ5X7C","created_at":"2026-07-05T08:15:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ONDJ5X7CLPK2SGQMVPBLHMW27A","target":"record","payload":{"canonical_record":{"source":{"id":"2405.01984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-03T10:37:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa94b8e3576cbeb9580d8dea69bc0920fbbcdee25c9ee703557f777f0fb4ac68","abstract_canon_sha256":"749500635765bb48e324aec22a1c416751541c85f1d5b035f8bce42a8a8fba59"},"schema_version":"1.0"},"canonical_sha256":"73469edfe25bd5a91a0cabc2b3b2daf816d9e2b05ed48c0949fb125c6a2a633a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:05.237663Z","signature_b64":"OkBcpGTB/F8MKkRTk0vWbaSK1bAz0RZlh8Mgz5QLeicfkptUS0v6E06Q5MIdua5Tt4e/6bSHJSABIgV+hfIdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73469edfe25bd5a91a0cabc2b3b2daf816d9e2b05ed48c0949fb125c6a2a633a","last_reissued_at":"2026-07-05T08:15:05.237168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:05.237168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.01984","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-05T08:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZO3PiUc9E6n/JGSe0D1pM7YehhWSGFQf3wKcKTvSQiLf6r89OEAXDLmBy6PTZbZ6btXdbR5wpVxDiEq5wM4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:37:55.896898Z"},"content_sha256":"8fbceb00cdd47248e55e360745941a528be406324501f75b5e156609121b56d1","schema_version":"1.0","event_id":"sha256:8fbceb00cdd47248e55e360745941a528be406324501f75b5e156609121b56d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ONDJ5X7CLPK2SGQMVPBLHMW27A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Ksenija Stepanovic, Mathijs de Weerdt, Wendelin B\\\"ohmer","submitted_at":"2024-05-03T10:37:34Z","abstract_excerpt":"Traditional mathematical programming solvers require long computational times to solve constrained minimization problems of complex and large-scale physical systems. Therefore, these problems are often transformed into unconstrained ones, and solved with computationally efficient optimization approaches based on first-order information, such as the gradient descent method. However, for unconstrained problems, balancing the minimization of the objective function with the reduction of constraint violations is challenging. We consider the class of time-dependent minimization problems with increas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01984","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/2405.01984/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-05T08:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDKo/uX8hmzqGBw2Ck1jD4RB+1rYbos7or2neNmag6DUVG+ANpt3pgJ6MjG7v6ga14JtOfv3VgdjuvWyv7kMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:37:55.897397Z"},"content_sha256":"a4062acd2642f41c034382b90554fe35e5a6c62f6464afdf79643d4cb3facaab","schema_version":"1.0","event_id":"sha256:a4062acd2642f41c034382b90554fe35e5a6c62f6464afdf79643d4cb3facaab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/bundle.json","state_url":"https://pith.science/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/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-08T23:37:55Z","links":{"resolver":"https://pith.science/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A","bundle":"https://pith.science/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/bundle.json","state":"https://pith.science/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONDJ5X7CLPK2SGQMVPBLHMW27A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ONDJ5X7CLPK2SGQMVPBLHMW27A","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":"749500635765bb48e324aec22a1c416751541c85f1d5b035f8bce42a8a8fba59","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-03T10:37:34Z","title_canon_sha256":"aa94b8e3576cbeb9580d8dea69bc0920fbbcdee25c9ee703557f777f0fb4ac68"},"schema_version":"1.0","source":{"id":"2405.01984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.01984","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"2405.01984v1","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01984","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"ONDJ5X7CLPK2","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_16","alias_value":"ONDJ5X7CLPK2SGQM","created_at":"2026-07-05T08:15:05Z"},{"alias_kind":"pith_short_8","alias_value":"ONDJ5X7C","created_at":"2026-07-05T08:15:05Z"}],"graph_snapshots":[{"event_id":"sha256:a4062acd2642f41c034382b90554fe35e5a6c62f6464afdf79643d4cb3facaab","target":"graph","created_at":"2026-07-05T08:15:05Z","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/2405.01984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditional mathematical programming solvers require long computational times to solve constrained minimization problems of complex and large-scale physical systems. Therefore, these problems are often transformed into unconstrained ones, and solved with computationally efficient optimization approaches based on first-order information, such as the gradient descent method. However, for unconstrained problems, balancing the minimization of the objective function with the reduction of constraint violations is challenging. We consider the class of time-dependent minimization problems with increas","authors_text":"Ksenija Stepanovic, Mathijs de Weerdt, Wendelin B\\\"ohmer","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-03T10:37:34Z","title":"A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01984","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:8fbceb00cdd47248e55e360745941a528be406324501f75b5e156609121b56d1","target":"record","created_at":"2026-07-05T08:15:05Z","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":"749500635765bb48e324aec22a1c416751541c85f1d5b035f8bce42a8a8fba59","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-03T10:37:34Z","title_canon_sha256":"aa94b8e3576cbeb9580d8dea69bc0920fbbcdee25c9ee703557f777f0fb4ac68"},"schema_version":"1.0","source":{"id":"2405.01984","kind":"arxiv","version":1}},"canonical_sha256":"73469edfe25bd5a91a0cabc2b3b2daf816d9e2b05ed48c0949fb125c6a2a633a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73469edfe25bd5a91a0cabc2b3b2daf816d9e2b05ed48c0949fb125c6a2a633a","first_computed_at":"2026-07-05T08:15:05.237168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:15:05.237168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OkBcpGTB/F8MKkRTk0vWbaSK1bAz0RZlh8Mgz5QLeicfkptUS0v6E06Q5MIdua5Tt4e/6bSHJSABIgV+hfIdBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:15:05.237663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.01984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbceb00cdd47248e55e360745941a528be406324501f75b5e156609121b56d1","sha256:a4062acd2642f41c034382b90554fe35e5a6c62f6464afdf79643d4cb3facaab"],"state_sha256":"9b47b95a481f5e4641ba3a9b27943756426ef1e9dea0508c2b3ae0457c853ae6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/U+Hz9E8I+NDhm+Qp+BspHxg+422VHQ38eEk1HbTKjrhJUxf6WU7t9wmFvksGtwWk5W9FyRPYkYSVbqMWsNoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:37:55.901606Z","bundle_sha256":"fe6517f9da6599a84572f9d190acced6c37733987fbe78b0ad21b35295d45663"}}