{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FBJU46R3X5A3232SL7T64KZKFQ","short_pith_number":"pith:FBJU46R3","schema_version":"1.0","canonical_sha256":"28534e7a3bbf41bd6f525fe7ee2b2a2c2c452a89fbc805ad74564ea8e974105e","source":{"kind":"arxiv","id":"1802.02688","version":2},"attestation_state":"computed","paper":{"title":"Exact Semidefinite Formulations for a Class of (Random and Non-Random) Nonconvex Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Samuel Burer, Yinyu Ye","submitted_at":"2018-02-08T01:46:08Z","abstract_excerpt":"We study a class of quadratically constrained quadratic programs (QCQPs), called {\\em diagonal QCQPs\\/}, which contain no off-diagonal terms $x_j x_k$ for $j \\ne k$, and we provide a sufficient condition on the problem data guaranteeing that the basic Shor semidefinite relaxation is exact. Our condition complements and refines those already present in the literature and can be checked in polynomial time. We then extend our analysis from diagonal QCQPs to general QCQPs, i.e., ones with no particular structure. By reformulating a general QCQP into diagonal form, we establish new, polynomial-time"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.02688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T01:46:08Z","cross_cats_sorted":[],"title_canon_sha256":"815cc901b5a76c458d7a2bad507d0921beba6654963956a1e6236a78b2ea97f5","abstract_canon_sha256":"9f73a2211846eceb213e1ee8b900a93450fbee5960f1d07205ceb6000155618a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:19.646120Z","signature_b64":"0Vuh/HB1Lkcs3+BxgbdV7p3RmsUbWahtp6LfxafBKAiLFEF9rwB+AfhIpNYM/qgQyEEjsw4DiGyBGzgjMGerBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28534e7a3bbf41bd6f525fe7ee2b2a2c2c452a89fbc805ad74564ea8e974105e","last_reissued_at":"2026-05-18T00:01:19.645662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:19.645662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Semidefinite Formulations for a Class of (Random and Non-Random) Nonconvex Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Samuel Burer, Yinyu Ye","submitted_at":"2018-02-08T01:46:08Z","abstract_excerpt":"We study a class of quadratically constrained quadratic programs (QCQPs), called {\\em diagonal QCQPs\\/}, which contain no off-diagonal terms $x_j x_k$ for $j \\ne k$, and we provide a sufficient condition on the problem data guaranteeing that the basic Shor semidefinite relaxation is exact. Our condition complements and refines those already present in the literature and can be checked in polynomial time. We then extend our analysis from diagonal QCQPs to general QCQPs, i.e., ones with no particular structure. By reformulating a general QCQP into diagonal form, we establish new, polynomial-time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02688","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.02688","created_at":"2026-05-18T00:01:19.645728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02688v2","created_at":"2026-05-18T00:01:19.645728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02688","created_at":"2026-05-18T00:01:19.645728+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBJU46R3X5A3","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBJU46R3X5A3232S","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBJU46R3","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ","json":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ.json","graph_json":"https://pith.science/api/pith-number/FBJU46R3X5A3232SL7T64KZKFQ/graph.json","events_json":"https://pith.science/api/pith-number/FBJU46R3X5A3232SL7T64KZKFQ/events.json","paper":"https://pith.science/paper/FBJU46R3"},"agent_actions":{"view_html":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ","download_json":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ.json","view_paper":"https://pith.science/paper/FBJU46R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02688&json=true","fetch_graph":"https://pith.science/api/pith-number/FBJU46R3X5A3232SL7T64KZKFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FBJU46R3X5A3232SL7T64KZKFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ/action/storage_attestation","attest_author":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ/action/author_attestation","sign_citation":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ/action/citation_signature","submit_replication":"https://pith.science/pith/FBJU46R3X5A3232SL7T64KZKFQ/action/replication_record"}},"created_at":"2026-05-18T00:01:19.645728+00:00","updated_at":"2026-05-18T00:01:19.645728+00:00"}