{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3ZPDCL7XMV54VH3URCLIEKDSRB","short_pith_number":"pith:3ZPDCL7X","canonical_record":{"source":{"id":"1602.00351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T00:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"e2091eb09ccd6efbcfb90ec1f00c956ce53235f23d6bf07d0ebc49e67c2a7840","abstract_canon_sha256":"87e5b55e3dd50ac4c65b7354e9a30fafb4dc01acfb7e7b705b7e44ef9cae941f"},"schema_version":"1.0"},"canonical_sha256":"de5e312ff7657bca9f7488968228728848b74dbc655e7e420da88df400348f61","source":{"kind":"arxiv","id":"1602.00351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00351","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00351v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00351","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"3ZPDCL7XMV54","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZPDCL7XMV54VH3U","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZPDCL7X","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3ZPDCL7XMV54VH3URCLIEKDSRB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T00:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"e2091eb09ccd6efbcfb90ec1f00c956ce53235f23d6bf07d0ebc49e67c2a7840","abstract_canon_sha256":"87e5b55e3dd50ac4c65b7354e9a30fafb4dc01acfb7e7b705b7e44ef9cae941f"},"schema_version":"1.0"},"canonical_sha256":"de5e312ff7657bca9f7488968228728848b74dbc655e7e420da88df400348f61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.603129Z","signature_b64":"+iYIMTgW5fNNQNSl5MgiADjQwZBAhKnsp+E9tZ2kUj7aGGWx4OtrzX1fnFSSha9/zS52rHUIp1tbSPDAhwGvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5e312ff7657bca9f7488968228728848b74dbc655e7e420da88df400348f61","last_reissued_at":"2026-05-18T01:21:35.602640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.602640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00351","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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcFIJfnSf5Q4HkiuckJe0yF5zZVFYBN4hhzsdxlV5+e8ESdaKnJ8W8GL3X0e6RgaTpboC5gbL3j1EnWeHZLkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:28:57.107909Z"},"content_sha256":"e863b06a71aea20727f3efe2780b480002aa131e8aa05b36141ba8361bcb7c20","schema_version":"1.0","event_id":"sha256:e863b06a71aea20727f3efe2780b480002aa131e8aa05b36141ba8361bcb7c20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3ZPDCL7XMV54VH3URCLIEKDSRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Subgradient Methods for Online AUC Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Peilin Zhao, Steven C.H. Hoi, Yew-Soon Ong, Yi Ding","submitted_at":"2016-02-01T00:25:18Z","abstract_excerpt":"Learning for maximizing AUC performance is an important research problem in Machine Learning and Artificial Intelligence. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass online learning approaches. Despite their encouraging results reported, the existing online AUC maximization algorithms often adopt simple online gradient descent approaches that fail to exploit the geometrical knowledge of the data observed during the online learning process, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00351","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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33Uw5dUf3DHZK6VAq0YmzLA2XO4m98/aQ3vg7DGeNazuNcGCgMXFZgB6JN/7n6EinD+UemHSOQrstbbfWkOWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:28:57.108248Z"},"content_sha256":"f27f98de4ec1b221bd27a1008f9c6e8d8c5eac7fbd010a2f00b02bc91c920ea3","schema_version":"1.0","event_id":"sha256:f27f98de4ec1b221bd27a1008f9c6e8d8c5eac7fbd010a2f00b02bc91c920ea3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/bundle.json","state_url":"https://pith.science/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/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-03T07:28:57Z","links":{"resolver":"https://pith.science/pith/3ZPDCL7XMV54VH3URCLIEKDSRB","bundle":"https://pith.science/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/bundle.json","state":"https://pith.science/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZPDCL7XMV54VH3URCLIEKDSRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3ZPDCL7XMV54VH3URCLIEKDSRB","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":"87e5b55e3dd50ac4c65b7354e9a30fafb4dc01acfb7e7b705b7e44ef9cae941f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T00:25:18Z","title_canon_sha256":"e2091eb09ccd6efbcfb90ec1f00c956ce53235f23d6bf07d0ebc49e67c2a7840"},"schema_version":"1.0","source":{"id":"1602.00351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00351","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00351v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00351","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"3ZPDCL7XMV54","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZPDCL7XMV54VH3U","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZPDCL7X","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:f27f98de4ec1b221bd27a1008f9c6e8d8c5eac7fbd010a2f00b02bc91c920ea3","target":"graph","created_at":"2026-05-18T01:21:35Z","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":"Learning for maximizing AUC performance is an important research problem in Machine Learning and Artificial Intelligence. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass online learning approaches. Despite their encouraging results reported, the existing online AUC maximization algorithms often adopt simple online gradient descent approaches that fail to exploit the geometrical knowledge of the data observed during the online learning process, and","authors_text":"Peilin Zhao, Steven C.H. Hoi, Yew-Soon Ong, Yi Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T00:25:18Z","title":"Adaptive Subgradient Methods for Online AUC Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00351","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:e863b06a71aea20727f3efe2780b480002aa131e8aa05b36141ba8361bcb7c20","target":"record","created_at":"2026-05-18T01:21:35Z","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":"87e5b55e3dd50ac4c65b7354e9a30fafb4dc01acfb7e7b705b7e44ef9cae941f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T00:25:18Z","title_canon_sha256":"e2091eb09ccd6efbcfb90ec1f00c956ce53235f23d6bf07d0ebc49e67c2a7840"},"schema_version":"1.0","source":{"id":"1602.00351","kind":"arxiv","version":1}},"canonical_sha256":"de5e312ff7657bca9f7488968228728848b74dbc655e7e420da88df400348f61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5e312ff7657bca9f7488968228728848b74dbc655e7e420da88df400348f61","first_computed_at":"2026-05-18T01:21:35.602640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.602640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+iYIMTgW5fNNQNSl5MgiADjQwZBAhKnsp+E9tZ2kUj7aGGWx4OtrzX1fnFSSha9/zS52rHUIp1tbSPDAhwGvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.603129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e863b06a71aea20727f3efe2780b480002aa131e8aa05b36141ba8361bcb7c20","sha256:f27f98de4ec1b221bd27a1008f9c6e8d8c5eac7fbd010a2f00b02bc91c920ea3"],"state_sha256":"8dbbdede77019369b35d8af3ff507489a50397cdc779161f0ba068652798f639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ds6lWjU+LZAZaCcEPBzuVPfd/1Htd0LFHMPdZEvOulMmF4ogtL7qvM8O7IfdQYZhrWXBo2SuHbvF6TfGNwf4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:28:57.110228Z","bundle_sha256":"33f32f8d5b08790f9ce0b44d9774d2d616da348fd7de2f9ece2e8a4b53788f24"}}