{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V4SGYVKJNPQEUOZXW4EHYWBSR6","short_pith_number":"pith:V4SGYVKJ","canonical_record":{"source":{"id":"1507.06615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T19:03:48Z","cross_cats_sorted":[],"title_canon_sha256":"d125994662a01637fcf855010f3647cfc0359da41e43d285543edcf8a852242b","abstract_canon_sha256":"e9de27c24f79c419acab850cc7b5a59e13f9f094644ca5f51728d080fdeefe32"},"schema_version":"1.0"},"canonical_sha256":"af246c55496be04a3b37b7087c58328f8f8c34ad7b7619fa3c3cf0882cd13b24","source":{"kind":"arxiv","id":"1507.06615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06615","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06615v1","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06615","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"pith_short_12","alias_value":"V4SGYVKJNPQE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4SGYVKJNPQEUOZX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4SGYVKJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V4SGYVKJNPQEUOZXW4EHYWBSR6","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T19:03:48Z","cross_cats_sorted":[],"title_canon_sha256":"d125994662a01637fcf855010f3647cfc0359da41e43d285543edcf8a852242b","abstract_canon_sha256":"e9de27c24f79c419acab850cc7b5a59e13f9f094644ca5f51728d080fdeefe32"},"schema_version":"1.0"},"canonical_sha256":"af246c55496be04a3b37b7087c58328f8f8c34ad7b7619fa3c3cf0882cd13b24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:23.140265Z","signature_b64":"OlrGDIPTPWczkqNnf3jJWaxYd8p3z565Eskp5BKG66wAJPCekjcVl1oo1rzASlc19L5PT14kX7daBHRLU0L2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af246c55496be04a3b37b7087c58328f8f8c34ad7b7619fa3c3cf0882cd13b24","last_reissued_at":"2026-05-18T01:36:23.139614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:23.139614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06615","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-18T01:36:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eG/NRu8dfK2Fm/Gxh6uPb4LM2biP82pfAKjJlu/sukYPdio17N0vi2ECfHm1mSO6OsGK7BdatJAJjhsyahXuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:15:46.870233Z"},"content_sha256":"3f68b9c8212cf88a74e7636305d09f72b7a23cbe55a49e93526ec9c740e2bf95","schema_version":"1.0","event_id":"sha256:3f68b9c8212cf88a74e7636305d09f72b7a23cbe55a49e93526ec9c740e2bf95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V4SGYVKJNPQEUOZXW4EHYWBSR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Learning Rates for Localized SVMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ingo Steinwart, Mona Eberts","submitted_at":"2015-07-23T19:03:48Z","abstract_excerpt":"One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in the literature. So far, however, almost all these approaches have only been empirically investigated. In addition, their motivation was always based on computational requirements. In this work, we consider a localized SVM approach based upon a partition of the input space. For t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06615","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":""},"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:36:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wk3fy/mFehL5v6AmOoLZ0U1QtYt4yRf8nMhX/TrQ+IO+FAyq51tMnSeincml11qFvXCNfigo9czUK/rWg1VyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:15:46.870590Z"},"content_sha256":"aceb4f34ac9949ba043c45554e444e46c3c1bd9ffa1fb94899145c0a13530c88","schema_version":"1.0","event_id":"sha256:aceb4f34ac9949ba043c45554e444e46c3c1bd9ffa1fb94899145c0a13530c88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/bundle.json","state_url":"https://pith.science/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/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-27T13:15:46Z","links":{"resolver":"https://pith.science/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6","bundle":"https://pith.science/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/bundle.json","state":"https://pith.science/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4SGYVKJNPQEUOZXW4EHYWBSR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V4SGYVKJNPQEUOZXW4EHYWBSR6","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":"e9de27c24f79c419acab850cc7b5a59e13f9f094644ca5f51728d080fdeefe32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T19:03:48Z","title_canon_sha256":"d125994662a01637fcf855010f3647cfc0359da41e43d285543edcf8a852242b"},"schema_version":"1.0","source":{"id":"1507.06615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06615","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06615v1","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06615","created_at":"2026-05-18T01:36:23Z"},{"alias_kind":"pith_short_12","alias_value":"V4SGYVKJNPQE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4SGYVKJNPQEUOZX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4SGYVKJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:aceb4f34ac9949ba043c45554e444e46c3c1bd9ffa1fb94899145c0a13530c88","target":"graph","created_at":"2026-05-18T01:36:23Z","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":"One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in the literature. So far, however, almost all these approaches have only been empirically investigated. In addition, their motivation was always based on computational requirements. In this work, we consider a localized SVM approach based upon a partition of the input space. For t","authors_text":"Ingo Steinwart, Mona Eberts","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T19:03:48Z","title":"Optimal Learning Rates for Localized SVMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06615","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:3f68b9c8212cf88a74e7636305d09f72b7a23cbe55a49e93526ec9c740e2bf95","target":"record","created_at":"2026-05-18T01:36:23Z","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":"e9de27c24f79c419acab850cc7b5a59e13f9f094644ca5f51728d080fdeefe32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T19:03:48Z","title_canon_sha256":"d125994662a01637fcf855010f3647cfc0359da41e43d285543edcf8a852242b"},"schema_version":"1.0","source":{"id":"1507.06615","kind":"arxiv","version":1}},"canonical_sha256":"af246c55496be04a3b37b7087c58328f8f8c34ad7b7619fa3c3cf0882cd13b24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af246c55496be04a3b37b7087c58328f8f8c34ad7b7619fa3c3cf0882cd13b24","first_computed_at":"2026-05-18T01:36:23.139614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:23.139614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OlrGDIPTPWczkqNnf3jJWaxYd8p3z565Eskp5BKG66wAJPCekjcVl1oo1rzASlc19L5PT14kX7daBHRLU0L2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:23.140265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f68b9c8212cf88a74e7636305d09f72b7a23cbe55a49e93526ec9c740e2bf95","sha256:aceb4f34ac9949ba043c45554e444e46c3c1bd9ffa1fb94899145c0a13530c88"],"state_sha256":"2d02a6164c4149308e3e5286081e931768c03070ce39a5d0ad2d6f10f362bb15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wu0l6cYM4ppegogx1xHpV2ZZ3c426gLRc1dLHelCG5MR2fbe756EqYH5zgYweno3/M1glwFib2VmbmRNUQBUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:15:46.872458Z","bundle_sha256":"24d8088c0c51eb5b3ab31e3372e3c146b9e9dd1a5f417cb41cd656a7daa6b473"}}