{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:COVSR3J5ZDXAKQ2VBAVCO7ZOLU","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":"d57ab14098cef47ee1770a5dc8bbde84962fc0277bd42bfb80d61ea183cf87c9","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T23:56:06Z","title_canon_sha256":"1a8e36ca4ddb48d415fad38a68e94645e92e23433442105747ee1586bc681f9f"},"schema_version":"1.0","source":{"id":"2605.25303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25303","created_at":"2026-05-26T02:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25303v1","created_at":"2026-05-26T02:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25303","created_at":"2026-05-26T02:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"COVSR3J5ZDXA","created_at":"2026-05-26T02:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"COVSR3J5ZDXAKQ2V","created_at":"2026-05-26T02:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"COVSR3J5","created_at":"2026-05-26T02:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:5d51d3acdc5c110a3c58626411540de7b354d3e8f9178a4349463835b5535a01","target":"graph","created_at":"2026-05-26T02:04: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/2605.25303/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $2 \\rightarrow q$ norm of a matrix $X \\in \\mathbb{R}^{n \\times d}$ is defined as $\\lVert X \\rVert_{2 \\rightarrow q} = \\sup_{\\lVert v \\rVert_2 = 1} \\lVert Xv \\rVert_q$. We give polynomial-time multiplicative approximation algorithms for this norm when $q > 2$ (i.e. in the hypercontractive setting). This problem either directly captures or is closely related to long-standing open problems in combinatorial optimization and hardness of approximation (e.g. Small Set Expansion), quantum information (e.g. Best Separable State), and algorithmic statistics.\n  Very little is known about what approxi","authors_text":"Samuel B. Hopkins, Stefan Tiegel","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T23:56:06Z","title":"Algorithms with Polynomially-Improved Approximation Factors for the $2 \\rightarrow q$ Norm, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25303","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:88defc8e815ae31ef0d5ead0004b3746a29873258c7a8fee0dfba239111e127a","target":"record","created_at":"2026-05-26T02:04: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":"d57ab14098cef47ee1770a5dc8bbde84962fc0277bd42bfb80d61ea183cf87c9","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T23:56:06Z","title_canon_sha256":"1a8e36ca4ddb48d415fad38a68e94645e92e23433442105747ee1586bc681f9f"},"schema_version":"1.0","source":{"id":"2605.25303","kind":"arxiv","version":1}},"canonical_sha256":"13ab28ed3dc8ee054355082a277f2e5d1f5ef8c05fb0caaaa653bab74ab7e5f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ab28ed3dc8ee054355082a277f2e5d1f5ef8c05fb0caaaa653bab74ab7e5f8","first_computed_at":"2026-05-26T02:04:28.065836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:28.065836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZtJqQpmO3UeAVtsk5Z0QLKrvuPFcoJzWwHzhCvybuqHW8t1uOHsI7pmH+RXpPTOcUUC7wm4ldai8rPre8qUmCw==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:28.066307Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88defc8e815ae31ef0d5ead0004b3746a29873258c7a8fee0dfba239111e127a","sha256:5d51d3acdc5c110a3c58626411540de7b354d3e8f9178a4349463835b5535a01"],"state_sha256":"64297a988f7bb90e2b18e5159809845a6a87f48335e65acae39914a67c1e79b8"}