REVIEW 3 major objections 5 minor 28 references
Enterprise LLM agents need a shared, governed memory of process rules, not per-agent prompts or raw document retrieval.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · grok-4.5
2026-07-12 03:58 UTC pith:SEEYGX2V
load-bearing objection Clean architecture paper for shared process knowledge in agentic BPM; the PoC shows atoms beat chunk RAG, but barely tests the multi-agent governance story that makes the idea distinctive. the 3 major comments →
Organizational Memory for Agentic Business Process Execution
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Reliable, scalable agentic business process execution requires a shared organizational memory: a governed, agent-consumable collection of process atoms that unifies fragmented procedural knowledge, supports conflict detection and human ownership, and supplies only the context needed for the current task—outperforming both pure parametric knowledge and document-level RAG on policy-compliant decisions.
What carries the argument
Process atoms: self-contained units each capturing one rule with name, source, applicability, action, purpose, and domain-model tags, curated under a Global Curator plus human approval and retrieved by a hybrid tag-plus-semantic Retriever at runtime.
Load-bearing premise
That atoms extracted from a small synthetic PDF set, after light human-style review, will stay precise and retrievable when real enterprises pile on overlapping policies, process models, conflicts, and non-PDF legacy sources.
What would settle it
Run the same agents on a larger multi-source enterprise corpus (policies, BPMN, SOPs, ERP docs, conflicting local rules) and check whether Policy Compliance Rate still clearly beats RAG and base setups without a surge of over-restriction or missed cross-cutting rules.
If this is right
- Enterprises can maintain procurement, finance, and compliance rules once and serve them to many agents instead of re-encoding them per agent.
- Policy updates (for example a new mismatch threshold) can propagate by changing the shared memory rather than re-prompting every agent.
- Human experts gain an explicit ownership and approval path over the knowledge that steers agent behavior across departments.
- Runtime agents receive compact, task-scoped rule sets rather than full documents or unfiltered retrieval dumps.
- Agent learning from repeated corrections can be proposed as candidate atom changes for governed inclusion.
Where Pith is reading between the lines
- If atom extraction quality is the main remaining error source, investment in multi-format extractors and automated conflict resolution will determine whether organizational memory is production-ready.
- The same atom layer could later support audit trails that link every agent decision back to the governing policy clause.
- Without strong ownership workflows, the memory itself could become a new bottleneck when many business units try to write competing rules.
- Tag-grounded retrieval may generalize to other multi-agent enterprise settings where context is organizational rather than purely semantic.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper argues that LLM-based agents for business process execution need organization-specific procedural knowledge that is currently fragmented across human-oriented artifacts (policies, BPMN, SOPs, etc.), and that encoding this knowledge per agent creates silos and inconsistent updates. It introduces organizational memory as a shared, human-governed, agent-consumable reference layer of evolving process knowledge; derives nine architecture requirements (R1–R9); proposes a curation/consumption architecture centered on process atoms (applicability/action/purpose units grounded by enterprise-domain tags), a Global Curator, and a Retriever; and reports a synthetic purchase-to-pay proof-of-concept in which a Memory agent achieves higher Policy Compliance Rate (88% GPT-4.1 / 95% Sonnet 4.5) than Base (30%) and document-level RAG (70–80%).
Significance. The problem is real and timely for agentic BPM: enterprises will not scale thousands of agents if each carries its own copy of overlapping policies. The requirements derivation from a concrete purchase-to-pay motivation is clear, and the process-atom design (self-contained rule units with source links and domain tags) is a concrete, governable representation that goes beyond generic RAG or per-agent memory streams. Related work is positioned fairly against process-rule databases and individual agent memory systems. If the architecture can be shown to support multi-agent reuse, conflict handling, and governed evolution under concept drift, the contribution would matter for both research and practice. The PoC is only preliminary evidence of single-agent policy compliance gains; the paper’s lasting value currently rests more on the conceptual framing and architecture than on the empirical result.
major comments (3)
- §6 vs R3/R7–R9 (§4–5): The central empirical claim that organizational memory improves policy-compliant execution (Fig. 3; PCR 88–95% vs 70–80% RAG) does not test the load-bearing enterprise properties that distinguish the architecture from a well-structured rule store—shared multi-agent consumption (R9), conflict detection across sources (R3), human governance of updates (R8), or adaptive evolution under concept drift (R7). The PoC is a single procurement assistant over a static atom set extracted once from 9 PDFs. The PCR gap may therefore be driven by atomic unitization and hybrid retrieval rather than by shared, governed memory. Either add experiments that exercise multi-agent reuse, conflict resolution, or governed updates, or revise the claims so that §6 is scoped as evidence for atom-based retrieval, not for the full architecture.
- §6.1–6.2 evaluation design: The evaluation uses a synthetic corpus (9 PDFs, 11 hand-embedded rules), 10 author-designed scenarios, and ground truth written by the same authors from those policies. Implementation is proprietary. There are no confidence intervals, no multi-run statistical tests beyond averaging four runs, no real enterprise documents, and no comparison against a strong structured baseline (e.g., a non-shared atom store or the process-rule databases of Kaltenpoth/Skolik). Remaining Memory errors are attributed to imprecise extraction, yet extraction services for non-PDF sources are explicitly out of scope (§5.2). This is too thin to support “demonstrate its effectiveness” as a contribution of equal weight to the architecture. Strengthen the evaluation or demote the PoC to an illustrative case study with correspondingly tempered abstract/conclusion language.
- §5.1–5.2 design choice vs evidence: Atomic decomposition into applicability/action/purpose is presented as the right granularity for governance, conflict detection, and selective retrieval, but the paper provides no ablation of atom structure (e.g., plain-text chunks vs atoms without tags vs atoms without purpose) and no worked example of Global Curator conflict detection on overlapping sources. Given that §6.2’s cost-center failure mode for RAG and over-restriction failures for Memory both hinge on applicability scope, an ablation or at least a transparent conflict/duplicate example is needed to justify the atom schema as more than a convenient packaging of rules.
minor comments (5)
- §5.3: typo “froms Section 4” → “from Section 4”.
- Fig. 1 and Fig. 2 are useful; ensure Fig. 2’s “Atom + / Atom − / Atom ~” legend is defined in the caption for readers who skip the body text.
- §2.1: the distinction from Kaltenpoth et al. and Skolik et al. is important; a short table contrasting scope (single process vs enterprise memory, governance, multi-source curation) would make the novelty claim easier to audit.
- §6.1: report chunking/embedding hyperparameters and the exact atom count after extraction so the Memory vs RAG comparison is reproducible even without source code.
- Abstract and §1 list four contributions including demonstration of effectiveness; align wording with the limitations stated in §7 so readers are not oversold on the empirical part.
Circularity Check
No circular derivation: architecture proposal plus independent empirical comparison against hand-labeled ground truth.
full rationale
This paper does not claim a first-principles derivation or a fitted-parameter prediction. It motivates organizational memory, lists requirements R1–R9, proposes an architecture (process atoms, curation, retrieval), and evaluates three agent setups (Base, RAG, Memory) on a synthetic purchase-to-pay task set via Policy Compliance Rate. Ground truth is manually annotated from the same synthetic policy corpus that supplies both RAG chunks and Memory atoms; that is standard knowledge-base evaluation, not a reduction of the metric to the representation by construction—the agent must still retrieve and apply rules correctly, and Memory can (and does) fail via over-broad extracted atoms. Self-citations (e.g., Kirchdorfer et al. on multi-agent process simulation; Kampik co-authored agentic BPM manifesto) appear only as background and do not supply a uniqueness theorem or ansatz that forces the central claim. No self-definitional loop, fitted-input-as-prediction, load-bearing self-citation chain, or renaming of a known result as a derived result is present. Confounding between atom unitization and the broader shared-governance architecture is a validity concern, not circularity.
Axiom & Free-Parameter Ledger
free parameters (2)
- RAG top-k and chunking (top-5, ~600-char chunks, 100-char overlap)
- Number and design of synthetic scenarios (10) and rules (11)
axioms (4)
- domain assumption Organization-specific procedural knowledge is fragmented across human-oriented artifacts and is required for reliable agentic process execution.
- domain assumption Per-agent prompts or retrieval setups do not scale in enterprises because they create silos, duplicates, and inconsistent updates.
- ad hoc to paper Atomic decomposition into applicability/action/purpose units is the right granularity for governance, conflict detection, and selective retrieval.
- domain assumption Human governance of memory updates is necessary because fully automated curation is insufficient for organizational accountability.
invented entities (3)
-
process atom
no independent evidence
-
organizational memory (as shared enterprise reference layer)
no independent evidence
-
Global Curator
no independent evidence
read the original abstract
LLM-based agents offer new opportunities for automating business process execution beyond the limits of rule-based systems. However, general-purpose LLMs lack the organization-specific knowledge required for reliable execution, which is typically fragmented across human-oriented artifacts such as policies, process models, and standard operating procedures. While such knowledge can technically be encoded in individual prompts or agent-specific retrieval setups, this approach does not scale in enterprises, as it gives rise to knowledge silos and rule duplicates, and makes consistent updates and learning across agents difficult. We argue that this calls for an organizational memory for agentic business process execution: a shared, governed, and agent-consumable reference layer of evolving organization-specific procedural knowledge about how work should be executed. We derive requirements for such a memory, propose an architecture for its curation and consumption, and demonstrate its effectiveness in a proof-of-concept based on a procurement scenario.
Figures
Reference graph
Works this paper leans on
-
[1]
van der Aalst, W.M.P., Bichler, M., Heinzl, A.: Robotic process automation. Bus. Inf. Syst. Eng.60(4), 269–272 (2018)
2018
-
[2]
In: Intelligent Information Systems (2026)
Bein, L., Pufahl, L.: Karibdis - a knowledge-graph-based business process manage- ment system for semantically explainable process execution support. In: Intelligent Information Systems (2026)
2026
-
[3]
Boissier, O., Bordini, R.H., Hübner, J.F., Ricci, A., Santi, A.: Multi-agent oriented programming with jacamo. Sci. Comput. Program.78(6), 747–761 (2013)
2013
-
[4]
IS140, 102738 (2026)
Calvanese, D., Casciani, A., De Giacomo, G., Dumas, M., Fournier, F., Kampik, T., Malfa, E.L., Limonad, L., Marrella, A., Metzger, A., Montali, M., Amyot, D., Fettke, P., Polyvyanyy, A., Rinderle-Ma, S., Sardiña, S., Tax, N., Weber, B.: Agentic business process management: A research manifesto. IS140, 102738 (2026)
2026
-
[5]
In: Process Mining Handbook, pp
Ciccio, C.D., Montali, M.: Declarative process specifications: Reasoning, discovery, monitoring. In: Process Mining Handbook, pp. 108–152. Springer (2022)
2022
-
[6]
Corea, C., Kuhlmann, I., Thimm, M., Grant, J.: Paraconsistent reasoning for inconsistency measurement in declarative process specifications. Inf. Syst.122, 102347 (2024)
2024
-
[7]
Dumas, M., Milani, F., Chapela-Campa, D.: Agentic business process management systems. CoRRabs/2601.18833(2026)
arXiv 2026
-
[8]
Giacomo, G.D., Kampik, T., Kirchdorfer, L., Montali, M., Weinhuber, C.: Formal foundations of agentic business process management (2026)
2026
-
[9]
In: KDD (2024)
Guan, Y., Wang, D., Chu, Z., Wang, S., Ni, F., Song, R., Zhuang, C.: Intelligent agents with llm-based process automation. In: KDD (2024)
2024
-
[10]
Jain, A., Paliwal, S., Sharma, M., Vig, L., Shroff, G.: Smartflow: Robotic process automation using llms. CoRRabs/2405.12842(2024)
Pith/arXiv arXiv 2024
-
[11]
IJCIS5(2&3), 105–130 (1996)
Jennings, N.R., Faratin, P., Johnson, M.J., Norman, T.J., O’Brien, P.D., Wiegand, M.E.: Agent-based business process management. IJCIS5(2&3), 105–130 (1996)
1996
-
[12]
In: BPM (2025) 16 L
Kaltenpoth, S., Skolik, A., Müller, O., Beverungen, D.: A step towards cognitive automation: Integrating llm agents with process rules. In: BPM (2025) 16 L. Kirchdorfer et al
2025
-
[13]
Process Science2(1), 4 (2025)
Kirchdorfer, L., Blümel, R., Kampik, T., van der Aa, H., Stuckenschmidt, H.: Discovering multi-agent systems for resource-centric business process simulation. Process Science2(1), 4 (2025)
2025
-
[14]
Kirchdorfer, L., Doumeni, A., van der Aa, H., López, H.A.: From global policies to local strategies: Multi-objective optimization of resource-specific handover policies. In: BPM. Lecture Notes in Computer Science, Springer (2026)
2026
-
[15]
Information Systems135, 102584 (2026)
Kraus, A., van der Aa, H.: Comprehensive characterization of concept drifts in process mining. Information Systems135, 102584 (2026)
2026
-
[16]
In: NeurIPS (2020)
Lewis, P., Perez, E., Piktus, A., Petroni, F., Karpukhin, V., Goyal, N., Küttler, H., Lewis, M., Yih, W.t., Rocktäschel, T., Riedel, S., Kiela, D.: Retrieval-augmented generation for knowledge-intensive nlp tasks. In: NeurIPS (2020)
2020
-
[17]
ACM Comput
Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., Neubig, G.: Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Comput. Surv.55(9) (2023)
2023
-
[18]
In: BPM (Forum) (2024)
Monti, F., Leotta, F., Mangler, J., Mecella, M., Rinderle-Ma, S.: Nl2processops: Towards llm-guided code generation for process execution. In: BPM (Forum) (2024)
2024
-
[19]
Packer, C., Fang, V., Patil, S.G., Lin, K., Wooders, S., Gonzalez, J.E.: Memgpt: Towards llms as operating systems. CoRRabs/2310.08560(2023)
Pith/arXiv arXiv 2023
-
[20]
Shen, Q., Polyvyanyy, A., Lipovetzky, N., Kampik, T.: Applying organizational mining to discover agent systems from event data. Inf. Syst.138, 102669 (2026)
2026
-
[21]
Information Systems141, 102748 (2026)
Skolik, A., Kaltenpoth, S., Beverungen, D., Müller, O.: A modular large language model agent architecture for adaptive and autonomous process-aware execution. Information Systems141, 102748 (2026)
2026
-
[22]
TMLR2024(2024)
Sumers, T.R., Yao, S., Narasimhan, K., Griffiths, T.L.: Cognitive architectures for language agents. TMLR2024(2024)
2024
-
[23]
In: BPM (2023)
Tour, A., Polyvyanyy, A., Kalenkova, A.A., Senderovich, A.: Agent miner: An algorithm for discovering agent systems from event data. In: BPM (2023)
2023
-
[24]
In: BPM (RBPM, PT, and Educators Forum) (2025)
Vu, H., Klievtsova, N., Leopold, H., Rinderle-Ma, S., Kampik, T.: Agentic business process management: Practitioner perspectives on agent governance in business processes. In: BPM (RBPM, PT, and Educators Forum) (2025)
2025
-
[25]
In: DASFAA (6)
Wang, B., Liang, X., Yang, J., Huang, H., Wu, Z., Wu, S., Ma, Z., Li, Z.: SCM: en- hancing large language model with self-controlled memory framework. In: DASFAA (6). pp. 188–203 (2025)
2025
-
[26]
Springer (2024)
Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer (2024)
2024
-
[27]
In: NeurIPS (2025)
Xu, W., Liang, Z., Mei, K., Gao, H., Tan, J., Zhang, Y.: A-MEM: agentic memory for LLM agents. In: NeurIPS (2025)
2025
-
[28]
In: AAAI (2024)
Zhong, W., Guo, L., Gao, Q., Ye, H., Wang, Y.: Memorybank: enhancing large language models with long-term memory. In: AAAI (2024)
2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.