{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QXP2MUAL32BUUXATH5RMV7Z5IH","short_pith_number":"pith:QXP2MUAL","canonical_record":{"source":{"id":"2505.02495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T09:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"ff7a2dbe97287c768d0d499eadb6eb47b0c73047c31b9ad3bb96ab91c8a84f94","abstract_canon_sha256":"046502aa98f768bb50e715811794697b55cae9d3fecf121d7d67170b0de8c427"},"schema_version":"1.0"},"canonical_sha256":"85dfa6500bde834a5c133f62caff3d41d1750e86602b5edcca439361b93063d6","source":{"kind":"arxiv","id":"2505.02495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.02495","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.02495v1","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02495","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"QXP2MUAL32BU","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_16","alias_value":"QXP2MUAL32BUUXAT","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_8","alias_value":"QXP2MUAL","created_at":"2026-07-05T10:58:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QXP2MUAL32BUUXATH5RMV7Z5IH","target":"record","payload":{"canonical_record":{"source":{"id":"2505.02495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T09:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"ff7a2dbe97287c768d0d499eadb6eb47b0c73047c31b9ad3bb96ab91c8a84f94","abstract_canon_sha256":"046502aa98f768bb50e715811794697b55cae9d3fecf121d7d67170b0de8c427"},"schema_version":"1.0"},"canonical_sha256":"85dfa6500bde834a5c133f62caff3d41d1750e86602b5edcca439361b93063d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:38.018507Z","signature_b64":"ic43ua9rxfpfm1Npj9o8Pl4UWnmyMQHJkbR2Mr2i9qI40pRIV8fpRrKHZ2gRiyb9YFtjacstXURvsPRTDclZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85dfa6500bde834a5c133f62caff3d41d1750e86602b5edcca439361b93063d6","last_reissued_at":"2026-07-05T10:58:38.017952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:38.017952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.02495","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-05T10:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlpfmwtco8Ay+zymiEXzEvxLLNokCtDcX2wmq6CaKsR/Tx3hYgJPGJsS1cgqwMYwVRakH3AIp/pITuj+WYrcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:18:31.787146Z"},"content_sha256":"85d53a021e62f941efafff93bda5c4e4b9df4be512637d862c0979adab3ce705","schema_version":"1.0","event_id":"sha256:85d53a021e62f941efafff93bda5c4e4b9df4be512637d862c0979adab3ce705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QXP2MUAL32BUUXATH5RMV7Z5IH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Nachuan Xiao, Shiwei Wang, Tianyun Tang","submitted_at":"2025-05-05T09:23:21Z","abstract_excerpt":"In this paper, we consider the nonlinear constrained optimization problem (NCP) with constraint set $\\{x \\in \\mathcal{X}: c(x) = 0\\}$, where $\\mathcal{X}$ is a closed convex subset of $\\mathbb{R}^n$. We propose an exact penalty approach, named constraint dissolving approach, that transforms (NCP) into its corresponding constraint dissolving problem (CDP). The transformed problem (CDP) admits $\\mathcal{X}$ as its feasible region with a locally Lipschitz smooth objective function. We prove that (NCP) and (CDP) share the same first-order stationary points, second-order stationary points, second-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02495","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/2505.02495/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-05T10:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxOgODV/o1lt49NGCmAk2h0CeKypQE/Fo7SWUKfZ7cOlS/n1d1skp4kiZ0IQTOW0uTrOgQRwbMO9Ewc4Z7cKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:18:31.787667Z"},"content_sha256":"c87b9e4a43868ed100ec257abf95541f4e892a39411e32092ca084710894f55a","schema_version":"1.0","event_id":"sha256:c87b9e4a43868ed100ec257abf95541f4e892a39411e32092ca084710894f55a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/bundle.json","state_url":"https://pith.science/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/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-11T04:18:31Z","links":{"resolver":"https://pith.science/pith/QXP2MUAL32BUUXATH5RMV7Z5IH","bundle":"https://pith.science/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/bundle.json","state":"https://pith.science/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXP2MUAL32BUUXATH5RMV7Z5IH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QXP2MUAL32BUUXATH5RMV7Z5IH","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":"046502aa98f768bb50e715811794697b55cae9d3fecf121d7d67170b0de8c427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T09:23:21Z","title_canon_sha256":"ff7a2dbe97287c768d0d499eadb6eb47b0c73047c31b9ad3bb96ab91c8a84f94"},"schema_version":"1.0","source":{"id":"2505.02495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.02495","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.02495v1","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02495","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"QXP2MUAL32BU","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_16","alias_value":"QXP2MUAL32BUUXAT","created_at":"2026-07-05T10:58:38Z"},{"alias_kind":"pith_short_8","alias_value":"QXP2MUAL","created_at":"2026-07-05T10:58:38Z"}],"graph_snapshots":[{"event_id":"sha256:c87b9e4a43868ed100ec257abf95541f4e892a39411e32092ca084710894f55a","target":"graph","created_at":"2026-07-05T10:58:38Z","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/2505.02495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the nonlinear constrained optimization problem (NCP) with constraint set $\\{x \\in \\mathcal{X}: c(x) = 0\\}$, where $\\mathcal{X}$ is a closed convex subset of $\\mathbb{R}^n$. We propose an exact penalty approach, named constraint dissolving approach, that transforms (NCP) into its corresponding constraint dissolving problem (CDP). The transformed problem (CDP) admits $\\mathcal{X}$ as its feasible region with a locally Lipschitz smooth objective function. We prove that (NCP) and (CDP) share the same first-order stationary points, second-order stationary points, second-o","authors_text":"Kim-Chuan Toh, Nachuan Xiao, Shiwei Wang, Tianyun Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T09:23:21Z","title":"An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02495","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:85d53a021e62f941efafff93bda5c4e4b9df4be512637d862c0979adab3ce705","target":"record","created_at":"2026-07-05T10:58:38Z","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":"046502aa98f768bb50e715811794697b55cae9d3fecf121d7d67170b0de8c427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T09:23:21Z","title_canon_sha256":"ff7a2dbe97287c768d0d499eadb6eb47b0c73047c31b9ad3bb96ab91c8a84f94"},"schema_version":"1.0","source":{"id":"2505.02495","kind":"arxiv","version":1}},"canonical_sha256":"85dfa6500bde834a5c133f62caff3d41d1750e86602b5edcca439361b93063d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85dfa6500bde834a5c133f62caff3d41d1750e86602b5edcca439361b93063d6","first_computed_at":"2026-07-05T10:58:38.017952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:38.017952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ic43ua9rxfpfm1Npj9o8Pl4UWnmyMQHJkbR2Mr2i9qI40pRIV8fpRrKHZ2gRiyb9YFtjacstXURvsPRTDclZCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:38.018507Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.02495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85d53a021e62f941efafff93bda5c4e4b9df4be512637d862c0979adab3ce705","sha256:c87b9e4a43868ed100ec257abf95541f4e892a39411e32092ca084710894f55a"],"state_sha256":"e1f0e80680709a4be50631fb46651a7540a1c0996ed61ce99632339250972a46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdBs1lCPNu0RDs/l0jQG6R7H+78wtjcAPVDxXOlVVl6ax7d2siCe6uaMdM4ctBv8rJ7rcchDCBXNiPCLkKnMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:18:31.791995Z","bundle_sha256":"fd6af34747fc15b2c19ac8e28b1e4bb631b9ffbcd7a07a4f89e7c5524520a3c0"}}