{"paper":{"title":"Transposition achieves OPT$+O(1)$ in polynomial time for IID list update","arxiv_id":"2609.28397","primary_cat":"cs.DS","submitted_at":"2026-09-23T17:03:25+00:00","version_compiled":"v1"},"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 v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"In the classical list update problem, a set of items must be stored in a list-type structure, where accessing the $i$-th element costs $i$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.37,"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":0.99,"id":"s1","own":false,"role":"background","text":"Items will be queried in an IID manner according to some probability distribution $p$ on the items.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.07,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.0,"background":0.99,"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":"We want to minimize the expected cost of each query.","hedge":{"p":0.82,"label":"asserted"},"own_p":0.07,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.04,"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.88,"id":"s3","own":false,"role":"background","text":"The optimal order is to place the items in decreasing order of probability $p_1 \\geq p_2 \\geq \\cdots$ with expected cost $\\mathsf{OPT} = \\sum_j j p_j$, but the probability vector $p$ is generally unknown.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.09,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.82,"role_probabilities":{"gap":0.12,"method":0.0,"result":0.0,"background":0.88,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":4,"p":0.82,"id":"s4","own":false,"role":"method","text":"Thus we use a self-organizing list following the transposition rule: an item is transposed 1 position forward whenever it is queried.","hedge":{"p":0.95,"label":"asserted"},"own_p":0.09,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.47,"role_probabilities":{"gap":0.0,"method":0.82,"result":0.0,"background":0.16,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":5,"p":0.96,"id":"s5","own":false,"role":"background","text":"Coester (2026) proved that, at stationarity measure for the transposition rule, the expected cost of a query is at most $\\mathsf{OPT} + 1$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.06,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.03,"background":0.96,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":6,"p":0.82,"id":"s6","own":false,"role":"gap","text":"However, this Markov chain may have arbitrarily slow mixing time.","hedge":{"p":0.95,"label":"hedged_possibility"},"own_p":0.08,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.15,"role_probabilities":{"gap":0.82,"method":0.0,"result":0.0,"background":0.04,"limitation":0.14,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":7,"p":0.89,"id":"s7","own":true,"role":"result","text":"We prove that, for arbitrary $p$ and arbitrary initial orderings $\\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\\mathsf{OPT} + O(1)$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.95,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.89,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.11,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"We prove that, for arbitrary $p$ and arbitrary initial orderings $\\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\\mathsf{OPT} + O(1)$.","location":"abstract s7","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":6320,"cost_usd_reported":0.0},"compiled_at":"2026-09-24","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.19,"human_participants":0.02,"controlled_comparison":0.14,"randomized_assignment":0.03,"states_quantitative_result":0.98,"compares_with_prior_results":0.95,"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 prove that, for arbitrary $p$ and arbitrary initial orderings $\\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\\mathsf{OPT} + O(1)$.","location":"abstract s7"}},"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 v1"],"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"}}}