{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J36HMJXPFYW3IBVVIJ3RRJV2JO","short_pith_number":"pith:J36HMJXP","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"},"canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","source":{"kind":"arxiv","id":"1802.09446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09446","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09446v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09446","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"J36HMJXPFYW3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J36HMJXPFYW3IBVV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J36HMJXP","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J36HMJXPFYW3IBVVIJ3RRJV2JO","target":"record","payload":{"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"},"canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","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"},"source_kind":"arxiv","source_id":"1802.09446","source_version":1,"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:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cl3KdG1VrsvGdS5KZIJZIxA9fBZ9UuNKleGdQHIBeHsNQxvQ6t8oD3rmbxhrkIaQzPhdscRweDjkfpRTDbSkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:23:17.633941Z"},"content_sha256":"3eeb2f21bc54fa70fdf7d99e90ee58967d8f3c6a746c2140a4875499ae964600","schema_version":"1.0","event_id":"sha256:3eeb2f21bc54fa70fdf7d99e90ee58967d8f3c6a746c2140a4875499ae964600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J36HMJXPFYW3IBVVIJ3RRJV2JO","target":"graph","payload":{"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"},"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:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59BUlaYC0Hwsc6CEUyzzsViCAb1xTVROvcYjemicSXwkT5cwTGBv0HNw5me2LlCmRWZlc6LmMvJ0tWjB9tBxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:23:17.634443Z"},"content_sha256":"d5ed9a7dc42311468dfca0100e6b238ecf99196ce709cddb4290ffcd9236bc93","schema_version":"1.0","event_id":"sha256:d5ed9a7dc42311468dfca0100e6b238ecf99196ce709cddb4290ffcd9236bc93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/bundle.json","state_url":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/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-06-22T22:23:17Z","links":{"resolver":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO","bundle":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/bundle.json","state":"https://pith.science/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J36HMJXPFYW3IBVVIJ3RRJV2JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J36HMJXPFYW3IBVVIJ3RRJV2JO","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":"3d18c4316552cf17613b7aac0e4e43f700ac86f67708b6cb7a102b3c19cbf016","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-26T16:45:27Z","title_canon_sha256":"96f699f3f56790ad5b4e61dc5ab1bae36c61af963a31181cbcc289575502c0bd"},"schema_version":"1.0","source":{"id":"1802.09446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09446","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09446v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09446","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"J36HMJXPFYW3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J36HMJXPFYW3IBVV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J36HMJXP","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:d5ed9a7dc42311468dfca0100e6b238ecf99196ce709cddb4290ffcd9236bc93","target":"graph","created_at":"2026-05-18T00:22:33Z","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":"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","authors_text":"Boris Pittel, Xin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-26T16:45:27Z","title":"On sparsity of the solution to a random quadratic optimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09446","kind":"arxiv","version":1},"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:3eeb2f21bc54fa70fdf7d99e90ee58967d8f3c6a746c2140a4875499ae964600","target":"record","created_at":"2026-05-18T00:22:33Z","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":"3d18c4316552cf17613b7aac0e4e43f700ac86f67708b6cb7a102b3c19cbf016","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-26T16:45:27Z","title_canon_sha256":"96f699f3f56790ad5b4e61dc5ab1bae36c61af963a31181cbcc289575502c0bd"},"schema_version":"1.0","source":{"id":"1802.09446","kind":"arxiv","version":1}},"canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4efc7626ef2e2db406b5427718a6ba4b82afa11687a4ac9279f8b85ae289ee11","first_computed_at":"2026-05-18T00:22:33.677763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:33.677763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tpYgDej7kKpR/gWYkreijifygvuUPJdmwXdrLN26dsrV0k2VEkS3q2vQJUAK6SZfE/rDQxN5vFufD/b+BYEdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:33.678482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eeb2f21bc54fa70fdf7d99e90ee58967d8f3c6a746c2140a4875499ae964600","sha256:d5ed9a7dc42311468dfca0100e6b238ecf99196ce709cddb4290ffcd9236bc93"],"state_sha256":"1d53cb8363ef2137d4adbac867b787e114e2662f680e6c14c87eecef15575f48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+r6f2JLFPyJEKvRyck7kj7utyHzzVIqiCOKKUnBd2NuM2efHEIGNHbAwz5olvSM+A982HEKrpxbHw5x5BS2ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:23:17.637062Z","bundle_sha256":"3147fada3b54b0aacff8456ea33e31c0e3b5671ab22c673e168068b888ce68e1"}}