{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T6DRA6R3REC663CHVGLDVNLTIF","short_pith_number":"pith:T6DRA6R3","schema_version":"1.0","canonical_sha256":"9f87107a3b8905ef6c47a9963ab5734178fae33098b003e401e090c2f3accb4b","source":{"kind":"arxiv","id":"2110.10099","version":1},"attestation_state":"computed","paper":{"title":"Matrix Discrepancy from Quantum Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","quant-ph"],"primary_cat":"cs.DS","authors_text":"Abhishek Shetty, Prasad Raghavendra, Samuel B. Hopkins","submitted_at":"2021-10-19T16:51:11Z","abstract_excerpt":"We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every collection of symmetric $n \\times n$ matrices $A_1,\\ldots,A_n$ with $\\|A_i\\| \\leq 1$ and $\\|A_i\\|_F \\leq n^{1/4}$ there exist signs $x \\in \\{ \\pm 1\\}^n$ such that the maximum eigenvalue of $\\sum_{i \\leq n} x_i A_i$ is at most $O(\\sqrt n)$. We give a polynomial-time algorithm based on partial coloring and semidefinite programming to find such $x$.\n  Our techniques op"},"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":"2110.10099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-19T16:51:11Z","cross_cats_sorted":["cs.CC","math.CO","quant-ph"],"title_canon_sha256":"ab418ac9eac0982e7ca92fbab896cc7705077ee81270225e1cbb42842811880b","abstract_canon_sha256":"bc0820f3d93bc09dfb585ff9b0bd4418431daa9a0598c98bae6298230b639800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:14.186720Z","signature_b64":"rBn91SPKgGD4e5GY3ED+kJ5hSGK4+D61lR+rPW2ji0EZ6JsjLmu0M8b1h4GfWxB29grBIcizFVnVto+oYS5hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f87107a3b8905ef6c47a9963ab5734178fae33098b003e401e090c2f3accb4b","last_reissued_at":"2026-07-05T03:24:14.186339Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:14.186339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Discrepancy from Quantum Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","quant-ph"],"primary_cat":"cs.DS","authors_text":"Abhishek Shetty, Prasad Raghavendra, Samuel B. Hopkins","submitted_at":"2021-10-19T16:51:11Z","abstract_excerpt":"We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every collection of symmetric $n \\times n$ matrices $A_1,\\ldots,A_n$ with $\\|A_i\\| \\leq 1$ and $\\|A_i\\|_F \\leq n^{1/4}$ there exist signs $x \\in \\{ \\pm 1\\}^n$ such that the maximum eigenvalue of $\\sum_{i \\leq n} x_i A_i$ is at most $O(\\sqrt n)$. We give a polynomial-time algorithm based on partial coloring and semidefinite programming to find such $x$.\n  Our techniques op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10099","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/2110.10099/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":"2110.10099","created_at":"2026-07-05T03:24:14.186400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10099v1","created_at":"2026-07-05T03:24:14.186400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10099","created_at":"2026-07-05T03:24:14.186400+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6DRA6R3REC6","created_at":"2026-07-05T03:24:14.186400+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6DRA6R3REC663CH","created_at":"2026-07-05T03:24:14.186400+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6DRA6R3","created_at":"2026-07-05T03:24:14.186400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF","json":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF.json","graph_json":"https://pith.science/api/pith-number/T6DRA6R3REC663CHVGLDVNLTIF/graph.json","events_json":"https://pith.science/api/pith-number/T6DRA6R3REC663CHVGLDVNLTIF/events.json","paper":"https://pith.science/paper/T6DRA6R3"},"agent_actions":{"view_html":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF","download_json":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF.json","view_paper":"https://pith.science/paper/T6DRA6R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10099&json=true","fetch_graph":"https://pith.science/api/pith-number/T6DRA6R3REC663CHVGLDVNLTIF/graph.json","fetch_events":"https://pith.science/api/pith-number/T6DRA6R3REC663CHVGLDVNLTIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF/action/storage_attestation","attest_author":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF/action/author_attestation","sign_citation":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF/action/citation_signature","submit_replication":"https://pith.science/pith/T6DRA6R3REC663CHVGLDVNLTIF/action/replication_record"}},"created_at":"2026-07-05T03:24:14.186400+00:00","updated_at":"2026-07-05T03:24:14.186400+00:00"}