{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LZ6K5T4NTOWLC2QFBUNW3Z75I5","short_pith_number":"pith:LZ6K5T4N","canonical_record":{"source":{"id":"1810.13258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"6e47f7bcd248f0f4ae62cdab6f48853d1e2b8664496e215f0b7b850b118cd991","abstract_canon_sha256":"0fe5dbb63423c2d4b29629f0998237fad6d858d172811b71407505041a7453e0"},"schema_version":"1.0"},"canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","source":{"kind":"arxiv","id":"1810.13258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13258","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13258v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13258","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"LZ6K5T4NTOWL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZ6K5T4NTOWLC2QF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZ6K5T4N","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LZ6K5T4NTOWLC2QFBUNW3Z75I5","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"6e47f7bcd248f0f4ae62cdab6f48853d1e2b8664496e215f0b7b850b118cd991","abstract_canon_sha256":"0fe5dbb63423c2d4b29629f0998237fad6d858d172811b71407505041a7453e0"},"schema_version":"1.0"},"canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.294796Z","signature_b64":"4dLwErjZ+MiI0lpytGhSfjV9eEJZ+MIrD/xhp82GSzcLSdgbs/ZCTpppB8ALtS5u0+uGhl42QsuBpb+jc+W1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","last_reissued_at":"2026-05-17T23:55:38.294340Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.294340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13258","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-17T23:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc3JkHlK3EtZVzKhgy9NzkxvyPRWDtHy9lWGL3Yqwr3OVpkAeqOmKxS0JSjIr8AA+7clfpMS65LVHTuREbzfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:42:07.846304Z"},"content_sha256":"5f0bb78c0afd70de68b41deca38c94fb03ac8d96fb17b7535f760f47626acea0","schema_version":"1.0","event_id":"sha256:5f0bb78c0afd70de68b41deca38c94fb03ac8d96fb17b7535f760f47626acea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LZ6K5T4NTOWLC2QFBUNW3Z75I5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Fast Leverage Score Sampling and Optimal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Rudi, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino","submitted_at":"2018-10-31T12:54:56Z","abstract_excerpt":"Leverage score sampling provides an appealing way to perform approximate computations for large matrices. Indeed, it allows to derive faithful approximations with a complexity adapted to the problem at hand. Yet, performing leverage scores sampling is a challenge in its own right requiring further approximations. In this paper, we study the problem of leverage score sampling for positive definite matrices defined by a kernel. Our contribution is twofold. First we provide a novel algorithm for leverage score sampling and second, we exploit the proposed method in statistical learning by deriving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13258","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-17T23:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBYqUUoQjMVoK8q15QseCVwPPAPHRGCPnhv1meVREGcpR1FlXWfsuOgpcGYt58j2YDlB/v/Q6oJGEnDFO1LYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:42:07.846983Z"},"content_sha256":"01aa1adb21d6f4b972d8c5951c29a3765ff25c7cc7c00967f5f15ebf19204b8a","schema_version":"1.0","event_id":"sha256:01aa1adb21d6f4b972d8c5951c29a3765ff25c7cc7c00967f5f15ebf19204b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/bundle.json","state_url":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/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-06-01T01:42:07Z","links":{"resolver":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5","bundle":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/bundle.json","state":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LZ6K5T4NTOWLC2QFBUNW3Z75I5","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":"0fe5dbb63423c2d4b29629f0998237fad6d858d172811b71407505041a7453e0","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","title_canon_sha256":"6e47f7bcd248f0f4ae62cdab6f48853d1e2b8664496e215f0b7b850b118cd991"},"schema_version":"1.0","source":{"id":"1810.13258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13258","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13258v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13258","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"LZ6K5T4NTOWL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZ6K5T4NTOWLC2QF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZ6K5T4N","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:01aa1adb21d6f4b972d8c5951c29a3765ff25c7cc7c00967f5f15ebf19204b8a","target":"graph","created_at":"2026-05-17T23:55:38Z","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":"Leverage score sampling provides an appealing way to perform approximate computations for large matrices. Indeed, it allows to derive faithful approximations with a complexity adapted to the problem at hand. Yet, performing leverage scores sampling is a challenge in its own right requiring further approximations. In this paper, we study the problem of leverage score sampling for positive definite matrices defined by a kernel. Our contribution is twofold. First we provide a novel algorithm for leverage score sampling and second, we exploit the proposed method in statistical learning by deriving","authors_text":"Alessandro Rudi, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","title":"On Fast Leverage Score Sampling and Optimal Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13258","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:5f0bb78c0afd70de68b41deca38c94fb03ac8d96fb17b7535f760f47626acea0","target":"record","created_at":"2026-05-17T23:55:38Z","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":"0fe5dbb63423c2d4b29629f0998237fad6d858d172811b71407505041a7453e0","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","title_canon_sha256":"6e47f7bcd248f0f4ae62cdab6f48853d1e2b8664496e215f0b7b850b118cd991"},"schema_version":"1.0","source":{"id":"1810.13258","kind":"arxiv","version":2}},"canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","first_computed_at":"2026-05-17T23:55:38.294340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:38.294340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4dLwErjZ+MiI0lpytGhSfjV9eEJZ+MIrD/xhp82GSzcLSdgbs/ZCTpppB8ALtS5u0+uGhl42QsuBpb+jc+W1BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:38.294796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f0bb78c0afd70de68b41deca38c94fb03ac8d96fb17b7535f760f47626acea0","sha256:01aa1adb21d6f4b972d8c5951c29a3765ff25c7cc7c00967f5f15ebf19204b8a"],"state_sha256":"e1125d24995983b8430c94cde038e364a5b83a4ca527e5df92a172cb720fd803"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fd20DFoSUuJZZx1qIaiUoN+kqoIbwnutb85GemjQmBMK7OCXq1eRVsafk4eByATw2aE0g4gS4cRciSt9kBjvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:42:07.850894Z","bundle_sha256":"70f8c7e77d5d36f1cc03bcb751f3c0a9578b48fa69c8a143be4ad2bbdde4f85e"}}