{"paper":{"title":"List Update with Time Windows and Delays without Batch-Serving","arxiv_id":"2611.17083","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12+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":0.57,"id":"s0","own":true,"role":"contribution","text":"We study list update with time windows and delays when every request requires a separate access.","hedge":{"p":0.9,"label":"asserted"},"own_p":0.77,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.43,"limitation":0.0,"future_work":0.0,"contribution":0.57,"interpretation":0.0}},{"i":1,"p":0.93,"id":"s1","own":false,"role":"background","text":"Unlike batch-serving models, serving several requests to one element still incurs one access per request, and each access may change the list for subsequent requests.","hedge":{"p":0.83,"label":"asserted"},"own_p":0.17,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.36,"role_probabilities":{"gap":0.01,"method":0.04,"result":0.0,"background":0.93,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.01}},{"i":2,"p":0.99,"id":"s2","own":true,"role":"result","text":"For time windows of overlap at most $k\\ge2$, our deterministic First-Element Removal algorithm is $(3-2/k)$-competitive, hence $3$-competitive in general.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.44,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":3,"p":0.99,"id":"s3","own":true,"role":"result","text":"Against an oblivious adversary, a randomized adaptation of BIT is $7/4$-competitive on arbitrary $2$-overlap inputs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.1,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":4,"p":1.0,"id":"s4","own":true,"role":"result","text":"More generally, on inputs without self-overlap, it is $\\left(13/4-9/[2(k+1)]\\right)$-competitive for every $k\\ge2$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.12,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.96,"id":"s5","own":true,"role":"result","text":"For delays, we give a deterministic $5$-competitive algorithm and a lower bound of $2+\\sqrt3$ for deterministic delay-unaware algorithms.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.15,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.96,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":6,"p":0.89,"id":"s6","own":true,"role":"method","text":"Our analyses extend inversion potentials with per-request credits that reconcile different service times and orders.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.89,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.11,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.99,"text":"For time windows of overlap at most $k\\ge2$, our deterministic First-Element Removal algorithm is $(3-2/k)$-competitive, hence $3$-competitive in general.","location":"abstract s2","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":5572,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.41,"human_participants":0.02,"controlled_comparison":0.19,"randomized_assignment":0.05,"states_quantitative_result":0.99,"compares_with_prior_results":0.81,"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":0.96,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.04,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.96,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.38,"text":"We study list update with time windows and delays when every request requires a separate access.","location":"abstract s0"}},"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":7,"sentences_in_abstract":7},"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"}}}