{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YJ553JGCQCMKETDL26H4N7VNNE","short_pith_number":"pith:YJ553JGC","canonical_record":{"source":{"id":"2605.19096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T20:32:28Z","cross_cats_sorted":["cs.NA","stat.CO"],"title_canon_sha256":"320f5d1a05ad43b3b2c0e016bcbae6caae426e3be1f6c8d380a8064e3e46c517","abstract_canon_sha256":"41199390d696e0e243e67d4d1f35388255fc38e9f4c52ed017f500d19eb73d13"},"schema_version":"1.0"},"canonical_sha256":"c27bdda4c28098a24c6bd78fc6fead6934a6ec40d51e94b8a51b645b90cc17ee","source":{"kind":"arxiv","id":"2605.19096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19096","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19096v1","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19096","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"YJ553JGCQCMK","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"YJ553JGCQCMKETDL","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"YJ553JGC","created_at":"2026-05-20T01:05:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YJ553JGCQCMKETDL26H4N7VNNE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T20:32:28Z","cross_cats_sorted":["cs.NA","stat.CO"],"title_canon_sha256":"320f5d1a05ad43b3b2c0e016bcbae6caae426e3be1f6c8d380a8064e3e46c517","abstract_canon_sha256":"41199390d696e0e243e67d4d1f35388255fc38e9f4c52ed017f500d19eb73d13"},"schema_version":"1.0"},"canonical_sha256":"c27bdda4c28098a24c6bd78fc6fead6934a6ec40d51e94b8a51b645b90cc17ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:26.984722Z","signature_b64":"U2CtFJu+lLbQhFAOv1YqxnuWn5HCf8H+KXbNJAQVnISEYoCP5kzJUJkhscXzAEMMVvT6G9Yr/drPpx3XJqpLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c27bdda4c28098a24c6bd78fc6fead6934a6ec40d51e94b8a51b645b90cc17ee","last_reissued_at":"2026-05-20T01:05:26.984137Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:26.984137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19096","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-05-20T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xH72WMOr4/c6Aw867jW8vBOu6htWKOhjpH1rqyHHs3sQN4VYNuoaLmoc02DIF23JgSELz38LmfFynmLcgaYxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:51:38.798310Z"},"content_sha256":"5f3d4f56a2fd87c5afce79b7de54b663076d2884913221143d1e69194dabfbb9","schema_version":"1.0","event_id":"sha256:5f3d4f56a2fd87c5afce79b7de54b663076d2884913221143d1e69194dabfbb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YJ553JGCQCMKETDL26H4N7VNNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp analysis of sketched least squares and randomized low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO"],"primary_cat":"math.NA","authors_text":"Ethan N. Epperly, Robert J. Webber","submitted_at":"2026-05-18T20:32:28Z","abstract_excerpt":"Two widely used randomized algorithms are the sketch-and-solve method for least-squares regression and the randomized SVD for low-rank approximation. These algorithms apply a random embedding to compress a target matrix, and they perform computations on the compressed matrix to save computational cost. This paper asks, what is the optimal random embedding in these algorithms? Also, what is the sharpest possible error bound for the optimal embedding? The paper proves that a random orthonormal matrix is minimax optimal for the sketch-and-solve algorithm while any rotation-invariant embedding is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19096","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.19096/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-05-20T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOrLGznBOIiq5GObyz3uis2kS8yQ3oG4n++bOWUH++rL6azCiOu+eF6SGcjtGQ8NOVVe4WbCJt6CKSjTgBjiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:51:38.798790Z"},"content_sha256":"b47ef0f4067d2c6ea8258997193ea6757e50fddfda513adee6af9df7511918b8","schema_version":"1.0","event_id":"sha256:b47ef0f4067d2c6ea8258997193ea6757e50fddfda513adee6af9df7511918b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJ553JGCQCMKETDL26H4N7VNNE/bundle.json","state_url":"https://pith.science/pith/YJ553JGCQCMKETDL26H4N7VNNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJ553JGCQCMKETDL26H4N7VNNE/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-05-26T08:51:38Z","links":{"resolver":"https://pith.science/pith/YJ553JGCQCMKETDL26H4N7VNNE","bundle":"https://pith.science/pith/YJ553JGCQCMKETDL26H4N7VNNE/bundle.json","state":"https://pith.science/pith/YJ553JGCQCMKETDL26H4N7VNNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJ553JGCQCMKETDL26H4N7VNNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YJ553JGCQCMKETDL26H4N7VNNE","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":"41199390d696e0e243e67d4d1f35388255fc38e9f4c52ed017f500d19eb73d13","cross_cats_sorted":["cs.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T20:32:28Z","title_canon_sha256":"320f5d1a05ad43b3b2c0e016bcbae6caae426e3be1f6c8d380a8064e3e46c517"},"schema_version":"1.0","source":{"id":"2605.19096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19096","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19096v1","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19096","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"YJ553JGCQCMK","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"YJ553JGCQCMKETDL","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"YJ553JGC","created_at":"2026-05-20T01:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:b47ef0f4067d2c6ea8258997193ea6757e50fddfda513adee6af9df7511918b8","target":"graph","created_at":"2026-05-20T01:05:26Z","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.19096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two widely used randomized algorithms are the sketch-and-solve method for least-squares regression and the randomized SVD for low-rank approximation. These algorithms apply a random embedding to compress a target matrix, and they perform computations on the compressed matrix to save computational cost. This paper asks, what is the optimal random embedding in these algorithms? Also, what is the sharpest possible error bound for the optimal embedding? The paper proves that a random orthonormal matrix is minimax optimal for the sketch-and-solve algorithm while any rotation-invariant embedding is ","authors_text":"Ethan N. Epperly, Robert J. Webber","cross_cats":["cs.NA","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T20:32:28Z","title":"Sharp analysis of sketched least squares and randomized low-rank approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19096","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:5f3d4f56a2fd87c5afce79b7de54b663076d2884913221143d1e69194dabfbb9","target":"record","created_at":"2026-05-20T01:05:26Z","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":"41199390d696e0e243e67d4d1f35388255fc38e9f4c52ed017f500d19eb73d13","cross_cats_sorted":["cs.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T20:32:28Z","title_canon_sha256":"320f5d1a05ad43b3b2c0e016bcbae6caae426e3be1f6c8d380a8064e3e46c517"},"schema_version":"1.0","source":{"id":"2605.19096","kind":"arxiv","version":1}},"canonical_sha256":"c27bdda4c28098a24c6bd78fc6fead6934a6ec40d51e94b8a51b645b90cc17ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c27bdda4c28098a24c6bd78fc6fead6934a6ec40d51e94b8a51b645b90cc17ee","first_computed_at":"2026-05-20T01:05:26.984137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:26.984137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U2CtFJu+lLbQhFAOv1YqxnuWn5HCf8H+KXbNJAQVnISEYoCP5kzJUJkhscXzAEMMVvT6G9Yr/drPpx3XJqpLCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:26.984722Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f3d4f56a2fd87c5afce79b7de54b663076d2884913221143d1e69194dabfbb9","sha256:b47ef0f4067d2c6ea8258997193ea6757e50fddfda513adee6af9df7511918b8"],"state_sha256":"018fb1d0dc018787d633a2f230a84361b74d17c94d3aebd5f2190e7d9decd9af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bO4IEAddt+KKgb3BIIuXoxGBG5IMmt4a4v9gXn6DDgHyVCmx9al8TnqfO4bEvkwICqVbay96ww2yQEqRQuCFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:51:38.801276Z","bundle_sha256":"97631fed4fc6f70cd07608e2e1ffa1d93cfb3b7e7326bca405f5e2abe9030752"}}