{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WGISDHUFXVGYNS4HJHRSJSPBS3","short_pith_number":"pith:WGISDHUF","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"},"canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","source":{"kind":"arxiv","id":"1512.07716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07716","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07716v1","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07716","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"WGISDHUFXVGY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WGISDHUFXVGYNS4H","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WGISDHUF","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WGISDHUFXVGYNS4HJHRSJSPBS3","target":"record","payload":{"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"},"canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","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"},"source_kind":"arxiv","source_id":"1512.07716","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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILzUBr3O1maXzYmun97qrkdIZRS1gxpIi/gqfce3/tBkB0RHCQAiM9uwhSyaSFz59InyNVdTAJ+qtk1OV31yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:27:18.722195Z"},"content_sha256":"c2e67584e25a8281a54c5b8ea50e86f96dbfb5962061ed867d7882bdddcd05f0","schema_version":"1.0","event_id":"sha256:c2e67584e25a8281a54c5b8ea50e86f96dbfb5962061ed867d7882bdddcd05f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WGISDHUFXVGYNS4HJHRSJSPBS3","target":"graph","payload":{"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"},"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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzKXvpf1HwbeaTep8HoNo7p22QO4TRXSBihNe93uk+ebd58h7nv4UuV5UgRpJ7uEWZppxuWkGnkcB+OzydEHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:27:18.722555Z"},"content_sha256":"6b456b3ec092c46a94fa5022980ac869d5060f68bbfd45200a8fabf5799e7506","schema_version":"1.0","event_id":"sha256:6b456b3ec092c46a94fa5022980ac869d5060f68bbfd45200a8fabf5799e7506"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/bundle.json","state_url":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/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-05-30T12:27:18Z","links":{"resolver":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3","bundle":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/bundle.json","state":"https://pith.science/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGISDHUFXVGYNS4HJHRSJSPBS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WGISDHUFXVGYNS4HJHRSJSPBS3","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":"7a077e041bf7917781332315aa0c0fd7766e4ff778bc0181e7576f24b05d1480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-24T04:56:28Z","title_canon_sha256":"16bdaa2f99763047d71c18da26916b6ebde5204b9bdd04a5bf42cc141b65f2ad"},"schema_version":"1.0","source":{"id":"1512.07716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07716","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07716v1","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07716","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"WGISDHUFXVGY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WGISDHUFXVGYNS4H","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WGISDHUF","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:6b456b3ec092c46a94fa5022980ac869d5060f68bbfd45200a8fabf5799e7506","target":"graph","created_at":"2026-05-18T01:23:48Z","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":"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","authors_text":"Bo Zhang, Hugh Perkins, Jun Zhu, Minjie Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-24T04:56:28Z","title":"Fast Parallel SVM using Data Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07716","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:c2e67584e25a8281a54c5b8ea50e86f96dbfb5962061ed867d7882bdddcd05f0","target":"record","created_at":"2026-05-18T01:23:48Z","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":"7a077e041bf7917781332315aa0c0fd7766e4ff778bc0181e7576f24b05d1480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-24T04:56:28Z","title_canon_sha256":"16bdaa2f99763047d71c18da26916b6ebde5204b9bdd04a5bf42cc141b65f2ad"},"schema_version":"1.0","source":{"id":"1512.07716","kind":"arxiv","version":1}},"canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b191219e85bd4d86cb8749e324c9e196c233588ba3c7aa0f1d01c09b14ae39d1","first_computed_at":"2026-05-18T01:23:48.676446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:48.676446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4vVZdqE0jhNcwsfpBEtGQJ7kXdnueIfAl7B/z/cKK1Pfy4Ue1Gcv7eL/cGqr1HGQhFq3o7xqH/4AVC3V/UFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:48.677087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2e67584e25a8281a54c5b8ea50e86f96dbfb5962061ed867d7882bdddcd05f0","sha256:6b456b3ec092c46a94fa5022980ac869d5060f68bbfd45200a8fabf5799e7506"],"state_sha256":"98010aa160dcc94a2e924c39db044cdf5371f99159df0a0b3f745c133b615636"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGaiBtWBgwoGxpkjcBILwRe1ZdFbu2RChK0Vo6XJPpoxOx9PerqFV37m9j5w55YWC5cH5qAiMzRW3v8NYlgnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:27:18.724433Z","bundle_sha256":"028915415f6800b6807ad578895d7bc2b5a839dcb7f5b9bcd6deae56bb954578"}}