{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BOTMAINMIRSUOVWSU2H7YQWV5M","short_pith_number":"pith:BOTMAINM","canonical_record":{"source":{"id":"1410.1462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-06T17:10:23Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"ed125e57295bfda84e98770057244706029c01adf530961a32e5ade2ac025ad4","abstract_canon_sha256":"b6579f39cd490f255534fc31bbd8f3a36a82fca50f3ef82bab9f8a7076155a0c"},"schema_version":"1.0"},"canonical_sha256":"0ba6c021ac44654756d2a68ffc42d5eb0c8be34dc3f51573e858f98163838080","source":{"kind":"arxiv","id":"1410.1462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1462","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1462v1","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1462","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOTMAINMIRSU","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"BOTMAINMIRSUOVWS","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"BOTMAINM","created_at":"2026-07-05T01:16:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BOTMAINMIRSUOVWSU2H7YQWV5M","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-06T17:10:23Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"ed125e57295bfda84e98770057244706029c01adf530961a32e5ade2ac025ad4","abstract_canon_sha256":"b6579f39cd490f255534fc31bbd8f3a36a82fca50f3ef82bab9f8a7076155a0c"},"schema_version":"1.0"},"canonical_sha256":"0ba6c021ac44654756d2a68ffc42d5eb0c8be34dc3f51573e858f98163838080","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:30.386438Z","signature_b64":"u1xnLOxpNVjh/aIk2yNk/Rz3bhKmnlbN9XdeoHRt+6SfwiWWQoApEeKjOlmv+aX4PKyc1sPe35noJI9EfnFKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba6c021ac44654756d2a68ffc42d5eb0c8be34dc3f51573e858f98163838080","last_reissued_at":"2026-07-05T01:16:30.385995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:30.385995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1462","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-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":"AQPUP14i+hE4MoNvZa1+90AnPVO0Rmm1MQ6UO5u63NVL1XFFBvPSZPqRiYTJ5U2p1Yp9bkoGb6cHvDhSKCNFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:12:01.196643Z"},"content_sha256":"33802b7116a84634235cca371465f64227d9c30561df62406e51dc78642d4a31","schema_version":"1.0","event_id":"sha256:33802b7116a84634235cca371465f64227d9c30561df62406e51dc78642d4a31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BOTMAINMIRSUOVWSU2H7YQWV5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top Rank Optimization in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Nan Li, Rong Jin, Zhi-Hua Zhou","submitted_at":"2014-10-06T17:10:23Z","abstract_excerpt":"Bipartite ranking aims to learn a real-valued ranking function that orders positive instances before negative instances. Recent efforts of bipartite ranking are focused on optimizing ranking accuracy at the top of the ranked list. Most existing approaches are either to optimize task specific metrics or to extend the ranking loss by emphasizing more on the error associated with the top ranked instances, leading to a high computational cost that is super-linear in the number of training instances. We propose a highly efficient approach, titled TopPush, for optimizing accuracy at the top that has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1462","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1410.1462/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":"ZHBl+pYfBD8ShsNrZOD9hr2l5LflPLykztNYJe+M9+iqxRFB3RLzEamWuLbNTkCT3yfqvuydnKWFBq7RSGIcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:12:01.197597Z"},"content_sha256":"1170d494bc41b8e8f86eee39b8876af03a33de5ecdea3c5a71f5278d7daed594","schema_version":"1.0","event_id":"sha256:1170d494bc41b8e8f86eee39b8876af03a33de5ecdea3c5a71f5278d7daed594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/bundle.json","state_url":"https://pith.science/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/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-12T14:12:01Z","links":{"resolver":"https://pith.science/pith/BOTMAINMIRSUOVWSU2H7YQWV5M","bundle":"https://pith.science/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/bundle.json","state":"https://pith.science/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOTMAINMIRSUOVWSU2H7YQWV5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BOTMAINMIRSUOVWSU2H7YQWV5M","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":"b6579f39cd490f255534fc31bbd8f3a36a82fca50f3ef82bab9f8a7076155a0c","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-06T17:10:23Z","title_canon_sha256":"ed125e57295bfda84e98770057244706029c01adf530961a32e5ade2ac025ad4"},"schema_version":"1.0","source":{"id":"1410.1462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1462","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1462v1","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1462","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOTMAINMIRSU","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"BOTMAINMIRSUOVWS","created_at":"2026-07-05T01:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"BOTMAINM","created_at":"2026-07-05T01:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:1170d494bc41b8e8f86eee39b8876af03a33de5ecdea3c5a71f5278d7daed594","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/1410.1462/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bipartite ranking aims to learn a real-valued ranking function that orders positive instances before negative instances. Recent efforts of bipartite ranking are focused on optimizing ranking accuracy at the top of the ranked list. Most existing approaches are either to optimize task specific metrics or to extend the ranking loss by emphasizing more on the error associated with the top ranked instances, leading to a high computational cost that is super-linear in the number of training instances. We propose a highly efficient approach, titled TopPush, for optimizing accuracy at the top that has","authors_text":"Nan Li, Rong Jin, Zhi-Hua Zhou","cross_cats":["cs.AI","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-06T17:10:23Z","title":"Top Rank Optimization in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1462","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:33802b7116a84634235cca371465f64227d9c30561df62406e51dc78642d4a31","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":"b6579f39cd490f255534fc31bbd8f3a36a82fca50f3ef82bab9f8a7076155a0c","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-06T17:10:23Z","title_canon_sha256":"ed125e57295bfda84e98770057244706029c01adf530961a32e5ade2ac025ad4"},"schema_version":"1.0","source":{"id":"1410.1462","kind":"arxiv","version":1}},"canonical_sha256":"0ba6c021ac44654756d2a68ffc42d5eb0c8be34dc3f51573e858f98163838080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ba6c021ac44654756d2a68ffc42d5eb0c8be34dc3f51573e858f98163838080","first_computed_at":"2026-07-05T01:16:30.385995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:30.385995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u1xnLOxpNVjh/aIk2yNk/Rz3bhKmnlbN9XdeoHRt+6SfwiWWQoApEeKjOlmv+aX4PKyc1sPe35noJI9EfnFKAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:30.386438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33802b7116a84634235cca371465f64227d9c30561df62406e51dc78642d4a31","sha256:1170d494bc41b8e8f86eee39b8876af03a33de5ecdea3c5a71f5278d7daed594"],"state_sha256":"b99d4c7aed54d79659a0d5081f35280b488d26ea6dc0fa3b862a4132cf108ddf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFHLBwlzeENTG3NVaPajq3zmQYynec1wKTaQaUk017Qd42xOoGb8G0QFa0n+u8CJUCgWo6adU8EEJ5euRy5RDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:12:01.203381Z","bundle_sha256":"24cd08274543b61400185f47eb8e0aa71fcd4b3fde31464ff8468861b3082c9e"}}