A T-API-Compliant ReAct Agentic Loop for Optical Networks: Generic vs. Domain-Specific Tool Abstractions

Seyed Morteza Ahmadian, Paolo Monti, Carlos Natalino
6/16/2026
cs.NIcs.AI

No confident code implementation found for this paper.

Abstract

Optical networks need intent-driven, closed-loop agentic management, a key enabler for higher autonomy levels. We present the first T-API-compliant reasoning and act (ReAct) loop. We show that domain-specific composite tools achieve 90% oracle-validated correctness with threefold token savings compared to generic tools.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Reason-Plan-ReAct: A Reasoner-Planner Supervising a ReAct Executor for Complex Enterprise Tasks

81% match2025

Agentic AI for Ultra-Modern Networks: Multi-Agent Framework for RAN Autonomy and Assurance

80% match2025

Autonomy and Agency in Agentic AI: Architectural Tactics for Regulated Contexts

80% match2026

PoAct: Policy and Action Dual-Control Agent for Generalized Applications

80% match2025

The Art of Tool Interface Design

80% match2025

From Cloud-Native to Trust-Native: A Protocol for Verifiable Multi-Agent Systems

80% match2025

Cite this paper

@article{ahmadian2026tapicompliant,
  title  = {A T-API-Compliant ReAct Agentic Loop for Optical Networks: Generic vs. Domain-Specific Tool Abstractions},
  author = {Seyed Morteza Ahmadian and Paolo Monti and Carlos Natalino},
  year   = {2026},
  eprint = {2606.18000},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.18000v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.18000.svg)](https://codeofpaper.com/paper/2606.18000)

Discussion