{"paper":{"title":"Agentic Orchestration for SLA-Constrained Network Slicing in Programmable Mobile Data Planes","arxiv_id":"2611.16801","primary_cat":"cs.NI","submitted_at":"2026-11-12T13:42:36+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":"The Third Generation Partnership Project (3GPP) Technical Specification 23.501 (Release 17) defines Maximum Bit Rate (MBR) enforcement at the User Plane Function (UPF) in fifth-generation (5G) networks.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.02,"quantitative":true,"quantitative_p":0.5,"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":"Supporting differentiated service-level agreements across the radio access and core networks requires the UPF to enforce MBR limits according to configured slice priorities.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.06,"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.73,"id":"s2","own":false,"role":"background","text":"During overload, the challenge is to adapt these limits while preserving that differentiation and avoiding oscillations.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.05,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.27,"method":0.0,"result":0.0,"background":0.73,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.64,"id":"s3","own":true,"role":"contribution","text":"Building on programmable enforcement and intelligent orchestration, we propose an agentic control loop combining UPF telemetry with locally hosted Large Language Model (LLM) selection from a finite set of admissible rate candidates.","hedge":{"p":0.93,"label":"asserted"},"own_p":0.83,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.36,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.64,"interpretation":0.0}},{"i":4,"p":0.99,"id":"s4","own":true,"role":"method","text":"Deterministic logic validates each selection and derives Packet Forwarding Control Protocol (PFCP) updates.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.82,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.04,"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":5,"p":1.0,"id":"s5","own":true,"role":"result","text":"The evaluated runs show no oscillations or fallbacks and unchanged highest-priority rate limits.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.33,"quantitative":false,"quantitative_p":0.37,"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.92,"id":"s6","own":true,"role":"limitation","text":"These observations establish configuration preservation; delivered per-class QoS protection remains unmeasured.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.86,"main_claim_p":0.21,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.01,"background":0.0,"limitation":0.92,"future_work":0.0,"contribution":0.0,"interpretation":0.07}}]},"compiled":{"main_claim":{"p":0.65,"text":"The evaluated runs show no oscillations or fallbacks and unchanged highest-priority rate limits.","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":5579,"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.05,"states_limitation":0.96,"human_participants":0.03,"controlled_comparison":0.1,"randomized_assignment":0.02,"states_quantitative_result":0.12,"compares_with_prior_results":0.1,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.85,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.85,"simulation_or_computation":0.15}},"contribution_type":{"p":0.99,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.99,"empirical_study":0.01,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"Building on programmable enforcement and intelligent orchestration, we propose an agentic control loop combining UPF telemetry with locally hosted Large Language Model (LLM) selection from a finite set of admissible rate candidates.","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":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"}}}