{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K4GYJRTXBPBIHP2EDVHG3HYTCX","short_pith_number":"pith:K4GYJRTX","canonical_record":{"source":{"id":"1805.11221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T02:30:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3071dca7431e7066cb3feedd9c03369ecb752955a6404784f8c332cdda3ac41d","abstract_canon_sha256":"59b20d0f0a139a433b545d3419415fb6f3eb2a25adb57ed55a54f038c9ae9679"},"schema_version":"1.0"},"canonical_sha256":"570d84c6770bc283bf441d4e6d9f1315d18c578c1c652afad965e399c1605142","source":{"kind":"arxiv","id":"1805.11221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11221","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11221v2","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11221","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"K4GYJRTXBPBI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K4GYJRTXBPBIHP2E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K4GYJRTX","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K4GYJRTXBPBIHP2EDVHG3HYTCX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T02:30:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3071dca7431e7066cb3feedd9c03369ecb752955a6404784f8c332cdda3ac41d","abstract_canon_sha256":"59b20d0f0a139a433b545d3419415fb6f3eb2a25adb57ed55a54f038c9ae9679"},"schema_version":"1.0"},"canonical_sha256":"570d84c6770bc283bf441d4e6d9f1315d18c578c1c652afad965e399c1605142","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:33.593889Z","signature_b64":"3VdngUzamZjvO29LEU7HBrMqfIMxTU9szqRwfmNam6Vd6oyAZj2zE1gUcupKD3mpfcOT3jn9RsxrKmUE0QDyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"570d84c6770bc283bf441d4e6d9f1315d18c578c1c652afad965e399c1605142","last_reissued_at":"2026-05-18T00:14:33.593236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:33.593236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11221","source_version":2,"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:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUOA6/VZs08HfbrVn1qDOLqANQx1a7uAVv+KMTTvXNODBuGjs7dUonmwByCDxqG2H07q10xo0XWSfoiXA74iCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:42.451055Z"},"content_sha256":"9ce6d07f883bd10a8ff669e2bf66e417c0102dd976edef8f025beada749266d2","schema_version":"1.0","event_id":"sha256:9ce6d07f883bd10a8ff669e2bf66e417c0102dd976edef8f025beada749266d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K4GYJRTXBPBIHP2EDVHG3HYTCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MBA: Mini-Batch AUC Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adwait Ratnaparkhi, Avishek Saha, John Paisley, San Gultekin","submitted_at":"2018-05-29T02:30:40Z","abstract_excerpt":"Area under the receiver operating characteristics curve (AUC) is an important metric for a wide range of signal processing and machine learning problems, and scalable methods for optimizing AUC have recently been proposed. However, handling very large datasets remains an open challenge for this problem. This paper proposes a novel approach to AUC maximization, based on sampling mini-batches of positive/negative instance pairs and computing U-statistics to approximate a global risk minimization problem. The resulting algorithm is simple, fast, and learning-rate free. We show that the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11221","kind":"arxiv","version":2},"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:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shg8vAZlCk3ITFwCjveDw+e3LksDue79EMloQWIoNVaFwGi7mQkTlNyCX+BH+X6LBL15IYwDjQ88tJHnZBaSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:42.451608Z"},"content_sha256":"a8c8c22f40abc8770ca6979a197918c8e76aacd4aed1f8785942f66e9aa7bc51","schema_version":"1.0","event_id":"sha256:a8c8c22f40abc8770ca6979a197918c8e76aacd4aed1f8785942f66e9aa7bc51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/bundle.json","state_url":"https://pith.science/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/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-01T21:58:42Z","links":{"resolver":"https://pith.science/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX","bundle":"https://pith.science/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/bundle.json","state":"https://pith.science/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4GYJRTXBPBIHP2EDVHG3HYTCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K4GYJRTXBPBIHP2EDVHG3HYTCX","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":"59b20d0f0a139a433b545d3419415fb6f3eb2a25adb57ed55a54f038c9ae9679","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T02:30:40Z","title_canon_sha256":"3071dca7431e7066cb3feedd9c03369ecb752955a6404784f8c332cdda3ac41d"},"schema_version":"1.0","source":{"id":"1805.11221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11221","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11221v2","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11221","created_at":"2026-05-18T00:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"K4GYJRTXBPBI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K4GYJRTXBPBIHP2E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K4GYJRTX","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a8c8c22f40abc8770ca6979a197918c8e76aacd4aed1f8785942f66e9aa7bc51","target":"graph","created_at":"2026-05-18T00:14:33Z","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":"Area under the receiver operating characteristics curve (AUC) is an important metric for a wide range of signal processing and machine learning problems, and scalable methods for optimizing AUC have recently been proposed. However, handling very large datasets remains an open challenge for this problem. This paper proposes a novel approach to AUC maximization, based on sampling mini-batches of positive/negative instance pairs and computing U-statistics to approximate a global risk minimization problem. The resulting algorithm is simple, fast, and learning-rate free. We show that the number of ","authors_text":"Adwait Ratnaparkhi, Avishek Saha, John Paisley, San Gultekin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T02:30:40Z","title":"MBA: Mini-Batch AUC Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11221","kind":"arxiv","version":2},"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:9ce6d07f883bd10a8ff669e2bf66e417c0102dd976edef8f025beada749266d2","target":"record","created_at":"2026-05-18T00:14:33Z","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":"59b20d0f0a139a433b545d3419415fb6f3eb2a25adb57ed55a54f038c9ae9679","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T02:30:40Z","title_canon_sha256":"3071dca7431e7066cb3feedd9c03369ecb752955a6404784f8c332cdda3ac41d"},"schema_version":"1.0","source":{"id":"1805.11221","kind":"arxiv","version":2}},"canonical_sha256":"570d84c6770bc283bf441d4e6d9f1315d18c578c1c652afad965e399c1605142","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"570d84c6770bc283bf441d4e6d9f1315d18c578c1c652afad965e399c1605142","first_computed_at":"2026-05-18T00:14:33.593236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:33.593236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VdngUzamZjvO29LEU7HBrMqfIMxTU9szqRwfmNam6Vd6oyAZj2zE1gUcupKD3mpfcOT3jn9RsxrKmUE0QDyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:33.593889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ce6d07f883bd10a8ff669e2bf66e417c0102dd976edef8f025beada749266d2","sha256:a8c8c22f40abc8770ca6979a197918c8e76aacd4aed1f8785942f66e9aa7bc51"],"state_sha256":"05d46ea3f3bca2ee2239550ef58b30128cf55f3f68c31db94899829fcf7e6d8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6CBftZbV75/e6Migv8BnRmQTTfJ4Vwycpqy7vCelWl7jndlGTRcrmSs89nYQTauIrCHRluNPMdpTURY2RQlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:58:42.453472Z","bundle_sha256":"22fcd8bd233648e0bb9d86e15488ebf26ab50c09d03006c5f12e5aaecc424dd9"}}