{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KCAPWQTYPVHGNOXJNHQHQ7OJDJ","short_pith_number":"pith:KCAPWQTY","canonical_record":{"source":{"id":"1511.07294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-23T16:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"f092731110d830769998c4bc9510ea6b3bc1f7419d3b30dd1a7c3b9aaf2296de","abstract_canon_sha256":"91ef3bb74af211b1218e4fd2bac38591f4d1c4eba87fee4f0aeed41511d88909"},"schema_version":"1.0"},"canonical_sha256":"5080fb42787d4e66bae969e0787dc91a41c9e10d8a6963533d90a5d36a6857da","source":{"kind":"arxiv","id":"1511.07294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07294","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07294v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07294","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"KCAPWQTYPVHG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KCAPWQTYPVHGNOXJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KCAPWQTY","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KCAPWQTYPVHGNOXJNHQHQ7OJDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-23T16:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"f092731110d830769998c4bc9510ea6b3bc1f7419d3b30dd1a7c3b9aaf2296de","abstract_canon_sha256":"91ef3bb74af211b1218e4fd2bac38591f4d1c4eba87fee4f0aeed41511d88909"},"schema_version":"1.0"},"canonical_sha256":"5080fb42787d4e66bae969e0787dc91a41c9e10d8a6963533d90a5d36a6857da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.738953Z","signature_b64":"tNd6dzyG5WvTq1fhQzN+9eqow6gV9YgoeRxW3qqyF1heuZwHOvkJpwazgvjV5i+f66Nvmf+xIaHbhJX31eWeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5080fb42787d4e66bae969e0787dc91a41c9e10d8a6963533d90a5d36a6857da","last_reissued_at":"2026-05-18T01:26:11.738387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.738387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07294","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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgnWzHRsGW2hvAZMj275MZNHaSore5ozE5TdCjzEsX6J6HaJxhHfYBgH7UxEMwz3Faa7sODuk7n20/tL0sWkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:49:21.220423Z"},"content_sha256":"daa5c916dc5ce50569fb7ab34408f539f421b519b0820e25690fc89fdc13a06d","schema_version":"1.0","event_id":"sha256:daa5c916dc5ce50569fb7ab34408f539f421b519b0820e25690fc89fdc13a06d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KCAPWQTYPVHGNOXJNHQHQ7OJDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Parallel Block Coordinate Descent for Large-scale Saddle Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Amos J. Storkey, Zhanxing Zhu","submitted_at":"2015-11-23T16:12:11Z","abstract_excerpt":"We consider convex-concave saddle point problems with a separable structure and non-strongly convex functions. We propose an efficient stochastic block coordinate descent method using adaptive primal-dual updates, which enables flexible parallel optimization for large-scale problems. Our method shares the efficiency and flexibility of block coordinate descent methods with the simplicity of primal-dual methods and utilizing the structure of the separable convex-concave saddle point problem. It is capable of solving a wide range of machine learning applications, including robust principal compon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07294","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:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CH4OmUtAYWIeTLUnDHJrQyHRiE6wweOf1D0MvzDW8Xxg6iBz00FnNk/NUc/mDJHXdEeO+oboT5cheoc6RGNhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:49:21.221058Z"},"content_sha256":"c2619bc4190533794fff26b970b850691cae2c54825d80e0c8433a40ecfbb5ac","schema_version":"1.0","event_id":"sha256:c2619bc4190533794fff26b970b850691cae2c54825d80e0c8433a40ecfbb5ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/bundle.json","state_url":"https://pith.science/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/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-05T20:49:21Z","links":{"resolver":"https://pith.science/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ","bundle":"https://pith.science/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/bundle.json","state":"https://pith.science/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCAPWQTYPVHGNOXJNHQHQ7OJDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KCAPWQTYPVHGNOXJNHQHQ7OJDJ","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":"91ef3bb74af211b1218e4fd2bac38591f4d1c4eba87fee4f0aeed41511d88909","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-23T16:12:11Z","title_canon_sha256":"f092731110d830769998c4bc9510ea6b3bc1f7419d3b30dd1a7c3b9aaf2296de"},"schema_version":"1.0","source":{"id":"1511.07294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07294","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07294v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07294","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"KCAPWQTYPVHG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KCAPWQTYPVHGNOXJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KCAPWQTY","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:c2619bc4190533794fff26b970b850691cae2c54825d80e0c8433a40ecfbb5ac","target":"graph","created_at":"2026-05-18T01:26:11Z","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":"We consider convex-concave saddle point problems with a separable structure and non-strongly convex functions. We propose an efficient stochastic block coordinate descent method using adaptive primal-dual updates, which enables flexible parallel optimization for large-scale problems. Our method shares the efficiency and flexibility of block coordinate descent methods with the simplicity of primal-dual methods and utilizing the structure of the separable convex-concave saddle point problem. It is capable of solving a wide range of machine learning applications, including robust principal compon","authors_text":"Amos J. Storkey, Zhanxing Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-23T16:12:11Z","title":"Stochastic Parallel Block Coordinate Descent for Large-scale Saddle Point Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07294","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:daa5c916dc5ce50569fb7ab34408f539f421b519b0820e25690fc89fdc13a06d","target":"record","created_at":"2026-05-18T01:26:11Z","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":"91ef3bb74af211b1218e4fd2bac38591f4d1c4eba87fee4f0aeed41511d88909","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-23T16:12:11Z","title_canon_sha256":"f092731110d830769998c4bc9510ea6b3bc1f7419d3b30dd1a7c3b9aaf2296de"},"schema_version":"1.0","source":{"id":"1511.07294","kind":"arxiv","version":1}},"canonical_sha256":"5080fb42787d4e66bae969e0787dc91a41c9e10d8a6963533d90a5d36a6857da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5080fb42787d4e66bae969e0787dc91a41c9e10d8a6963533d90a5d36a6857da","first_computed_at":"2026-05-18T01:26:11.738387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.738387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tNd6dzyG5WvTq1fhQzN+9eqow6gV9YgoeRxW3qqyF1heuZwHOvkJpwazgvjV5i+f66Nvmf+xIaHbhJX31eWeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.738953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daa5c916dc5ce50569fb7ab34408f539f421b519b0820e25690fc89fdc13a06d","sha256:c2619bc4190533794fff26b970b850691cae2c54825d80e0c8433a40ecfbb5ac"],"state_sha256":"e4da52f12f7157da51e8751c4d3f377bf4f8932b2b87a451d84c2d7db13bec87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vzNUd0YCski3rMJAzlxQoWWGdEREUg2+rLGjiXm85CFcE4gFzUTGJdWFpNNlUEvKNtbridZ1fwEQ7ue1x10Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:49:21.224829Z","bundle_sha256":"331ba31f162cafefcde99a5abe8be45a3983bdafc1c673e668af8f2b8be59768"}}