{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2S74QZCOXUV2C6DREEQGMNSST3","short_pith_number":"pith:2S74QZCO","canonical_record":{"source":{"id":"1502.06315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T05:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"9eaf5a3b876413185529c59c57936dab837ff0e7ec447b611baecbb9498f09f3","abstract_canon_sha256":"66e0baeddd309e1b72e74a5e768ba6ee72c6a86c7c78a79ed8c19980bbcf959f"},"schema_version":"1.0"},"canonical_sha256":"d4bfc8644ebd2ba1787121206636529eeecd98e1fd6b889740a17aa9f5f91b2e","source":{"kind":"arxiv","id":"1502.06315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06315","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06315v1","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06315","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"2S74QZCOXUV2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2S74QZCOXUV2C6DR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2S74QZCO","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2S74QZCOXUV2C6DREEQGMNSST3","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T05:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"9eaf5a3b876413185529c59c57936dab837ff0e7ec447b611baecbb9498f09f3","abstract_canon_sha256":"66e0baeddd309e1b72e74a5e768ba6ee72c6a86c7c78a79ed8c19980bbcf959f"},"schema_version":"1.0"},"canonical_sha256":"d4bfc8644ebd2ba1787121206636529eeecd98e1fd6b889740a17aa9f5f91b2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.337263Z","signature_b64":"B85XBe9dPP35DgdkWuSP0MtdYXCqdCt28CWBXUyVPESh2PtDjAYMEy7v+VO+zmFccc5wi+CKqNJoOPrlRz1WDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4bfc8644ebd2ba1787121206636529eeecd98e1fd6b889740a17aa9f5f91b2e","last_reissued_at":"2026-05-18T01:32:37.336629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.336629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06315","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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2FaL3U+3mCyi3RxuLiSdlGmJBtDIH7Rfjjx19TL0spMmpF3pE4da5kVshwkz0PuajAIvYkWzCLzJ9/9TDCdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:37:27.990902Z"},"content_sha256":"b38b08fdb57f974c246dd56bfa83ea4ae910935274b516c1d2f3b15dc1dd7969","schema_version":"1.0","event_id":"sha256:b38b08fdb57f974c246dd56bfa83ea4ae910935274b516c1d2f3b15dc1dd7969"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2S74QZCOXUV2C6DREEQGMNSST3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex mixed integer nonlinear programming problems and an outer approximation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"M. Montaz Ali, Zhou Wei","submitted_at":"2015-02-23T05:11:44Z","abstract_excerpt":"In this paper, we mainly study one class of convex mixed-integer nonlinear programming problems (MINLPs) with non-differentiable data. By dropping the differentiability assumption, we substitute gradients with subgradients obtained from KKT conditions, and use the outer approximation method to reformulate convex MINLP as one equivalent MILP master program. By solving a finite sequence of subproblems and relaxed MILP problems, we establish an outer approximation algorithm to find the optimal solution of this convex MINLP. The convergence of this algorithm is also presented. The work of this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06315","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-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGRDGaw4nDSnIdCTtAXfuG8kEb75eadO5XQ1AKuzK/4rkGB2Y+23U4KAoIKr4uNJcW6AOfgEIeR+Z09TQX0hBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:37:27.991248Z"},"content_sha256":"7c7ad1b314bd9863991d991c31188ae1f20ce81d0d6ab2a0d53c18bc14919b2c","schema_version":"1.0","event_id":"sha256:7c7ad1b314bd9863991d991c31188ae1f20ce81d0d6ab2a0d53c18bc14919b2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2S74QZCOXUV2C6DREEQGMNSST3/bundle.json","state_url":"https://pith.science/pith/2S74QZCOXUV2C6DREEQGMNSST3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2S74QZCOXUV2C6DREEQGMNSST3/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-07-01T15:37:27Z","links":{"resolver":"https://pith.science/pith/2S74QZCOXUV2C6DREEQGMNSST3","bundle":"https://pith.science/pith/2S74QZCOXUV2C6DREEQGMNSST3/bundle.json","state":"https://pith.science/pith/2S74QZCOXUV2C6DREEQGMNSST3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2S74QZCOXUV2C6DREEQGMNSST3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2S74QZCOXUV2C6DREEQGMNSST3","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":"66e0baeddd309e1b72e74a5e768ba6ee72c6a86c7c78a79ed8c19980bbcf959f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T05:11:44Z","title_canon_sha256":"9eaf5a3b876413185529c59c57936dab837ff0e7ec447b611baecbb9498f09f3"},"schema_version":"1.0","source":{"id":"1502.06315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06315","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06315v1","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06315","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"2S74QZCOXUV2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2S74QZCOXUV2C6DR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2S74QZCO","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:7c7ad1b314bd9863991d991c31188ae1f20ce81d0d6ab2a0d53c18bc14919b2c","target":"graph","created_at":"2026-05-18T01:32:37Z","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":"In this paper, we mainly study one class of convex mixed-integer nonlinear programming problems (MINLPs) with non-differentiable data. By dropping the differentiability assumption, we substitute gradients with subgradients obtained from KKT conditions, and use the outer approximation method to reformulate convex MINLP as one equivalent MILP master program. By solving a finite sequence of subproblems and relaxed MILP problems, we establish an outer approximation algorithm to find the optimal solution of this convex MINLP. The convergence of this algorithm is also presented. The work of this pap","authors_text":"M. Montaz Ali, Zhou Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T05:11:44Z","title":"Convex mixed integer nonlinear programming problems and an outer approximation algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06315","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:b38b08fdb57f974c246dd56bfa83ea4ae910935274b516c1d2f3b15dc1dd7969","target":"record","created_at":"2026-05-18T01:32:37Z","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":"66e0baeddd309e1b72e74a5e768ba6ee72c6a86c7c78a79ed8c19980bbcf959f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T05:11:44Z","title_canon_sha256":"9eaf5a3b876413185529c59c57936dab837ff0e7ec447b611baecbb9498f09f3"},"schema_version":"1.0","source":{"id":"1502.06315","kind":"arxiv","version":1}},"canonical_sha256":"d4bfc8644ebd2ba1787121206636529eeecd98e1fd6b889740a17aa9f5f91b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4bfc8644ebd2ba1787121206636529eeecd98e1fd6b889740a17aa9f5f91b2e","first_computed_at":"2026-05-18T01:32:37.336629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:37.336629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B85XBe9dPP35DgdkWuSP0MtdYXCqdCt28CWBXUyVPESh2PtDjAYMEy7v+VO+zmFccc5wi+CKqNJoOPrlRz1WDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:37.337263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38b08fdb57f974c246dd56bfa83ea4ae910935274b516c1d2f3b15dc1dd7969","sha256:7c7ad1b314bd9863991d991c31188ae1f20ce81d0d6ab2a0d53c18bc14919b2c"],"state_sha256":"727da17893aa001335017cdc96dab9527e6f83c5a78300a9693f35a20b29a900"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sS16FfrCWjmj3AyyUgS706zkDkkQYfxqmadxNNpWILLYB7z7kkhHShaHK3aedAZCuH+3pqxnoYFjovMdNFhXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:37:27.993217Z","bundle_sha256":"0b4123e07158bb326965a1967f8354d6868dc7d10727b1639dd160e314ef8725"}}