{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KFAOHE6IW7H7O3CFOTYYQASKPE","short_pith_number":"pith:KFAOHE6I","schema_version":"1.0","canonical_sha256":"5140e393c8b7cff76c4574f188024a7918f38dabfac55e89ee8344843e3aa416","source":{"kind":"arxiv","id":"2409.05798","version":4},"attestation_state":"computed","paper":{"title":"Enhancing Preference-based Linear Bandits via Human Response Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.HC","econ.EM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Claire Liang, Julie A. Shah, Na Li, Shen Li, Yuyang Zhang, Zhaolin Ren","submitted_at":"2024-09-09T17:02:47Z","abstract_excerpt":"Interactive preference learning systems infer human preferences by presenting queries as pairs of options and collecting binary choices. Although binary choices are simple and widely used, they provide limited information about preference strength. To address this, we leverage human response times, which are inversely related to preference strength, as an additional signal. We propose a computationally efficient method that combines choices and response times to estimate human utility functions, grounded in the EZ diffusion model from psychology. Theoretical and empirical analyses show that fo"},"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":"2409.05798","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-09T17:02:47Z","cross_cats_sorted":["cs.AI","cs.HC","econ.EM","stat.ML"],"title_canon_sha256":"a6e4867a5afed9b44181297b0f22ff0eae4282786b576c3d260c41deb74f0a7d","abstract_canon_sha256":"19d97471fed11c61d48e4dd2229a6009d5b45b45363dcf30972c542009aeaebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:00.138500Z","signature_b64":"R8jVoIHlmnYf1Myamy3bIKvsMVrZKp2C8YVPIYalqTBnerN4PNHLtWLdTDgKC3ACj3lbN7C5+xASpg48WafUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5140e393c8b7cff76c4574f188024a7918f38dabfac55e89ee8344843e3aa416","last_reissued_at":"2026-07-05T09:56:00.138050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:00.138050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Preference-based Linear Bandits via Human Response Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.HC","econ.EM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Claire Liang, Julie A. Shah, Na Li, Shen Li, Yuyang Zhang, Zhaolin Ren","submitted_at":"2024-09-09T17:02:47Z","abstract_excerpt":"Interactive preference learning systems infer human preferences by presenting queries as pairs of options and collecting binary choices. Although binary choices are simple and widely used, they provide limited information about preference strength. To address this, we leverage human response times, which are inversely related to preference strength, as an additional signal. We propose a computationally efficient method that combines choices and response times to estimate human utility functions, grounded in the EZ diffusion model from psychology. Theoretical and empirical analyses show that fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05798","kind":"arxiv","version":4},"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/2409.05798/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":"2409.05798","created_at":"2026-07-05T09:56:00.138109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05798v4","created_at":"2026-07-05T09:56:00.138109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05798","created_at":"2026-07-05T09:56:00.138109+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFAOHE6IW7H7","created_at":"2026-07-05T09:56:00.138109+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFAOHE6IW7H7O3CF","created_at":"2026-07-05T09:56:00.138109+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFAOHE6I","created_at":"2026-07-05T09:56:00.138109+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.01097","citing_title":"Understanding LoRA as Knowledge Memory: An Empirical Analysis","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE","json":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE.json","graph_json":"https://pith.science/api/pith-number/KFAOHE6IW7H7O3CFOTYYQASKPE/graph.json","events_json":"https://pith.science/api/pith-number/KFAOHE6IW7H7O3CFOTYYQASKPE/events.json","paper":"https://pith.science/paper/KFAOHE6I"},"agent_actions":{"view_html":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE","download_json":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE.json","view_paper":"https://pith.science/paper/KFAOHE6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05798&json=true","fetch_graph":"https://pith.science/api/pith-number/KFAOHE6IW7H7O3CFOTYYQASKPE/graph.json","fetch_events":"https://pith.science/api/pith-number/KFAOHE6IW7H7O3CFOTYYQASKPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE/action/storage_attestation","attest_author":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE/action/author_attestation","sign_citation":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE/action/citation_signature","submit_replication":"https://pith.science/pith/KFAOHE6IW7H7O3CFOTYYQASKPE/action/replication_record"}},"created_at":"2026-07-05T09:56:00.138109+00:00","updated_at":"2026-07-05T09:56:00.138109+00:00"}