{"paper":{"title":"Optimal Seat Movement Strategies Among Modular Bus Units","arxiv_id":"2611.16357","primary_cat":"cs.CE","submitted_at":"2026-11-12T06:15:08+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.64,"id":"s0","own":false,"role":"background","text":"Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.07,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.36,"method":0.0,"result":0.0,"background":0.64,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.92,"id":"s1","own":true,"role":"method","text":"We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.92,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.08,"interpretation":0.0}},{"i":2,"p":0.96,"id":"s2","own":true,"role":"method","text":"A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.82,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.96,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":3,"p":0.85,"id":"s3","own":true,"role":"method","text":"We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.85,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":4,"p":0.94,"id":"s4","own":true,"role":"method","text":"BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.2,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.94,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.06,"interpretation":0.0}},{"i":5,"p":1.0,"id":"s5","own":true,"role":"result","text":"On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.16,"quantitative":true,"quantitative_p":0.99,"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":6,"p":0.97,"id":"s6","own":true,"role":"method","text":"In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.92,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.95,"role_probabilities":{"gap":0.0,"method":0.97,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"result","text":"BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.29,"quantitative":true,"quantitative_p":0.99,"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":8,"p":0.66,"id":"s8","own":true,"role":"contribution","text":"Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance.","hedge":{"p":0.95,"label":"asserted"},"own_p":0.92,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.17,"result":0.13,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.66,"interpretation":0.04}},{"i":9,"p":0.84,"id":"s9","own":true,"role":"interpretation","text":"The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.64,"main_claim_p":0.17,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.01,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.14,"interpretation":0.84}}]},"compiled":{"main_claim":{"p":0.92,"text":"BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes.","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":7665,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.09,"states_limitation":0.31,"human_participants":0.03,"controlled_comparison":0.82,"randomized_assignment":0.02,"states_quantitative_result":0.99,"compares_with_prior_results":0.96,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":1.0,"value":"simulation or computation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":1.0}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.93,"text":"We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm.","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":10,"sentences_in_abstract":10},"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"}}}