{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QLE64HXUPJWRH452ZJ2VTRPEKK","short_pith_number":"pith:QLE64HXU","canonical_record":{"source":{"id":"1908.10831","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-28T17:02:49Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ac35c9ffdfd45bc33b9891fb496139d2d97aecb21ed5286d4cd63259f9c172f6","abstract_canon_sha256":"0ddd4f9f9f97b5cf37f704d9c371f6afb2535167c1ab4720fa411e0adb1aa227"},"schema_version":"1.0"},"canonical_sha256":"82c9ee1ef47a6d13f3baca7559c5e452a24ecfaeda0e91723d3d3af46d7eeb6b","source":{"kind":"arxiv","id":"1908.10831","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10831","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10831v5","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10831","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"QLE64HXUPJWR","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLE64HXUPJWRH452","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLE64HXU","created_at":"2026-07-05T01:14:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QLE64HXUPJWRH452ZJ2VTRPEKK","target":"record","payload":{"canonical_record":{"source":{"id":"1908.10831","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-28T17:02:49Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ac35c9ffdfd45bc33b9891fb496139d2d97aecb21ed5286d4cd63259f9c172f6","abstract_canon_sha256":"0ddd4f9f9f97b5cf37f704d9c371f6afb2535167c1ab4720fa411e0adb1aa227"},"schema_version":"1.0"},"canonical_sha256":"82c9ee1ef47a6d13f3baca7559c5e452a24ecfaeda0e91723d3d3af46d7eeb6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:14:27.886446Z","signature_b64":"B3E2odLIQTCgrHAQa1qfLY0D++geDsiFUIzt7VYvyq+nuhO4rU2znUk/Mc86wSrYkJG73uTnR16/mJRNceT+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82c9ee1ef47a6d13f3baca7559c5e452a24ecfaeda0e91723d3d3af46d7eeb6b","last_reissued_at":"2026-07-05T01:14:27.886041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:14:27.886041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.10831","source_version":5,"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-07-05T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUX0UKrpA0pdMgPjrkcE7SdRfyA8Rx9oh92MTiIACWgzMbpzPJe43ONN75nYz7F17YSuuen2t9N2j4TmxBVkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:21:21.851930Z"},"content_sha256":"6d5f211ad376a5362d501fab98d5a930fb0b182873f82cc00fdc18f2049c5fbb","schema_version":"1.0","event_id":"sha256:6d5f211ad376a5362d501fab98d5a930fb0b182873f82cc00fdc18f2049c5fbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QLE64HXUPJWRH452ZJ2VTRPEKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic AUC Maximization with Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mingrui Liu, Tianbao Yang, Yiming Ying, Zhuoning Yuan","submitted_at":"2019-08-28T17:02:49Z","abstract_excerpt":"Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximization with a linear predictive model, which restricts its predictive power when dealing with extremely complex data. In this paper, we consider stochastic AUC maximization problem with a deep neural network as the predictive model. Building on the saddle point reformulation of a surrogated loss of AUC, the problem can be cast into a {\\it non-convex concave} min-max problem. The main contribution made in this paper is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10831","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.10831/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWBMIFfPs9AUAgAAzzLGTi5WriAOuAtJpXYDy7uVJkJoN6HqeFL17kUk+4yoYOMlTFsO+HzhTMbI5IGK67pXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:21:21.852430Z"},"content_sha256":"806489e328fb17bfc1f42ce589185fa54555e8061815dcb51e5a3cd556033f5e","schema_version":"1.0","event_id":"sha256:806489e328fb17bfc1f42ce589185fa54555e8061815dcb51e5a3cd556033f5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/bundle.json","state_url":"https://pith.science/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/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-08-15T22:21:21Z","links":{"resolver":"https://pith.science/pith/QLE64HXUPJWRH452ZJ2VTRPEKK","bundle":"https://pith.science/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/bundle.json","state":"https://pith.science/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLE64HXUPJWRH452ZJ2VTRPEKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QLE64HXUPJWRH452ZJ2VTRPEKK","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":"0ddd4f9f9f97b5cf37f704d9c371f6afb2535167c1ab4720fa411e0adb1aa227","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-28T17:02:49Z","title_canon_sha256":"ac35c9ffdfd45bc33b9891fb496139d2d97aecb21ed5286d4cd63259f9c172f6"},"schema_version":"1.0","source":{"id":"1908.10831","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10831","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10831v5","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10831","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"QLE64HXUPJWR","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLE64HXUPJWRH452","created_at":"2026-07-05T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLE64HXU","created_at":"2026-07-05T01:14:27Z"}],"graph_snapshots":[{"event_id":"sha256:806489e328fb17bfc1f42ce589185fa54555e8061815dcb51e5a3cd556033f5e","target":"graph","created_at":"2026-07-05T01:14:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.10831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximization with a linear predictive model, which restricts its predictive power when dealing with extremely complex data. In this paper, we consider stochastic AUC maximization problem with a deep neural network as the predictive model. Building on the saddle point reformulation of a surrogated loss of AUC, the problem can be cast into a {\\it non-convex concave} min-max problem. The main contribution made in this paper is t","authors_text":"Mingrui Liu, Tianbao Yang, Yiming Ying, Zhuoning Yuan","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-28T17:02:49Z","title":"Stochastic AUC Maximization with Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10831","kind":"arxiv","version":5},"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:6d5f211ad376a5362d501fab98d5a930fb0b182873f82cc00fdc18f2049c5fbb","target":"record","created_at":"2026-07-05T01:14:27Z","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":"0ddd4f9f9f97b5cf37f704d9c371f6afb2535167c1ab4720fa411e0adb1aa227","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-28T17:02:49Z","title_canon_sha256":"ac35c9ffdfd45bc33b9891fb496139d2d97aecb21ed5286d4cd63259f9c172f6"},"schema_version":"1.0","source":{"id":"1908.10831","kind":"arxiv","version":5}},"canonical_sha256":"82c9ee1ef47a6d13f3baca7559c5e452a24ecfaeda0e91723d3d3af46d7eeb6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82c9ee1ef47a6d13f3baca7559c5e452a24ecfaeda0e91723d3d3af46d7eeb6b","first_computed_at":"2026-07-05T01:14:27.886041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:14:27.886041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B3E2odLIQTCgrHAQa1qfLY0D++geDsiFUIzt7VYvyq+nuhO4rU2znUk/Mc86wSrYkJG73uTnR16/mJRNceT+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:14:27.886446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.10831","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d5f211ad376a5362d501fab98d5a930fb0b182873f82cc00fdc18f2049c5fbb","sha256:806489e328fb17bfc1f42ce589185fa54555e8061815dcb51e5a3cd556033f5e"],"state_sha256":"e0483031f0fafc687741d3e784a81fd0bfa95aca2cfc2a5b5bfe95f2573f76ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5+WUDdBL9Uh2clelW8oQQy0AfBOKqRy6EVJqmnX7ivg3CIa+5QXhiiLq8Chk9EZd0gDHwQ6P6QZ55AwSzjcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:21:21.856570Z","bundle_sha256":"48f3cf6ca6a327c2eb09b173416faa15289e25996b498e60996ac1b48cd94ca7"}}