{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LUKMCH4IC2QWAEEE6Y4UBIK6ZX","short_pith_number":"pith:LUKMCH4I","canonical_record":{"source":{"id":"1804.05981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T23:33:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"db29286a013f6d0f70c2277999048dc92a2ca810258d96d8f3281ce976c7d76a","abstract_canon_sha256":"30d8fa4159b5b1fb14e617fb5f00e26547e9c47694177d220322a2d76e854c53"},"schema_version":"1.0"},"canonical_sha256":"5d14c11f8816a1601084f63940a15ecdd27f61796fa430ea735758577afb6980","source":{"kind":"arxiv","id":"1804.05981","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05981","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05981v2","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05981","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"LUKMCH4IC2QW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LUKMCH4IC2QWAEEE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LUKMCH4I","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LUKMCH4IC2QWAEEE6Y4UBIK6ZX","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T23:33:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"db29286a013f6d0f70c2277999048dc92a2ca810258d96d8f3281ce976c7d76a","abstract_canon_sha256":"30d8fa4159b5b1fb14e617fb5f00e26547e9c47694177d220322a2d76e854c53"},"schema_version":"1.0"},"canonical_sha256":"5d14c11f8816a1601084f63940a15ecdd27f61796fa430ea735758577afb6980","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:59.331451Z","signature_b64":"PTJQI0nODWu9xbldrfBhJi2ajnAzjjfkPOj3VdvKx1k63/RubCcgJuQ4v5XEaexdKo+bCqo8VSfhoNPKr1qtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d14c11f8816a1601084f63940a15ecdd27f61796fa430ea735758577afb6980","last_reissued_at":"2026-05-18T00:14:59.330894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:59.330894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05981","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:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04Va/XgQT+7MioHg1/JjZNVwaLuhgt16zUISf5Q8YR+IVS3jYo4zlwPHTFhYg+f4/3l94z46gOQ3Gv4nxzF4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:15:47.791447Z"},"content_sha256":"80ab476dc641182435339a6172ece1f21b636b2200266e3c0f0a994de209369a","schema_version":"1.0","event_id":"sha256:80ab476dc641182435339a6172ece1f21b636b2200266e3c0f0a994de209369a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LUKMCH4IC2QWAEEE6Y4UBIK6ZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Univariate Bound of Area Under ROC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Siwei Lyu, Yiming Ying","submitted_at":"2018-04-16T23:33:09Z","abstract_excerpt":"Area under ROC (AUC) is an important metric for binary classification and bipartite ranking problems. However, it is difficult to directly optimizing AUC as a learning objective, so most existing algorithms are based on optimizing a surrogate loss to AUC. One significant drawback of these surrogate losses is that they require pairwise comparisons among training data, which leads to slow running time and increasing local storage for online learning. In this work, we describe a new surrogate loss based on a reformulation of the AUC risk, which does not require pairwise comparison but rankings of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05981","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:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJmX5lvzamkez/9JiyrankkZ0bSe1HIqjaIW9vKPx/qMMOHW6e9eX8et453jnFg4Vu07+9TrOjjFkhpLi3DBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:15:47.791790Z"},"content_sha256":"9a0e5c2aabe2ed74f53a71aa8e339c88b42133ed01a9a4bf269ab6cdf8611023","schema_version":"1.0","event_id":"sha256:9a0e5c2aabe2ed74f53a71aa8e339c88b42133ed01a9a4bf269ab6cdf8611023"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/bundle.json","state_url":"https://pith.science/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/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-04T01:15:47Z","links":{"resolver":"https://pith.science/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX","bundle":"https://pith.science/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/bundle.json","state":"https://pith.science/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUKMCH4IC2QWAEEE6Y4UBIK6ZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LUKMCH4IC2QWAEEE6Y4UBIK6ZX","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":"30d8fa4159b5b1fb14e617fb5f00e26547e9c47694177d220322a2d76e854c53","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T23:33:09Z","title_canon_sha256":"db29286a013f6d0f70c2277999048dc92a2ca810258d96d8f3281ce976c7d76a"},"schema_version":"1.0","source":{"id":"1804.05981","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05981","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05981v2","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05981","created_at":"2026-05-18T00:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"LUKMCH4IC2QW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LUKMCH4IC2QWAEEE","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LUKMCH4I","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:9a0e5c2aabe2ed74f53a71aa8e339c88b42133ed01a9a4bf269ab6cdf8611023","target":"graph","created_at":"2026-05-18T00:14:59Z","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 ROC (AUC) is an important metric for binary classification and bipartite ranking problems. However, it is difficult to directly optimizing AUC as a learning objective, so most existing algorithms are based on optimizing a surrogate loss to AUC. One significant drawback of these surrogate losses is that they require pairwise comparisons among training data, which leads to slow running time and increasing local storage for online learning. In this work, we describe a new surrogate loss based on a reformulation of the AUC risk, which does not require pairwise comparison but rankings of","authors_text":"Siwei Lyu, Yiming Ying","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T23:33:09Z","title":"A Univariate Bound of Area Under ROC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05981","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:80ab476dc641182435339a6172ece1f21b636b2200266e3c0f0a994de209369a","target":"record","created_at":"2026-05-18T00:14:59Z","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":"30d8fa4159b5b1fb14e617fb5f00e26547e9c47694177d220322a2d76e854c53","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T23:33:09Z","title_canon_sha256":"db29286a013f6d0f70c2277999048dc92a2ca810258d96d8f3281ce976c7d76a"},"schema_version":"1.0","source":{"id":"1804.05981","kind":"arxiv","version":2}},"canonical_sha256":"5d14c11f8816a1601084f63940a15ecdd27f61796fa430ea735758577afb6980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d14c11f8816a1601084f63940a15ecdd27f61796fa430ea735758577afb6980","first_computed_at":"2026-05-18T00:14:59.330894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:59.330894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTJQI0nODWu9xbldrfBhJi2ajnAzjjfkPOj3VdvKx1k63/RubCcgJuQ4v5XEaexdKo+bCqo8VSfhoNPKr1qtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:59.331451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05981","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80ab476dc641182435339a6172ece1f21b636b2200266e3c0f0a994de209369a","sha256:9a0e5c2aabe2ed74f53a71aa8e339c88b42133ed01a9a4bf269ab6cdf8611023"],"state_sha256":"c20d2f100c34ccfe8358fdecc9f638a13e350448bebad9394b6208c5952e6320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7hFdDgGKmp5+qdKmqMRQMNMYN6/FkWXLYV6b8TjPO/n/xrupGntqTro8Lf3KeVcGp/TMuhRbarGvLh9q5zDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:15:47.793660Z","bundle_sha256":"52d60195175f50cd9b21b9396e121692bf5cd6c8109d985fb737b9a94bb7f3b7"}}