{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3G6IXJXLUKXSRBIIHOIW54UIBW","short_pith_number":"pith:3G6IXJXL","schema_version":"1.0","canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","source":{"kind":"arxiv","id":"1011.0108","version":11},"attestation_state":"computed","paper":{"title":"An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nir Ailon","submitted_at":"2010-10-30T21:47:19Z","abstract_excerpt":"We study the problem of learning to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results for our particular problem. Given a set $V$ of $n$ elements, we wish to linearly order them given pairwise preference labels. A pairwise preference label is obtained as a response, typically from a human, to the question \"which if preferred, u or v?$ for two elements $u,v\\in V$. We assume possible non-transitivity paradoxes which may arise naturally due to human mistakes or irrationality. The goal is to linearly order "},"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":"1011.0108","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-30T21:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"197529ff73d29b7218d9930f782470662a400d4445a5c5b340d76f58b2c864c3","abstract_canon_sha256":"647140eb232fa08db48c43dc0af0841133b0df573a8924f9441ef3e7190d9b11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:00.781004Z","signature_b64":"1vqNOzhKlfwxNuSPH0yv24oxgzhMm1f7hic34FSSqbSaZTJ1lFJOsTKhrTjS8e/yZaVlZKpkRgUijXxc9cQlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bc8ba6eba2af2885083b916ef2880d92579188431e644ab5ee53fc116ac724","last_reissued_at":"2026-05-18T04:22:00.780597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:00.780597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nir Ailon","submitted_at":"2010-10-30T21:47:19Z","abstract_excerpt":"We study the problem of learning to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results for our particular problem. Given a set $V$ of $n$ elements, we wish to linearly order them given pairwise preference labels. A pairwise preference label is obtained as a response, typically from a human, to the question \"which if preferred, u or v?$ for two elements $u,v\\in V$. We assume possible non-transitivity paradoxes which may arise naturally due to human mistakes or irrationality. The goal is to linearly order "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0108","kind":"arxiv","version":11},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.0108","created_at":"2026-05-18T04:22:00.780653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0108v11","created_at":"2026-05-18T04:22:00.780653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0108","created_at":"2026-05-18T04:22:00.780653+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G6IXJXLUKXS","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G6IXJXLUKXSRBII","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G6IXJXL","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW","json":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW.json","graph_json":"https://pith.science/api/pith-number/3G6IXJXLUKXSRBIIHOIW54UIBW/graph.json","events_json":"https://pith.science/api/pith-number/3G6IXJXLUKXSRBIIHOIW54UIBW/events.json","paper":"https://pith.science/paper/3G6IXJXL"},"agent_actions":{"view_html":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW","download_json":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW.json","view_paper":"https://pith.science/paper/3G6IXJXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0108&json=true","fetch_graph":"https://pith.science/api/pith-number/3G6IXJXLUKXSRBIIHOIW54UIBW/graph.json","fetch_events":"https://pith.science/api/pith-number/3G6IXJXLUKXSRBIIHOIW54UIBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/action/storage_attestation","attest_author":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/action/author_attestation","sign_citation":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/action/citation_signature","submit_replication":"https://pith.science/pith/3G6IXJXLUKXSRBIIHOIW54UIBW/action/replication_record"}},"created_at":"2026-05-18T04:22:00.780653+00:00","updated_at":"2026-05-18T04:22:00.780653+00:00"}