{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WDUKZQACCB7NSEWBEVBUFCC4EH","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":"6953d155378f64fe847024dffd3b0922d75502cbb498fd2c31f5766db29d8bc1","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-08-24T03:42:44Z","title_canon_sha256":"e751d686a7445214fa033f0cb3db4902e1960e2e1bbee8eb3605ea981d17f289"},"schema_version":"1.0","source":{"id":"2208.11286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.11286","created_at":"2026-07-05T04:52:17Z"},{"alias_kind":"arxiv_version","alias_value":"2208.11286v2","created_at":"2026-07-05T04:52:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11286","created_at":"2026-07-05T04:52:17Z"},{"alias_kind":"pith_short_12","alias_value":"WDUKZQACCB7N","created_at":"2026-07-05T04:52:17Z"},{"alias_kind":"pith_short_16","alias_value":"WDUKZQACCB7NSEWB","created_at":"2026-07-05T04:52:17Z"},{"alias_kind":"pith_short_8","alias_value":"WDUKZQAC","created_at":"2026-07-05T04:52:17Z"}],"graph_snapshots":[{"event_id":"sha256:a7ef5c5afe32abff915923164be11a6a7d16b9092f294b0acdbaf7c922fd6c08","target":"graph","created_at":"2026-07-05T04:52:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.11286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \\times d$ matrices $A_1,\\ldots,A_n$ each with $\\|A_i\\|_{\\mathsf{op}} \\leq 1$ and rank at most $n/\\log^3 n$, one can efficiently find $\\pm 1$ signs $x_1,\\ldots,x_n$ such that their signed sum has spectral norm $\\|\\sum_{i=1}^n x_i A_i\\|_{\\mathsf{op}} = O(\\sqrt{n})$. This result also implies a $\\log n - \\Omega( \\log \\log n)$ qubit lower bound for quantum random access codes encoding $n$ classical bits with advantage $\\gg 1/\\sqrt{n}$.\n  Our proof uses the recent refinement of the non-commutative","authors_text":"Haotian Jiang, Nikhil Bansal, Raghu Meka","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-08-24T03:42:44Z","title":"Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11286","kind":"arxiv","version":2},"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:fdebde3e887195039dc06a84e99557c6e37f532c6066a3fec0293b53fd8a1e9f","target":"record","created_at":"2026-07-05T04:52:17Z","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":"6953d155378f64fe847024dffd3b0922d75502cbb498fd2c31f5766db29d8bc1","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-08-24T03:42:44Z","title_canon_sha256":"e751d686a7445214fa033f0cb3db4902e1960e2e1bbee8eb3605ea981d17f289"},"schema_version":"1.0","source":{"id":"2208.11286","kind":"arxiv","version":2}},"canonical_sha256":"b0e8acc002107ed912c1254342885c21d3f0e6e8bc64610f4cf7a2e28e905e81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e8acc002107ed912c1254342885c21d3f0e6e8bc64610f4cf7a2e28e905e81","first_computed_at":"2026-07-05T04:52:17.325456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:52:17.325456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1bhOmqcS5D6z+ZBBzZjtvLPdLwvJt3Ai/BwmSlSC2I0qeuF1liMwKKCV2a0e5pVXB87e4PTex0TNv8+uxHUOBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:52:17.325919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.11286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdebde3e887195039dc06a84e99557c6e37f532c6066a3fec0293b53fd8a1e9f","sha256:a7ef5c5afe32abff915923164be11a6a7d16b9092f294b0acdbaf7c922fd6c08"],"state_sha256":"dd75a649dc6240487ffd131189d9fffeb204618a57dc32913c001ab6c9045093"}