{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TXP5UYVW7ICU6NSFXG2FD46TJO","short_pith_number":"pith:TXP5UYVW","canonical_record":{"source":{"id":"1410.6776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-24T18:45:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8a868bafebbfe83d26ccc3f9000a3be1b2b59140fe6f3abb4285c9beeee6b30c","abstract_canon_sha256":"4574ac634c1d69d214182d00e174fa8aa9b0276ac4ab15fa23c55f739d8d4ebf"},"schema_version":"1.0"},"canonical_sha256":"9ddfda62b6fa054f3645b9b451f3d34b9385a97db0efb5d40db3d5a83b1080d6","source":{"kind":"arxiv","id":"1410.6776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6776","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6776v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6776","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"TXP5UYVW7ICU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXP5UYVW7ICU6NSF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXP5UYVW","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TXP5UYVW7ICU6NSFXG2FD46TJO","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-24T18:45:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8a868bafebbfe83d26ccc3f9000a3be1b2b59140fe6f3abb4285c9beeee6b30c","abstract_canon_sha256":"4574ac634c1d69d214182d00e174fa8aa9b0276ac4ab15fa23c55f739d8d4ebf"},"schema_version":"1.0"},"canonical_sha256":"9ddfda62b6fa054f3645b9b451f3d34b9385a97db0efb5d40db3d5a83b1080d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.589454Z","signature_b64":"CIP86ctgn6QiMMk9Eho8K4IRWJBP4Jo8sX0FtGGBr+462nzJN2SjxX1pMnz3KGF8teqi1ESbHDRRh+QX8/KNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ddfda62b6fa054f3645b9b451f3d34b9385a97db0efb5d40db3d5a83b1080d6","last_reissued_at":"2026-05-18T02:39:24.589056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.589056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6776","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBph9AXmMdGmdk0YJUYVUGtsjTJwmZY00Wuj3loTeShkrI86AqzMBibcC6JqglKmdVs4NQqpI5KKDIUkQA6XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:22.859690Z"},"content_sha256":"56cfa9f287c1d765fe64ac6b412069a54249e8f8ebaffaad34b1fc89990c29aa","schema_version":"1.0","event_id":"sha256:56cfa9f287c1d765fe64ac6b412069a54249e8f8ebaffaad34b1fc89990c29aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TXP5UYVW7ICU6NSFXG2FD46TJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online and Stochastic Gradient Methods for Non-decomposable Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Harikrishna Narasimhan, Prateek Jain, Purushottam Kar","submitted_at":"2014-10-24T18:45:23Z","abstract_excerpt":"Modern applications in sensitive domains such as biometrics and medicine frequently require the use of non-decomposable loss functions such as precision@k, F-measure etc. Compared to point loss functions such as hinge-loss, these offer much more fine grained control over prediction, but at the same time present novel challenges in terms of algorithm design and analysis. In this work we initiate a study of online learning techniques for such non-decomposable loss functions with an aim to enable incremental learning as well as design scalable solvers for batch problems. To this end, we propose a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6776","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnlAkAnN+fSorvZMYtXwQbHrDMrI/zGcnCS0zTvapQRFwkVXAsoPEUbSzn1ASod1w4Sjij9w9CKjnsAy/5fkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:07:22.860026Z"},"content_sha256":"ab82cf8d49f0a57289a7e06a020af09a8c11f8c4ecb61361dcd3bf3443220ffb","schema_version":"1.0","event_id":"sha256:ab82cf8d49f0a57289a7e06a020af09a8c11f8c4ecb61361dcd3bf3443220ffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/bundle.json","state_url":"https://pith.science/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/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-20T06:07:22Z","links":{"resolver":"https://pith.science/pith/TXP5UYVW7ICU6NSFXG2FD46TJO","bundle":"https://pith.science/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/bundle.json","state":"https://pith.science/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXP5UYVW7ICU6NSFXG2FD46TJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TXP5UYVW7ICU6NSFXG2FD46TJO","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":"4574ac634c1d69d214182d00e174fa8aa9b0276ac4ab15fa23c55f739d8d4ebf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-24T18:45:23Z","title_canon_sha256":"8a868bafebbfe83d26ccc3f9000a3be1b2b59140fe6f3abb4285c9beeee6b30c"},"schema_version":"1.0","source":{"id":"1410.6776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6776","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6776v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6776","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"TXP5UYVW7ICU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXP5UYVW7ICU6NSF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXP5UYVW","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:ab82cf8d49f0a57289a7e06a020af09a8c11f8c4ecb61361dcd3bf3443220ffb","target":"graph","created_at":"2026-05-18T02:39:24Z","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":"Modern applications in sensitive domains such as biometrics and medicine frequently require the use of non-decomposable loss functions such as precision@k, F-measure etc. Compared to point loss functions such as hinge-loss, these offer much more fine grained control over prediction, but at the same time present novel challenges in terms of algorithm design and analysis. In this work we initiate a study of online learning techniques for such non-decomposable loss functions with an aim to enable incremental learning as well as design scalable solvers for batch problems. To this end, we propose a","authors_text":"Harikrishna Narasimhan, Prateek Jain, Purushottam Kar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-24T18:45:23Z","title":"Online and Stochastic Gradient Methods for Non-decomposable Loss Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6776","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:56cfa9f287c1d765fe64ac6b412069a54249e8f8ebaffaad34b1fc89990c29aa","target":"record","created_at":"2026-05-18T02:39:24Z","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":"4574ac634c1d69d214182d00e174fa8aa9b0276ac4ab15fa23c55f739d8d4ebf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-24T18:45:23Z","title_canon_sha256":"8a868bafebbfe83d26ccc3f9000a3be1b2b59140fe6f3abb4285c9beeee6b30c"},"schema_version":"1.0","source":{"id":"1410.6776","kind":"arxiv","version":1}},"canonical_sha256":"9ddfda62b6fa054f3645b9b451f3d34b9385a97db0efb5d40db3d5a83b1080d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ddfda62b6fa054f3645b9b451f3d34b9385a97db0efb5d40db3d5a83b1080d6","first_computed_at":"2026-05-18T02:39:24.589056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:24.589056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIP86ctgn6QiMMk9Eho8K4IRWJBP4Jo8sX0FtGGBr+462nzJN2SjxX1pMnz3KGF8teqi1ESbHDRRh+QX8/KNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:24.589454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56cfa9f287c1d765fe64ac6b412069a54249e8f8ebaffaad34b1fc89990c29aa","sha256:ab82cf8d49f0a57289a7e06a020af09a8c11f8c4ecb61361dcd3bf3443220ffb"],"state_sha256":"5c5e24352db775be2c04214fad9741f194aee3df555239ee7c08ca6faf9708fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtFm2Nq9/N2CrcwU3NimL8jj4LPxGXXcH+fUHTdoWUkVsM/Rg0lMIb5X9AkQJ0IzwsjurQd4uXkYaO0airvHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:07:22.861879Z","bundle_sha256":"308b018815bbdcaace209caeab25a33f31e8a1c7bea1dc92df94a55b9d9f7d04"}}