{"paper":{"title":"Online Multi-level Aggregation with Delays and Stochastic Arrivals","arxiv_id":"2404.09711","primary_cat":"cs.DS","submitted_at":"2024-04-15T12:12:25+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":0.95,"id":"s0","own":true,"role":"contribution","text":"This paper presents a new research direction for online Multi-Level Aggregation (MLA) with delays.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.76,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.05,"limitation":0.0,"future_work":0.0,"contribution":0.95,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"In this problem, we are given an edge-weighted rooted tree $T$, and we have to serve a sequence of requests arriving at its vertices in an online manner.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.11,"main_claim_p":0.02,"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":2,"p":0.99,"id":"s2","own":false,"role":"background","text":"Each request $r$ is characterized by two parameters: its arrival time $t(r)$ and location $l(r)$ (a vertex).","hedge":{"p":0.99,"label":"asserted"},"own_p":0.09,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.11,"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":3,"p":0.98,"id":"s3","own":false,"role":"background","text":"Once a request $r$ arrives, we can either serve it immediately or postpone this action until any time $t > t(r)$.","hedge":{"p":0.68,"label":"asserted"},"own_p":0.09,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.0,"background":0.98,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":4,"p":0.98,"id":"s4","own":false,"role":"background","text":"We can serve several pending requests at the same time, and the service cost of a service corresponds to the weight of the subtree that contains all the requests served and the root of $T$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.11,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.0,"background":0.98,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.99,"id":"s5","own":false,"role":"background","text":"Postponing the service of a request $r$ to time $t > t(r)$ generates an additional delay cost of $t - t(r)$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.14,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.25,"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":6,"p":1.0,"id":"s6","own":false,"role":"background","text":"The goal is to serve all requests in an online manner such that the total cost (i.e., the total sum of service and delay costs) is minimized.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.07,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.08,"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":7,"p":0.98,"id":"s7","own":false,"role":"background","text":"The current best algorithm for this problem achieves a competitive ratio of $O(d^2)$ (Azar and Touitou, FOCS'19), where $d$ denotes the depth of the tree.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.02,"method":0.0,"result":0.0,"background":0.98,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":8,"p":0.62,"id":"s8","own":false,"role":"contribution","text":"Here, we consider a stochastic version of MLA where the requests follow a Poisson arrival process.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.48,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.01,"method":0.12,"result":0.0,"background":0.25,"limitation":0.0,"future_work":0.0,"contribution":0.62,"interpretation":0.0}},{"i":9,"p":0.83,"id":"s9","own":true,"role":"result","text":"We present a deterministic online algorithm which achieves a constant ratio of expectations, meaning that the ratio between the expected costs of the solution generated by our algorithm and the optimal offline solution is bounded by a constant.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.83,"quantitative":true,"quantitative_p":0.92,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.83,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.17,"interpretation":0.0}},{"i":10,"p":0.97,"id":"s10","own":true,"role":"method","text":"Our algorithm is obtained by carefully combining two strategies.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.97,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}},{"i":11,"p":0.99,"id":"s11","own":true,"role":"method","text":"In the first one, we plan periodic oblivious visits to the subset of frequent vertices, whereas in the second one, we greedily serve the pending requests in the remaining vertices.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.17,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":12,"p":0.98,"id":"s12","own":true,"role":"interpretation","text":"This problem is complex enough to demonstrate a very rare phenomenon that ``single-minded\" or ``sample-average\" strategies are not enough in stochastic optimization.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.7,"main_claim_p":0.1,"quantitative":false,"quantitative_p":0.19,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.98}}]},"compiled":{"main_claim":{"p":1.0,"text":"We present a deterministic online algorithm which achieves a constant ratio of expectations, meaning that the ratio between the expected costs of the solution generated by our algorithm and the optimal offline solution is bounded by a constant.","location":"abstract s9","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":9594,"cost_usd_reported":0.0},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.16,"states_limitation":0.24,"human_participants":0.01,"controlled_comparison":0.15,"randomized_assignment":0.03,"states_quantitative_result":0.85,"compares_with_prior_results":0.92,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":0.99,"value":"proof or derivation","probabilities":{"argument":0.01,"literature":0.0,"proof_or_derivation":0.99,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.57,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.57,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.43,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.99,"text":"We present a deterministic online algorithm which achieves a constant ratio of expectations, meaning that the ratio between the expected costs of the solution generated by our algorithm and the optimal offline solution is bounded by a constant.","location":"abstract s9"}},"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":13,"sentences_in_abstract":13},"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"}}}