{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:665FUZMQSPYCBUJXMGIPOPI4ZH","short_pith_number":"pith:665FUZMQ","canonical_record":{"source":{"id":"1809.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T10:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"ffd36539f7e41f9a147c0706a8718a49e7253b8d6d19561fccb052701102bb4c","abstract_canon_sha256":"51854e4f5d1c7563c34a383604991b3faba2a867a1691fc6c0494b146ccc2c2d"},"schema_version":"1.0"},"canonical_sha256":"f7ba5a659093f020d1376190f73d1cc9e35f01a2fae14fa0b77cb740c9531c0d","source":{"kind":"arxiv","id":"1809.02388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02388","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02388v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02388","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"665FUZMQSPYC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"665FUZMQSPYCBUJX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"665FUZMQ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:665FUZMQSPYCBUJXMGIPOPI4ZH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T10:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"ffd36539f7e41f9a147c0706a8718a49e7253b8d6d19561fccb052701102bb4c","abstract_canon_sha256":"51854e4f5d1c7563c34a383604991b3faba2a867a1691fc6c0494b146ccc2c2d"},"schema_version":"1.0"},"canonical_sha256":"f7ba5a659093f020d1376190f73d1cc9e35f01a2fae14fa0b77cb740c9531c0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.261416Z","signature_b64":"S65IHw6J4HhxKER6jMQh/iQWIb/L76qWMh4PYj/iU3h/QCsH8UGTw2OQav/CHUTztvF6f9FjNoKV+kYDtx3MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ba5a659093f020d1376190f73d1cc9e35f01a2fae14fa0b77cb740c9531c0d","last_reissued_at":"2026-05-18T00:06:17.260775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.260775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02388","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-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dOqzixbVc/QlQ0ZcTMq+aBDXQVcNuvzcEL9YAH1A7SDb6PUwsdztCcjgwQS2cLpkXl+3cOOIiriFt00jBH/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:39.381967Z"},"content_sha256":"40b8d0f6927ab57eee34e899f7dac7a08bf51ce270eed8dd4455d84f78634e8e","schema_version":"1.0","event_id":"sha256:40b8d0f6927ab57eee34e899f7dac7a08bf51ce270eed8dd4455d84f78634e8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:665FUZMQSPYCBUJXMGIPOPI4ZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxation schemes for mathematical programs with switching constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Kanzow, Daniel Steck, Patrick Mehlitz","submitted_at":"2018-09-07T10:12:09Z","abstract_excerpt":"Switching-constrained optimization problems form a difficult class of mathematical programs since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why the application of standard methods from nonlinear programming does not seem to be promising in order to solve such problems. In this paper, we adapt the relaxation method from Kanzow and Schwartz (SIAM J. Optim., 23(2):770-798, 2013) for the numerical treatment of mathematical programs with complementarity constraints to the setting of switching-constrained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02388","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-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q1cXjWfd0WTE028rMgZoDUDKCVCZD4efOyBZDxl+L0ijslqFpiI14Ns6iy+swDseZ9lc/7SGGgHnQUADyW7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:39.382417Z"},"content_sha256":"d993df8b8f8c7c9164dfe1ea676913ec94b903fd18b5d59296935ac4f575d327","schema_version":"1.0","event_id":"sha256:d993df8b8f8c7c9164dfe1ea676913ec94b903fd18b5d59296935ac4f575d327"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/bundle.json","state_url":"https://pith.science/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/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-05-26T08:33:39Z","links":{"resolver":"https://pith.science/pith/665FUZMQSPYCBUJXMGIPOPI4ZH","bundle":"https://pith.science/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/bundle.json","state":"https://pith.science/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/665FUZMQSPYCBUJXMGIPOPI4ZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:665FUZMQSPYCBUJXMGIPOPI4ZH","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":"51854e4f5d1c7563c34a383604991b3faba2a867a1691fc6c0494b146ccc2c2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T10:12:09Z","title_canon_sha256":"ffd36539f7e41f9a147c0706a8718a49e7253b8d6d19561fccb052701102bb4c"},"schema_version":"1.0","source":{"id":"1809.02388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02388","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02388v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02388","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"665FUZMQSPYC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"665FUZMQSPYCBUJX","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"665FUZMQ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:d993df8b8f8c7c9164dfe1ea676913ec94b903fd18b5d59296935ac4f575d327","target":"graph","created_at":"2026-05-18T00:06:17Z","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":"Switching-constrained optimization problems form a difficult class of mathematical programs since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why the application of standard methods from nonlinear programming does not seem to be promising in order to solve such problems. In this paper, we adapt the relaxation method from Kanzow and Schwartz (SIAM J. Optim., 23(2):770-798, 2013) for the numerical treatment of mathematical programs with complementarity constraints to the setting of switching-constrained","authors_text":"Christian Kanzow, Daniel Steck, Patrick Mehlitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T10:12:09Z","title":"Relaxation schemes for mathematical programs with switching constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02388","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:40b8d0f6927ab57eee34e899f7dac7a08bf51ce270eed8dd4455d84f78634e8e","target":"record","created_at":"2026-05-18T00:06:17Z","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":"51854e4f5d1c7563c34a383604991b3faba2a867a1691fc6c0494b146ccc2c2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T10:12:09Z","title_canon_sha256":"ffd36539f7e41f9a147c0706a8718a49e7253b8d6d19561fccb052701102bb4c"},"schema_version":"1.0","source":{"id":"1809.02388","kind":"arxiv","version":1}},"canonical_sha256":"f7ba5a659093f020d1376190f73d1cc9e35f01a2fae14fa0b77cb740c9531c0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7ba5a659093f020d1376190f73d1cc9e35f01a2fae14fa0b77cb740c9531c0d","first_computed_at":"2026-05-18T00:06:17.260775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.260775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S65IHw6J4HhxKER6jMQh/iQWIb/L76qWMh4PYj/iU3h/QCsH8UGTw2OQav/CHUTztvF6f9FjNoKV+kYDtx3MCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.261416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40b8d0f6927ab57eee34e899f7dac7a08bf51ce270eed8dd4455d84f78634e8e","sha256:d993df8b8f8c7c9164dfe1ea676913ec94b903fd18b5d59296935ac4f575d327"],"state_sha256":"367a93bd77e8091ff67a0584ddf0a8df6afb9f34c2fb54c95503f950f5b68877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIj2bd21ZnuRB470SeezETUEDQvFC70blDaGydi9pS8/bXMxk29odNJCzGP9LF29Rxik7eVtI825XJ6kove/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:33:39.385916Z","bundle_sha256":"e7b1cdc7bc9f69411e60d4a4079921e54d637f00bfcc4e92be114c8489c5234a"}}