{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OZNAUTRTDIR6VB7AMHDXFIIYF2","short_pith_number":"pith:OZNAUTRT","canonical_record":{"source":{"id":"2311.01960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T14:56:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef90f0734291f90752fdf2da65eeb612fcf82f39d460c144f2aa15239dbac607","abstract_canon_sha256":"210fe6184ada9ae59f27f7a30d584b23f371322f59a0e409e9b471f9ccd764a4"},"schema_version":"1.0"},"canonical_sha256":"765a0a4e331a23ea87e061c772a1182e9f4c87b0045c593988110fc6e74fca62","source":{"kind":"arxiv","id":"2311.01960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.01960","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"2311.01960v1","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01960","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"OZNAUTRTDIR6","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_16","alias_value":"OZNAUTRTDIR6VB7A","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_8","alias_value":"OZNAUTRT","created_at":"2026-07-05T07:08:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OZNAUTRTDIR6VB7AMHDXFIIYF2","target":"record","payload":{"canonical_record":{"source":{"id":"2311.01960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T14:56:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef90f0734291f90752fdf2da65eeb612fcf82f39d460c144f2aa15239dbac607","abstract_canon_sha256":"210fe6184ada9ae59f27f7a30d584b23f371322f59a0e409e9b471f9ccd764a4"},"schema_version":"1.0"},"canonical_sha256":"765a0a4e331a23ea87e061c772a1182e9f4c87b0045c593988110fc6e74fca62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:47.951601Z","signature_b64":"UB7sAeqogyhVtxBr0aYPTkvjHhHM88JMfypnv2v00SqmcdjwKzJJvdetPFq5TUyAGGoRIYs1DBxdLFwr84OwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"765a0a4e331a23ea87e061c772a1182e9f4c87b0045c593988110fc6e74fca62","last_reissued_at":"2026-07-05T07:08:47.951077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:47.951077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.01960","source_version":1,"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-07-05T07:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNBEaXupjimMpFqlzB2XR0z2EtRrRWqWGjkFVY1UIVFipBG5Zao8fVfIAkvrRSmKKN6dzWwpbtiAh5ZGLPyjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:21:58.828379Z"},"content_sha256":"12399282143dd64fd03b388af5ad28c4f4dc018e5c20a56785a2e6a0b5526564","schema_version":"1.0","event_id":"sha256:12399282143dd64fd03b388af5ad28c4f4dc018e5c20a56785a2e6a0b5526564"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OZNAUTRTDIR6VB7AMHDXFIIYF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David Woodruff, Qiuyi (Richard) Zhang, Tamas Sarlos, Xingyou Song","submitted_at":"2023-11-03T14:56:24Z","abstract_excerpt":"Inspired by fast algorithms in natural language processing, we study low rank approximation in the entrywise transformed setting where we want to find a good rank $k$ approximation to $f(U \\cdot V)$, where $U, V^\\top \\in \\mathbb{R}^{n \\times r}$ are given, $r = O(\\log(n))$, and $f(x)$ is a general scalar function. Previous work in sublinear low rank approximation has shown that if both (1) $U = V^\\top$ and (2) $f(x)$ is a PSD kernel function, then there is an $O(nk^{\\omega-1})$ time constant relative error approximation algorithm, where $\\omega \\approx 2.376$ is the exponent of matrix multipli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01960","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/2311.01960/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-07-05T07:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/X3to2m7ulFEKmMlfmeIuTncM51u3ixDyZqRBOkLQStQdukn3AlAQrPVLn1jYoGzNGIJUncynwulGm4r6o8DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:21:58.828762Z"},"content_sha256":"f9935ef30a65c59c4919e5ef280ecd8279a8c354501215bbca02ea9702520e4c","schema_version":"1.0","event_id":"sha256:f9935ef30a65c59c4919e5ef280ecd8279a8c354501215bbca02ea9702520e4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/bundle.json","state_url":"https://pith.science/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/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-10T06:21:58Z","links":{"resolver":"https://pith.science/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2","bundle":"https://pith.science/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/bundle.json","state":"https://pith.science/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZNAUTRTDIR6VB7AMHDXFIIYF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OZNAUTRTDIR6VB7AMHDXFIIYF2","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":"210fe6184ada9ae59f27f7a30d584b23f371322f59a0e409e9b471f9ccd764a4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T14:56:24Z","title_canon_sha256":"ef90f0734291f90752fdf2da65eeb612fcf82f39d460c144f2aa15239dbac607"},"schema_version":"1.0","source":{"id":"2311.01960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.01960","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"2311.01960v1","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01960","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"OZNAUTRTDIR6","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_16","alias_value":"OZNAUTRTDIR6VB7A","created_at":"2026-07-05T07:08:47Z"},{"alias_kind":"pith_short_8","alias_value":"OZNAUTRT","created_at":"2026-07-05T07:08:47Z"}],"graph_snapshots":[{"event_id":"sha256:f9935ef30a65c59c4919e5ef280ecd8279a8c354501215bbca02ea9702520e4c","target":"graph","created_at":"2026-07-05T07:08:47Z","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/2311.01960/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inspired by fast algorithms in natural language processing, we study low rank approximation in the entrywise transformed setting where we want to find a good rank $k$ approximation to $f(U \\cdot V)$, where $U, V^\\top \\in \\mathbb{R}^{n \\times r}$ are given, $r = O(\\log(n))$, and $f(x)$ is a general scalar function. Previous work in sublinear low rank approximation has shown that if both (1) $U = V^\\top$ and (2) $f(x)$ is a PSD kernel function, then there is an $O(nk^{\\omega-1})$ time constant relative error approximation algorithm, where $\\omega \\approx 2.376$ is the exponent of matrix multipli","authors_text":"David Woodruff, Qiuyi (Richard) Zhang, Tamas Sarlos, Xingyou Song","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T14:56:24Z","title":"Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01960","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:12399282143dd64fd03b388af5ad28c4f4dc018e5c20a56785a2e6a0b5526564","target":"record","created_at":"2026-07-05T07:08:47Z","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":"210fe6184ada9ae59f27f7a30d584b23f371322f59a0e409e9b471f9ccd764a4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T14:56:24Z","title_canon_sha256":"ef90f0734291f90752fdf2da65eeb612fcf82f39d460c144f2aa15239dbac607"},"schema_version":"1.0","source":{"id":"2311.01960","kind":"arxiv","version":1}},"canonical_sha256":"765a0a4e331a23ea87e061c772a1182e9f4c87b0045c593988110fc6e74fca62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"765a0a4e331a23ea87e061c772a1182e9f4c87b0045c593988110fc6e74fca62","first_computed_at":"2026-07-05T07:08:47.951077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:08:47.951077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UB7sAeqogyhVtxBr0aYPTkvjHhHM88JMfypnv2v00SqmcdjwKzJJvdetPFq5TUyAGGoRIYs1DBxdLFwr84OwAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:08:47.951601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.01960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12399282143dd64fd03b388af5ad28c4f4dc018e5c20a56785a2e6a0b5526564","sha256:f9935ef30a65c59c4919e5ef280ecd8279a8c354501215bbca02ea9702520e4c"],"state_sha256":"7a4f21e23dfe5a68cc7d6714b018e463f92952f6abee3cee0112406dcf89f7fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gpXuvr+nCAnzmPuqN6B8a3T6DamxKAzsUkL7AJVGDVCFKgqIG5c/o+JYeozXxNlxOnDWbULR8y3CNPTdNiHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T06:21:58.830847Z","bundle_sha256":"ee3d4f65a3d96cb466acf9cdc1a8a7c9db800a64fe097ba3f88f647f639f73e6"}}