{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PV3SOY3AGRLFCZLIQ5C42OXAOF","short_pith_number":"pith:PV3SOY3A","schema_version":"1.0","canonical_sha256":"7d7727636034565165688745cd3ae0715d4f03324101fc6faa3afb42af6d2ba9","source":{"kind":"arxiv","id":"1901.10335","version":1},"attestation_state":"computed","paper":{"title":"SDP-based branch-and-bound for non-convex quadratic integer optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelika Wiegele, Christoph Buchheim, Maribel Montenegro","submitted_at":"2019-01-29T15:21:00Z","abstract_excerpt":"Semidefinite programming (SDP) relaxations have been intensively used for solving discrete quadratic optimization problems, in particular in the binary case. For the general non-convex integer case with box constraints, the branch-and-bound algorithm Q-MIST has been proposed by Buchheim and Wiegele (Math Program 141(1--2):435--452, 2013), which is based on an extension of the well-known SDP-relaxation for max-cut. For solving the resulting SDPs, Q-MIST uses an off-the-shelf interior point algorithm.\n  In this paper, we present a tailored coordinate ascent algorithm for solving the dual 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":"1901.10335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-29T15:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"32130405a1d1cf9f591c66818a49a10af22bf699d58b98bbef24d96ba7d09729","abstract_canon_sha256":"ca3c1880c59d5485bab334da764fa88301c762e7cca2ef9ee477889f78ed3d8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.606310Z","signature_b64":"6COvvsrzsi9ksblxsknactttuhG8LUmNcQXidxUdsRNQJXykTkFdFEIkeWmytIPy2C/999gDFElzowAdEApFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7727636034565165688745cd3ae0715d4f03324101fc6faa3afb42af6d2ba9","last_reissued_at":"2026-05-17T23:55:15.605699Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.605699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDP-based branch-and-bound for non-convex quadratic integer optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelika Wiegele, Christoph Buchheim, Maribel Montenegro","submitted_at":"2019-01-29T15:21:00Z","abstract_excerpt":"Semidefinite programming (SDP) relaxations have been intensively used for solving discrete quadratic optimization problems, in particular in the binary case. For the general non-convex integer case with box constraints, the branch-and-bound algorithm Q-MIST has been proposed by Buchheim and Wiegele (Math Program 141(1--2):435--452, 2013), which is based on an extension of the well-known SDP-relaxation for max-cut. For solving the resulting SDPs, Q-MIST uses an off-the-shelf interior point algorithm.\n  In this paper, we present a tailored coordinate ascent algorithm for solving the dual problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10335","kind":"arxiv","version":1},"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":"1901.10335","created_at":"2026-05-17T23:55:15.605785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10335v1","created_at":"2026-05-17T23:55:15.605785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10335","created_at":"2026-05-17T23:55:15.605785+00:00"},{"alias_kind":"pith_short_12","alias_value":"PV3SOY3AGRLF","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PV3SOY3AGRLFCZLI","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PV3SOY3A","created_at":"2026-05-18T12:33:24.271573+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/PV3SOY3AGRLFCZLIQ5C42OXAOF","json":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF.json","graph_json":"https://pith.science/api/pith-number/PV3SOY3AGRLFCZLIQ5C42OXAOF/graph.json","events_json":"https://pith.science/api/pith-number/PV3SOY3AGRLFCZLIQ5C42OXAOF/events.json","paper":"https://pith.science/paper/PV3SOY3A"},"agent_actions":{"view_html":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF","download_json":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF.json","view_paper":"https://pith.science/paper/PV3SOY3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10335&json=true","fetch_graph":"https://pith.science/api/pith-number/PV3SOY3AGRLFCZLIQ5C42OXAOF/graph.json","fetch_events":"https://pith.science/api/pith-number/PV3SOY3AGRLFCZLIQ5C42OXAOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF/action/storage_attestation","attest_author":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF/action/author_attestation","sign_citation":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF/action/citation_signature","submit_replication":"https://pith.science/pith/PV3SOY3AGRLFCZLIQ5C42OXAOF/action/replication_record"}},"created_at":"2026-05-17T23:55:15.605785+00:00","updated_at":"2026-05-17T23:55:15.605785+00:00"}