{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZIULVL5ZCAWRBEYED75J3DORAZ","short_pith_number":"pith:ZIULVL5Z","canonical_record":{"source":{"id":"1802.02907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-07T18:06:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3a10f9bb32c4c504b9a299cc72378d194137a81bc66970f7777e1a72381daec1","abstract_canon_sha256":"ec5ef3a7e42da4e5be41b5a266651ac61a2a7a5e06e27b8710d18aea4454c7c1"},"schema_version":"1.0"},"canonical_sha256":"ca28baafb9102d1093041ffa9d8dd10658389caec394de6ed87ecb156ba3a62a","source":{"kind":"arxiv","id":"1802.02907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02907","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02907v1","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02907","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZIULVL5ZCAWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIULVL5ZCAWRBEYE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIULVL5Z","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZIULVL5ZCAWRBEYED75J3DORAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-07T18:06:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3a10f9bb32c4c504b9a299cc72378d194137a81bc66970f7777e1a72381daec1","abstract_canon_sha256":"ec5ef3a7e42da4e5be41b5a266651ac61a2a7a5e06e27b8710d18aea4454c7c1"},"schema_version":"1.0"},"canonical_sha256":"ca28baafb9102d1093041ffa9d8dd10658389caec394de6ed87ecb156ba3a62a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:20.082067Z","signature_b64":"xMieFoy4QFmFjyt5DBtAxwXFgMT1rp6TNxWGAZTWN28Ix3XzrLf90gDnz26ugwWprWE/cUAtQ+Hsx1yMmy4VBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca28baafb9102d1093041ffa9d8dd10658389caec394de6ed87ecb156ba3a62a","last_reissued_at":"2026-05-18T00:21:20.081268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:20.081268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02907","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-18T00:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHqoFL8i7w6Zz4+LmICINEWrge8bhzh62kX3qHP5b0OTov4yTxW3LPq5Zy3yjYFE3dk4FHnbdLh+0+LhEtwDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:40:13.519685Z"},"content_sha256":"7432bbc4bcf77fd7c2997507a871ce49f001cd1a4d14243006ed8a37d5c77baa","schema_version":"1.0","event_id":"sha256:7432bbc4bcf77fd7c2997507a871ce49f001cd1a4d14243006ed8a37d5c77baa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZIULVL5ZCAWRBEYED75J3DORAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Game-Theoretic Approach to Design Secure and Resilient Distributed Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Quanyan Zhu, Rui Zhang","submitted_at":"2018-02-07T18:06:48Z","abstract_excerpt":"Distributed Support Vector Machines (DSVM) have been developed to solve large-scale classification problems in networked systems with a large number of sensors and control units. However, the systems become more vulnerable as detection and defense are increasingly difficult and expensive. This work aims to develop secure and resilient DSVM algorithms under adversarial environments in which an attacker can manipulate the training data to achieve his objective. We establish a game-theoretic framework to capture the conflicting interests between an adversary and a set of distributed data processi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02907","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-18T00:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xf5TJKPOH7gf6L2d1qP48QepfgJZ5KXSMAULX08PoHPXId2n6Lg3mpxMvK0YN5fh6WMIkJu72mJtN2OsOGs1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:40:13.520037Z"},"content_sha256":"2115179b4a63445e25862e50a445f7bb3f4ef57c8bd51c62b82a8341cb7aafcd","schema_version":"1.0","event_id":"sha256:2115179b4a63445e25862e50a445f7bb3f4ef57c8bd51c62b82a8341cb7aafcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/bundle.json","state_url":"https://pith.science/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/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-28T08:40:13Z","links":{"resolver":"https://pith.science/pith/ZIULVL5ZCAWRBEYED75J3DORAZ","bundle":"https://pith.science/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/bundle.json","state":"https://pith.science/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIULVL5ZCAWRBEYED75J3DORAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZIULVL5ZCAWRBEYED75J3DORAZ","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":"ec5ef3a7e42da4e5be41b5a266651ac61a2a7a5e06e27b8710d18aea4454c7c1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-07T18:06:48Z","title_canon_sha256":"3a10f9bb32c4c504b9a299cc72378d194137a81bc66970f7777e1a72381daec1"},"schema_version":"1.0","source":{"id":"1802.02907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02907","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02907v1","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02907","created_at":"2026-05-18T00:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZIULVL5ZCAWR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIULVL5ZCAWRBEYE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIULVL5Z","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:2115179b4a63445e25862e50a445f7bb3f4ef57c8bd51c62b82a8341cb7aafcd","target":"graph","created_at":"2026-05-18T00:21:20Z","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":"Distributed Support Vector Machines (DSVM) have been developed to solve large-scale classification problems in networked systems with a large number of sensors and control units. However, the systems become more vulnerable as detection and defense are increasingly difficult and expensive. This work aims to develop secure and resilient DSVM algorithms under adversarial environments in which an attacker can manipulate the training data to achieve his objective. We establish a game-theoretic framework to capture the conflicting interests between an adversary and a set of distributed data processi","authors_text":"Quanyan Zhu, Rui Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-07T18:06:48Z","title":"A Game-Theoretic Approach to Design Secure and Resilient Distributed Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02907","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:7432bbc4bcf77fd7c2997507a871ce49f001cd1a4d14243006ed8a37d5c77baa","target":"record","created_at":"2026-05-18T00:21:20Z","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":"ec5ef3a7e42da4e5be41b5a266651ac61a2a7a5e06e27b8710d18aea4454c7c1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-07T18:06:48Z","title_canon_sha256":"3a10f9bb32c4c504b9a299cc72378d194137a81bc66970f7777e1a72381daec1"},"schema_version":"1.0","source":{"id":"1802.02907","kind":"arxiv","version":1}},"canonical_sha256":"ca28baafb9102d1093041ffa9d8dd10658389caec394de6ed87ecb156ba3a62a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca28baafb9102d1093041ffa9d8dd10658389caec394de6ed87ecb156ba3a62a","first_computed_at":"2026-05-18T00:21:20.081268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:20.081268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xMieFoy4QFmFjyt5DBtAxwXFgMT1rp6TNxWGAZTWN28Ix3XzrLf90gDnz26ugwWprWE/cUAtQ+Hsx1yMmy4VBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:20.082067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7432bbc4bcf77fd7c2997507a871ce49f001cd1a4d14243006ed8a37d5c77baa","sha256:2115179b4a63445e25862e50a445f7bb3f4ef57c8bd51c62b82a8341cb7aafcd"],"state_sha256":"2ee194b5bcbe53b9af699c49fd9237c7c30e75f48c794c0a5f6dc40e3e41d32e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmq/eNY0AMeJRr6M2VrNXhEs5OLAtWXi3o61ie53tvRttGMONQsFMVmLGxteUb2PE5qpUaEaFCYSZp9uY12hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:40:13.522141Z","bundle_sha256":"8599dfcef34a2331a425b7d86997ba7d0e092e117ed8de0e86e4ad13d339bbb5"}}