{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CVUH3WSODBOAA22RUJQT4IF46U","short_pith_number":"pith:CVUH3WSO","canonical_record":{"source":{"id":"2505.08146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-13T00:47:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e98c5aa893d3913fd8211a1e40df1e57f51622f1b0040bc740d6351c2d114243","abstract_canon_sha256":"35c1818625062f1f83832f65f60f7e51fe0eae3be51a638ae9315132f497f2d5"},"schema_version":"1.0"},"canonical_sha256":"15687dda4e185c006b51a2613e20bcf50efb93b555fe6185c36002a323aa03ff","source":{"kind":"arxiv","id":"2505.08146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08146","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08146v2","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08146","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"CVUH3WSODBOA","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"CVUH3WSODBOAA22R","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"CVUH3WSO","created_at":"2026-07-05T11:04:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CVUH3WSODBOAA22RUJQT4IF46U","target":"record","payload":{"canonical_record":{"source":{"id":"2505.08146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-13T00:47:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e98c5aa893d3913fd8211a1e40df1e57f51622f1b0040bc740d6351c2d114243","abstract_canon_sha256":"35c1818625062f1f83832f65f60f7e51fe0eae3be51a638ae9315132f497f2d5"},"schema_version":"1.0"},"canonical_sha256":"15687dda4e185c006b51a2613e20bcf50efb93b555fe6185c36002a323aa03ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:51.095590Z","signature_b64":"p8Fsog85i6yg1oKe6La/NgNMXoI2zlX4EUOivINmkzh1PWHiN6vqocbrAqQUjwtA0QFLwnZzRh8j5Gr65bLUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15687dda4e185c006b51a2613e20bcf50efb93b555fe6185c36002a323aa03ff","last_reissued_at":"2026-07-05T11:04:51.095007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:51.095007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.08146","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-07-05T11:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/dpEEI02ZUFwtE1elIKCXynozJuXtxHrRk2PvOSNTdbUd1GAJqOcxy8yyx+KJy25ViYCGdmvpeaaQjTrL0xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:35.954483Z"},"content_sha256":"c46170fb754f0897a4b87a8280ef226af7837871df45edc37c94f85b2309292c","schema_version":"1.0","event_id":"sha256:c46170fb754f0897a4b87a8280ef226af7837871df45edc37c94f85b2309292c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CVUH3WSODBOAA22RUJQT4IF46U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ninh Pham, Rasmus Pagh","submitted_at":"2025-05-13T00:47:17Z","abstract_excerpt":"Approximation of non-linear kernels using random feature maps has become a powerful technique for scaling kernel methods to large datasets. We propose $\\textit{Tensor Sketch}$, an efficient random feature map for approximating polynomial kernels. Given $n$ training samples in $\\mathbb{R}^d$ Tensor Sketch computes low-dimensional embeddings in $\\mathbb{R}^D$ in time $\\mathcal{O}\\left( n(d+D \\log{D}) \\right)$ making it well-suited for high-dimensional and large-scale settings. We provide theoretical guarantees on the approximation error, ensuring the fidelity of the resulting kernel function est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08146","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.08146/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-05T11:04:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zX4iPkLW0gwqTS5PA23l7mAlCz6MsDxRZBsAluJeO3/jMntSIZVKK05Nus1THht1+ofC+CyLObNm6h/Q0/HlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:35.954905Z"},"content_sha256":"c56a76a88a6c70ae37fd27be048d47f5546dfe4ab880b1a08bcdb4b6593300f7","schema_version":"1.0","event_id":"sha256:c56a76a88a6c70ae37fd27be048d47f5546dfe4ab880b1a08bcdb4b6593300f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVUH3WSODBOAA22RUJQT4IF46U/bundle.json","state_url":"https://pith.science/pith/CVUH3WSODBOAA22RUJQT4IF46U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVUH3WSODBOAA22RUJQT4IF46U/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-08-17T12:29:35Z","links":{"resolver":"https://pith.science/pith/CVUH3WSODBOAA22RUJQT4IF46U","bundle":"https://pith.science/pith/CVUH3WSODBOAA22RUJQT4IF46U/bundle.json","state":"https://pith.science/pith/CVUH3WSODBOAA22RUJQT4IF46U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVUH3WSODBOAA22RUJQT4IF46U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CVUH3WSODBOAA22RUJQT4IF46U","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":"35c1818625062f1f83832f65f60f7e51fe0eae3be51a638ae9315132f497f2d5","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-13T00:47:17Z","title_canon_sha256":"e98c5aa893d3913fd8211a1e40df1e57f51622f1b0040bc740d6351c2d114243"},"schema_version":"1.0","source":{"id":"2505.08146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08146","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08146v2","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08146","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_12","alias_value":"CVUH3WSODBOA","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_16","alias_value":"CVUH3WSODBOAA22R","created_at":"2026-07-05T11:04:51Z"},{"alias_kind":"pith_short_8","alias_value":"CVUH3WSO","created_at":"2026-07-05T11:04:51Z"}],"graph_snapshots":[{"event_id":"sha256:c56a76a88a6c70ae37fd27be048d47f5546dfe4ab880b1a08bcdb4b6593300f7","target":"graph","created_at":"2026-07-05T11:04:51Z","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/2505.08146/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximation of non-linear kernels using random feature maps has become a powerful technique for scaling kernel methods to large datasets. We propose $\\textit{Tensor Sketch}$, an efficient random feature map for approximating polynomial kernels. Given $n$ training samples in $\\mathbb{R}^d$ Tensor Sketch computes low-dimensional embeddings in $\\mathbb{R}^D$ in time $\\mathcal{O}\\left( n(d+D \\log{D}) \\right)$ making it well-suited for high-dimensional and large-scale settings. We provide theoretical guarantees on the approximation error, ensuring the fidelity of the resulting kernel function est","authors_text":"Ninh Pham, Rasmus Pagh","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08146","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:c46170fb754f0897a4b87a8280ef226af7837871df45edc37c94f85b2309292c","target":"record","created_at":"2026-07-05T11:04:51Z","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":"35c1818625062f1f83832f65f60f7e51fe0eae3be51a638ae9315132f497f2d5","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-13T00:47:17Z","title_canon_sha256":"e98c5aa893d3913fd8211a1e40df1e57f51622f1b0040bc740d6351c2d114243"},"schema_version":"1.0","source":{"id":"2505.08146","kind":"arxiv","version":2}},"canonical_sha256":"15687dda4e185c006b51a2613e20bcf50efb93b555fe6185c36002a323aa03ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15687dda4e185c006b51a2613e20bcf50efb93b555fe6185c36002a323aa03ff","first_computed_at":"2026-07-05T11:04:51.095007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:51.095007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p8Fsog85i6yg1oKe6La/NgNMXoI2zlX4EUOivINmkzh1PWHiN6vqocbrAqQUjwtA0QFLwnZzRh8j5Gr65bLUCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:51.095590Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.08146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46170fb754f0897a4b87a8280ef226af7837871df45edc37c94f85b2309292c","sha256:c56a76a88a6c70ae37fd27be048d47f5546dfe4ab880b1a08bcdb4b6593300f7"],"state_sha256":"6ee5744b38255ebd2753ae2fc07a38a05c3f211df6a092dfabafc5bcaca0bccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXDFidM9ywIo8u/GvW9SvOTIv85BaNz7rpNpP3z9Sje7D9k5HZ3S5NRlR9ohROF8xJjxawDG/MQT4w62bhmeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:29:35.957871Z","bundle_sha256":"37b51320d28f918299758b8549aac394910f1fe17ef7d9f9c82750a6544e5fc5"}}