{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WGISDHUFXVGYNS4HJHRSJSPBS3","short_pith_number":"pith:WGISDHUF","schema_version":"1.0","canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","source":{"kind":"arxiv","id":"1512.07716","version":1},"attestation_state":"computed","paper":{"title":"Fast Parallel SVM using Data Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Zhang, Hugh Perkins, Jun Zhu, Minjie Xu","submitted_at":"2015-12-24T04:56:28Z","abstract_excerpt":"As one of the most popular classifiers, linear SVMs still have challenges in dealing with very large-scale problems, even though linear or sub-linear algorithms have been developed recently on single machines. Parallel computing methods have been developed for learning large-scale SVMs. However, existing methods rely on solving local sub-optimization problems. In this paper, we develop a novel parallel algorithm for learning large-scale linear SVM. Our approach is based on a data augmentation equivalent formulation, which casts the problem of learning SVM as a Bayesian inference problem, for w"},"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":"1512.07716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-24T04:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"16bdaa2f99763047d71c18da26916b6ebde5204b9bdd04a5bf42cc141b65f2ad","abstract_canon_sha256":"7a077e041bf7917781332315aa0c0fd7766e4ff778bc0181e7576f24b05d1480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:48.677087Z","signature_b64":"G4vVZdqE0jhNcwsfpBEtGQJ7kXdnueIfAl7B/z/cKK1Pfy4Ue1Gcv7eL/cGqr1HGQhFq3o7xqH/4AVC3V/UFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","last_reissued_at":"2026-05-18T01:23:48.676446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:48.676446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Parallel SVM using Data Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Zhang, Hugh Perkins, Jun Zhu, Minjie Xu","submitted_at":"2015-12-24T04:56:28Z","abstract_excerpt":"As one of the most popular classifiers, linear SVMs still have challenges in dealing with very large-scale problems, even though linear or sub-linear algorithms have been developed recently on single machines. Parallel computing methods have been developed for learning large-scale SVMs. However, existing methods rely on solving local sub-optimization problems. In this paper, we develop a novel parallel algorithm for learning large-scale linear SVM. Our approach is based on a data augmentation equivalent formulation, which casts the problem of learning SVM as a Bayesian inference problem, for w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07716","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.07716","created_at":"2026-05-18T01:23:48.676542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07716v1","created_at":"2026-05-18T01:23:48.676542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07716","created_at":"2026-05-18T01:23:48.676542+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGISDHUFXVGY","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGISDHUFXVGYNS4H","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGISDHUF","created_at":"2026-05-18T12:29:47.479230+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/WGISDHUFXVGYNS4HJHRSJSPBS3","json":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3.json","graph_json":"https://pith.science/api/pith-number/WGISDHUFXVGYNS4HJHRSJSPBS3/graph.json","events_json":"https://pith.science/api/pith-number/WGISDHUFXVGYNS4HJHRSJSPBS3/events.json","paper":"https://pith.science/paper/WGISDHUF"},"agent_actions":{"view_html":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3","download_json":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3.json","view_paper":"https://pith.science/paper/WGISDHUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07716&json=true","fetch_graph":"https://pith.science/api/pith-number/WGISDHUFXVGYNS4HJHRSJSPBS3/graph.json","fetch_events":"https://pith.science/api/pith-number/WGISDHUFXVGYNS4HJHRSJSPBS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/action/storage_attestation","attest_author":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/action/author_attestation","sign_citation":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/action/citation_signature","submit_replication":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/action/replication_record"}},"created_at":"2026-05-18T01:23:48.676542+00:00","updated_at":"2026-05-18T01:23:48.676542+00:00"}