{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OU2UZI7AN5J5IILVGELSCAVS7O","short_pith_number":"pith:OU2UZI7A","canonical_record":{"source":{"id":"1811.08122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-20T08:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"51c45fe2e8cf82604aa791ccc43e2eeba52376df1917ffe7dd1a90a7d0f50c1a","abstract_canon_sha256":"53d9e696a8c086ce79fbd06503f27fcffb28b187514f7cabea533d6f4f08aab1"},"schema_version":"1.0"},"canonical_sha256":"75354ca3e06f53d4217531172102b2fb9dfd2221ddd56856707f1659b5a07625","source":{"kind":"arxiv","id":"1811.08122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08122","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08122v1","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08122","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"pith_short_12","alias_value":"OU2UZI7AN5J5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OU2UZI7AN5J5IILV","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OU2UZI7A","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OU2UZI7AN5J5IILVGELSCAVS7O","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-20T08:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"51c45fe2e8cf82604aa791ccc43e2eeba52376df1917ffe7dd1a90a7d0f50c1a","abstract_canon_sha256":"53d9e696a8c086ce79fbd06503f27fcffb28b187514f7cabea533d6f4f08aab1"},"schema_version":"1.0"},"canonical_sha256":"75354ca3e06f53d4217531172102b2fb9dfd2221ddd56856707f1659b5a07625","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:16.836515Z","signature_b64":"h5HMvwJxm4bHym1Aa+J47k5SMt8wXw7Ht1UbNx1IXjmJCpx3+NQ2ddgTAc+KjxnXnTG5BW/Z970vK18YpaToAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75354ca3e06f53d4217531172102b2fb9dfd2221ddd56856707f1659b5a07625","last_reissued_at":"2026-05-18T00:00:16.835801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:16.835801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08122","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:00:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ia9lj1XR8z1iR4KobZ98TaDupmTnoMvMfQjjtCPh57hGFrKhkm+2wn2sM1cayPKL43+YTarYkG2IKlt8NfgPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:30:07.188127Z"},"content_sha256":"1eba9505b55e746edfed2de65820bfe327117961832704269b96acd514395c97","schema_version":"1.0","event_id":"sha256:1eba9505b55e746edfed2de65820bfe327117961832704269b96acd514395c97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OU2UZI7AN5J5IILVGELSCAVS7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongbo Dong, Yunqi Luo","submitted_at":"2018-11-20T08:40:28Z","abstract_excerpt":"Decades of advances in mixed-integer linear programming (MILP) and recent development in mixed-integer second-order-cone programming (MISOCP) have translated very mildly to progresses in global solving nonconvex mixed-integer quadratically constrained programs (MIQCP). In this paper we propose a new approach, namely Compact Disjunctive Approximation (CDA), to approximate nonconvex MIQCP to arbitrary precision by \\textit{convex} MIQCPs, which can be solved by MISOCP solvers. For nonconvex MIQCP with $n$ variables and $m$ general quadratic constraints, our method yields relaxations with at most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08122","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:00:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28kS7UjXc1ARoG2mwSnOyYaTrj6vJEEFSGls4gozQrjWFHG0doywNddBQ6nzP1W7xvahKq0VjuHtJ9WmQl0jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:30:07.188776Z"},"content_sha256":"da5b0431d1ffc9620ebef551b873f319615706d1165792f22ca06e19d1436860","schema_version":"1.0","event_id":"sha256:da5b0431d1ffc9620ebef551b873f319615706d1165792f22ca06e19d1436860"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OU2UZI7AN5J5IILVGELSCAVS7O/bundle.json","state_url":"https://pith.science/pith/OU2UZI7AN5J5IILVGELSCAVS7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OU2UZI7AN5J5IILVGELSCAVS7O/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-09T01:30:07Z","links":{"resolver":"https://pith.science/pith/OU2UZI7AN5J5IILVGELSCAVS7O","bundle":"https://pith.science/pith/OU2UZI7AN5J5IILVGELSCAVS7O/bundle.json","state":"https://pith.science/pith/OU2UZI7AN5J5IILVGELSCAVS7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OU2UZI7AN5J5IILVGELSCAVS7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OU2UZI7AN5J5IILVGELSCAVS7O","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":"53d9e696a8c086ce79fbd06503f27fcffb28b187514f7cabea533d6f4f08aab1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-20T08:40:28Z","title_canon_sha256":"51c45fe2e8cf82604aa791ccc43e2eeba52376df1917ffe7dd1a90a7d0f50c1a"},"schema_version":"1.0","source":{"id":"1811.08122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08122","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08122v1","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08122","created_at":"2026-05-18T00:00:16Z"},{"alias_kind":"pith_short_12","alias_value":"OU2UZI7AN5J5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OU2UZI7AN5J5IILV","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OU2UZI7A","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:da5b0431d1ffc9620ebef551b873f319615706d1165792f22ca06e19d1436860","target":"graph","created_at":"2026-05-18T00:00:16Z","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":"Decades of advances in mixed-integer linear programming (MILP) and recent development in mixed-integer second-order-cone programming (MISOCP) have translated very mildly to progresses in global solving nonconvex mixed-integer quadratically constrained programs (MIQCP). In this paper we propose a new approach, namely Compact Disjunctive Approximation (CDA), to approximate nonconvex MIQCP to arbitrary precision by \\textit{convex} MIQCPs, which can be solved by MISOCP solvers. For nonconvex MIQCP with $n$ variables and $m$ general quadratic constraints, our method yields relaxations with at most ","authors_text":"Hongbo Dong, Yunqi Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-20T08:40:28Z","title":"Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08122","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:1eba9505b55e746edfed2de65820bfe327117961832704269b96acd514395c97","target":"record","created_at":"2026-05-18T00:00:16Z","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":"53d9e696a8c086ce79fbd06503f27fcffb28b187514f7cabea533d6f4f08aab1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-20T08:40:28Z","title_canon_sha256":"51c45fe2e8cf82604aa791ccc43e2eeba52376df1917ffe7dd1a90a7d0f50c1a"},"schema_version":"1.0","source":{"id":"1811.08122","kind":"arxiv","version":1}},"canonical_sha256":"75354ca3e06f53d4217531172102b2fb9dfd2221ddd56856707f1659b5a07625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75354ca3e06f53d4217531172102b2fb9dfd2221ddd56856707f1659b5a07625","first_computed_at":"2026-05-18T00:00:16.835801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:16.835801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h5HMvwJxm4bHym1Aa+J47k5SMt8wXw7Ht1UbNx1IXjmJCpx3+NQ2ddgTAc+KjxnXnTG5BW/Z970vK18YpaToAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:16.836515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eba9505b55e746edfed2de65820bfe327117961832704269b96acd514395c97","sha256:da5b0431d1ffc9620ebef551b873f319615706d1165792f22ca06e19d1436860"],"state_sha256":"c6ca6111cf35ae072104ce68c9f612d5f1d112d0fa1139ee505cf6c42c8a2f21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eWK763fYEIZhAlHF10WtXvH5A9OjZHay6CE9hhEfLdKVZiRW3rwUxUM93aOQlRqy2IlIn9yUfG1FpGXTr2xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:30:07.192268Z","bundle_sha256":"6cab42c774058672609b9708a81368f216f6bca6c1e25c1f5c62d0b204a74ca3"}}