{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:47HVZM4FOP7T7LNEY7UVEPTUBT","short_pith_number":"pith:47HVZM4F","schema_version":"1.0","canonical_sha256":"e7cf5cb38573ff3fada4c7e9523e740cf8478a310cb5db7ff317c468945884bc","source":{"kind":"arxiv","id":"1305.5029","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.5029","created_at":"2026-05-18T02:52:56.160172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5029v2","created_at":"2026-05-18T02:52:56.160172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5029","created_at":"2026-05-18T02:52:56.160172+00:00"},{"alias_kind":"pith_short_12","alias_value":"47HVZM4FOP7T","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"47HVZM4FOP7T7LNE","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"47HVZM4F","created_at":"2026-05-18T12:27:32.513160+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/47HVZM4FOP7T7LNEY7UVEPTUBT","json":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT.json","graph_json":"https://pith.science/api/pith-number/47HVZM4FOP7T7LNEY7UVEPTUBT/graph.json","events_json":"https://pith.science/api/pith-number/47HVZM4FOP7T7LNEY7UVEPTUBT/events.json","paper":"https://pith.science/paper/47HVZM4F"},"agent_actions":{"view_html":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT","download_json":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT.json","view_paper":"https://pith.science/paper/47HVZM4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5029&json=true","fetch_graph":"https://pith.science/api/pith-number/47HVZM4FOP7T7LNEY7UVEPTUBT/graph.json","fetch_events":"https://pith.science/api/pith-number/47HVZM4FOP7T7LNEY7UVEPTUBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/action/storage_attestation","attest_author":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/action/author_attestation","sign_citation":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/action/citation_signature","submit_replication":"https://pith.science/pith/47HVZM4FOP7T7LNEY7UVEPTUBT/action/replication_record"}},"created_at":"2026-05-18T02:52:56.160172+00:00","updated_at":"2026-05-18T02:52:56.160172+00:00"}