{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZFERUJBVUKZ6XRGPQNYUDEIGQT","short_pith_number":"pith:ZFERUJBV","canonical_record":{"source":{"id":"1605.09046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T19:07:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ba37c3ac9fb641d1d0107a5be64ddadee9857692d12a6ff7959ee74a7b4c7cb8","abstract_canon_sha256":"fb11dffbbf848455fe1c082e2e4ea9d147a437891b110f90e65c4cc3d7afa1b9"},"schema_version":"1.0"},"canonical_sha256":"c9491a2435a2b3ebc4cf837141910684f18013952c83ff670cb85d0b50ce1a4f","source":{"kind":"arxiv","id":"1605.09046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09046","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09046v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09046","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZFERUJBVUKZ6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFERUJBVUKZ6XRGP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFERUJBV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZFERUJBVUKZ6XRGPQNYUDEIGQT","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T19:07:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ba37c3ac9fb641d1d0107a5be64ddadee9857692d12a6ff7959ee74a7b4c7cb8","abstract_canon_sha256":"fb11dffbbf848455fe1c082e2e4ea9d147a437891b110f90e65c4cc3d7afa1b9"},"schema_version":"1.0"},"canonical_sha256":"c9491a2435a2b3ebc4cf837141910684f18013952c83ff670cb85d0b50ce1a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.579110Z","signature_b64":"fmC6wCr2lZrKwhXFp1TnfFoK+H4t6L6v2MLgCMQU9K+CnI1KF5MMQnESHIXJZY5XWMnUIL/d+0joLgoACmwcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9491a2435a2b3ebc4cf837141910684f18013952c83ff670cb85d0b50ce1a4f","last_reissued_at":"2026-05-18T01:12:54.578764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.578764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09046","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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+vtowIKEJeG0C9SO3CU41mu5vxfZGw+B4kat0q9pdIy8OBmq17Rp1+T97JhglJBzH28OAzc/6LsPzlGKN9aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:58:30.959853Z"},"content_sha256":"23232cdd3ab91542e3930b1621a384931049146a70c62556591d5f5ef88098c4","schema_version":"1.0","event_id":"sha256:23232cdd3ab91542e3930b1621a384931049146a70c62556591d5f5ef88098c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZFERUJBVUKZ6XRGPQNYUDEIGQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TripleSpin - a generic compact paradigm for fast machine learning computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anne Morvan, Cedric Gouy-Pailler, Francois Fagan, Jamal Atif, Krzysztof Choromanski, Tamas Sarlos","submitted_at":"2016-05-29T19:07:09Z","abstract_excerpt":"We present a generic compact computational framework relying on structured random matrices that can be applied to speed up several machine learning algorithms with almost no loss of accuracy. The applications include new fast LSH-based algorithms, efficient kernel computations via random feature maps, convex optimization algorithms, quantization techniques and many more. Certain models of the presented paradigm are even more compressible since they apply only bit matrices. This makes them suitable for deploying on mobile devices. All our findings come with strong theoretical guarantees. In par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09046","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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJII+CiN0fCJy7LkDkX28u2eMS5k3fAKPEtlSirWbp+v3rTrXoT+00ci8Fe4e+NjHseXlQiCvY4McuFl5M/yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:58:30.960613Z"},"content_sha256":"9a95b6612ee2be6fa4a8710a8c4e47ee86c48ded923ac213eab62d8fbb23effe","schema_version":"1.0","event_id":"sha256:9a95b6612ee2be6fa4a8710a8c4e47ee86c48ded923ac213eab62d8fbb23effe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/bundle.json","state_url":"https://pith.science/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/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-30T16:58:30Z","links":{"resolver":"https://pith.science/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT","bundle":"https://pith.science/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/bundle.json","state":"https://pith.science/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFERUJBVUKZ6XRGPQNYUDEIGQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZFERUJBVUKZ6XRGPQNYUDEIGQT","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":"fb11dffbbf848455fe1c082e2e4ea9d147a437891b110f90e65c4cc3d7afa1b9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T19:07:09Z","title_canon_sha256":"ba37c3ac9fb641d1d0107a5be64ddadee9857692d12a6ff7959ee74a7b4c7cb8"},"schema_version":"1.0","source":{"id":"1605.09046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09046","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09046v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09046","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZFERUJBVUKZ6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFERUJBVUKZ6XRGP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFERUJBV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9a95b6612ee2be6fa4a8710a8c4e47ee86c48ded923ac213eab62d8fbb23effe","target":"graph","created_at":"2026-05-18T01:12:54Z","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 present a generic compact computational framework relying on structured random matrices that can be applied to speed up several machine learning algorithms with almost no loss of accuracy. The applications include new fast LSH-based algorithms, efficient kernel computations via random feature maps, convex optimization algorithms, quantization techniques and many more. Certain models of the presented paradigm are even more compressible since they apply only bit matrices. This makes them suitable for deploying on mobile devices. All our findings come with strong theoretical guarantees. In par","authors_text":"Anne Morvan, Cedric Gouy-Pailler, Francois Fagan, Jamal Atif, Krzysztof Choromanski, Tamas Sarlos","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T19:07:09Z","title":"TripleSpin - a generic compact paradigm for fast machine learning computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09046","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:23232cdd3ab91542e3930b1621a384931049146a70c62556591d5f5ef88098c4","target":"record","created_at":"2026-05-18T01:12:54Z","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":"fb11dffbbf848455fe1c082e2e4ea9d147a437891b110f90e65c4cc3d7afa1b9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-29T19:07:09Z","title_canon_sha256":"ba37c3ac9fb641d1d0107a5be64ddadee9857692d12a6ff7959ee74a7b4c7cb8"},"schema_version":"1.0","source":{"id":"1605.09046","kind":"arxiv","version":2}},"canonical_sha256":"c9491a2435a2b3ebc4cf837141910684f18013952c83ff670cb85d0b50ce1a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9491a2435a2b3ebc4cf837141910684f18013952c83ff670cb85d0b50ce1a4f","first_computed_at":"2026-05-18T01:12:54.578764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.578764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmC6wCr2lZrKwhXFp1TnfFoK+H4t6L6v2MLgCMQU9K+CnI1KF5MMQnESHIXJZY5XWMnUIL/d+0joLgoACmwcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.579110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23232cdd3ab91542e3930b1621a384931049146a70c62556591d5f5ef88098c4","sha256:9a95b6612ee2be6fa4a8710a8c4e47ee86c48ded923ac213eab62d8fbb23effe"],"state_sha256":"305058758e4758d9d01c2253d757683e6bbefd660f81b6d5c1bfac5e7fe75dba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvZe7B9rzrgNnyAoWRCOraFR3ibMpyE2KsLzOBF+xcGWZwEZfXQmeYKDBuqv0bjtX/jDt1DPZ4Q3IppRO4B8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:58:30.964870Z","bundle_sha256":"bb1e0e87bb107b2b712d9f61105b5aaf147ec2588c2c7149dbc0d9fba7ec0a97"}}