{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FJHEGLIO7GEI764ME6QJ3CA7VZ","short_pith_number":"pith:FJHEGLIO","schema_version":"1.0","canonical_sha256":"2a4e432d0ef9888ffb8c27a09d881fae54c1b0394759c49f622499ad130d2c05","source":{"kind":"arxiv","id":"1510.06421","version":2},"attestation_state":"computed","paper":{"title":"Concave Quadratic Cuts for Mixed-Integer Quadratic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jaehyun Park, Stephen Boyd","submitted_at":"2015-10-21T20:22:52Z","abstract_excerpt":"The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice ${\\bf Z}^n$, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the optimal value. This scheme is tested using several numerical problem instances of the max-cut problem and the integer least squares problem."},"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":"1510.06421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-21T20:22:52Z","cross_cats_sorted":[],"title_canon_sha256":"e8af32dee9c439bc8c4fd3bbe391b269e17a452b4aff1ce1fdc8a13ed19e431a","abstract_canon_sha256":"59d455feb866a9518bea8dd812c9ef66d5da25915c9c7026f4e91c28e241b332"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.900156Z","signature_b64":"r2aA4QCRJlFkEPcT9xiuD404d6vrDnmhWojCC2cdul5G0oKZpmsYeP/ToCoJdraeuqHDkTGIRR+pwgYF8PJyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a4e432d0ef9888ffb8c27a09d881fae54c1b0394759c49f622499ad130d2c05","last_reissued_at":"2026-05-18T01:03:40.899743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.899743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concave Quadratic Cuts for Mixed-Integer Quadratic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jaehyun Park, Stephen Boyd","submitted_at":"2015-10-21T20:22:52Z","abstract_excerpt":"The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice ${\\bf Z}^n$, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the optimal value. This scheme is tested using several numerical problem instances of the max-cut problem and the integer least squares problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06421","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":"1510.06421","created_at":"2026-05-18T01:03:40.899817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06421v2","created_at":"2026-05-18T01:03:40.899817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06421","created_at":"2026-05-18T01:03:40.899817+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJHEGLIO7GEI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJHEGLIO7GEI764M","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJHEGLIO","created_at":"2026-05-18T12:29:19.899920+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/FJHEGLIO7GEI764ME6QJ3CA7VZ","json":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ.json","graph_json":"https://pith.science/api/pith-number/FJHEGLIO7GEI764ME6QJ3CA7VZ/graph.json","events_json":"https://pith.science/api/pith-number/FJHEGLIO7GEI764ME6QJ3CA7VZ/events.json","paper":"https://pith.science/paper/FJHEGLIO"},"agent_actions":{"view_html":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ","download_json":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ.json","view_paper":"https://pith.science/paper/FJHEGLIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06421&json=true","fetch_graph":"https://pith.science/api/pith-number/FJHEGLIO7GEI764ME6QJ3CA7VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FJHEGLIO7GEI764ME6QJ3CA7VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ/action/storage_attestation","attest_author":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ/action/author_attestation","sign_citation":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ/action/citation_signature","submit_replication":"https://pith.science/pith/FJHEGLIO7GEI764ME6QJ3CA7VZ/action/replication_record"}},"created_at":"2026-05-18T01:03:40.899817+00:00","updated_at":"2026-05-18T01:03:40.899817+00:00"}