{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WJVH6DZQUKLABESJE7QCOMEYB6","short_pith_number":"pith:WJVH6DZQ","canonical_record":{"source":{"id":"1608.02010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"a24c0f75f8da0076651714e1a3c83b906d4fb1b1b1c29ed49a04e06e75f845be","abstract_canon_sha256":"37a04d325a8d72292426b63a9f1bce7e7ea2ff5e17daa5055abf8e07c1e653fa"},"schema_version":"1.0"},"canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","source":{"kind":"arxiv","id":"1608.02010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02010","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02010v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02010","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJVH6DZQUKLA","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WJVH6DZQUKLABESJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WJVH6DZQ","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WJVH6DZQUKLABESJE7QCOMEYB6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"a24c0f75f8da0076651714e1a3c83b906d4fb1b1b1c29ed49a04e06e75f845be","abstract_canon_sha256":"37a04d325a8d72292426b63a9f1bce7e7ea2ff5e17daa5055abf8e07c1e653fa"},"schema_version":"1.0"},"canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.156930Z","signature_b64":"krM7sBUTSKeqCh07grvfRxBbJwEhpHBEefzW/waNQrPoTPaoREHn0PvDYo333uNSyuXHFui1ZWro+pTnOAMjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","last_reissued_at":"2026-05-18T01:09:41.156554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.156554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02010","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:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aRTrrgvuDr7+V0BQldYQn/p3ZBmoVbnzIXVdSccz9PtxJyKLccksHEWZpdegIi0XH833IvwhDgNZ6S5mxNRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:49:27.889915Z"},"content_sha256":"cda63790ee42e30bf6a87cc3e7fa60a6cbab4ac704eed94b93a01387ad32ee7b","schema_version":"1.0","event_id":"sha256:cda63790ee42e30bf6a87cc3e7fa60a6cbab4ac704eed94b93a01387ad32ee7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WJVH6DZQUKLABESJE7QCOMEYB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient Parallel Block Minimization for Kernel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Inderjit S. Dhillon, Si Si","submitted_at":"2016-08-05T20:15:51Z","abstract_excerpt":"Kernel machines often yield superior predictive performance on various tasks; however, they suffer from severe computational challenges. In this paper, we show how to overcome the important challenge of speeding up kernel machines. In particular, we develop a parallel block minimization framework for solving kernel machines, including kernel SVM and kernel logistic regression. Our framework proceeds by dividing the problem into smaller subproblems by forming a block-diagonal approximation of the Hessian matrix. The subproblems are then solved approximately in parallel. After that, a communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02010","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:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEfKnmdhO2D3yZb/Ztcl8GA4a9dxOiOrKwGplPkJIxVnUjT6NImPd5suuK442a9o/Wp2znJMFL5GbtLYnU5+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:49:27.890253Z"},"content_sha256":"de1df9b9179295ff65908c16d5dddd56b397fe0b5dbed96dfbdc6ca3ae79098a","schema_version":"1.0","event_id":"sha256:de1df9b9179295ff65908c16d5dddd56b397fe0b5dbed96dfbdc6ca3ae79098a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/bundle.json","state_url":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJVH6DZQUKLABESJE7QCOMEYB6/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-02T07:49:27Z","links":{"resolver":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6","bundle":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/bundle.json","state":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJVH6DZQUKLABESJE7QCOMEYB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WJVH6DZQUKLABESJE7QCOMEYB6","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":"37a04d325a8d72292426b63a9f1bce7e7ea2ff5e17daa5055abf8e07c1e653fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","title_canon_sha256":"a24c0f75f8da0076651714e1a3c83b906d4fb1b1b1c29ed49a04e06e75f845be"},"schema_version":"1.0","source":{"id":"1608.02010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02010","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02010v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02010","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"WJVH6DZQUKLA","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WJVH6DZQUKLABESJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WJVH6DZQ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:de1df9b9179295ff65908c16d5dddd56b397fe0b5dbed96dfbdc6ca3ae79098a","target":"graph","created_at":"2026-05-18T01:09:41Z","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":"Kernel machines often yield superior predictive performance on various tasks; however, they suffer from severe computational challenges. In this paper, we show how to overcome the important challenge of speeding up kernel machines. In particular, we develop a parallel block minimization framework for solving kernel machines, including kernel SVM and kernel logistic regression. Our framework proceeds by dividing the problem into smaller subproblems by forming a block-diagonal approximation of the Hessian matrix. The subproblems are then solved approximately in parallel. After that, a communicat","authors_text":"Cho-Jui Hsieh, Inderjit S. Dhillon, Si Si","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","title":"Communication-Efficient Parallel Block Minimization for Kernel Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02010","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:cda63790ee42e30bf6a87cc3e7fa60a6cbab4ac704eed94b93a01387ad32ee7b","target":"record","created_at":"2026-05-18T01:09:41Z","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":"37a04d325a8d72292426b63a9f1bce7e7ea2ff5e17daa5055abf8e07c1e653fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","title_canon_sha256":"a24c0f75f8da0076651714e1a3c83b906d4fb1b1b1c29ed49a04e06e75f845be"},"schema_version":"1.0","source":{"id":"1608.02010","kind":"arxiv","version":1}},"canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","first_computed_at":"2026-05-18T01:09:41.156554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.156554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"krM7sBUTSKeqCh07grvfRxBbJwEhpHBEefzW/waNQrPoTPaoREHn0PvDYo333uNSyuXHFui1ZWro+pTnOAMjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.156930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda63790ee42e30bf6a87cc3e7fa60a6cbab4ac704eed94b93a01387ad32ee7b","sha256:de1df9b9179295ff65908c16d5dddd56b397fe0b5dbed96dfbdc6ca3ae79098a"],"state_sha256":"40287eff8748ee05321abb48b242076cd4bbadefef5709abe55dafd5c5fe931d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oh6g4qmUM4pNx468GUv2+nEheJfQzxR5+SfcVUrgUd7W6bwBHydsi/4405GfUfJ129FzDoMGoYFgLiooUWJPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:49:27.892084Z","bundle_sha256":"723b2dedd084426f53e22b61a722df9880c35db92934b60bc1398bd6a2612265"}}