{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C6NXLVRYPUVR72RKZ72IQECZYW","short_pith_number":"pith:C6NXLVRY","schema_version":"1.0","canonical_sha256":"179b75d6387d2b1fea2acff4881059c5a2ebef7b21dea1c554dead7d470d0660","source":{"kind":"arxiv","id":"2509.10580","version":1},"attestation_state":"computed","paper":{"title":"The Structure of Extremal Bad Science Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.FA","authors_text":"Shridhar Sinha","submitted_at":"2025-09-11T20:47:43Z","abstract_excerpt":"We study the 'bad science matrix problem': among all matrices $A\\in\\mathbb{R}^{n\\times n}$ whose rows have unit $\\ell_2$-norm, determine the maximum of $\\beta(A)=\\frac{1}{2^n}\\sum_{x\\in\\{\\pm1\\}^n}\\|Ax\\|_\\infty$. Steinerberger [1] (arXiv:2402.03205) showed that the optimal asymptotic rate is $(1+o(1))\\sqrt{2\\log n}$, and that this rate is attained with high probability by matrices with i.i.d. $\\pm1$ entries after normalization. More recent explicit constructions [2] (arXiv:2408.00933) achieve $\\beta(A)\\ge\\sqrt{\\log_2(n)+1}$, which lies within a constant factor of the asymptotic optimum. In this"},"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":"2509.10580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2025-09-11T20:47:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"270fefc617463b8b3d48b532a5e81b1c4d11231d532f53438e05e998bd25020f","abstract_canon_sha256":"6271a8768e2b8c94ddc963ea660e30b2703ed61c563b2f313a1d0921c01cf2c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:23.744140Z","signature_b64":"FAdTHEgcZtuVbmMBZlAjkPsZR3CRg4OlbJcvo4F1Zzz9tCSIz3D1gFjLa6ZlrZkXAhHx2W8msBVfUoGJONz1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179b75d6387d2b1fea2acff4881059c5a2ebef7b21dea1c554dead7d470d0660","last_reissued_at":"2026-07-05T12:11:23.743682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:23.743682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Structure of Extremal Bad Science Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.FA","authors_text":"Shridhar Sinha","submitted_at":"2025-09-11T20:47:43Z","abstract_excerpt":"We study the 'bad science matrix problem': among all matrices $A\\in\\mathbb{R}^{n\\times n}$ whose rows have unit $\\ell_2$-norm, determine the maximum of $\\beta(A)=\\frac{1}{2^n}\\sum_{x\\in\\{\\pm1\\}^n}\\|Ax\\|_\\infty$. Steinerberger [1] (arXiv:2402.03205) showed that the optimal asymptotic rate is $(1+o(1))\\sqrt{2\\log n}$, and that this rate is attained with high probability by matrices with i.i.d. $\\pm1$ entries after normalization. More recent explicit constructions [2] (arXiv:2408.00933) achieve $\\beta(A)\\ge\\sqrt{\\log_2(n)+1}$, which lies within a constant factor of the asymptotic optimum. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10580","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/2509.10580/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":"2509.10580","created_at":"2026-07-05T12:11:23.743760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10580v1","created_at":"2026-07-05T12:11:23.743760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10580","created_at":"2026-07-05T12:11:23.743760+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6NXLVRYPUVR","created_at":"2026-07-05T12:11:23.743760+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6NXLVRYPUVR72RK","created_at":"2026-07-05T12:11:23.743760+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6NXLVRY","created_at":"2026-07-05T12:11:23.743760+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/C6NXLVRYPUVR72RKZ72IQECZYW","json":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW.json","graph_json":"https://pith.science/api/pith-number/C6NXLVRYPUVR72RKZ72IQECZYW/graph.json","events_json":"https://pith.science/api/pith-number/C6NXLVRYPUVR72RKZ72IQECZYW/events.json","paper":"https://pith.science/paper/C6NXLVRY"},"agent_actions":{"view_html":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW","download_json":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW.json","view_paper":"https://pith.science/paper/C6NXLVRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10580&json=true","fetch_graph":"https://pith.science/api/pith-number/C6NXLVRYPUVR72RKZ72IQECZYW/graph.json","fetch_events":"https://pith.science/api/pith-number/C6NXLVRYPUVR72RKZ72IQECZYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW/action/storage_attestation","attest_author":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW/action/author_attestation","sign_citation":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW/action/citation_signature","submit_replication":"https://pith.science/pith/C6NXLVRYPUVR72RKZ72IQECZYW/action/replication_record"}},"created_at":"2026-07-05T12:11:23.743760+00:00","updated_at":"2026-07-05T12:11:23.743760+00:00"}