{"paper":{"title":"Discrete Approximation of differential two-stage stochastic linear complementarity problems","arxiv_id":"2611.16501","primary_cat":"math.OC","submitted_at":"2026-11-12T09:04:22+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.6,"id":"s0","own":true,"role":"contribution","text":"This paper studies differential two-stage stochastic linear complementarity problems, in which an ordinary differential equation (ODE) is coupled with a two-stage stochastic linear complementarity problem (SLCP) under a time-dependent probability distribution.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.54,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.4,"limitation":0.0,"future_work":0.0,"contribution":0.6,"interpretation":0.0}},{"i":1,"p":0.82,"id":"s1","own":false,"role":"background","text":"The right-hand side of the ODE involves a solution pair (here-and-now and wait-and-see decisions) of the two-stage SLCP, while the two-stage SLCP involves two functions depending on the time $t$ and the state $x(t)$ of the ODE.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.28,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.07,"result":0.0,"background":0.82,"limitation":0.0,"future_work":0.0,"contribution":0.11,"interpretation":0.0}},{"i":2,"p":0.92,"id":"s2","own":true,"role":"result","text":"Under appropriate conditions, we prove that the solution function of the two-stage SLCP is Lipschitz continuous in $x(t)$ and locally $\\frac{1}{2}$-H\\\"older continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.38,"quantitative":true,"quantitative_p":0.76,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.92,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.08,"interpretation":0.0}},{"i":3,"p":0.79,"id":"s3","own":true,"role":"contribution","text":"Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.21,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.79,"interpretation":0.0}},{"i":4,"p":1.0,"id":"s4","own":true,"role":"method","text":"We first use a finite-scenario partition with mesh size $\\delta_N$ to approximate the distribution, then apply the Euler method for time discretization with step size $h$, and finally solve the resulting finite-dimensional problems using an inexact progressive hedging method with tolerance $\\eta$.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.95,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.22,"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":5,"p":0.98,"id":"s5","own":true,"role":"result","text":"We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(\\delta_N+h+\\eta)$, where $C>0$ is a constant independent of $N$, $h$ and $\\eta$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.41,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":6,"p":0.91,"id":"s6","own":true,"role":"contribution","text":"Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.06,"result":0.03,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.91,"interpretation":0.0}},{"i":7,"p":0.86,"id":"s7","own":true,"role":"result","text":"Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.86,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.1,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":0.6,"text":"We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(\\delta_N+h+\\eta)$, where $C>0$ is a constant independent of $N$, $h$ and $\\eta$.","location":"abstract s5","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":6542,"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.04,"states_limitation":0.17,"human_participants":0.02,"controlled_comparison":0.02,"randomized_assignment":0.01,"states_quantitative_result":0.96,"compares_with_prior_results":0.07,"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.56,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.56,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.44,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.93,"text":"Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP.","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"}}}