{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AN7SF6MKDHP2EGWPSJRKVZINTC","short_pith_number":"pith:AN7SF6MK","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"},"canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","source":{"kind":"arxiv","id":"1802.07425","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07425","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07425v2","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07425","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"AN7SF6MKDHP2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AN7SF6MKDHP2EGWP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AN7SF6MK","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AN7SF6MKDHP2EGWPSJRKVZINTC","target":"record","payload":{"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"},"canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","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"},"source_kind":"arxiv","source_id":"1802.07425","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-05-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJAkZsOTwWj32cfnhjqAM0umUbI6yoOKBxGtTEPjCIb5Nv5YA4i7tlcsjFxDir3YtxMDZAaY9h+4G9hiLS0FAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:46:08.039515Z"},"content_sha256":"1bbde2ef8143ef7a840cc4688d85b35728aa37848df1111adc8b6ce936d9ce97","schema_version":"1.0","event_id":"sha256:1bbde2ef8143ef7a840cc4688d85b35728aa37848df1111adc8b6ce936d9ce97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AN7SF6MKDHP2EGWPSJRKVZINTC","target":"graph","payload":{"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"},"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-05-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oInKX1f/MnHVgcc5Ir9DXX6fy0VGvqdrvLnU4kvy53HWyA83hx1WkFRgnG1E6tK2U9TMmnX0tA/GGoTXxJQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:46:08.039873Z"},"content_sha256":"af20685f7f20ef9194c8c8170d8144b38edc5e4eead310ec10ef4230a108d463","schema_version":"1.0","event_id":"sha256:af20685f7f20ef9194c8c8170d8144b38edc5e4eead310ec10ef4230a108d463"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/bundle.json","state_url":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/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-06-03T12:46:08Z","links":{"resolver":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC","bundle":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/bundle.json","state":"https://pith.science/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN7SF6MKDHP2EGWPSJRKVZINTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AN7SF6MKDHP2EGWPSJRKVZINTC","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":"3b666b70762b6cbf0ef4e47583f0db687107eda5ca2891bbfca8a4c171156412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T05:02:10Z","title_canon_sha256":"f7a6dc43da293b7c4f8c24ed9fb9167315f7da110b488e356db9ff0efe1f5cc7"},"schema_version":"1.0","source":{"id":"1802.07425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07425","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07425v2","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07425","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"AN7SF6MKDHP2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AN7SF6MKDHP2EGWP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AN7SF6MK","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:af20685f7f20ef9194c8c8170d8144b38edc5e4eead310ec10ef4230a108d463","target":"graph","created_at":"2026-05-18T00:08:31Z","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"},"paper":{"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 $","authors_text":"Euiwoong Lee, Madhur Tulsiani, Mrinalkanti Ghosh, Venkatesan Guruswami, Vijay Bhattiprolu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T05:02:10Z","title":"Inapproximability of Matrix $p\\rightarrow q$ Norms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07425","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:1bbde2ef8143ef7a840cc4688d85b35728aa37848df1111adc8b6ce936d9ce97","target":"record","created_at":"2026-05-18T00:08:31Z","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":"3b666b70762b6cbf0ef4e47583f0db687107eda5ca2891bbfca8a4c171156412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T05:02:10Z","title_canon_sha256":"f7a6dc43da293b7c4f8c24ed9fb9167315f7da110b488e356db9ff0efe1f5cc7"},"schema_version":"1.0","source":{"id":"1802.07425","kind":"arxiv","version":2}},"canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037f22f98a19dfa21acf9262aae50d98919c9049917c7bcab1861098bda30bb4","first_computed_at":"2026-05-18T00:08:31.147375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:31.147375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4rTXtv00j1LBhoHTG//uP2yPq2JErevrSt75Z1r5VkQ44Y2vb7Vs2Td5lMq2v58Oe6aLm1r3bdWR8D+iEQDHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:31.147799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbde2ef8143ef7a840cc4688d85b35728aa37848df1111adc8b6ce936d9ce97","sha256:af20685f7f20ef9194c8c8170d8144b38edc5e4eead310ec10ef4230a108d463"],"state_sha256":"0bb184a2ff928818e1ead70abe52c3f5d88dc3283f4c9fb83d45003141b9afaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yy6ynlK4lvmd+/SdX1lO8UKmkRJN+Eh7KXzjMzeAfqHa/cn/bNOmAIgTZwse2rDve63A0Kybrc8cLz3vVltCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:46:08.041855Z","bundle_sha256":"792fc00a56158df865dd83e98957a12786b9fdab06e6d89630f9feb331c294e0"}}