{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KCRS263JX3MLZCCBW2V24IKVVJ","short_pith_number":"pith:KCRS263J","canonical_record":{"source":{"id":"1906.06053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T07:16:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"adf87fcc5d8df1f899694d41c2065650628b680ece60facc0f085f9490df4236","abstract_canon_sha256":"4f3efdf07f8d22ecce0f18e1cd9b7a5cef320e8e9103beca2dd2b67165563004"},"schema_version":"1.0"},"canonical_sha256":"50a32d7b69bed8bc8841b6abae2155aa52116dc6e3fc010d11cda65efe8ed89f","source":{"kind":"arxiv","id":"1906.06053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06053","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06053v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06053","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"KCRS263JX3ML","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KCRS263JX3MLZCCB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KCRS263J","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KCRS263JX3MLZCCBW2V24IKVVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T07:16:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"adf87fcc5d8df1f899694d41c2065650628b680ece60facc0f085f9490df4236","abstract_canon_sha256":"4f3efdf07f8d22ecce0f18e1cd9b7a5cef320e8e9103beca2dd2b67165563004"},"schema_version":"1.0"},"canonical_sha256":"50a32d7b69bed8bc8841b6abae2155aa52116dc6e3fc010d11cda65efe8ed89f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:19.897737Z","signature_b64":"s4ooNSFu1vJ0q7BJMiO6zjG836jpFXHdHHnK/6npZxnpy38marGTi9lBAmv3ODsn1BEHoWaEcvnrYtqKPTV2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50a32d7b69bed8bc8841b6abae2155aa52116dc6e3fc010d11cda65efe8ed89f","last_reissued_at":"2026-05-17T23:43:19.897108Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:19.897108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06053","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-17T23:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcJWpzg8wAs1dB+eDYrEA0LGtAu03kFF5pvuXdpj1VPaxXmzMtaMU4aOTvlJCcdHVgiM7F/MKUxUUk2zuQ8DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:33:53.866559Z"},"content_sha256":"c460fc2fd10439be2fb85734b0139678aed55977e81a009e53f69bc784405caf","schema_version":"1.0","event_id":"sha256:c460fc2fd10439be2fb85734b0139678aed55977e81a009e53f69bc784405caf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KCRS263JX3MLZCCBW2V24IKVVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Proximal AUC Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Yiming Ying, Yunwen Lei","submitted_at":"2019-06-14T07:16:26Z","abstract_excerpt":"In this paper we consider the problem of maximizing the Area under the ROC curve (AUC) which is a widely used performance metric in imbalanced classification and anomaly detection. Due to the pairwise nonlinearity of the objective function, classical SGD algorithms do not apply to the task of AUC maximization. We propose a novel stochastic proximal algorithm for AUC maximization which is scalable to large scale streaming data. Our algorithm can accommodate general penalty terms and is easy to implement with favorable $O(d)$ space and per-iteration time complexities. We establish a high-probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06053","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-17T23:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r11A9Kfb4U3s7IQPOOPcxrEe4TA0z7kZcZ+np8HSPLEIOTcfwmG0Jnx5Vh3xKLAySzk0+DLvK+i2EenUrRrhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:33:53.867116Z"},"content_sha256":"d40a7a2639aa3ba161c9c94b15e146eee0cd4a3a3a169c00d558ecdc216a2197","schema_version":"1.0","event_id":"sha256:d40a7a2639aa3ba161c9c94b15e146eee0cd4a3a3a169c00d558ecdc216a2197"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCRS263JX3MLZCCBW2V24IKVVJ/bundle.json","state_url":"https://pith.science/pith/KCRS263JX3MLZCCBW2V24IKVVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCRS263JX3MLZCCBW2V24IKVVJ/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-04T05:33:53Z","links":{"resolver":"https://pith.science/pith/KCRS263JX3MLZCCBW2V24IKVVJ","bundle":"https://pith.science/pith/KCRS263JX3MLZCCBW2V24IKVVJ/bundle.json","state":"https://pith.science/pith/KCRS263JX3MLZCCBW2V24IKVVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCRS263JX3MLZCCBW2V24IKVVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KCRS263JX3MLZCCBW2V24IKVVJ","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":"4f3efdf07f8d22ecce0f18e1cd9b7a5cef320e8e9103beca2dd2b67165563004","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T07:16:26Z","title_canon_sha256":"adf87fcc5d8df1f899694d41c2065650628b680ece60facc0f085f9490df4236"},"schema_version":"1.0","source":{"id":"1906.06053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06053","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06053v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06053","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"KCRS263JX3ML","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KCRS263JX3MLZCCB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KCRS263J","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:d40a7a2639aa3ba161c9c94b15e146eee0cd4a3a3a169c00d558ecdc216a2197","target":"graph","created_at":"2026-05-17T23:43:19Z","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":"In this paper we consider the problem of maximizing the Area under the ROC curve (AUC) which is a widely used performance metric in imbalanced classification and anomaly detection. Due to the pairwise nonlinearity of the objective function, classical SGD algorithms do not apply to the task of AUC maximization. We propose a novel stochastic proximal algorithm for AUC maximization which is scalable to large scale streaming data. Our algorithm can accommodate general penalty terms and is easy to implement with favorable $O(d)$ space and per-iteration time complexities. We establish a high-probabi","authors_text":"Yiming Ying, Yunwen Lei","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T07:16:26Z","title":"Stochastic Proximal AUC Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06053","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:c460fc2fd10439be2fb85734b0139678aed55977e81a009e53f69bc784405caf","target":"record","created_at":"2026-05-17T23:43:19Z","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":"4f3efdf07f8d22ecce0f18e1cd9b7a5cef320e8e9103beca2dd2b67165563004","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T07:16:26Z","title_canon_sha256":"adf87fcc5d8df1f899694d41c2065650628b680ece60facc0f085f9490df4236"},"schema_version":"1.0","source":{"id":"1906.06053","kind":"arxiv","version":1}},"canonical_sha256":"50a32d7b69bed8bc8841b6abae2155aa52116dc6e3fc010d11cda65efe8ed89f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50a32d7b69bed8bc8841b6abae2155aa52116dc6e3fc010d11cda65efe8ed89f","first_computed_at":"2026-05-17T23:43:19.897108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:19.897108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4ooNSFu1vJ0q7BJMiO6zjG836jpFXHdHHnK/6npZxnpy38marGTi9lBAmv3ODsn1BEHoWaEcvnrYtqKPTV2Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:19.897737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c460fc2fd10439be2fb85734b0139678aed55977e81a009e53f69bc784405caf","sha256:d40a7a2639aa3ba161c9c94b15e146eee0cd4a3a3a169c00d558ecdc216a2197"],"state_sha256":"ebc321e64c893d42d8a61ead55c4179e0040f4d922f9e230e6ac1be4f37ecbff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeRmncQFCcnzkWI23Vpxqxh/Z1EviJxRNCm9n+7fy3tdb28qAsNYm1aWbQOMwnN3WizzPmeQepfTZS4O3xR3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:33:53.870415Z","bundle_sha256":"0d638c8c4a33b973ff209db4bbc451ef478991f2a6a19e64b6be1c11473d1066"}}