{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P6WDKRZVZE5VFYIBCTUNOJOFAX","short_pith_number":"pith:P6WDKRZV","canonical_record":{"source":{"id":"1207.0268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-02T02:57:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4aafbe3a4f47c000a712656eb58003ca673f073661e08583c407764adc5a28cf","abstract_canon_sha256":"db0c400d38ab59bf270ed12073e100b343844389a9b5d1448dd3e206a49f67e0"},"schema_version":"1.0"},"canonical_sha256":"7fac354735c93b52e10114e8d725c505e38e41fcebdd79203aad11948101780c","source":{"kind":"arxiv","id":"1207.0268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0268","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0268v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0268","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6WDKRZVZE5V","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P6WDKRZVZE5VFYIB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P6WDKRZV","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P6WDKRZVZE5VFYIBCTUNOJOFAX","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-02T02:57:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4aafbe3a4f47c000a712656eb58003ca673f073661e08583c407764adc5a28cf","abstract_canon_sha256":"db0c400d38ab59bf270ed12073e100b343844389a9b5d1448dd3e206a49f67e0"},"schema_version":"1.0"},"canonical_sha256":"7fac354735c93b52e10114e8d725c505e38e41fcebdd79203aad11948101780c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.377119Z","signature_b64":"01aFm6p+6zFHmuJbLN8KhQ76J3DHjcfEbrm+oA3yySESI0Sr5Mvg/i5HGAT48v6KAFXyfPnhhUdcbejqjBrxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fac354735c93b52e10114e8d725c505e38e41fcebdd79203aad11948101780c","last_reissued_at":"2026-05-18T02:45:22.376723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.376723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0268","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFUzS+xKvxfygmDJoSKQ2DXcI7GXXrtQHoYGOfqU0FbGX+YOatcuMAoC1jN0gQvLoVOmMUnz4Rb1q0he7RmnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:29.966135Z"},"content_sha256":"eb69144bc993c5ef4a4982cbf029dde857a4d8b98eb14170279e5230e768a796","schema_version":"1.0","event_id":"sha256:eb69144bc993c5ef4a4982cbf029dde857a4d8b98eb14170279e5230e768a796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P6WDKRZVZE5VFYIBCTUNOJOFAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shivani Agarwal","submitted_at":"2012-07-02T02:57:30Z","abstract_excerpt":"The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0268","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iuL1bL8CGkxXhLSKc5eDl76r8FDlQGirF4DKDxl/P7EXL16v6nGAwxGfA83TX8TXkcEoTfECi8hMStiHbwq/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:29.966495Z"},"content_sha256":"a5b4faddc3a642dbd9e71ed83650e04f2ff6c37b8e1bc148fa3d4e20d7e7df3a","schema_version":"1.0","event_id":"sha256:a5b4faddc3a642dbd9e71ed83650e04f2ff6c37b8e1bc148fa3d4e20d7e7df3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/bundle.json","state_url":"https://pith.science/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/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-02T22:23:29Z","links":{"resolver":"https://pith.science/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX","bundle":"https://pith.science/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/bundle.json","state":"https://pith.science/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6WDKRZVZE5VFYIBCTUNOJOFAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P6WDKRZVZE5VFYIBCTUNOJOFAX","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":"db0c400d38ab59bf270ed12073e100b343844389a9b5d1448dd3e206a49f67e0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-02T02:57:30Z","title_canon_sha256":"4aafbe3a4f47c000a712656eb58003ca673f073661e08583c407764adc5a28cf"},"schema_version":"1.0","source":{"id":"1207.0268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0268","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0268v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0268","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6WDKRZVZE5V","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P6WDKRZVZE5VFYIB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P6WDKRZV","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:a5b4faddc3a642dbd9e71ed83650e04f2ff6c37b8e1bc148fa3d4e20d7e7df3a","target":"graph","created_at":"2026-05-18T02:45:22Z","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":"The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bo","authors_text":"Shivani Agarwal","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-02T02:57:30Z","title":"Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0268","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:eb69144bc993c5ef4a4982cbf029dde857a4d8b98eb14170279e5230e768a796","target":"record","created_at":"2026-05-18T02:45:22Z","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":"db0c400d38ab59bf270ed12073e100b343844389a9b5d1448dd3e206a49f67e0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-02T02:57:30Z","title_canon_sha256":"4aafbe3a4f47c000a712656eb58003ca673f073661e08583c407764adc5a28cf"},"schema_version":"1.0","source":{"id":"1207.0268","kind":"arxiv","version":1}},"canonical_sha256":"7fac354735c93b52e10114e8d725c505e38e41fcebdd79203aad11948101780c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fac354735c93b52e10114e8d725c505e38e41fcebdd79203aad11948101780c","first_computed_at":"2026-05-18T02:45:22.376723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:22.376723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01aFm6p+6zFHmuJbLN8KhQ76J3DHjcfEbrm+oA3yySESI0Sr5Mvg/i5HGAT48v6KAFXyfPnhhUdcbejqjBrxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:22.377119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb69144bc993c5ef4a4982cbf029dde857a4d8b98eb14170279e5230e768a796","sha256:a5b4faddc3a642dbd9e71ed83650e04f2ff6c37b8e1bc148fa3d4e20d7e7df3a"],"state_sha256":"e5953b461a8d31f39832e1ceb463aeb0e5c7ee71d6f415931413b9920365ba1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yilW41pDeFCvZFFk1Owsi20Lknvyc9YdLdWLVkSjeD0Cl1jIerUhroNYhdHwyhER73xmtPcoqk7FWSuUjuPPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:23:29.968483Z","bundle_sha256":"65ee037f745f92f9042c07a36dd5cc01f96a39d50ae35c6346f56e903ee44740"}}