{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:47HVZM4FOP7T7LNEY7UVEPTUBT","short_pith_number":"pith:47HVZM4F","canonical_record":{"source":{"id":"1305.5029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-05-22T06:30:46Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"f2b35fa52de96584f09a0db4ab88b9b53b8e137bcecaa1515099f75149079dbd","abstract_canon_sha256":"1b10a3c023849dd23b2a9e86a6eccca76e689f97a754352746372f66b008a28f"},"schema_version":"1.0"},"canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","source":{"kind":"arxiv","id":"1305.5029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5029","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5029v2","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5029","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"47HVZM4FOP7T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47HVZM4FOP7T7LNE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47HVZM4F","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:47HVZM4FOP7T7LNEY7UVEPTUBT","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-05-22T06:30:46Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"f2b35fa52de96584f09a0db4ab88b9b53b8e137bcecaa1515099f75149079dbd","abstract_canon_sha256":"1b10a3c023849dd23b2a9e86a6eccca76e689f97a754352746372f66b008a28f"},"schema_version":"1.0"},"canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:56.160768Z","signature_b64":"2DhnrItXG/j2kVpfV+SxcGzRVsUG1uNvAO8rgXz06DhQ36zxbCWkVrpG7AIag8Nl76sOo79DLmyt4CRSokEODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","last_reissued_at":"2026-05-18T02:52:56.160058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:56.160058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5029","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-18T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5DAaHCcaiD4Yrl1cLf2/ZYuIAvjexnSpdQ7LJPXjCvzT/sT5+rV+Qf6Vqar3UhIDvxW3oz0SC9i1eDKOZa3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:18:26.558914Z"},"content_sha256":"fb47bcb27ff8ab1012ef8e312abf3a55d2927f1f96a60b93704462fe01715dfd","schema_version":"1.0","event_id":"sha256:fb47bcb27ff8ab1012ef8e312abf3a55d2927f1f96a60b93704462fe01715dfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:47HVZM4FOP7T7LNEY7UVEPTUBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"John C. Duchi, Martin J. Wainwright, Yuchen Zhang","submitted_at":"2013-05-22T06:30:46Z","abstract_excerpt":"We establish optimal convergence rates for a decomposition-based scalable approach to kernel ridge regression. The method is simple to describe: it randomly partitions a dataset of size N into m subsets of equal size, computes an independent kernel ridge regression estimator for each subset, then averages the local solutions into a global predictor. This partitioning leads to a substantial reduction in computation time versus the standard approach of performing kernel ridge regression on all N samples. Our two main theorems establish that despite the computational speed-up, statistical optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5029","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-18T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNRX4LZu+Ius2NJ7OeycBth6PygruGQeuGLiH1zON46rRVpLFK8dZYzDtKIT6BLCjKCSQ/2ItW9Wzakv+iLRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:18:26.559259Z"},"content_sha256":"6a82a98b11f6c99169a1430e58d718eca7f594dcbb7f1f0dc604540635d3acc1","schema_version":"1.0","event_id":"sha256:6a82a98b11f6c99169a1430e58d718eca7f594dcbb7f1f0dc604540635d3acc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/bundle.json","state_url":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/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-01T20:18:26Z","links":{"resolver":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT","bundle":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/bundle.json","state":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:47HVZM4FOP7T7LNEY7UVEPTUBT","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":"1b10a3c023849dd23b2a9e86a6eccca76e689f97a754352746372f66b008a28f","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-05-22T06:30:46Z","title_canon_sha256":"f2b35fa52de96584f09a0db4ab88b9b53b8e137bcecaa1515099f75149079dbd"},"schema_version":"1.0","source":{"id":"1305.5029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5029","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5029v2","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5029","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"47HVZM4FOP7T","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47HVZM4FOP7T7LNE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47HVZM4F","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6a82a98b11f6c99169a1430e58d718eca7f594dcbb7f1f0dc604540635d3acc1","target":"graph","created_at":"2026-05-18T02:52:56Z","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 establish optimal convergence rates for a decomposition-based scalable approach to kernel ridge regression. The method is simple to describe: it randomly partitions a dataset of size N into m subsets of equal size, computes an independent kernel ridge regression estimator for each subset, then averages the local solutions into a global predictor. This partitioning leads to a substantial reduction in computation time versus the standard approach of performing kernel ridge regression on all N samples. Our two main theorems establish that despite the computational speed-up, statistical optimal","authors_text":"John C. Duchi, Martin J. Wainwright, Yuchen Zhang","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-05-22T06:30:46Z","title":"Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5029","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:fb47bcb27ff8ab1012ef8e312abf3a55d2927f1f96a60b93704462fe01715dfd","target":"record","created_at":"2026-05-18T02:52:56Z","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":"1b10a3c023849dd23b2a9e86a6eccca76e689f97a754352746372f66b008a28f","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-05-22T06:30:46Z","title_canon_sha256":"f2b35fa52de96584f09a0db4ab88b9b53b8e137bcecaa1515099f75149079dbd"},"schema_version":"1.0","source":{"id":"1305.5029","kind":"arxiv","version":2}},"canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","first_computed_at":"2026-05-18T02:52:56.160058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:56.160058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2DhnrItXG/j2kVpfV+SxcGzRVsUG1uNvAO8rgXz06DhQ36zxbCWkVrpG7AIag8Nl76sOo79DLmyt4CRSokEODg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:56.160768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb47bcb27ff8ab1012ef8e312abf3a55d2927f1f96a60b93704462fe01715dfd","sha256:6a82a98b11f6c99169a1430e58d718eca7f594dcbb7f1f0dc604540635d3acc1"],"state_sha256":"0d1398293ccf1091031d0fe7261cfa205caa556725af2d5cf5a45317bf3263a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrFI0HFPF0bt8PHtoh5qDPTlF0CqSc1qUQdA78Vzwm/yj1MGuEhh2HN7JYFdO2eE/0sAMYEbzfaxhyUVa70MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:18:26.561267Z","bundle_sha256":"d5f557717c83d881665fa8e72824c058616f05733a56a89500db9d9dbb1fa9c1"}}