{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:22PSYZ3EJADFRWHJGKK2FFMZBY","short_pith_number":"pith:22PSYZ3E","canonical_record":{"source":{"id":"0710.2889","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2007-10-15T18:25:15Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c282ead4254b103d1368e68fe604efa6f840493e3135b48a77cf1e655a7fa15f","abstract_canon_sha256":"d3f98268ac096dd963fe1165276efbb04deae14fe553debd7b6c8575498204fa"},"schema_version":"1.0"},"canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","source":{"kind":"arxiv","id":"0710.2889","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.2889","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.2889v2","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.2889","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"22PSYZ3EJADF","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_16","alias_value":"22PSYZ3EJADFRWHJ","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_8","alias_value":"22PSYZ3E","created_at":"2026-07-04T15:06:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:22PSYZ3EJADFRWHJGKK2FFMZBY","target":"record","payload":{"canonical_record":{"source":{"id":"0710.2889","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2007-10-15T18:25:15Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c282ead4254b103d1368e68fe604efa6f840493e3135b48a77cf1e655a7fa15f","abstract_canon_sha256":"d3f98268ac096dd963fe1165276efbb04deae14fe553debd7b6c8575498204fa"},"schema_version":"1.0"},"canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:05.516407Z","signature_b64":"A7JX2OyML+GHrI+l+Im37/qeI969eY/jEXn2aZYeBdKJr3JlG3rWp7Rm+Gekp0llbZrY2vN6LBaMC7wFgI8vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","last_reissued_at":"2026-07-04T15:06:05.516051Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:05.516051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.2889","source_version":2,"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-04T15:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92V7nEDk2O+cBR9wJs2XP1N+Rvnm2zXOirxxWDn5U4DbDwe2jva+Lmj/MLQs2alYGEAzXXr4ImdvHghcQRNDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:54:37.865661Z"},"content_sha256":"12bed41f4c60aa2cbb96b4225f1d6fa1a2cb9d6967cc19c1be8247b6e1439eb9","schema_version":"1.0","event_id":"sha256:12bed41f4c60aa2cbb96b4225f1d6fa1a2cb9d6967cc19c1be8247b6e1439eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:22PSYZ3EJADFRWHJGKK2FFMZBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient reduction of ranking to classification","license":"","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Mehryar Mohri, Nir Ailon","submitted_at":"2007-10-15T18:25:15Z","abstract_excerpt":"This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most that of the binary classifier regret, improving a recent result of Balcan et al which only guarantees a factor of 2. Moreover, our reduction applies to a broader class of ranking loss functions, admits a simpler proof, and the expected running time complexity of our algorithm in terms of number of calls to a classifier or preference function is improved from $\\Omega(n^2)$ to $O(n \\log n)$. In addition, when the top $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.2889","kind":"arxiv","version":2},"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/0710.2889/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-04T15:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0s5oSwhHxWPUhJRg5zewtdihAIf8CpSFblv4b0pq4P1fWgAA4XxFakeBsTQztHCiFe/MdnNZOExoBxpQWAAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:54:37.866395Z"},"content_sha256":"07e825851f7be5ce0b30d9ac918ba7c199a33fa0f177366f806bbda755e9ccc8","schema_version":"1.0","event_id":"sha256:07e825851f7be5ce0b30d9ac918ba7c199a33fa0f177366f806bbda755e9ccc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/bundle.json","state_url":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/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-11T14:54:37Z","links":{"resolver":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY","bundle":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/bundle.json","state":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:22PSYZ3EJADFRWHJGKK2FFMZBY","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":"d3f98268ac096dd963fe1165276efbb04deae14fe553debd7b6c8575498204fa","cross_cats_sorted":["cs.IR"],"license":"","primary_cat":"cs.LG","submitted_at":"2007-10-15T18:25:15Z","title_canon_sha256":"c282ead4254b103d1368e68fe604efa6f840493e3135b48a77cf1e655a7fa15f"},"schema_version":"1.0","source":{"id":"0710.2889","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.2889","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.2889v2","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.2889","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"22PSYZ3EJADF","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_16","alias_value":"22PSYZ3EJADFRWHJ","created_at":"2026-07-04T15:06:05Z"},{"alias_kind":"pith_short_8","alias_value":"22PSYZ3E","created_at":"2026-07-04T15:06:05Z"}],"graph_snapshots":[{"event_id":"sha256:07e825851f7be5ce0b30d9ac918ba7c199a33fa0f177366f806bbda755e9ccc8","target":"graph","created_at":"2026-07-04T15:06:05Z","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/0710.2889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most that of the binary classifier regret, improving a recent result of Balcan et al which only guarantees a factor of 2. Moreover, our reduction applies to a broader class of ranking loss functions, admits a simpler proof, and the expected running time complexity of our algorithm in terms of number of calls to a classifier or preference function is improved from $\\Omega(n^2)$ to $O(n \\log n)$. In addition, when the top $k","authors_text":"Mehryar Mohri, Nir Ailon","cross_cats":["cs.IR"],"headline":"","license":"","primary_cat":"cs.LG","submitted_at":"2007-10-15T18:25:15Z","title":"An efficient reduction of ranking to classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.2889","kind":"arxiv","version":2},"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:12bed41f4c60aa2cbb96b4225f1d6fa1a2cb9d6967cc19c1be8247b6e1439eb9","target":"record","created_at":"2026-07-04T15:06:05Z","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":"d3f98268ac096dd963fe1165276efbb04deae14fe553debd7b6c8575498204fa","cross_cats_sorted":["cs.IR"],"license":"","primary_cat":"cs.LG","submitted_at":"2007-10-15T18:25:15Z","title_canon_sha256":"c282ead4254b103d1368e68fe604efa6f840493e3135b48a77cf1e655a7fa15f"},"schema_version":"1.0","source":{"id":"0710.2889","kind":"arxiv","version":2}},"canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","first_computed_at":"2026-07-04T15:06:05.516051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:05.516051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7JX2OyML+GHrI+l+Im37/qeI969eY/jEXn2aZYeBdKJr3JlG3rWp7Rm+Gekp0llbZrY2vN6LBaMC7wFgI8vAw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:05.516407Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.2889","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12bed41f4c60aa2cbb96b4225f1d6fa1a2cb9d6967cc19c1be8247b6e1439eb9","sha256:07e825851f7be5ce0b30d9ac918ba7c199a33fa0f177366f806bbda755e9ccc8"],"state_sha256":"b2dfac779f2b0be23fa21f88d4028c51f47281231e7818177927fa90bf61672b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gb7WG26Yhg4P9JSm955BVhtgYtgHi9J5JOi10nIzipLu8boLAVFUP4YksdWME4fwPYtiCC/rtz25u/Dp6McNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T14:54:37.871827Z","bundle_sha256":"b1c9dc22b4dc8a677838494fbfbcaec0a42f228354cb3cf2f420450e6fba8426"}}