Enterprise-Ai

TL;DR for operators A shared enterprise assistant does not only need to remember more people. It must often determine which fact, permission, instruction, or decision has to exist before another action is valid. Org-Agent addresses this by decomposing multi-user work into atomic subtasks, connecting prerequisite relationships in a dynamic execution graph, ordering those subtasks so prerequisites run first, and carrying retrieved evidence and intermediate results into later steps.1 ...

TL;DR for operators Enterprise agents repeatedly entering the same document stores, applications, and tool environments often spend task-time compute rediscovering where information lives and how the environment behaves. The alternative tested here is to perform some of that discovery before real requests arrive and preserve what was learned as reusable artifacts. Samuel et al.’s Studying Without a Syllabus: Task-Agnostic Environment Preprocessing1 reports that 21 of 24 studied method-by-benchmark conditions improve over running the frozen solver with no preparation. The stronger result is not that more preparation is always better. A preparation strategy that works well in one environment can perform poorly in another, and larger study budgets do not reliably increase downstream reward. ...

TL;DR for operators When an LLM produces a bad executable workflow, the failure may not mean that it misunderstood the business rule. It may have selected the right actions and still lost parameters, Boolean relationships, or graph ordering while writing the full structure. That distinction changes the engineering response. In Generating Workflow DAGs from Natural Language with Non-Reasoning LLMs, Anand Iyer, Bhanu Khetharpal, Srinivas Upadhya, and Ramkumar Rajagopal test an architecture that keeps language interpretation in the LLM but moves deterministic graph expansion into conventional code.1 On their 635-rule benchmark, GPT-5.3-chat improves from 56.4% to 80.6% LLM-judge validity when paired with registry selection, a compact intermediate representation, and deterministic compilation. Exact-condition accuracy rises from 56.5% to 82.2%. ...

TL;DR for operators A natural-language interface to a knowledge graph can look healthy while producing the wrong answer. In the experiments behind EXYGEN, several configurations generated executable SPARQL more than 97% of the time yet achieved zero correct execution results. The strongest configuration reached 97.8% executability and 41.9% relaxed exact match on execution results only after combining graph-derived metadata, explicit schema constraints, retrieved triples, and question-query examples. ...

TL;DR for operators An enterprise assistant may retrieve a long internal document because one sentence is relevant to a user question. If the entire passage is then handed to the generator, the model receives much more information than it needs—and a successful prompt injection has more material available to disclose. KFS-RAG addresses that exposure point after retrieval but before generation. Instead of forwarding raw passages, it identifies query-relevant evidence and converts it into a compact set of facts. In the paper’s open-domain QA evaluation, this reduced untargeted chunk recovery from 70.8% with Vanilla RAG to 21.03%, while answer BLEU-1 and ROUGE-L remained close to the raw-context baseline. ...

TL;DR for operators Hallucination control should not depend on finding one detector strong enough to catch every unsupported answer. The paper studied here proposes distributing that responsibility across six control points: grounding, deterministic execution boundaries, verification, abstention, traceability, and continuous oversight. Its benchmark results also show why composition matters. Two LLM judges reached AUROC 0.846 and 0.843 on hallucination detection, versus 0.640 for a rule-based grounding score. Yet averaging the weaker rule score with either judge slightly reduced AUROC. More verification signals are not automatically better verification. ...

TL;DR for operators A RAG system can fail even when retrieval looks superficially healthy: several top-ranked documents repeat the query vocabulary, while the document that actually contains the answer sits lower in the list. The paper studies a reranking rule designed specifically for that situation.1 Instead of rewarding more query-document overlap, it removes words that exactly or semantically echo the query and scores what remains. In an eight-theme controlled keyword-stuffing diagnostic, this semantic variant improves mean target rank from 2.88 to 1.25 and pushes stuffed distractors from mean rank 2.00 to 4.50. ...

TL;DR for operators An internal document collection can contain the relationships needed to answer difficult questions while still lacking the labeled examples needed to teach a retriever which relationships matter. That usually leaves teams choosing between manual annotation and retrieval based mostly on embedding similarity. SelfGraphRAG1 tests a third option: build a knowledge graph, turn its structure into generated question-answer examples, and train the retriever on those examples. On MultiHop-RAG, the resulting system reports F1 of 24.62, compared with 2.60 for RAG, 0.98 for LightRAG, and 0.01 for GraphRAG. ...

TL;DR for operators A long generated report can contain low-risk statements alongside claims that deserve much stronger evidence checking. Applying the strictest verification rule everywhere spends verifier capacity without distinguishing where factual failure is most likely. FACTOR turns that problem into a routing decision. The framework estimates uncertainty for individual claims, applies progressively stricter evidence requirements as estimated risk rises, and then selects among multiple generated candidates. In the reported benchmark, FACTOR reached a FActScore of 42.3 versus 36.8 for static verification while reducing average verification calls from 194.0 to 41.9.1 ...

TL;DR for operators An enterprise agent can finish a workflow and still be a poor production system. It may require repeated retries, call the wrong tool before recovering, exceed an acceptable cost envelope, fail under small environmental changes, or depend on a human to stop a consequential action. Bin Xu’s survey, AI Agent Systems: Architectures, Applications, and Evaluation, treats those behaviors as part of the system being evaluated, not as incidental implementation details.1 Its central abstraction places the model inside an execution loop with memory, tools, verifiers, and an environment. Section 6 then evaluates the resulting system across multiple dimensions rather than collapsing performance into task success. ...