{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MTRTDCUCCEB3SEJR62A7BU77US","short_pith_number":"pith:MTRTDCUC","canonical_record":{"source":{"id":"1909.01778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-04T13:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"90f3e4ac6d2807ff186cc2066680f831faed35e6940204a8fb7d81eeb92cbede","abstract_canon_sha256":"a607a9774e66e39a66a0b5a3ab411e3cabbe2ff485bac163ed620f7ef368bfa0"},"schema_version":"1.0"},"canonical_sha256":"64e3318a821103b91131f681f0d3ffa4a9a5c6f1128385505c053a8d5aee863c","source":{"kind":"arxiv","id":"1909.01778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01778","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01778v1","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01778","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"MTRTDCUCCEB3","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_16","alias_value":"MTRTDCUCCEB3SEJR","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_8","alias_value":"MTRTDCUC","created_at":"2026-07-05T00:02:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MTRTDCUCCEB3SEJR62A7BU77US","target":"record","payload":{"canonical_record":{"source":{"id":"1909.01778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-04T13:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"90f3e4ac6d2807ff186cc2066680f831faed35e6940204a8fb7d81eeb92cbede","abstract_canon_sha256":"a607a9774e66e39a66a0b5a3ab411e3cabbe2ff485bac163ed620f7ef368bfa0"},"schema_version":"1.0"},"canonical_sha256":"64e3318a821103b91131f681f0d3ffa4a9a5c6f1128385505c053a8d5aee863c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:19.857509Z","signature_b64":"aIkfAzTZrFDAAvZKC2d11/D/zv9+GxF4E45RFZugSjBVcxyDioz8AazXrELCcjFrEQ80IC5gRYMqZVa51xfBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e3318a821103b91131f681f0d3ffa4a9a5c6f1128385505c053a8d5aee863c","last_reissued_at":"2026-07-05T00:02:19.857115Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:19.857115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.01778","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-05T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhMrLl/yCwjDy7FrNDJ6Bfd0laOlaQM2Ju1oGUTu8L9Mrygrb7/tdtVv2eIgSuVrKx3GQkAWylkmnWdWW95JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:06:23.914746Z"},"content_sha256":"b3e656097de52f0c3db1e88ae649504b40ef18c3cdc9b55f824198b7b8d34ef2","schema_version":"1.0","event_id":"sha256:b3e656097de52f0c3db1e88ae649504b40ef18c3cdc9b55f824198b7b8d34ef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MTRTDCUCCEB3SEJR62A7BU77US","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Convex Restriction and its Applications in Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dongchan Lee, Jean-Jacques Slotine, Konstantin Turitsyn","submitted_at":"2019-09-04T13:16:52Z","abstract_excerpt":"This paper presents a convex sufficient condition for solving a system of nonlinear equations under parametric changes and proposes a sequential convex optimization method for solving robust optimization problems with nonlinear equality constraints. By bounding the nonlinearity with concave envelopes and using Brouwer's fixed point theorem, the sufficient condition is expressed in terms of closed-form convex inequality constraints. We extend the result to provide a convex sufficient condition for feasibility under bounded uncertainty. Using these conditions, a non-convex optimization problem c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01778","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/1909.01778/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-05T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwVBJiliAjkM851FpToL2w84oPuW3/ewCmXRusklQGLbs1QePZRe82TDzvsdyHex4pOoEEwuhUXhVAOynewYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:06:23.915285Z"},"content_sha256":"c1516bc1b9e4d2d7bd8b04346ff110c812191e5ef2596032c2d33b99222850e4","schema_version":"1.0","event_id":"sha256:c1516bc1b9e4d2d7bd8b04346ff110c812191e5ef2596032c2d33b99222850e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTRTDCUCCEB3SEJR62A7BU77US/bundle.json","state_url":"https://pith.science/pith/MTRTDCUCCEB3SEJR62A7BU77US/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTRTDCUCCEB3SEJR62A7BU77US/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-14T23:06:23Z","links":{"resolver":"https://pith.science/pith/MTRTDCUCCEB3SEJR62A7BU77US","bundle":"https://pith.science/pith/MTRTDCUCCEB3SEJR62A7BU77US/bundle.json","state":"https://pith.science/pith/MTRTDCUCCEB3SEJR62A7BU77US/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTRTDCUCCEB3SEJR62A7BU77US/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MTRTDCUCCEB3SEJR62A7BU77US","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":"a607a9774e66e39a66a0b5a3ab411e3cabbe2ff485bac163ed620f7ef368bfa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-04T13:16:52Z","title_canon_sha256":"90f3e4ac6d2807ff186cc2066680f831faed35e6940204a8fb7d81eeb92cbede"},"schema_version":"1.0","source":{"id":"1909.01778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01778","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01778v1","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01778","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"MTRTDCUCCEB3","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_16","alias_value":"MTRTDCUCCEB3SEJR","created_at":"2026-07-05T00:02:19Z"},{"alias_kind":"pith_short_8","alias_value":"MTRTDCUC","created_at":"2026-07-05T00:02:19Z"}],"graph_snapshots":[{"event_id":"sha256:c1516bc1b9e4d2d7bd8b04346ff110c812191e5ef2596032c2d33b99222850e4","target":"graph","created_at":"2026-07-05T00:02:19Z","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/1909.01778/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a convex sufficient condition for solving a system of nonlinear equations under parametric changes and proposes a sequential convex optimization method for solving robust optimization problems with nonlinear equality constraints. By bounding the nonlinearity with concave envelopes and using Brouwer's fixed point theorem, the sufficient condition is expressed in terms of closed-form convex inequality constraints. We extend the result to provide a convex sufficient condition for feasibility under bounded uncertainty. Using these conditions, a non-convex optimization problem c","authors_text":"Dongchan Lee, Jean-Jacques Slotine, Konstantin Turitsyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-04T13:16:52Z","title":"Sequential Convex Restriction and its Applications in Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01778","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:b3e656097de52f0c3db1e88ae649504b40ef18c3cdc9b55f824198b7b8d34ef2","target":"record","created_at":"2026-07-05T00:02:19Z","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":"a607a9774e66e39a66a0b5a3ab411e3cabbe2ff485bac163ed620f7ef368bfa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-04T13:16:52Z","title_canon_sha256":"90f3e4ac6d2807ff186cc2066680f831faed35e6940204a8fb7d81eeb92cbede"},"schema_version":"1.0","source":{"id":"1909.01778","kind":"arxiv","version":1}},"canonical_sha256":"64e3318a821103b91131f681f0d3ffa4a9a5c6f1128385505c053a8d5aee863c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e3318a821103b91131f681f0d3ffa4a9a5c6f1128385505c053a8d5aee863c","first_computed_at":"2026-07-05T00:02:19.857115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:19.857115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIkfAzTZrFDAAvZKC2d11/D/zv9+GxF4E45RFZugSjBVcxyDioz8AazXrELCcjFrEQ80IC5gRYMqZVa51xfBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:19.857509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e656097de52f0c3db1e88ae649504b40ef18c3cdc9b55f824198b7b8d34ef2","sha256:c1516bc1b9e4d2d7bd8b04346ff110c812191e5ef2596032c2d33b99222850e4"],"state_sha256":"26c0d1d72c0f7e1eca49282f23bb37af3f07aa30aaa25618e9d25fcf2a7c3bc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHwLLpFLEmVwqhgZjZVHlU+QnhXWuUDABm8O6Ne7mQuFviGkBMdPly2rMon6CK9uwRc2kL379pGDDYWfdNxYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T23:06:23.918828Z","bundle_sha256":"1b5aa4147ed2720c93b5c26357841db9d36bbf7b64ace50567071c70f4837c52"}}