{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MVFXCKAFMKD2DTXFV5M5EMSQXJ","short_pith_number":"pith:MVFXCKAF","canonical_record":{"source":{"id":"1305.1363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-07T00:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"65a8eb4bf6d91a0694671c159c8c5033f88227f55bdbdd44cb5bc9222f3ce9af","abstract_canon_sha256":"79121e3fbaace9a9cc334c71d3ad1d5ef8948baf2fde47c3605ce464f373d375"},"schema_version":"1.0"},"canonical_sha256":"654b7128056287a1cee5af59d23250ba64e6d6fa2ad42033750f0a776372a29a","source":{"kind":"arxiv","id":"1305.1363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1363","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1363v2","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1363","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"MVFXCKAFMKD2","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"MVFXCKAFMKD2DTXF","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"MVFXCKAF","created_at":"2026-07-05T01:16:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MVFXCKAFMKD2DTXFV5M5EMSQXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-07T00:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"65a8eb4bf6d91a0694671c159c8c5033f88227f55bdbdd44cb5bc9222f3ce9af","abstract_canon_sha256":"79121e3fbaace9a9cc334c71d3ad1d5ef8948baf2fde47c3605ce464f373d375"},"schema_version":"1.0"},"canonical_sha256":"654b7128056287a1cee5af59d23250ba64e6d6fa2ad42033750f0a776372a29a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:30.324935Z","signature_b64":"sEgN69V3mntdmUvbou5cO6VyCJ18J4BxHCbjMIu/vkpBziBHZ2YzdxhIfUmxB598ktdFsiKe7yysY3VMv33YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654b7128056287a1cee5af59d23250ba64e6d6fa2ad42033750f0a776372a29a","last_reissued_at":"2026-07-05T01:16:30.324392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:30.324392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1363","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-07-05T01:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KmaFLsOSBB5krLUjL83QuTSXA9Sg+H3Rk+taq/xksdmEKwD5rdTHBY4BJsmk63gqCt0gj40S3M65uZvWbKAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:27:47.802951Z"},"content_sha256":"9f31d609bd7eb602815839f6972034a06faf80e223ee30807d6db5c990edec8e","schema_version":"1.0","event_id":"sha256:9f31d609bd7eb602815839f6972034a06faf80e223ee30807d6db5c990edec8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MVFXCKAFMKD2DTXFV5M5EMSQXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Pass AUC Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rong Jin, Shenghuo Zhu, Wei Gao, Zhi-Hua Zhou","submitted_at":"2013-05-07T00:30:32Z","abstract_excerpt":"AUC is an important performance measure and many algorithms have been devoted to AUC optimization, mostly by minimizing a surrogate convex loss on a training data set. In this work, we focus on one-pass AUC optimization that requires only going through the training data once without storing the entire training dataset, where conventional online learning algorithms cannot be applied directly because AUC is measured by a sum of losses defined over pairs of instances from different classes. We develop a regression-based algorithm which only needs to maintain the first and second order statistics "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1363","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1305.1363/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:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQseaIff9D18rkx4IYG2o3AxmqaxUgUUrXDaY1EBQdbTFjnFBBOM0gMF0caQNEbn1bFLXYy7xisS37t+vTTkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:27:47.803497Z"},"content_sha256":"4dbab4b22e88f25f07cf5e6bf3f87cda06450209e5d3483ecfe8272b05eeab64","schema_version":"1.0","event_id":"sha256:4dbab4b22e88f25f07cf5e6bf3f87cda06450209e5d3483ecfe8272b05eeab64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/bundle.json","state_url":"https://pith.science/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/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-07T09:27:47Z","links":{"resolver":"https://pith.science/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ","bundle":"https://pith.science/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/bundle.json","state":"https://pith.science/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVFXCKAFMKD2DTXFV5M5EMSQXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MVFXCKAFMKD2DTXFV5M5EMSQXJ","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":"79121e3fbaace9a9cc334c71d3ad1d5ef8948baf2fde47c3605ce464f373d375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-07T00:30:32Z","title_canon_sha256":"65a8eb4bf6d91a0694671c159c8c5033f88227f55bdbdd44cb5bc9222f3ce9af"},"schema_version":"1.0","source":{"id":"1305.1363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1363","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1363v2","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1363","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"MVFXCKAFMKD2","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"MVFXCKAFMKD2DTXF","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"MVFXCKAF","created_at":"2026-07-05T01:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:4dbab4b22e88f25f07cf5e6bf3f87cda06450209e5d3483ecfe8272b05eeab64","target":"graph","created_at":"2026-07-05T01:16:30Z","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/1305.1363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"AUC is an important performance measure and many algorithms have been devoted to AUC optimization, mostly by minimizing a surrogate convex loss on a training data set. In this work, we focus on one-pass AUC optimization that requires only going through the training data once without storing the entire training dataset, where conventional online learning algorithms cannot be applied directly because AUC is measured by a sum of losses defined over pairs of instances from different classes. We develop a regression-based algorithm which only needs to maintain the first and second order statistics ","authors_text":"Rong Jin, Shenghuo Zhu, Wei Gao, Zhi-Hua Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-07T00:30:32Z","title":"One-Pass AUC Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1363","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:9f31d609bd7eb602815839f6972034a06faf80e223ee30807d6db5c990edec8e","target":"record","created_at":"2026-07-05T01:16:30Z","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":"79121e3fbaace9a9cc334c71d3ad1d5ef8948baf2fde47c3605ce464f373d375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-07T00:30:32Z","title_canon_sha256":"65a8eb4bf6d91a0694671c159c8c5033f88227f55bdbdd44cb5bc9222f3ce9af"},"schema_version":"1.0","source":{"id":"1305.1363","kind":"arxiv","version":2}},"canonical_sha256":"654b7128056287a1cee5af59d23250ba64e6d6fa2ad42033750f0a776372a29a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654b7128056287a1cee5af59d23250ba64e6d6fa2ad42033750f0a776372a29a","first_computed_at":"2026-07-05T01:16:30.324392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:30.324392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sEgN69V3mntdmUvbou5cO6VyCJ18J4BxHCbjMIu/vkpBziBHZ2YzdxhIfUmxB598ktdFsiKe7yysY3VMv33YAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:30.324935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f31d609bd7eb602815839f6972034a06faf80e223ee30807d6db5c990edec8e","sha256:4dbab4b22e88f25f07cf5e6bf3f87cda06450209e5d3483ecfe8272b05eeab64"],"state_sha256":"56154195404ad1f66137c6126c88da524524cfc0d12d19f296455b76f6958d2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60EGdxS4ZUSPwUj5+8Xhfim13OZxVZKqf7HvXZE7V6BgvWe8NaYUcqw8TLDeMuXdxK0Khl0QMxXncYo8pHOBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T09:27:47.809698Z","bundle_sha256":"1df313a9c2f6c2e4d54181b8d035a6aa7265b78a65428c1cd9bbba32b59d357b"}}