{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N3HOQMV3WRHJPO3Q25XPR3KUVJ","short_pith_number":"pith:N3HOQMV3","schema_version":"1.0","canonical_sha256":"6ecee832bbb44e97bb70d76ef8ed54aa75461f256b814965fb72755109e4b6d7","source":{"kind":"arxiv","id":"1905.11984","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Time-to-Rank: A Learning and Recommendation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.HC","authors_text":"Chaonan Ye, Haoming Li, Junming Wang, Lirong Xia, Rohit Vaish, Sujoy Sikdar","submitted_at":"2019-05-27T23:50:06Z","abstract_excerpt":"Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-and-drop operations. The platform's goal is to recommend an initial ranking that minimizes the time spent by the user in arriving at her desired ranking. We develop the first optimization framework to address this problem, and make theoretical as well as practical contributions. On the practical side, our experiments on Amazon Mechanical Turk provide two interesting insights about user behavior: First, that users' ra"},"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":"1905.11984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2019-05-27T23:50:06Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"699acc2f8c73d4489e7b0369d1bba872b2f004d839f3b5f5f1a6cba89510d0b8","abstract_canon_sha256":"a2c5cad4c9577520bbc9f088fed9482f25fb5b58077470d5d24f3237ee3e085d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:49.281114Z","signature_b64":"cVJnXyCT3g71mLXpaUICkoKkYXyL5OOB01YSOeWaiLc1lB8sidJVwCJ3/t/WpFd92lmxR3qIKKRtRg+ZLxICBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecee832bbb44e97bb70d76ef8ed54aa75461f256b814965fb72755109e4b6d7","last_reissued_at":"2026-05-17T23:44:49.280407Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:49.280407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Time-to-Rank: A Learning and Recommendation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.HC","authors_text":"Chaonan Ye, Haoming Li, Junming Wang, Lirong Xia, Rohit Vaish, Sujoy Sikdar","submitted_at":"2019-05-27T23:50:06Z","abstract_excerpt":"Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-and-drop operations. The platform's goal is to recommend an initial ranking that minimizes the time spent by the user in arriving at her desired ranking. We develop the first optimization framework to address this problem, and make theoretical as well as practical contributions. On the practical side, our experiments on Amazon Mechanical Turk provide two interesting insights about user behavior: First, that users' ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11984","kind":"arxiv","version":1},"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":"1905.11984","created_at":"2026-05-17T23:44:49.280502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11984v1","created_at":"2026-05-17T23:44:49.280502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11984","created_at":"2026-05-17T23:44:49.280502+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3HOQMV3WRHJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3HOQMV3WRHJPO3Q","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3HOQMV3","created_at":"2026-05-18T12:33:24.271573+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/N3HOQMV3WRHJPO3Q25XPR3KUVJ","json":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ.json","graph_json":"https://pith.science/api/pith-number/N3HOQMV3WRHJPO3Q25XPR3KUVJ/graph.json","events_json":"https://pith.science/api/pith-number/N3HOQMV3WRHJPO3Q25XPR3KUVJ/events.json","paper":"https://pith.science/paper/N3HOQMV3"},"agent_actions":{"view_html":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ","download_json":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ.json","view_paper":"https://pith.science/paper/N3HOQMV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11984&json=true","fetch_graph":"https://pith.science/api/pith-number/N3HOQMV3WRHJPO3Q25XPR3KUVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N3HOQMV3WRHJPO3Q25XPR3KUVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ/action/storage_attestation","attest_author":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ/action/author_attestation","sign_citation":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ/action/citation_signature","submit_replication":"https://pith.science/pith/N3HOQMV3WRHJPO3Q25XPR3KUVJ/action/replication_record"}},"created_at":"2026-05-17T23:44:49.280502+00:00","updated_at":"2026-05-17T23:44:49.280502+00:00"}