{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PYQLPU2GVTD6LZ457R2GHLWGBE","short_pith_number":"pith:PYQLPU2G","canonical_record":{"source":{"id":"1905.01893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"8027c51c1eda0c793e6eedc4974580af4ba64594da37a5f99d61867a21bed994","abstract_canon_sha256":"7dcbc9ddb03021b33388138202bb3cf1694f0d90dd28b84c3b6ae824fa225c18"},"schema_version":"1.0"},"canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","source":{"kind":"arxiv","id":"1905.01893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01893","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01893v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01893","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"PYQLPU2GVTD6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYQLPU2GVTD6LZ45","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYQLPU2G","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PYQLPU2GVTD6LZ457R2GHLWGBE","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"8027c51c1eda0c793e6eedc4974580af4ba64594da37a5f99d61867a21bed994","abstract_canon_sha256":"7dcbc9ddb03021b33388138202bb3cf1694f0d90dd28b84c3b6ae824fa225c18"},"schema_version":"1.0"},"canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.073761Z","signature_b64":"rLi7AnaYaIBdeBsHnC8ukdqxXJklfLNkdiVDYYLJHUrIL8G7YEORFxuMdj1EpgKvv58jqUGjuZpvLAug531qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","last_reissued_at":"2026-05-17T23:46:57.072995Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.072995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01893","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-05-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sku4sUyfhtXASf7Vmv131yrey8idopQVhbjKhMuqJ5Hysh4PLgaMaC5kgb6QiaGnOinvNZn7QrSk1RhUw+onCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:22:01.323749Z"},"content_sha256":"e164d2d3cee45ac8cee1cf3b230f2cf56df925f883ecaa2aecf3754d2fd595a3","schema_version":"1.0","event_id":"sha256:e164d2d3cee45ac8cee1cf3b230f2cf56df925f883ecaa2aecf3754d2fd595a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PYQLPU2GVTD6LZ457R2GHLWGBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A comparison of first-order methods for the numerical solution of or-constrained optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Patrick Mehlitz","submitted_at":"2019-05-06T09:19:22Z","abstract_excerpt":"Mathematical programs with or-constraints form a new class of disjunctive optimization problems with inherent practical relevance. In this paper, we provide a comparison of three different first-order methods for the numerical treatment of this problem class which are inspired by classical approaches from disjunctive programming. First, we study the replacement of the or-constraints as nonlinear inequality constraints using suitable NCP-functions. Second, we transfer the or-constrained program into a mathematical program with switching or complementarity constraints which can be treated with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01893","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":""},"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-05-17T23:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5ZDbaBYGykFiTJRzWFUg4tO/qloiNhg+MUADeEo7PCFu0Jfi1/VQy9hXhA9yNR+6p65hUDwNOiWduRceAzMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:22:01.324085Z"},"content_sha256":"2033e375d3e900ebf281b343c972526c183e1c0c51933f141dd4c696bad8bb64","schema_version":"1.0","event_id":"sha256:2033e375d3e900ebf281b343c972526c183e1c0c51933f141dd4c696bad8bb64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/bundle.json","state_url":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/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-06-21T19:22:01Z","links":{"resolver":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE","bundle":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/bundle.json","state":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PYQLPU2GVTD6LZ457R2GHLWGBE","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":"7dcbc9ddb03021b33388138202bb3cf1694f0d90dd28b84c3b6ae824fa225c18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","title_canon_sha256":"8027c51c1eda0c793e6eedc4974580af4ba64594da37a5f99d61867a21bed994"},"schema_version":"1.0","source":{"id":"1905.01893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01893","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01893v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01893","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"PYQLPU2GVTD6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYQLPU2GVTD6LZ45","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYQLPU2G","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2033e375d3e900ebf281b343c972526c183e1c0c51933f141dd4c696bad8bb64","target":"graph","created_at":"2026-05-17T23:46:57Z","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"},"paper":{"abstract_excerpt":"Mathematical programs with or-constraints form a new class of disjunctive optimization problems with inherent practical relevance. In this paper, we provide a comparison of three different first-order methods for the numerical treatment of this problem class which are inspired by classical approaches from disjunctive programming. First, we study the replacement of the or-constraints as nonlinear inequality constraints using suitable NCP-functions. Second, we transfer the or-constrained program into a mathematical program with switching or complementarity constraints which can be treated with t","authors_text":"Patrick Mehlitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","title":"A comparison of first-order methods for the numerical solution of or-constrained optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01893","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:e164d2d3cee45ac8cee1cf3b230f2cf56df925f883ecaa2aecf3754d2fd595a3","target":"record","created_at":"2026-05-17T23:46:57Z","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":"7dcbc9ddb03021b33388138202bb3cf1694f0d90dd28b84c3b6ae824fa225c18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","title_canon_sha256":"8027c51c1eda0c793e6eedc4974580af4ba64594da37a5f99d61867a21bed994"},"schema_version":"1.0","source":{"id":"1905.01893","kind":"arxiv","version":1}},"canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","first_computed_at":"2026-05-17T23:46:57.072995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.072995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLi7AnaYaIBdeBsHnC8ukdqxXJklfLNkdiVDYYLJHUrIL8G7YEORFxuMdj1EpgKvv58jqUGjuZpvLAug531qAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.073761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e164d2d3cee45ac8cee1cf3b230f2cf56df925f883ecaa2aecf3754d2fd595a3","sha256:2033e375d3e900ebf281b343c972526c183e1c0c51933f141dd4c696bad8bb64"],"state_sha256":"541e232827148a3f337216d84d2fcd0897641f42e3d78a18c80da6463d3c997e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdLLTadoTyewpsURYiBQyAaZpT0muioJfLF6XQW8kL+ipma8paGWXiDC1t/PXhCm5PquEiYGX8V9CR4I8amfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:22:01.326168Z","bundle_sha256":"21ae2588d783224d939e6628e7deb1a33b6bf0bfd4a689c099f65e1e60b4969b"}}