{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:22PSYZ3EJADFRWHJGKK2FFMZBY","short_pith_number":"pith:22PSYZ3E","schema_version":"1.0","canonical_sha256":"d69f2c6764480658d8e93295a295990e37e12211563858d467b8a5c6f099c9b4","source":{"kind":"arxiv","id":"0710.2889","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0710.2889","created_at":"2026-07-04T15:06:05.516115+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.2889v2","created_at":"2026-07-04T15:06:05.516115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.2889","created_at":"2026-07-04T15:06:05.516115+00:00"},{"alias_kind":"pith_short_12","alias_value":"22PSYZ3EJADF","created_at":"2026-07-04T15:06:05.516115+00:00"},{"alias_kind":"pith_short_16","alias_value":"22PSYZ3EJADFRWHJ","created_at":"2026-07-04T15:06:05.516115+00:00"},{"alias_kind":"pith_short_8","alias_value":"22PSYZ3E","created_at":"2026-07-04T15:06:05.516115+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.16759","citing_title":"Can Explanations Improve Recommendations? Evidence from Prediction-Informed Explanations","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY","json":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY.json","graph_json":"https://pith.science/api/pith-number/22PSYZ3EJADFRWHJGKK2FFMZBY/graph.json","events_json":"https://pith.science/api/pith-number/22PSYZ3EJADFRWHJGKK2FFMZBY/events.json","paper":"https://pith.science/paper/22PSYZ3E"},"agent_actions":{"view_html":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY","download_json":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY.json","view_paper":"https://pith.science/paper/22PSYZ3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.2889&json=true","fetch_graph":"https://pith.science/api/pith-number/22PSYZ3EJADFRWHJGKK2FFMZBY/graph.json","fetch_events":"https://pith.science/api/pith-number/22PSYZ3EJADFRWHJGKK2FFMZBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/action/storage_attestation","attest_author":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/action/author_attestation","sign_citation":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/action/citation_signature","submit_replication":"https://pith.science/pith/22PSYZ3EJADFRWHJGKK2FFMZBY/action/replication_record"}},"created_at":"2026-07-04T15:06:05.516115+00:00","updated_at":"2026-07-04T15:06:05.516115+00:00"}