{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OZHG5AUDYSLSFR45VR6MEXJNZW","short_pith_number":"pith:OZHG5AUD","schema_version":"1.0","canonical_sha256":"764e6e8283c49722c79dac7cc25d2dcda128cd3697545b51178faf6c70dfae8e","source":{"kind":"arxiv","id":"2405.02612","version":3},"attestation_state":"computed","paper":{"title":"Learning Linear Utility Functions From Pairwise Comparison Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan Juba, Luise Ge, Yevgeniy Vorobeychik","submitted_at":"2024-05-04T08:43:45Z","abstract_excerpt":"We study learnability of linear utility functions from pairwise comparison queries. In particular, we consider two learning objectives. The first objective is to predict out-of-sample responses to pairwise comparisons, whereas the second is to approximately recover the true parameters of the utility function. We show that in the passive learning setting, linear utilities are efficiently learnable with respect to the first objective, both when query responses are uncorrupted by noise, and under Tsybakov noise when the distributions are sufficiently \"nice\". In contrast, we show that utility para"},"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":"2405.02612","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-04T08:43:45Z","cross_cats_sorted":["cs.AI","cs.CY","stat.ML"],"title_canon_sha256":"f09059a15843fc93e4d35e2c7177fbc0996e5fc8ca503e24af1949ef47e90ed6","abstract_canon_sha256":"81fd8e777d22f30e1f533276c4d6049989e65e99a65401be4c7fca12cd4b4733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:17.651923Z","signature_b64":"E4b5Nutgj3/cn/hAalUTI5PsEHH5c2PaaxyVTsKyAx4kR/kSB6l30cuf6AHxN9OprRXzzEpsCNAOC8RWZ+PJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"764e6e8283c49722c79dac7cc25d2dcda128cd3697545b51178faf6c70dfae8e","last_reissued_at":"2026-07-05T08:34:17.651448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:17.651448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Linear Utility Functions From Pairwise Comparison Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan Juba, Luise Ge, Yevgeniy Vorobeychik","submitted_at":"2024-05-04T08:43:45Z","abstract_excerpt":"We study learnability of linear utility functions from pairwise comparison queries. In particular, we consider two learning objectives. The first objective is to predict out-of-sample responses to pairwise comparisons, whereas the second is to approximately recover the true parameters of the utility function. We show that in the passive learning setting, linear utilities are efficiently learnable with respect to the first objective, both when query responses are uncorrupted by noise, and under Tsybakov noise when the distributions are sufficiently \"nice\". In contrast, we show that utility para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02612","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/2405.02612/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":"2405.02612","created_at":"2026-07-05T08:34:17.651503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02612v3","created_at":"2026-07-05T08:34:17.651503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02612","created_at":"2026-07-05T08:34:17.651503+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZHG5AUDYSLS","created_at":"2026-07-05T08:34:17.651503+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZHG5AUDYSLSFR45","created_at":"2026-07-05T08:34:17.651503+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZHG5AUD","created_at":"2026-07-05T08:34:17.651503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12350","citing_title":"Theoretical Tensions in RLHF: Reconciling Empirical Success with Inconsistencies in Social Choice Theory","ref_index":2009,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW","json":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW.json","graph_json":"https://pith.science/api/pith-number/OZHG5AUDYSLSFR45VR6MEXJNZW/graph.json","events_json":"https://pith.science/api/pith-number/OZHG5AUDYSLSFR45VR6MEXJNZW/events.json","paper":"https://pith.science/paper/OZHG5AUD"},"agent_actions":{"view_html":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW","download_json":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW.json","view_paper":"https://pith.science/paper/OZHG5AUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02612&json=true","fetch_graph":"https://pith.science/api/pith-number/OZHG5AUDYSLSFR45VR6MEXJNZW/graph.json","fetch_events":"https://pith.science/api/pith-number/OZHG5AUDYSLSFR45VR6MEXJNZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW/action/storage_attestation","attest_author":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW/action/author_attestation","sign_citation":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW/action/citation_signature","submit_replication":"https://pith.science/pith/OZHG5AUDYSLSFR45VR6MEXJNZW/action/replication_record"}},"created_at":"2026-07-05T08:34:17.651503+00:00","updated_at":"2026-07-05T08:34:17.651503+00:00"}