{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LAAYEA3KHDF77APO6OHKZVOLIU","short_pith_number":"pith:LAAYEA3K","schema_version":"1.0","canonical_sha256":"580182036a38cbff81eef38eacd5cb4504ac67efc8df11ac16d4858d92f75cdc","source":{"kind":"arxiv","id":"2505.09795","version":3},"attestation_state":"computed","paper":{"title":"Beyond Pairwise Learning-To-Rank At Airbnb","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Daochen Zha, Huiji Gao, Liwei He, Malay Haldar, Sanjeev Katariya","submitted_at":"2025-05-14T20:45:29Z","abstract_excerpt":"There are three fundamental asks from a ranking algorithm: it should scale to handle a large number of items, sort items accurately by their utility, and impose a total order on the items for logical consistency. But here's the catch-no algorithm can achieve all three at the same time. We call this limitation the SAT theorem for ranking algorithms. Given the dilemma, how can we design a practical system that meets user needs? Our current work at Airbnb provides an answer, with a working solution deployed at scale. We start with pairwise learning-to-rank (LTR) models-the bedrock of search ranki"},"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":"2505.09795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-14T20:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"45b33cd74e1851d3ca021571af5c30185ddd55b08348059ae23b05bbf886d032","abstract_canon_sha256":"c618a5bae82ef9f4e461c04fa75d89601265d0ee899b252e5380e51ef9078e0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:25.152830Z","signature_b64":"OPxLC6m4be+xBCpPa/jHYKQ6k5tDXE9G76XyfkGxBrwAplGzNY29v/0VxsZjnScOE7UFIHVzV+7q+iRueZJpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580182036a38cbff81eef38eacd5cb4504ac67efc8df11ac16d4858d92f75cdc","last_reissued_at":"2026-07-05T11:13:25.152379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:25.152379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Pairwise Learning-To-Rank At Airbnb","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Daochen Zha, Huiji Gao, Liwei He, Malay Haldar, Sanjeev Katariya","submitted_at":"2025-05-14T20:45:29Z","abstract_excerpt":"There are three fundamental asks from a ranking algorithm: it should scale to handle a large number of items, sort items accurately by their utility, and impose a total order on the items for logical consistency. But here's the catch-no algorithm can achieve all three at the same time. We call this limitation the SAT theorem for ranking algorithms. Given the dilemma, how can we design a practical system that meets user needs? Our current work at Airbnb provides an answer, with a working solution deployed at scale. We start with pairwise learning-to-rank (LTR) models-the bedrock of search ranki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09795","kind":"arxiv","version":3},"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/2505.09795/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":"2505.09795","created_at":"2026-07-05T11:13:25.152435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09795v3","created_at":"2026-07-05T11:13:25.152435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09795","created_at":"2026-07-05T11:13:25.152435+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAAYEA3KHDF7","created_at":"2026-07-05T11:13:25.152435+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAAYEA3KHDF77APO","created_at":"2026-07-05T11:13:25.152435+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAAYEA3K","created_at":"2026-07-05T11:13:25.152435+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/LAAYEA3KHDF77APO6OHKZVOLIU","json":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU.json","graph_json":"https://pith.science/api/pith-number/LAAYEA3KHDF77APO6OHKZVOLIU/graph.json","events_json":"https://pith.science/api/pith-number/LAAYEA3KHDF77APO6OHKZVOLIU/events.json","paper":"https://pith.science/paper/LAAYEA3K"},"agent_actions":{"view_html":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU","download_json":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU.json","view_paper":"https://pith.science/paper/LAAYEA3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09795&json=true","fetch_graph":"https://pith.science/api/pith-number/LAAYEA3KHDF77APO6OHKZVOLIU/graph.json","fetch_events":"https://pith.science/api/pith-number/LAAYEA3KHDF77APO6OHKZVOLIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU/action/storage_attestation","attest_author":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU/action/author_attestation","sign_citation":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU/action/citation_signature","submit_replication":"https://pith.science/pith/LAAYEA3KHDF77APO6OHKZVOLIU/action/replication_record"}},"created_at":"2026-07-05T11:13:25.152435+00:00","updated_at":"2026-07-05T11:13:25.152435+00:00"}