{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G4N674OHRL3P66Q76KVGX3EU6R","short_pith_number":"pith:G4N674OH","schema_version":"1.0","canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","source":{"kind":"arxiv","id":"1504.07672","version":6},"attestation_state":"computed","paper":{"title":"A Semidefinite Programming Method for Integer Convex Quadratic Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Jaehyun Park, Stephen Boyd","submitted_at":"2015-04-28T22:07:02Z","abstract_excerpt":"We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice ${\\bf Z}^n$. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optimal value of the problem. By interpreting the solution to the SDP relaxation probabilistically, we obtain a randomized algorithm for finding good suboptimal solutions, and thus an upper bound on the optimal value. The effectiveness of the method is shown for numerical problem instances of various sizes."},"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":"1504.07672","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-28T22:07:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"41221c76b2ed21f8e3f3d0b9d5b700c7de81c87376448a60e0ad2fa4d020d4b7","abstract_canon_sha256":"ce52e5ff1b01301e70096fe244847a29acb75df48c1b040d221ee05c1b1ce3cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.315311Z","signature_b64":"GjsgMdC7Bol6UHYcDhfM3efCFVcQ0AIlw8SLllUdz7xV4l9vuBKkWqB4Seu/MSD8W8zD7paoeyE/MwSkGlk5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","last_reissued_at":"2026-05-18T00:48:43.314756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.314756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Semidefinite Programming Method for Integer Convex Quadratic Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Jaehyun Park, Stephen Boyd","submitted_at":"2015-04-28T22:07:02Z","abstract_excerpt":"We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice ${\\bf Z}^n$. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optimal value of the problem. By interpreting the solution to the SDP relaxation probabilistically, we obtain a randomized algorithm for finding good suboptimal solutions, and thus an upper bound on the optimal value. The effectiveness of the method is shown for numerical problem instances of various sizes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07672","kind":"arxiv","version":6},"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":"1504.07672","created_at":"2026-05-18T00:48:43.314829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07672v6","created_at":"2026-05-18T00:48:43.314829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07672","created_at":"2026-05-18T00:48:43.314829+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4N674OHRL3P","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4N674OHRL3P66Q7","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4N674OH","created_at":"2026-05-18T12:29:22.688609+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/G4N674OHRL3P66Q76KVGX3EU6R","json":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R.json","graph_json":"https://pith.science/api/pith-number/G4N674OHRL3P66Q76KVGX3EU6R/graph.json","events_json":"https://pith.science/api/pith-number/G4N674OHRL3P66Q76KVGX3EU6R/events.json","paper":"https://pith.science/paper/G4N674OH"},"agent_actions":{"view_html":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R","download_json":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R.json","view_paper":"https://pith.science/paper/G4N674OH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07672&json=true","fetch_graph":"https://pith.science/api/pith-number/G4N674OHRL3P66Q76KVGX3EU6R/graph.json","fetch_events":"https://pith.science/api/pith-number/G4N674OHRL3P66Q76KVGX3EU6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/action/storage_attestation","attest_author":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/action/author_attestation","sign_citation":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/action/citation_signature","submit_replication":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/action/replication_record"}},"created_at":"2026-05-18T00:48:43.314829+00:00","updated_at":"2026-05-18T00:48:43.314829+00:00"}