{ "schema_version": 1, "builder_plan": { "scenario": "Your inference service slows down when several customers send requests together.", "change": "Replay a recorded request trace with only the proposed serving policy changed.", "baseline": "Your current scheduler on the same model and hardware.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Requests meeting your latency target, throughput, failures, and cost per successful request.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2609.31047", "title": "DynBranch: Speculative Subgraph Reuse for Dynamic Agentic LLM Serving", "summary": "It replaces idle waiting at runtime branch points (where neither caching nor downstream execution can start until the branch resolves) with speculative execution of candidate subgraphs under a stable pre-resolution coordinate, plus cross-request reuse of completed subgraph results. The cost is additional speculative compute that may be discarded, a two-level admission controller to tune, and serving-layer complexity even though agent harnesses and model engines are untouched. It can fail when branch predictions are wrong (wasted tokens and GPU time), when the admission controller underprices load, or when the reader's workloads run only through third-party APIs where a serving-layer controller cannot be deployed.", "rationale": "The mechanism is validated on commodity hardware and requires no harness changes, but it is a new serving system whose benefit depends on workload branch predictability, so the reader should validate it on their own agentic workloads before production adoption.", "technique": "Speculative subgraph reuse for agentic workflow serving", "family": "serving_e_batching", "recommendation": "testar", "published": "2026-09-25", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.31047", "independent_implementations": 0, "total_implementations": 1, "stars": 10, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "It replaces idle waiting at runtime branch points (where neither caching nor downstream execution can start until the branch resolves) with speculative execution of candidate subgraphs under a stable pre-resolution coordinate, plus cross-request reuse of completed subgraph results. The cost is additional speculative compute that may be discarded, a two-level admission controller to tune, and serving-layer complexity even though agent harnesses and model engines are untouched. It can fail when branch predictions are wrong (wasted tokens and GPU time), when the admission controller underprices load, or when the reader's workloads run only through third-party APIs where a serving-layer controller cannot be deployed.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31047", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Reduces mean latency by up to 32% over each workload's strongest prior system and 46-66% against a no-reuse baseline, on Qwen3-32B with 4x H200 and on a Qwen3-8B/RTX 4090 deployment.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31047", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }