{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KX3SWIK26MSOQNYYU7JDGUFSTL","short_pith_number":"pith:KX3SWIK2","schema_version":"1.0","canonical_sha256":"55f72b215af324e83718a7d23350b29ac544fe036110add7741ae4a290fa88b0","source":{"kind":"arxiv","id":"1702.08159","version":15},"attestation_state":"computed","paper":{"title":"McKernel: A Library for Approximate Kernel Expansions in Log-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola, Chong Wah Ngo, Feng Yang, Fernando De la Torre, I. C. Zarza, J. D. Curt\\'o, Luc Van Gool","submitted_at":"2017-02-27T06:30:47Z","abstract_excerpt":"McKernel introduces a framework to use kernel approximates in the mini-batch setting with Stochastic Gradient Descent (SGD) as an alternative to Deep Learning. Based on Random Kitchen Sinks [Rahimi and Recht 2007], we provide a C++ library for Large-scale Machine Learning. It contains a CPU optimized implementation of the algorithm in [Le et al. 2013], that allows the computation of approximated kernel expansions in log-linear time. The algorithm requires to compute the product of matrices Walsh Hadamard. A cache friendly Fast Walsh Hadamard that achieves compelling speed and outperforms curre"},"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":"1702.08159","kind":"arxiv","version":15},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T06:30:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6ee4bde016d87cd4b30e4e15c706de30f892f1f14a37b126c2f62132553190a6","abstract_canon_sha256":"0f975dad7bb7f2ec87dd4b7184cb4b2d245421907989999370aa711ccb91b2e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:42.903171Z","signature_b64":"gsYGXphMZlLVAKvo0ttOnhjST2w8Lsb2nFONSeK//J3evTRFuPL11AuwAOyraIS5EIDEZYPhlz6amMfT07FuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55f72b215af324e83718a7d23350b29ac544fe036110add7741ae4a290fa88b0","last_reissued_at":"2026-07-05T00:55:42.902735Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:42.902735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"McKernel: A Library for Approximate Kernel Expansions in Log-linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola, Chong Wah Ngo, Feng Yang, Fernando De la Torre, I. C. Zarza, J. D. Curt\\'o, Luc Van Gool","submitted_at":"2017-02-27T06:30:47Z","abstract_excerpt":"McKernel introduces a framework to use kernel approximates in the mini-batch setting with Stochastic Gradient Descent (SGD) as an alternative to Deep Learning. Based on Random Kitchen Sinks [Rahimi and Recht 2007], we provide a C++ library for Large-scale Machine Learning. It contains a CPU optimized implementation of the algorithm in [Le et al. 2013], that allows the computation of approximated kernel expansions in log-linear time. The algorithm requires to compute the product of matrices Walsh Hadamard. A cache friendly Fast Walsh Hadamard that achieves compelling speed and outperforms curre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08159","kind":"arxiv","version":15},"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/1702.08159/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08159","created_at":"2026-07-05T00:55:42.902792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08159v15","created_at":"2026-07-05T00:55:42.902792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08159","created_at":"2026-07-05T00:55:42.902792+00:00"},{"alias_kind":"pith_short_12","alias_value":"KX3SWIK26MSO","created_at":"2026-07-05T00:55:42.902792+00:00"},{"alias_kind":"pith_short_16","alias_value":"KX3SWIK26MSOQNYY","created_at":"2026-07-05T00:55:42.902792+00:00"},{"alias_kind":"pith_short_8","alias_value":"KX3SWIK2","created_at":"2026-07-05T00:55:42.902792+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/KX3SWIK26MSOQNYYU7JDGUFSTL","json":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL.json","graph_json":"https://pith.science/api/pith-number/KX3SWIK26MSOQNYYU7JDGUFSTL/graph.json","events_json":"https://pith.science/api/pith-number/KX3SWIK26MSOQNYYU7JDGUFSTL/events.json","paper":"https://pith.science/paper/KX3SWIK2"},"agent_actions":{"view_html":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL","download_json":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL.json","view_paper":"https://pith.science/paper/KX3SWIK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08159&json=true","fetch_graph":"https://pith.science/api/pith-number/KX3SWIK26MSOQNYYU7JDGUFSTL/graph.json","fetch_events":"https://pith.science/api/pith-number/KX3SWIK26MSOQNYYU7JDGUFSTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL/action/storage_attestation","attest_author":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL/action/author_attestation","sign_citation":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL/action/citation_signature","submit_replication":"https://pith.science/pith/KX3SWIK26MSOQNYYU7JDGUFSTL/action/replication_record"}},"created_at":"2026-07-05T00:55:42.902792+00:00","updated_at":"2026-07-05T00:55:42.902792+00:00"}