{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G4N674OHRL3P66Q76KVGX3EU6R","short_pith_number":"pith:G4N674OH","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"},"canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","source":{"kind":"arxiv","id":"1504.07672","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07672","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07672v6","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07672","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"G4N674OHRL3P","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G4N674OHRL3P66Q7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G4N674OH","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G4N674OHRL3P66Q76KVGX3EU6R","target":"record","payload":{"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"},"canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","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"},"source_kind":"arxiv","source_id":"1504.07672","source_version":6,"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1dkgGWfhGrye9dtFJuCLwiRM+cca7HW5M+JKOcWnet+YPZw5DpATNgOZOFibsoZQ0jHnp6Ww9VuApOFdIGrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:28:12.882842Z"},"content_sha256":"cd24558730d4ce728935157f50136350fa3855688051efe6eb57738d23c87fcd","schema_version":"1.0","event_id":"sha256:cd24558730d4ce728935157f50136350fa3855688051efe6eb57738d23c87fcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G4N674OHRL3P66Q76KVGX3EU6R","target":"graph","payload":{"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"},"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDAs/0QOOi0xWw0cuirUsG1QIznBrkXa30ItM/mT0rFBFvrYcU6wWTw4fyJgR8pILzM4YeU/oUWd167RkRjEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:28:12.883474Z"},"content_sha256":"81625ec88caa591a78af9a46fa5c9ac9b14e3d3ac37a25c9a6599893b212955f","schema_version":"1.0","event_id":"sha256:81625ec88caa591a78af9a46fa5c9ac9b14e3d3ac37a25c9a6599893b212955f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/bundle.json","state_url":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4N674OHRL3P66Q76KVGX3EU6R/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-05-30T20:28:12Z","links":{"resolver":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R","bundle":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/bundle.json","state":"https://pith.science/pith/G4N674OHRL3P66Q76KVGX3EU6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4N674OHRL3P66Q76KVGX3EU6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G4N674OHRL3P66Q76KVGX3EU6R","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":"ce52e5ff1b01301e70096fe244847a29acb75df48c1b040d221ee05c1b1ce3cc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-28T22:07:02Z","title_canon_sha256":"41221c76b2ed21f8e3f3d0b9d5b700c7de81c87376448a60e0ad2fa4d020d4b7"},"schema_version":"1.0","source":{"id":"1504.07672","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07672","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07672v6","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07672","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"G4N674OHRL3P","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G4N674OHRL3P66Q7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G4N674OH","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:81625ec88caa591a78af9a46fa5c9ac9b14e3d3ac37a25c9a6599893b212955f","target":"graph","created_at":"2026-05-18T00:48:43Z","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":"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.","authors_text":"Jaehyun Park, Stephen Boyd","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-28T22:07:02Z","title":"A Semidefinite Programming Method for Integer Convex Quadratic Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07672","kind":"arxiv","version":6},"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:cd24558730d4ce728935157f50136350fa3855688051efe6eb57738d23c87fcd","target":"record","created_at":"2026-05-18T00:48:43Z","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":"ce52e5ff1b01301e70096fe244847a29acb75df48c1b040d221ee05c1b1ce3cc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-28T22:07:02Z","title_canon_sha256":"41221c76b2ed21f8e3f3d0b9d5b700c7de81c87376448a60e0ad2fa4d020d4b7"},"schema_version":"1.0","source":{"id":"1504.07672","kind":"arxiv","version":6}},"canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"371beff1c78af6ff7a1ff2aa6bec94f45b1d192a75ac0d2697fa8ea85b529e8e","first_computed_at":"2026-05-18T00:48:43.314756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.314756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjsgMdC7Bol6UHYcDhfM3efCFVcQ0AIlw8SLllUdz7xV4l9vuBKkWqB4Seu/MSD8W8zD7paoeyE/MwSkGlk5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.315311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07672","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd24558730d4ce728935157f50136350fa3855688051efe6eb57738d23c87fcd","sha256:81625ec88caa591a78af9a46fa5c9ac9b14e3d3ac37a25c9a6599893b212955f"],"state_sha256":"02b84b11b893f86edd8c40368a58e35274101bf4d51daa799ede7fc4b135a0cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoCQCLdxxXakGUbhTdbL2q/NP6QEE5SFe+EhGq0oLbdx8MDt5rQiNRE+5PgomuFZ2z2wKdyXiiS6fOY/7k3hCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:28:12.886789Z","bundle_sha256":"331715ef244277f2ba97674a011d4ce5cd8ce9f394576cac1a6532b8d89db735"}}