{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5RI3527U4AUAS3PUCOKS2733VZ","short_pith_number":"pith:5RI3527U","canonical_record":{"source":{"id":"1107.5841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-28T22:24:08Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d2fcfc1f2f411d669310bfe975d0116012b1cdb979dacf6f31d77ae28514c9f4","abstract_canon_sha256":"99fc7e1708dac391b00bc57fef8f7d6daeb2e1fc8d80a189b71d336e0269b099"},"schema_version":"1.0"},"canonical_sha256":"ec51beebf4e028096df413952d7f7bae596ccb5fb6773b67e0cf20da06906dbc","source":{"kind":"arxiv","id":"1107.5841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5841","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5841v1","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5841","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"5RI3527U4AUA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5RI3527U4AUAS3PU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5RI3527U","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5RI3527U4AUAS3PUCOKS2733VZ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-28T22:24:08Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d2fcfc1f2f411d669310bfe975d0116012b1cdb979dacf6f31d77ae28514c9f4","abstract_canon_sha256":"99fc7e1708dac391b00bc57fef8f7d6daeb2e1fc8d80a189b71d336e0269b099"},"schema_version":"1.0"},"canonical_sha256":"ec51beebf4e028096df413952d7f7bae596ccb5fb6773b67e0cf20da06906dbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:40.449035Z","signature_b64":"VE/4DTr8Dp6cHvQBc45aQZA4pknOiBXcCRqLdKBzj3UkWVMVHZ0KACqIaajdUQjlS+WcYmMU3lXSMfwcrhD6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec51beebf4e028096df413952d7f7bae596ccb5fb6773b67e0cf20da06906dbc","last_reissued_at":"2026-05-18T04:16:40.448272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:40.448272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5841","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-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zOm42vRuKOssZxzf8Uk8SaftsOciPbRfYe5M3JxAnH+LLQaVRPqTunjjnh3G6BNRGJK36nRmhS5WG7YBQVsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:38:39.455049Z"},"content_sha256":"992a11036208c43488abdf5f1d479504bf8076856d162bcdc028d8f5e005f58f","schema_version":"1.0","event_id":"sha256:992a11036208c43488abdf5f1d479504bf8076856d162bcdc028d8f5e005f58f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5RI3527U4AUAS3PUCOKS2733VZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Moritz Diehl, Tran Dinh Quoc","submitted_at":"2011-07-28T22:24:08Z","abstract_excerpt":"This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we combine the proposed algorithm with a relaxation technique to handle inconsistent linearizations. Numerical tests are performed to investigate the behaviour of the class of algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5841","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-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olg0fBpXG8X2oltHik6gsVEOsdsNW/1banDoA5rR1XNc2Lhu+I7XYFacOf6kCQDgCWGZbgi99IyYNqdSmQUgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:38:39.455418Z"},"content_sha256":"c7f5676c49a77fc5460e8f2be18a89a05d665ed5a1f24f19576ccd5f71ed5101","schema_version":"1.0","event_id":"sha256:c7f5676c49a77fc5460e8f2be18a89a05d665ed5a1f24f19576ccd5f71ed5101"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RI3527U4AUAS3PUCOKS2733VZ/bundle.json","state_url":"https://pith.science/pith/5RI3527U4AUAS3PUCOKS2733VZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RI3527U4AUAS3PUCOKS2733VZ/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-01T23:38:39Z","links":{"resolver":"https://pith.science/pith/5RI3527U4AUAS3PUCOKS2733VZ","bundle":"https://pith.science/pith/5RI3527U4AUAS3PUCOKS2733VZ/bundle.json","state":"https://pith.science/pith/5RI3527U4AUAS3PUCOKS2733VZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RI3527U4AUAS3PUCOKS2733VZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5RI3527U4AUAS3PUCOKS2733VZ","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":"99fc7e1708dac391b00bc57fef8f7d6daeb2e1fc8d80a189b71d336e0269b099","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-28T22:24:08Z","title_canon_sha256":"d2fcfc1f2f411d669310bfe975d0116012b1cdb979dacf6f31d77ae28514c9f4"},"schema_version":"1.0","source":{"id":"1107.5841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5841","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5841v1","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5841","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"5RI3527U4AUA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5RI3527U4AUAS3PU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5RI3527U","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c7f5676c49a77fc5460e8f2be18a89a05d665ed5a1f24f19576ccd5f71ed5101","target":"graph","created_at":"2026-05-18T04:16:40Z","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":"This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we combine the proposed algorithm with a relaxation technique to handle inconsistent linearizations. Numerical tests are performed to investigate the behaviour of the class of algorithms.","authors_text":"Moritz Diehl, Tran Dinh Quoc","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-28T22:24:08Z","title":"Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5841","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:992a11036208c43488abdf5f1d479504bf8076856d162bcdc028d8f5e005f58f","target":"record","created_at":"2026-05-18T04:16:40Z","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":"99fc7e1708dac391b00bc57fef8f7d6daeb2e1fc8d80a189b71d336e0269b099","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-28T22:24:08Z","title_canon_sha256":"d2fcfc1f2f411d669310bfe975d0116012b1cdb979dacf6f31d77ae28514c9f4"},"schema_version":"1.0","source":{"id":"1107.5841","kind":"arxiv","version":1}},"canonical_sha256":"ec51beebf4e028096df413952d7f7bae596ccb5fb6773b67e0cf20da06906dbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec51beebf4e028096df413952d7f7bae596ccb5fb6773b67e0cf20da06906dbc","first_computed_at":"2026-05-18T04:16:40.448272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:40.448272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VE/4DTr8Dp6cHvQBc45aQZA4pknOiBXcCRqLdKBzj3UkWVMVHZ0KACqIaajdUQjlS+WcYmMU3lXSMfwcrhD6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:40.449035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:992a11036208c43488abdf5f1d479504bf8076856d162bcdc028d8f5e005f58f","sha256:c7f5676c49a77fc5460e8f2be18a89a05d665ed5a1f24f19576ccd5f71ed5101"],"state_sha256":"63a9b9637d87e10b4dff5df33659422a2bae1adffb5a42ca43df71fc009aae46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EXuiH+D8vb61kkgKc5+tI0GFmUrDMsmJJeqWKT/TrGI+I/F/wQ3p5Dk7Z4rJH/gFLGJTQIXUgZe7qS4YairDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:38:39.457430Z","bundle_sha256":"96277e3456f557842b07f09f6daabb4b865c618b60b5bface649bd3fa50651c1"}}