{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J36HMJXPFYW3IBVVIJ3RRJV2JO","short_pith_number":"pith:J36HMJXP","schema_version":"1.0","canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","source":{"kind":"arxiv","id":"1802.09446","version":1},"attestation_state":"computed","paper":{"title":"On sparsity of the solution to a random quadratic optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Boris Pittel, Xin Chen","submitted_at":"2018-02-26T16:45:27Z","abstract_excerpt":"The standard quadratic optimization problem (StQP), i.e. the problem of minimizing a quadratic form $\\bold x^TQ\\bold x$ on the standard simplex $\\{\\bold x\\ge\\bold 0: \\bold x^T\\bold e=1\\}$, is studied. The StQP arises in numerous applications, and it is known to be NP-hard. The first author, Peng and Zhang~\\cite{int:Peng-StQP} showed that almost certainly the StQP with a large random matrix $Q=Q^T$, whose upper-triangular entries are i. i. concave-distributed, attains its minimum at a point with few positive components. In this paper we establish sparsity of the solution for a considerably broa"},"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":"1802.09446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-26T16:45:27Z","cross_cats_sorted":[],"title_canon_sha256":"96f699f3f56790ad5b4e61dc5ab1bae36c61af963a31181cbcc289575502c0bd","abstract_canon_sha256":"3d18c4316552cf17613b7aac0e4e43f700ac86f67708b6cb7a102b3c19cbf016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.678482Z","signature_b64":"tpYgDej7kKpR/gWYkreijifygvuUPJdmwXdrLN26dsrV0k2VEkS3q2vQJUAK6SZfE/rDQxN5vFufD/b+BYEdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","last_reissued_at":"2026-05-18T00:22:33.677763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.677763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sparsity of the solution to a random quadratic optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Boris Pittel, Xin Chen","submitted_at":"2018-02-26T16:45:27Z","abstract_excerpt":"The standard quadratic optimization problem (StQP), i.e. the problem of minimizing a quadratic form $\\bold x^TQ\\bold x$ on the standard simplex $\\{\\bold x\\ge\\bold 0: \\bold x^T\\bold e=1\\}$, is studied. The StQP arises in numerous applications, and it is known to be NP-hard. The first author, Peng and Zhang~\\cite{int:Peng-StQP} showed that almost certainly the StQP with a large random matrix $Q=Q^T$, whose upper-triangular entries are i. i. concave-distributed, attains its minimum at a point with few positive components. In this paper we establish sparsity of the solution for a considerably broa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09446","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":"1802.09446","created_at":"2026-05-18T00:22:33.677880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09446v1","created_at":"2026-05-18T00:22:33.677880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09446","created_at":"2026-05-18T00:22:33.677880+00:00"},{"alias_kind":"pith_short_12","alias_value":"J36HMJXPFYW3","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J36HMJXPFYW3IBVV","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J36HMJXP","created_at":"2026-05-18T12:32:31.084164+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/J36HMJXPFYW3IBVVIJ3RRJV2JO","json":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO.json","graph_json":"https://pith.science/api/pith-number/J36HMJXPFYW3IBVVIJ3RRJV2JO/graph.json","events_json":"https://pith.science/api/pith-number/J36HMJXPFYW3IBVVIJ3RRJV2JO/events.json","paper":"https://pith.science/paper/J36HMJXP"},"agent_actions":{"view_html":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO","download_json":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO.json","view_paper":"https://pith.science/paper/J36HMJXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09446&json=true","fetch_graph":"https://pith.science/api/pith-number/J36HMJXPFYW3IBVVIJ3RRJV2JO/graph.json","fetch_events":"https://pith.science/api/pith-number/J36HMJXPFYW3IBVVIJ3RRJV2JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/action/storage_attestation","attest_author":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/action/author_attestation","sign_citation":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/action/citation_signature","submit_replication":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/action/replication_record"}},"created_at":"2026-05-18T00:22:33.677880+00:00","updated_at":"2026-05-18T00:22:33.677880+00:00"}