{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AN7SF6MKDHP2EGWPSJRKVZINTC","short_pith_number":"pith:AN7SF6MK","schema_version":"1.0","canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","source":{"kind":"arxiv","id":"1802.07425","version":2},"attestation_state":"computed","paper":{"title":"Inapproximability of Matrix $p\\rightarrow q$ Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Madhur Tulsiani, Mrinalkanti Ghosh, Venkatesan Guruswami, Vijay Bhattiprolu","submitted_at":"2018-02-21T05:02:10Z","abstract_excerpt":"We study the problem of computing the $p\\rightarrow q$ norm of a matrix $A \\in R^{m \\times n}$, defined as \\[ \\|A\\|_{p\\rightarrow q} ~:=~ \\max_{x \\,\\in\\, R^n \\setminus \\{0\\}} \\frac{\\|Ax\\|_q}{\\|x\\|_p} \\] This problem generalizes the spectral norm of a matrix ($p=q=2$) and the Grothendieck problem ($p=\\infty$, $q=1$), and has been widely studied in various regimes. When $p \\geq q$, the problem exhibits a dichotomy: constant factor approximation algorithms are known if $2 \\in [q,p]$, and the problem is hard to approximate within almost polynomial factors when $2 \\notin [q,p]$.\n  The regime when $"},"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":"1802.07425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T05:02:10Z","cross_cats_sorted":[],"title_canon_sha256":"f7a6dc43da293b7c4f8c24ed9fb9167315f7da110b488e356db9ff0efe1f5cc7","abstract_canon_sha256":"3b666b70762b6cbf0ef4e47583f0db687107eda5ca2891bbfca8a4c171156412"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.147799Z","signature_b64":"4rTXtv00j1LBhoHTG//uP2yPq2JErevrSt75Z1r5VkQ44Y2vb7Vs2Td5lMq2v58Oe6aLm1r3bdWR8D+iEQDHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","last_reissued_at":"2026-05-18T00:08:31.147375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.147375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inapproximability of Matrix $p\\rightarrow q$ Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Madhur Tulsiani, Mrinalkanti Ghosh, Venkatesan Guruswami, Vijay Bhattiprolu","submitted_at":"2018-02-21T05:02:10Z","abstract_excerpt":"We study the problem of computing the $p\\rightarrow q$ norm of a matrix $A \\in R^{m \\times n}$, defined as \\[ \\|A\\|_{p\\rightarrow q} ~:=~ \\max_{x \\,\\in\\, R^n \\setminus \\{0\\}} \\frac{\\|Ax\\|_q}{\\|x\\|_p} \\] This problem generalizes the spectral norm of a matrix ($p=q=2$) and the Grothendieck problem ($p=\\infty$, $q=1$), and has been widely studied in various regimes. When $p \\geq q$, the problem exhibits a dichotomy: constant factor approximation algorithms are known if $2 \\in [q,p]$, and the problem is hard to approximate within almost polynomial factors when $2 \\notin [q,p]$.\n  The regime when $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07425","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":""},"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":"1802.07425","created_at":"2026-05-18T00:08:31.147443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07425v2","created_at":"2026-05-18T00:08:31.147443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07425","created_at":"2026-05-18T00:08:31.147443+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN7SF6MKDHP2","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN7SF6MKDHP2EGWP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN7SF6MK","created_at":"2026-05-18T12:32:13.499390+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/AN7SF6MKDHP2EGWPSJRKVZINTC","json":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC.json","graph_json":"https://pith.science/api/pith-number/AN7SF6MKDHP2EGWPSJRKVZINTC/graph.json","events_json":"https://pith.science/api/pith-number/AN7SF6MKDHP2EGWPSJRKVZINTC/events.json","paper":"https://pith.science/paper/AN7SF6MK"},"agent_actions":{"view_html":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC","download_json":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC.json","view_paper":"https://pith.science/paper/AN7SF6MK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07425&json=true","fetch_graph":"https://pith.science/api/pith-number/AN7SF6MKDHP2EGWPSJRKVZINTC/graph.json","fetch_events":"https://pith.science/api/pith-number/AN7SF6MKDHP2EGWPSJRKVZINTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/action/storage_attestation","attest_author":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/action/author_attestation","sign_citation":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/action/citation_signature","submit_replication":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/action/replication_record"}},"created_at":"2026-05-18T00:08:31.147443+00:00","updated_at":"2026-05-18T00:08:31.147443+00:00"}