{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZTKUXYLL7HGZGZC26RULOIQSZX","short_pith_number":"pith:ZTKUXYLL","canonical_record":{"source":{"id":"2408.00933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-08-01T21:52:18Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"70f0af4b5ab92d1fa95731debc5dfa33126c2104a1d72d80f8728e00d28ab94b","abstract_canon_sha256":"ea69f9ea96a5392f31a2659b8181dc543252096d5c42bad1243b6a1a28b9bad6"},"schema_version":"1.0"},"canonical_sha256":"ccd54be16bf9cd93645af468b72212cdeb6d2625dd28d37773c08a00b3144c1f","source":{"kind":"arxiv","id":"2408.00933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00933","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00933v2","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00933","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZTKUXYLL7HGZ","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZTKUXYLL7HGZGZC2","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZTKUXYLL","created_at":"2026-06-19T16:10:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZTKUXYLL7HGZGZC26RULOIQSZX","target":"record","payload":{"canonical_record":{"source":{"id":"2408.00933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-08-01T21:52:18Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"70f0af4b5ab92d1fa95731debc5dfa33126c2104a1d72d80f8728e00d28ab94b","abstract_canon_sha256":"ea69f9ea96a5392f31a2659b8181dc543252096d5c42bad1243b6a1a28b9bad6"},"schema_version":"1.0"},"canonical_sha256":"ccd54be16bf9cd93645af468b72212cdeb6d2625dd28d37773c08a00b3144c1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:28.576818Z","signature_b64":"jumWYW4z7NQzFZuoiRFl/F64YjXlo8sD4ASZ2VQ2PVxg26cwUf+UW5YJzSOUFmqmotZo1Cu9yQ/FP2Rw7Z/YDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccd54be16bf9cd93645af468b72212cdeb6d2625dd28d37773c08a00b3144c1f","last_reissued_at":"2026-06-19T16:10:28.576479Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:28.576479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.00933","source_version":2,"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-06-19T16:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQxoNC512IMb8rJVprNbU1409PDZwvBmMmunMXs2kAcSzfa0f/SkCMfGnEipyjKc9al01pdghYHC4DmX33h8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:42:43.216415Z"},"content_sha256":"ca6b5d2a5a0174f0cccf5921e6c55649ef4380dcbe0c37da06358dfee3a1048e","schema_version":"1.0","event_id":"sha256:ca6b5d2a5a0174f0cccf5921e6c55649ef4380dcbe0c37da06358dfee3a1048e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZTKUXYLL7HGZGZC26RULOIQSZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Structure of Bad Science Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.FA","authors_text":"Alex Albors, Alicia Stepin, Dmitriy Kunisky, Hisham Bhatti, Lukshya Ganjoo, Raymond Guo, Rohan Mukherjee, Tony Zeng","submitted_at":"2024-08-01T21:52:18Z","abstract_excerpt":"The bad science matrix problem consists in finding, among all matrices $A \\in \\mathbb{R}^{n \\times n}$ with rows having unit $\\ell^2$ norm, one that maximizes $\\beta(A) = \\frac{1}{2^n} \\sum_{x \\in \\{-1, 1\\}^n} \\|Ax\\|_\\infty$. Our main contribution is an explicit construction of an $n \\times n$ matrix $A$ showing that $\\beta(A) \\geq \\sqrt{\\log_2(n+1)}$, which is only 18% smaller than the asymptotic rate. We prove that every entry of any optimal matrix is a square root of a rational number, and we find provably optimal matrices for $n \\leq 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00933","kind":"arxiv","version":2},"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/2408.00933/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"},"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-06-19T16:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk/0v3yevKEQuFmm5Fmn6CxQUtFgI5shQnsC1/j1NCD22g4vwOq2qhiSHx2Y8Usl6bbQOLizUUL0MWWL/vAJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:42:43.216791Z"},"content_sha256":"35062872fb71a3a8ef730d2354c7fac980dbc7bbbcd2aa87d2418016ac83b7b7","schema_version":"1.0","event_id":"sha256:35062872fb71a3a8ef730d2354c7fac980dbc7bbbcd2aa87d2418016ac83b7b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/bundle.json","state_url":"https://pith.science/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/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-07-07T09:42:43Z","links":{"resolver":"https://pith.science/pith/ZTKUXYLL7HGZGZC26RULOIQSZX","bundle":"https://pith.science/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/bundle.json","state":"https://pith.science/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTKUXYLL7HGZGZC26RULOIQSZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZTKUXYLL7HGZGZC26RULOIQSZX","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":"ea69f9ea96a5392f31a2659b8181dc543252096d5c42bad1243b6a1a28b9bad6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-08-01T21:52:18Z","title_canon_sha256":"70f0af4b5ab92d1fa95731debc5dfa33126c2104a1d72d80f8728e00d28ab94b"},"schema_version":"1.0","source":{"id":"2408.00933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00933","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00933v2","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00933","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZTKUXYLL7HGZ","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZTKUXYLL7HGZGZC2","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZTKUXYLL","created_at":"2026-06-19T16:10:28Z"}],"graph_snapshots":[{"event_id":"sha256:35062872fb71a3a8ef730d2354c7fac980dbc7bbbcd2aa87d2418016ac83b7b7","target":"graph","created_at":"2026-06-19T16:10:28Z","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/2408.00933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The bad science matrix problem consists in finding, among all matrices $A \\in \\mathbb{R}^{n \\times n}$ with rows having unit $\\ell^2$ norm, one that maximizes $\\beta(A) = \\frac{1}{2^n} \\sum_{x \\in \\{-1, 1\\}^n} \\|Ax\\|_\\infty$. Our main contribution is an explicit construction of an $n \\times n$ matrix $A$ showing that $\\beta(A) \\geq \\sqrt{\\log_2(n+1)}$, which is only 18% smaller than the asymptotic rate. We prove that every entry of any optimal matrix is a square root of a rational number, and we find provably optimal matrices for $n \\leq 4$.","authors_text":"Alex Albors, Alicia Stepin, Dmitriy Kunisky, Hisham Bhatti, Lukshya Ganjoo, Raymond Guo, Rohan Mukherjee, Tony Zeng","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-08-01T21:52:18Z","title":"On the Structure of Bad Science Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00933","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:ca6b5d2a5a0174f0cccf5921e6c55649ef4380dcbe0c37da06358dfee3a1048e","target":"record","created_at":"2026-06-19T16:10:28Z","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":"ea69f9ea96a5392f31a2659b8181dc543252096d5c42bad1243b6a1a28b9bad6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2024-08-01T21:52:18Z","title_canon_sha256":"70f0af4b5ab92d1fa95731debc5dfa33126c2104a1d72d80f8728e00d28ab94b"},"schema_version":"1.0","source":{"id":"2408.00933","kind":"arxiv","version":2}},"canonical_sha256":"ccd54be16bf9cd93645af468b72212cdeb6d2625dd28d37773c08a00b3144c1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccd54be16bf9cd93645af468b72212cdeb6d2625dd28d37773c08a00b3144c1f","first_computed_at":"2026-06-19T16:10:28.576479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:28.576479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jumWYW4z7NQzFZuoiRFl/F64YjXlo8sD4ASZ2VQ2PVxg26cwUf+UW5YJzSOUFmqmotZo1Cu9yQ/FP2Rw7Z/YDg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:28.576818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.00933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6b5d2a5a0174f0cccf5921e6c55649ef4380dcbe0c37da06358dfee3a1048e","sha256:35062872fb71a3a8ef730d2354c7fac980dbc7bbbcd2aa87d2418016ac83b7b7"],"state_sha256":"0526cf42e87c972cbb842099480a6143fff5fdba0581b3647c85f6ce95defa61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6iJL8XCPwvP2KY0hq9z+rzKOsTc1FBGH568xm1DPCxHj+ge+kohNoY/sIYOQNU5uGdRpEgr66WT32sejypTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:42:43.218753Z","bundle_sha256":"8d6afaf9aedac72f9fc39e92b1a2bb264520ba9f682f79355e2517b0a6ffa695"}}