{"paper":{"title":"Transposition Is Nearly Optimal for IID List Update","arxiv_id":"2603.10244","primary_cat":"cs.DS","submitted_at":"2026-03-10T21:41:28+00:00","version_compiled":"v2"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v2","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"The list update problem is one of the oldest and simplest problems in online algorithms: A set of items must be maintained in a list while requests to these items arrive over time.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"Whenever an item is requested, the algorithm pays a cost equal to the position of the item in the list.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":1.0,"id":"s2","own":false,"role":"background","text":"In the i.i.d. model, where requests are drawn independently from a fixed distribution, the static ordering by decreasing access probabilities $p_1\\ge p_2\\ge \\dots \\ge p_n$ achieves the minimal expected access cost $\\mathrm{OPT}=\\sum_{i=1}^n ip_i$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.07,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.8,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.52,"id":"s3","own":false,"role":"gap","text":"However, $p$ is typically unknown, and approximating it by tracking access frequencies creates undesirable overheads.","hedge":{"p":0.93,"label":"asserted"},"own_p":0.06,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.52,"method":0.0,"result":0.0,"background":0.47,"limitation":0.01,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":4,"p":0.96,"id":"s4","own":false,"role":"background","text":"A 50-year old conjecture by Rivest states that the Transposition rule (swap the requested item with its predecessor) is optimal among memoryless algorithms.","hedge":{"p":0.59,"label":"speculative"},"own_p":0.03,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.58,"role_probabilities":{"gap":0.04,"method":0.0,"result":0.0,"background":0.96,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.83,"id":"s5","own":false,"role":"background","text":"While known to be false in the strict sense, prior research provided asymptotic confirmation of Rivest's conjecture for restricted distributions.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.17,"method":0.0,"result":0.0,"background":0.83,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":6,"p":0.9,"id":"s6","own":true,"role":"result","text":"We show that for all distributions, Transposition has stationary expected access cost at most $\\mathrm{OPT}+1$, confirming Rivest's conjecture up to an unavoidable additive constant, and showing near-optimality even among algorithms with memory.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.96,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.9,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.1,"interpretation":0.0}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"interpretation","text":"More abstractly, it yields a purely memoryless procedure to approximately sort probabilities via sampling.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.79,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":1.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"We show that for all distributions, Transposition has stationary expected access cost at most $\\mathrm{OPT}+1$, confirming Rivest's conjecture up to an unavoidable additive constant, and showing near-optimality even among algorithms with memory.","location":"abstract s6","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6391,"cost_usd_reported":0.0},"compiled_at":"2026-11-11","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.1,"states_limitation":0.73,"human_participants":0.01,"controlled_comparison":0.2,"randomized_assignment":0.03,"states_quantitative_result":0.98,"compares_with_prior_results":0.96,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"We show that for all distributions, Transposition has stationary expected access cost at most $\\mathrm{OPT}+1$, confirming Rivest's conjecture up to an unavoidable additive constant, and showing near-optimality even among algorithms with memory.","location":"abstract s6"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v2"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":8,"sentences_in_abstract":8},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}