{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NZUUMDCETHFJLO4UDUIW2E3OYN","short_pith_number":"pith:NZUUMDCE","schema_version":"1.0","canonical_sha256":"6e69460c4499ca95bb941d116d136ec3422354edbe3aecf87cc50167481107d3","source":{"kind":"arxiv","id":"2406.01239","version":1},"attestation_state":"computed","paper":{"title":"Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Peng, E. Alper Yildirim, Immanuel Bomze, Yuzhou Qiu","submitted_at":"2024-06-03T11:59:19Z","abstract_excerpt":"The Standard Quadratic optimization Problem (StQP), arguably the simplest among all classes of NP-hard optimization problems, consists of extremizing a quadratic form (the simplest nonlinear polynomial) over the standard simplex (the simplest polytope/compact feasible set). As a problem class, StQPs may be nonconvex with an exponential number of inefficient local solutions. StQPs arise in a multitude of applications, among them mathematical finance, machine learning (clustering), and modeling in biosciences (e.g., selection and ecology). This paper deals with such StQPs under an additional spa"},"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":"2406.01239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-03T11:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"2a31c4c9472eddd7a6b50406bd69a75cd6d3c61487592e67edebd537f55422bb","abstract_canon_sha256":"a8a72b4e01f557bb2e10a65ce8717a983e19cba54ceb0c14f4f7ca5d18ce8045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:37.415336Z","signature_b64":"Y7NnAE8mOs6n2dt9GQnkNKJQzxFFbCGKcuhtnAQn4WTGX9pg+0DCFV54lyFBxWnkOCjBGiqpcmy71A3fBUDuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e69460c4499ca95bb941d116d136ec3422354edbe3aecf87cc50167481107d3","last_reissued_at":"2026-07-05T08:26:37.414772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:37.414772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Peng, E. Alper Yildirim, Immanuel Bomze, Yuzhou Qiu","submitted_at":"2024-06-03T11:59:19Z","abstract_excerpt":"The Standard Quadratic optimization Problem (StQP), arguably the simplest among all classes of NP-hard optimization problems, consists of extremizing a quadratic form (the simplest nonlinear polynomial) over the standard simplex (the simplest polytope/compact feasible set). As a problem class, StQPs may be nonconvex with an exponential number of inefficient local solutions. StQPs arise in a multitude of applications, among them mathematical finance, machine learning (clustering), and modeling in biosciences (e.g., selection and ecology). This paper deals with such StQPs under an additional spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01239","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.01239/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":"2406.01239","created_at":"2026-07-05T08:26:37.414828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01239v1","created_at":"2026-07-05T08:26:37.414828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01239","created_at":"2026-07-05T08:26:37.414828+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZUUMDCETHFJ","created_at":"2026-07-05T08:26:37.414828+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZUUMDCETHFJLO4U","created_at":"2026-07-05T08:26:37.414828+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZUUMDCE","created_at":"2026-07-05T08:26:37.414828+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/NZUUMDCETHFJLO4UDUIW2E3OYN","json":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN.json","graph_json":"https://pith.science/api/pith-number/NZUUMDCETHFJLO4UDUIW2E3OYN/graph.json","events_json":"https://pith.science/api/pith-number/NZUUMDCETHFJLO4UDUIW2E3OYN/events.json","paper":"https://pith.science/paper/NZUUMDCE"},"agent_actions":{"view_html":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN","download_json":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN.json","view_paper":"https://pith.science/paper/NZUUMDCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01239&json=true","fetch_graph":"https://pith.science/api/pith-number/NZUUMDCETHFJLO4UDUIW2E3OYN/graph.json","fetch_events":"https://pith.science/api/pith-number/NZUUMDCETHFJLO4UDUIW2E3OYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN/action/storage_attestation","attest_author":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN/action/author_attestation","sign_citation":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN/action/citation_signature","submit_replication":"https://pith.science/pith/NZUUMDCETHFJLO4UDUIW2E3OYN/action/replication_record"}},"created_at":"2026-07-05T08:26:37.414828+00:00","updated_at":"2026-07-05T08:26:37.414828+00:00"}