{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ACYHZK6GJG442GMYORT6Y6EHZJ","short_pith_number":"pith:ACYHZK6G","canonical_record":{"source":{"id":"1608.02096","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-06T11:35:55Z","cross_cats_sorted":[],"title_canon_sha256":"e008e0bb18d2c26e129ebc89f3e054fb462cafa8b8aea4b1a72b03b7c527a6f4","abstract_canon_sha256":"3a9bcab770f1e802f78fb90add6cafaf8abe34a9891040949ac96b29d2746bd9"},"schema_version":"1.0"},"canonical_sha256":"00b07cabc649b9cd19987467ec7887ca4e1d783a246f65a7f01d21c8fe134659","source":{"kind":"arxiv","id":"1608.02096","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02096","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02096v3","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02096","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"ACYHZK6GJG44","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ACYHZK6GJG442GMY","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ACYHZK6G","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ACYHZK6GJG442GMYORT6Y6EHZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02096","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-06T11:35:55Z","cross_cats_sorted":[],"title_canon_sha256":"e008e0bb18d2c26e129ebc89f3e054fb462cafa8b8aea4b1a72b03b7c527a6f4","abstract_canon_sha256":"3a9bcab770f1e802f78fb90add6cafaf8abe34a9891040949ac96b29d2746bd9"},"schema_version":"1.0"},"canonical_sha256":"00b07cabc649b9cd19987467ec7887ca4e1d783a246f65a7f01d21c8fe134659","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:05.276130Z","signature_b64":"MZLAj244OKbMGg/5kFFXtLFSIQDgnkQCh170aWpqdPn6Hhhr0yXPMAlP+G0skUYbMa7I+d98fWPbB+CYdS5tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00b07cabc649b9cd19987467ec7887ca4e1d783a246f65a7f01d21c8fe134659","last_reissued_at":"2026-05-18T00:35:05.275308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:05.275308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02096","source_version":3,"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:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JT+q9o4RHFU0okJLk5W9+7IRQYqu/lftiU2uQuImYzWvN3Yi/DVSyqg708r8ZqxNJRoJ9we1bE45edXhe35qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:04:31.438582Z"},"content_sha256":"5df5946c3813a364467bb443e638053bde6601f05c0859225ba8bbf7230b0ad6","schema_version":"1.0","event_id":"sha256:5df5946c3813a364467bb443e638053bde6601f05c0859225ba8bbf7230b0ad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ACYHZK6GJG442GMYORT6Y6EHZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second Order Cone Constrained Convex Relaxations for Nonconvex Quadratically Constrained Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Duan Li, Rujun Jiang","submitted_at":"2016-08-06T11:35:55Z","abstract_excerpt":"In this paper, we present new convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. While recent research has focused on strengthening convex relaxations using reformulation-linearization technique (RLT), the state-of-the-art methods lose their effectiveness when dealing with (multiple) nonconvex quadratic constraints in QCQP. In this research, we decompose and relax each nonconvex constraint to two second order cone (SOC) constraints and then linearize the products of the SOC constraints and linear constraints to construct some effective new valid c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02096","kind":"arxiv","version":3},"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:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGkaLp1BJNAyuYrz7exf0nJ7jRMad1Rmpwv1DVTpjJN2OPVhnjosDAfooRkQMHgPqW96dyHCL23Zd9faeL+nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:04:31.438916Z"},"content_sha256":"93919c94fb5247cc4c841cd56baa269b30b2a3d1e46e18624689276e512a7c44","schema_version":"1.0","event_id":"sha256:93919c94fb5247cc4c841cd56baa269b30b2a3d1e46e18624689276e512a7c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/bundle.json","state_url":"https://pith.science/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/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-29T15:04:31Z","links":{"resolver":"https://pith.science/pith/ACYHZK6GJG442GMYORT6Y6EHZJ","bundle":"https://pith.science/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/bundle.json","state":"https://pith.science/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACYHZK6GJG442GMYORT6Y6EHZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ACYHZK6GJG442GMYORT6Y6EHZJ","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":"3a9bcab770f1e802f78fb90add6cafaf8abe34a9891040949ac96b29d2746bd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-06T11:35:55Z","title_canon_sha256":"e008e0bb18d2c26e129ebc89f3e054fb462cafa8b8aea4b1a72b03b7c527a6f4"},"schema_version":"1.0","source":{"id":"1608.02096","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02096","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02096v3","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02096","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"ACYHZK6GJG44","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ACYHZK6GJG442GMY","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ACYHZK6G","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:93919c94fb5247cc4c841cd56baa269b30b2a3d1e46e18624689276e512a7c44","target":"graph","created_at":"2026-05-18T00:35:05Z","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 present new convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. While recent research has focused on strengthening convex relaxations using reformulation-linearization technique (RLT), the state-of-the-art methods lose their effectiveness when dealing with (multiple) nonconvex quadratic constraints in QCQP. In this research, we decompose and relax each nonconvex constraint to two second order cone (SOC) constraints and then linearize the products of the SOC constraints and linear constraints to construct some effective new valid c","authors_text":"Duan Li, Rujun Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-06T11:35:55Z","title":"Second Order Cone Constrained Convex Relaxations for Nonconvex Quadratically Constrained Quadratic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02096","kind":"arxiv","version":3},"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:5df5946c3813a364467bb443e638053bde6601f05c0859225ba8bbf7230b0ad6","target":"record","created_at":"2026-05-18T00:35:05Z","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":"3a9bcab770f1e802f78fb90add6cafaf8abe34a9891040949ac96b29d2746bd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-06T11:35:55Z","title_canon_sha256":"e008e0bb18d2c26e129ebc89f3e054fb462cafa8b8aea4b1a72b03b7c527a6f4"},"schema_version":"1.0","source":{"id":"1608.02096","kind":"arxiv","version":3}},"canonical_sha256":"00b07cabc649b9cd19987467ec7887ca4e1d783a246f65a7f01d21c8fe134659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00b07cabc649b9cd19987467ec7887ca4e1d783a246f65a7f01d21c8fe134659","first_computed_at":"2026-05-18T00:35:05.275308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:05.275308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZLAj244OKbMGg/5kFFXtLFSIQDgnkQCh170aWpqdPn6Hhhr0yXPMAlP+G0skUYbMa7I+d98fWPbB+CYdS5tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:05.276130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02096","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df5946c3813a364467bb443e638053bde6601f05c0859225ba8bbf7230b0ad6","sha256:93919c94fb5247cc4c841cd56baa269b30b2a3d1e46e18624689276e512a7c44"],"state_sha256":"e781b9801008baa34cfed580f7edee7ba2f47dd476273fb012d7b3ad517bfe81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN46akDJIzsgWtpjULdD+nMzj/tr8BEVlGGcFSduV3ltNYbas4Bf66/W+Ad8KfYJTmqkgBm7NFPXqPocgKxEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:04:31.440715Z","bundle_sha256":"8cc98230958b58d3ffe03ad996d9d23264bd47e9595c8986d99956f20c8039c5"}}