{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KRZICWE6IGA47U57EIJVGYZEWA","short_pith_number":"pith:KRZICWE6","canonical_record":{"source":{"id":"1612.08633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-27T13:52:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7a57d6ff50d740a36e0d2348e6c3d63b1b554446b1eb0a09bfc22b366a05e491","abstract_canon_sha256":"4c281f9921c2bebe5000e630a961c5f766a6d6be708d2d1db19d54bf567f8c7b"},"schema_version":"1.0"},"canonical_sha256":"547281589e4181cfd3bf2213536324b0118c1c5add6d8cc85a797129cbdd3399","source":{"kind":"arxiv","id":"1612.08633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08633","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08633v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08633","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"KRZICWE6IGA4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRZICWE6IGA47U57","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRZICWE6","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KRZICWE6IGA47U57EIJVGYZEWA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-27T13:52:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7a57d6ff50d740a36e0d2348e6c3d63b1b554446b1eb0a09bfc22b366a05e491","abstract_canon_sha256":"4c281f9921c2bebe5000e630a961c5f766a6d6be708d2d1db19d54bf567f8c7b"},"schema_version":"1.0"},"canonical_sha256":"547281589e4181cfd3bf2213536324b0118c1c5add6d8cc85a797129cbdd3399","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:52.503885Z","signature_b64":"uXA/oWKxYbC0nytd4GWitQPEr9Tda3bEI8YcumP6kEPyOsQDdGErK23lrSGj8o+pPB4JjhJvvHbV/cvyBV78Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"547281589e4181cfd3bf2213536324b0118c1c5add6d8cc85a797129cbdd3399","last_reissued_at":"2026-05-18T00:53:52.503401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:52.503401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08633","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-18T00:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyiSQpxaJSmAdF4szIPbmmb1qtD/Jpxb5LVB1cfj1GoPkKOzH8TC741MR0m1nXHXiV1rsg4gwV5VsOkCdBjiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:29:43.513426Z"},"content_sha256":"af722c6d75d2578df955d2ab9a48a802ce65b21906cfc965a78eeb6fa1a2b8d2","schema_version":"1.0","event_id":"sha256:af722c6d75d2578df955d2ab9a48a802ce65b21906cfc965a78eeb6fa1a2b8d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KRZICWE6IGA47U57EIJVGYZEWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sparse Nonlinear Classifier Design Using AUC Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Dinesh Garg, Shirish K. Shevade, S Sundararajan, Vishal Kakkar","submitted_at":"2016-12-27T13:52:56Z","abstract_excerpt":"AUC (Area under the ROC curve) is an important performance measure for applications where the data is highly imbalanced. Learning to maximize AUC performance is thus an important research problem. Using a max-margin based surrogate loss function, AUC optimization problem can be approximated as a pairwise rankSVM learning problem. Batch learning methods for solving the kernelized version of this problem suffer from scalability and may not result in sparse classifiers. Recent years have witnessed an increased interest in the development of online or single-pass online learning algorithms that de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08633","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-18T00:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh8teoAdNnzZsNB6twJjmRtVtIJyVCjV5maYeTTaNP+3s3mU+zfSZKP6d480aHb2nLByLTGo1gxiWcUofdbhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:29:43.513795Z"},"content_sha256":"51973617456b0709cca426d43ddecbbc39841a2a7d9f1094998a699e358d2321","schema_version":"1.0","event_id":"sha256:51973617456b0709cca426d43ddecbbc39841a2a7d9f1094998a699e358d2321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRZICWE6IGA47U57EIJVGYZEWA/bundle.json","state_url":"https://pith.science/pith/KRZICWE6IGA47U57EIJVGYZEWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRZICWE6IGA47U57EIJVGYZEWA/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-28T09:29:43Z","links":{"resolver":"https://pith.science/pith/KRZICWE6IGA47U57EIJVGYZEWA","bundle":"https://pith.science/pith/KRZICWE6IGA47U57EIJVGYZEWA/bundle.json","state":"https://pith.science/pith/KRZICWE6IGA47U57EIJVGYZEWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRZICWE6IGA47U57EIJVGYZEWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KRZICWE6IGA47U57EIJVGYZEWA","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":"4c281f9921c2bebe5000e630a961c5f766a6d6be708d2d1db19d54bf567f8c7b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-27T13:52:56Z","title_canon_sha256":"7a57d6ff50d740a36e0d2348e6c3d63b1b554446b1eb0a09bfc22b366a05e491"},"schema_version":"1.0","source":{"id":"1612.08633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08633","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08633v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08633","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"KRZICWE6IGA4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRZICWE6IGA47U57","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRZICWE6","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:51973617456b0709cca426d43ddecbbc39841a2a7d9f1094998a699e358d2321","target":"graph","created_at":"2026-05-18T00:53:52Z","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":"AUC (Area under the ROC curve) is an important performance measure for applications where the data is highly imbalanced. Learning to maximize AUC performance is thus an important research problem. Using a max-margin based surrogate loss function, AUC optimization problem can be approximated as a pairwise rankSVM learning problem. Batch learning methods for solving the kernelized version of this problem suffer from scalability and may not result in sparse classifiers. Recent years have witnessed an increased interest in the development of online or single-pass online learning algorithms that de","authors_text":"Dinesh Garg, Shirish K. Shevade, S Sundararajan, Vishal Kakkar","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-27T13:52:56Z","title":"A Sparse Nonlinear Classifier Design Using AUC Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08633","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:af722c6d75d2578df955d2ab9a48a802ce65b21906cfc965a78eeb6fa1a2b8d2","target":"record","created_at":"2026-05-18T00:53:52Z","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":"4c281f9921c2bebe5000e630a961c5f766a6d6be708d2d1db19d54bf567f8c7b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-27T13:52:56Z","title_canon_sha256":"7a57d6ff50d740a36e0d2348e6c3d63b1b554446b1eb0a09bfc22b366a05e491"},"schema_version":"1.0","source":{"id":"1612.08633","kind":"arxiv","version":1}},"canonical_sha256":"547281589e4181cfd3bf2213536324b0118c1c5add6d8cc85a797129cbdd3399","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"547281589e4181cfd3bf2213536324b0118c1c5add6d8cc85a797129cbdd3399","first_computed_at":"2026-05-18T00:53:52.503401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:52.503401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXA/oWKxYbC0nytd4GWitQPEr9Tda3bEI8YcumP6kEPyOsQDdGErK23lrSGj8o+pPB4JjhJvvHbV/cvyBV78Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:52.503885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af722c6d75d2578df955d2ab9a48a802ce65b21906cfc965a78eeb6fa1a2b8d2","sha256:51973617456b0709cca426d43ddecbbc39841a2a7d9f1094998a699e358d2321"],"state_sha256":"dbdb45f7220651feca0a45a0937dfab9e9a4571dbefcc16a05fa0855e15db212"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHb8Xwu9oTlkwTeJDAlDXEdnLU4jV/FHwOTJaX1FquurpaDxLDEPMOwH0HHAkOE0v9tTdTxy+EDh/ckHnwZbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:29:43.515709Z","bundle_sha256":"1dac038aec9c7246dbab57e7bfd334caf6db1ba59a72021e2aefdd94d699492b"}}