{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RYCWOBSSII5DPCTMCFLLUNCGTR","short_pith_number":"pith:RYCWOBSS","schema_version":"1.0","canonical_sha256":"8e05670652423a378a6c1156ba34469c45443e70ba88b525614003b00e8ce7c7","source":{"kind":"arxiv","id":"2302.05930","version":2},"attestation_state":"computed","paper":{"title":"Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tianyou Zeng, Yuchen Lou, Zheng Qu","submitted_at":"2023-02-12T14:54:59Z","abstract_excerpt":"We consider the problem of maximizing a convex quadratic function over a bounded polyhedral set. We design a new framework based on SDP relaxations and cutting plane methods for solving the associated reference value problem. The major novelty is a new way to generate valid cuts through the doubly nonnegative (DNN) relaxation. We establish various theoretical properties of the DNN relaxation, including its equivalence with the Shor relaxation of an equivalent quadratically constrained problem, the strong duality, and the generation of valid cuts from an approximate solution of the DNN relaxati"},"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":"2302.05930","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-12T14:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"202bc950467f56fff84f35961a9e3d9cb54774fdfb7c7375ab53f0914dab1791","abstract_canon_sha256":"3f4abbdb5dfa4f48e7f2b84473e663c91f7429db5856061dd357acd74b30f593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:42.339904Z","signature_b64":"uk/bbMTm28i1ezTQKRjfT409ypfUsI5Fv+W1IJb2vzgEUOnhQiAmMqXvbm/7kKe/QMmN2AUglciqLHgEpX28BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e05670652423a378a6c1156ba34469c45443e70ba88b525614003b00e8ce7c7","last_reissued_at":"2026-07-05T10:53:42.339483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:42.339483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tianyou Zeng, Yuchen Lou, Zheng Qu","submitted_at":"2023-02-12T14:54:59Z","abstract_excerpt":"We consider the problem of maximizing a convex quadratic function over a bounded polyhedral set. We design a new framework based on SDP relaxations and cutting plane methods for solving the associated reference value problem. The major novelty is a new way to generate valid cuts through the doubly nonnegative (DNN) relaxation. We establish various theoretical properties of the DNN relaxation, including its equivalence with the Shor relaxation of an equivalent quadratically constrained problem, the strong duality, and the generation of valid cuts from an approximate solution of the DNN relaxati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05930","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.05930/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.05930","created_at":"2026-07-05T10:53:42.339537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05930v2","created_at":"2026-07-05T10:53:42.339537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05930","created_at":"2026-07-05T10:53:42.339537+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYCWOBSSII5D","created_at":"2026-07-05T10:53:42.339537+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYCWOBSSII5DPCTM","created_at":"2026-07-05T10:53:42.339537+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYCWOBSS","created_at":"2026-07-05T10:53:42.339537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13776","citing_title":"RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR","json":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR.json","graph_json":"https://pith.science/api/pith-number/RYCWOBSSII5DPCTMCFLLUNCGTR/graph.json","events_json":"https://pith.science/api/pith-number/RYCWOBSSII5DPCTMCFLLUNCGTR/events.json","paper":"https://pith.science/paper/RYCWOBSS"},"agent_actions":{"view_html":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR","download_json":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR.json","view_paper":"https://pith.science/paper/RYCWOBSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05930&json=true","fetch_graph":"https://pith.science/api/pith-number/RYCWOBSSII5DPCTMCFLLUNCGTR/graph.json","fetch_events":"https://pith.science/api/pith-number/RYCWOBSSII5DPCTMCFLLUNCGTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR/action/storage_attestation","attest_author":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR/action/author_attestation","sign_citation":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR/action/citation_signature","submit_replication":"https://pith.science/pith/RYCWOBSSII5DPCTMCFLLUNCGTR/action/replication_record"}},"created_at":"2026-07-05T10:53:42.339537+00:00","updated_at":"2026-07-05T10:53:42.339537+00:00"}