{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:COVSR3J5ZDXAKQ2VBAVCO7ZOLU","short_pith_number":"pith:COVSR3J5","schema_version":"1.0","canonical_sha256":"13ab28ed3dc8ee054355082a277f2e5d1f5ef8c05fb0caaaa653bab74ab7e5f8","source":{"kind":"arxiv","id":"2605.25303","version":1},"attestation_state":"computed","paper":{"title":"Algorithms with Polynomially-Improved Approximation Factors for the $2 \\rightarrow q$ Norm, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Samuel B. Hopkins, Stefan Tiegel","submitted_at":"2026-05-24T23:56:06Z","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"},"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":"2605.25303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T23:56:06Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1a8e36ca4ddb48d415fad38a68e94645e92e23433442105747ee1586bc681f9f","abstract_canon_sha256":"d57ab14098cef47ee1770a5dc8bbde84962fc0277bd42bfb80d61ea183cf87c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:28.066307Z","signature_b64":"ZtJqQpmO3UeAVtsk5Z0QLKrvuPFcoJzWwHzhCvybuqHW8t1uOHsI7pmH+RXpPTOcUUC7wm4ldai8rPre8qUmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ab28ed3dc8ee054355082a277f2e5d1f5ef8c05fb0caaaa653bab74ab7e5f8","last_reissued_at":"2026-05-26T02:04:28.065836Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:28.065836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms with Polynomially-Improved Approximation Factors for the $2 \\rightarrow q$ Norm, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Samuel B. Hopkins, Stefan Tiegel","submitted_at":"2026-05-24T23:56:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25303","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/2605.25303/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":"2605.25303","created_at":"2026-05-26T02:04:28.065912+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25303v1","created_at":"2026-05-26T02:04:28.065912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25303","created_at":"2026-05-26T02:04:28.065912+00:00"},{"alias_kind":"pith_short_12","alias_value":"COVSR3J5ZDXA","created_at":"2026-05-26T02:04:28.065912+00:00"},{"alias_kind":"pith_short_16","alias_value":"COVSR3J5ZDXAKQ2V","created_at":"2026-05-26T02:04:28.065912+00:00"},{"alias_kind":"pith_short_8","alias_value":"COVSR3J5","created_at":"2026-05-26T02:04:28.065912+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/COVSR3J5ZDXAKQ2VBAVCO7ZOLU","json":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU.json","graph_json":"https://pith.science/api/pith-number/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/graph.json","events_json":"https://pith.science/api/pith-number/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/events.json","paper":"https://pith.science/paper/COVSR3J5"},"agent_actions":{"view_html":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU","download_json":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU.json","view_paper":"https://pith.science/paper/COVSR3J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25303&json=true","fetch_graph":"https://pith.science/api/pith-number/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/graph.json","fetch_events":"https://pith.science/api/pith-number/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/action/storage_attestation","attest_author":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/action/author_attestation","sign_citation":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/action/citation_signature","submit_replication":"https://pith.science/pith/COVSR3J5ZDXAKQ2VBAVCO7ZOLU/action/replication_record"}},"created_at":"2026-05-26T02:04:28.065912+00:00","updated_at":"2026-05-26T02:04:28.065912+00:00"}