{"paper":{"title":"A Little Length Slack Goes a Long Way in Planar Length-Constrained Network Design","arxiv_id":"2611.17201","primary_cat":"cs.DS","submitted_at":"2026-11-12T18:04:29+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":"Problems in length-constrained network design ask for min-cost subgraphs connecting $k$ input vertex pairs by paths of length at most $h$.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.05,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.42,"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":"Algorithms that instead connect these pairs by paths of length at most $\\beta h$ are said to have length slack $\\beta$.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.07,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.78,"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.97,"id":"s2","own":false,"role":"background","text":"Recent work has shown that poly-time polylogarithmic approximations with polylogarithmic length slack are possible for a broad class of both directed and multicommodity length-constrained network design problems on planar graphs.","hedge":{"p":0.75,"label":"asserted"},"own_p":0.04,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.45,"role_probabilities":{"gap":0.03,"method":0.0,"result":0.0,"background":0.97,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.95,"id":"s3","own":true,"role":"contribution","text":"We give the first poly-time polylogarithmic approximations with $O(1)$ length slack for these problems on planar graphs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.85,"quantitative":true,"quantitative_p":0.74,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.05,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.95,"interpretation":0.0}},{"i":4,"p":0.73,"id":"s4","own":true,"role":"result","text":"In particular, for the length-constrained setting, we give LP-competitive algorithms for planar graphs with length slack $1+\\epsilon$ and approximation ratios of $O(\\log^2 k/\\epsilon)$ for directed Steiner tree and $O(\\log^5 k/\\epsilon^2)$ for (undirected) Steiner forest.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.31,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.73,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.27,"interpretation":0.0}},{"i":5,"p":0.79,"id":"s5","own":true,"role":"result","text":"Similarly, for length-constrained directed Steiner forest, we give an $O(\\log^6 k/\\epsilon)$ approximation on planar graphs with length slack $6+\\epsilon$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.11,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.79,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.21,"interpretation":0.0}},{"i":6,"p":1.0,"id":"s6","own":true,"role":"method","text":"Our approach is based on a novel charging argument that charges the cost of our solution to the length of the LP and the length of our solution to the cost of the LP.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":1.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":7,"p":0.67,"id":"s7","own":true,"role":"result","text":"We complement these algorithms with hardness results that separate planar and general graphs for both forest problems: under standard complexity assumptions, we rule out polylogarithmic approximations on general graphs with length slack below $3$.","hedge":{"p":0.96,"label":"asserted"},"own_p":0.92,"main_claim_p":0.12,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.67,"background":0.0,"limitation":0.03,"future_work":0.0,"contribution":0.29,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":1.0,"text":"We give the first poly-time polylogarithmic approximations with $O(1)$ length slack for these problems on planar graphs.","location":"abstract s3","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":6506,"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.93,"states_limitation":0.46,"human_participants":0.01,"controlled_comparison":0.06,"randomized_assignment":0.01,"states_quantitative_result":0.99,"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":0.51,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.51,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.49,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"We give the first poly-time polylogarithmic approximations with $O(1)$ length slack for these problems on planar graphs.","location":"abstract s3"}},"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"}}}