{"id":"a892e372-bc12-44db-b6f4-c6a764003b5d","arxiv_id":"2605.23928","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":4,"one_line_summary":"An architecture for proactive goal-directed AI agents is presented with six formal theorems claiming Pareto improvements over reactive chatbots in multi-participant task settings.","lead":"The paper proposes an architecture where AI agents proactively advance shared tasks without waiting for user prompts, using precomputed context, sandboxed programs, and state machines. A smart generalist might read it to understand a formal framework for reducing coordination overhead in multi-person AI-assisted workflows.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"The Pareto improvement claim is true by construction: Theorem 6.3 defines quality to exclude exactly the turns that proactivity eliminates, making the 'no speed-quality tradeoff' claim definitional rather than substantive.","rationale":"The reader correctly identified the most load-bearing concern: Theorem 6.3's quality metric is defined to exclude coordination turns, making the Pareto improvement claim true by construction. I agree with this assessment. The concern is precise and technically correct—the 'no speed-quality tradeoff' result is definitional rather than substantive. The reader's verdict of CONDITIONAL with MODERATE confidence is appropriate. The paper presents a coherent architectural framework with formally stated theorems, but the formal claims do not provide the scientific guarantees they appear to because the key theorem (6.3) assumes away the very dimension where a tradeoff could exist. The self-citations with placeholder arXiv IDs ([12], [13]) compound this: several theorems (3.5, 4.5, 7.2, 8.1) depend on results from these unavailable papers (Byte-Identity Theorem, Accumulation Monotonicity, Local Linearizability, SPACER RuleTrigger/RuleExecute), making independent verification impossible. The architecture may be valuable as engineering, and the formal model is internally consistent, but the Pareto claim is not a substantive theorem—it is a consequence of how quality is defined. No verdict adjustment needed; the reader's assessment is accurate.","tokens_in":11212,"tokens_out":2339,"duration_ms":60582,"concrete_test":"Define an alternative quality metric Q'(v) that includes measurable contributions from coordination turns—e.g., post-task participant surveys rating shared understanding, trust, and alignment on a Likert scale, or independent expert ratings of collaboration quality. Run the proposed measurement methodology from §10 on 20+ multi-participant goal chat sessions comparing π_P and π_R on identical goal types. If Q' under π_P is statistically significantly lower than under π_R (p < 0.05), the Pareto claim fails for any quality function that values coordination turns, revealing that Theorem 6.3's restriction to deliberation-turn-only quality is not merely a modeling choice but a substantive limitation.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central Pareto claim rests on two theorems. Theorem 5.6 (Proactive Dominance) is straightforwardly correct given the definitions: a proactive agent that can act on background events without user messages will need fewer user-message turns. The concern is with Theorem 6.3 (Quality Preservation), which states: 'Let Q(v) be any quality metric that depends only on the content produced by deliberation turns (turns with routing decision pass to the LM), not on coordination turns.' Since Theorem 5.6 only eliminates coordination turns (by construction—proactive advancement conditions fire on graph state, not LM generation), and quality is defined to depend only on deliberation turns, quality preservation follows tautologically. The eliminated turns are defined as non-quality-contributing, so removing them cannot reduce quality by definition. This makes the Pareto claim ('strictly faster, equal or higher quality, no tradeoff') true by construction rather than as a substantive result. If coordination turns in real human-AI-human collaboration contribute to shared understanding, trust, creative alignment, or participant buy-in—as is plausible in multi-participant settings—then a quality metric that captures these contributions could decrease under proactivity, breaking the Pareto claim. The paper acknowledges domain dependence (§10) but frames this as a matter of coverage magnitude, not as a threat to the quality preservation result itself. Additionally, several proofs depend on results from self-cited papers with placeholder arXiv IDs ([12]: arXiv:2502.XXXXX, [13]: arXiv:2501.XXXXX), which are not independently verifiable.","agreement_with_reader":"agree"},"referee_report":{"model":"glm-5.2","summary":"The paper presents Context, an architecture for proactive goal-directed AI agents that advance shared tasks without waiting for user prompts. The system rests on three mechanisms: (1) write-time context assembly with deterministic KV-cache reuse, (2) composable sandboxed 'wisdom programs' with phase-ordered composition, and (3) proactive state machine intelligence that emits structured content based on graph state. The paper proves six formal results: Context Stability (per-turn LM cost bound), Program Composition Correctness, Declarative Wiring Soundness, Proactive Dominance (proactive agents weakly dominate reactive agents on turns-to-terminal), Coordination Overhead Elimination and Quality Preservation (Pareto improvement), and Cross-Platform Vote Consistency. The architecture is implemented in the open-source Qbix/Safebox/Safebots stack.","tokens_in":11568,"tokens_out":1911,"duration_ms":151048,"significance":"The paper addresses a genuine gap: formal models of organizational efficiency in multi-participant human-AI-human goal-directed collaboration are rare, and the framing of proactive advancement as a structural rather than approximate property is novel. The wisdom library composition algebra (Theorem 4.2) and declarative wiring soundness (Theorem 4.5) are clean contributions. The open-source implementation across multiple platforms (Telegram, email, web, Apple) lends practical credibility. However, the central Pareto improvement claim (Theorems 5.6 + 6.3) is the headline result, and its significance depends on whether the quality preservation result is substantive or definitional, which is the primary concern discussed below.","major_comments":[{"comment":"§6, Theorem 6.3 (Quality Preservation): The theorem states 'Let Q(v) be any quality metric that depends only on the content produced by deliberation turns (turns with routing decision pass to the LM), not on coordination turns.' The proof then argues that since proactive advancement conditions fire on graph state (not LM generation), the eliminated turns are coordination turns, and since Q excludes coordination turns by definition, E[Q_πP] ≥ E[Q_πR] follows. This is correct but tautological: the theorem is true by construction because the quality metric is defined to exclude exactly the class of turns that proactivity eliminates. The Pareto claim ('strictly faster, equal or higher quality, no speed-quality tradeoff') is therefore definitional rather than substantive. This is load-bearing for the paper's central claim. The authors should either (a) acknowledge this explicitly and reframe ","section":null},{"comment":"the contribution as a definitional separation (coordination turns are structurally eliminable without touching deliberation turns) rather than a Pareto improvement, or (b) provide a theorem showing quality preservation under a broader class of quality metrics that could plausibly depend on coordination turns (e.g., metrics capturing shared understanding, trust, or participant buy-in). The current framing in §10 ('Domain dependence') acknowledges that c_elim is small for open-ended creative collaborations, but frames this as a coverage magnitude issue rather than as a threat to the quality preservation result itself.","section":null},{"comment":"References [12] and [13] are cited as 'arXiv:2502.XXXXX' and 'arXiv:2501.XXXXX' respectively, with placeholder arXiv IDs. These references are load-bearing: the Byte-Identity Theorem [12], Accumulation Monotonicity [12], SPACER semantics [13], Local Linearizability [13], and RuleTrigger [13] are all invoked in proofs (Theorems 3.5, 4.5, 7.2, 8.1). Without verifiable prior work, the formal results that depend on these theorems cannot be fully assessed. If [12] and [13] are not yet publicly available, the authors should either (a) include the necessary definitions and theorem statements as an appendix, or (b) provide stable, accessible references. As it stands, a reader cannot verify the proofs of Theorems 3.5, 4.5, 7.2, or 8.1 without taking the cited results on faith.","section":null},{"comment":"§6, Corollary 6.5 (Total Efficiency Gain): The product formula C_πP ≤ C_πR · (1−c_elim) · (1−E(W(t))) · [k_dyn + 0.1(k_perm + k_sess)] / [k_dyn + k_perm + k_sess] assumes independence of the three efficiency mechanisms. The authors acknowledge this is an approximation and that 'c_elim and E(W(t)) interact since eliminated coordination turns also eliminate wisdom library invocations.' However, the claim that the product 'provides a conservative upper bound under the approximation that the interactions are negligible' is not justified: if the interactions are non-negligible (as the authors themselves note), the product could either overestimate or underestimate the true savings depending on the direction of the interaction. The authors should either prove that the product is indeed conservative (i.e., an upper bound on savings) under stated assumptions, or remove the 'conservative upper' ","section":null},{"comment":"bound' claim and present the formula as a first-order approximation with explicit discussion of interaction effects.","section":null}],"minor_comments":[{"comment":"§3, Definition 3.3: The phase ordering relation lists 'pre ≺ ctx ≺ agg ≺ post ≺ render' and 'rel ≺ agg' and 'post ≺ auto' and 'idx independent.' The relationship between 'auto' and other phases (e.g., does auto ≺ render?) is not specified. Clarify the full partial order.","section":null},{"comment":"§5, Theorem 5.6 proof: The phrase 'the expected number of turns between c_i becoming satisfiable and π_R acting on it is at least 1' should specify the expectation is over what distribution (presumably the arrival process of user messages). The current formulation is informal for a theorem proof.","section":null},{"comment":"§5, Corollary 5.7: The variable p_user is described as 'the probability that a condition is satisfied simultaneously by a user message' but it is unclear whether this is per-condition or averaged across conditions. Clarify.","section":null},{"comment":"§6, Theorem 6.2: The proof lists four categories C1–C4 but the theorem statement refers to 'categories C_1, ..., C_k' with general k. The proof should either argue that these four categories are exhaustive (and set k=4) or maintain generality in the proof.","section":null},{"comment":"§7, Theorem 7.2: The proof references 'MM's Local Linearizability theorem [13]' and 'MM's per-publisher sequential consistency [13]' as distinct properties. It would help the reader to state these as formal assumptions (with self-contained definitions) rather than named references to unavailable work.","section":null},{"comment":"§8, Theorem 8.1: The cost formula uses subscript ℓ for levels but the DAG H has 'd depth levels.' Clarify the relationship between ℓ and d, and whether N_ℓ is the number of leaf nodes at level ℓ.","section":null},{"comment":"Table 1: 'Reqire' appears to be a typo for 'Require' in the SPACER phase description (also appears in §3, Definition 3.2: 'reads from a pre-loaded immutable input (no live DB queries, corresponding to SPACER's Compute; writes only via proposal accumulation (no direct writes, corresponding to Require)').","section":null},{"comment":"§10 (Discussion): The proposed measurement methodology is described as 'the subject of ongoing work' but no concrete experimental design or timeline is given. Consider adding a brief description of planned experiments or at least specifying what goal types would be tested.","section":null},{"comment":"The abstract lists six formal results but the introduction lists seven contributions (items 1–7). The seventh (Dual-traversal Hierarchy-Cache Correspondence, §8) is not mentioned in the abstract. Consider aligning.","section":null}],"recommendation":"major_revision","confidential_remarks":"The placeholder arXiv IDs for references [12] and [13] are a significant concern. If these are the author's own prior works that are not yet posted, the paper is effectively asking the reader to accept multiple load-bearing theorems on faith. The editor should verify whether [12] and [13] are accessible in some form before accepting the manuscript for review. Separately, the Pareto improvement claim is the paper's headline and it is essentially definitional. This is not necessarily fatal — the definitional separation between coordination and deliberation turns is itself a useful conceptual contribution — but the current framing oversells what is proven. The authors should be asked to reframe honestly."},"author_rebuttal":{"model":"glm-5.2","summary":"We thank the referee for a careful and substantive review. The referee correctly identifies that Theorem 6.3 (Quality Preservation) is true by construction under the stated quality metric restriction, that references [12] and [13] contain placeholder arXiv IDs and need to be made verifiable, and that the 'conservative upper bound' language in Corollary 6.5 is not justified. We address each point below and describe concrete revisions.","responses":[{"response":"The referee is correct that Theorem 6.3 is true by construction under the stated restriction on Q. We accept this criticism. In the revision, we will adopt option (a): we will explicitly acknowledge that the Quality Preservation result is a definitional separation—coordination turns are structurally eliminable without touching deliberation turns—rather than a substantive quality-preservation theorem under arbitrary quality metrics. We will reframe the contribution of Theorems 5.6 + 6.3 accordingly: the structural result is that proactive advancement conditions fire on graph state, not LM generation, so the eliminated turns are provably coordination turns, not deliberation turns. This is a non-trivial structural fact about the architecture, but it is not a universal quality-preservation guarantee. We will also add a paragraph in Section 6 discussing what a broader quality-preservation theorem would require (e.g., metrics capturing shared understanding or participant buy-in that could depend on coordination turns) and note that formalizing such a result would require additional assumptions about the relationship between coordination turns and terminal artifact quality, which we leave to future work. The informal argument for strict improvement (currently in the proof of Theorem 6.3) will be moved to a clearly labeled remark, separated from the formal theorem statement.","revision_made":"yes","referee_comment":"Theorem 6.3 (Quality Preservation) is tautological: the quality metric is defined to exclude exactly the turns that proactivity eliminates, making the Pareto claim definitional rather than substantive. The referee requests either (a) explicit acknowledgment and reframing as a definitional separation, or (b) a theorem under broader quality metrics."},{"response":"The referee is correct that placeholder arXiv IDs are unacceptable for load-bearing references. We will fix this by adopting option (a): we will add an appendix containing the necessary definitions and theorem statements from [12] and [13] that are invoked in our proofs. Specifically, the appendix will include: the Byte-Identity Theorem and Accumulation Monotonicity from [12] (needed for Theorems 3.5 and 8.1, and Corollary 4.3); the SPACER operational semantics, RuleTrigger delivery guarantee, and Local Linearizability theorem from [13] (needed for Theorems 4.5 and 7.2). Each will be stated with sufficient definitions for a reader to verify our proofs without accessing the companion papers. We will also update the references with correct arXiv IDs if the companion papers are publicly available by submission; if not, the appendix ensures self-contained verifiability regardless.","revision_made":"yes","referee_comment":"References [12] and [13] are cited with placeholder arXiv IDs and are load-bearing for proofs of Theorems 3.5, 4.5, 7.2, and 8.1. Without verifiable prior work, these proofs cannot be fully assessed. The referee requests either (a) including necessary definitions and theorem statements as an appendix, or (b) providing stable, accessible references."},{"response":"The referee is correct. We cannot justify the 'conservative upper bound' claim as stated. The interaction between c_elim and E(W(t))—eliminated coordination turns also eliminate wisdom library invocations—means the product could overestimate savings (if the interactions are synergistic, the true savings exceed the product) or underestimate them (if double-counting occurs). In the revision, we will remove the phrase 'conservative upper bound' and reframe Corollary 6.5 as a first-order approximation under an explicit independence assumption. We will add a discussion of the interaction effects: (1) the c_elim × E(W(t)) interaction is synergistic (eliminated coordination turns eliminate their associated wisdom invocations, so true savings exceed the product), but (2) the c_elim × KV-cache interaction is partially redundant (eliminated turns already avoid their per-turn token cost, so the cache savings factor partially double-counts). The net direction of the combined interaction is not determined without empirical measurement. We will present the formula as an order-of-magnitude estimate and note that empirical validation is needed to assess the actual combined effect.","revision_made":"yes","referee_comment":"Corollary 6.5 (Total Efficiency Gain): The product formula assumes independence of the three efficiency mechanisms. The claim that the product provides a 'conservative upper bound' is not justified since interactions could cause the product to overestimate or underestimate savings. The referee requests either proving the bound is conservative or removing the 'conservative upper bound' claim and presenting the formula as a first-order approximation."}],"tokens_in":11544,"tokens_out":1067,"duration_ms":134615,"standing_objections":[]},"desk_editor":{"model":"glm-5.2","letter":"The headline: the paper's central Pareto improvement claim is technically correct but true by construction, and several proofs depend on self-cited papers with placeholder arXiv IDs that can't be verified. The architecture itself is a legitimate engineering integration worth reading about, but the formal results don't deliver the scientific guarantees they advertise.","headline":"The Pareto improvement claim is true by construction — the theorems are correct but largely definitional, and load-bearing self-citations are unavailable.","tokens_in":12029,"tokens_out":134,"would_cite":false,"duration_ms":38413,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"glm-5.2","headline":"Proactive AI agents provably need fewer turns than reactive ones","keywords":["proactive dialogue","goal-directed agents","wisdom library","sandboxed programs","KV-cache optimization","organizational efficiency","knowledge graphs","cross-platform governance"],"falsifier":"Measure artifact quality in multi-participant goal chats under proactive vs. reactive agents where coordination turns are independently rated for quality contribution. If coordination turns carry nonzero quality signal, the Pareto claim fails.","tokens_in":11315,"feed_emoji":"⚙️","tokens_out":1655,"duration_ms":68302,"temperature":0.7,"pith_summary":"This paper argues that conversational AI systems should be proactive—acting on their own when the next step is determinable from existing state—rather than waiting for user messages. It introduces an architecture called Context built on three mechanisms: write-time context assembly that precomputes typed attributes so context blocks are byte-identical across turns (enabling near-100% KV-cache reuse and roughly 10× cost reduction); a library of sandboxed imperative programs generated by language models, declaratively wired to goal types via typed stream relations and composed in a phase-ordered pipeline that preserves individual program correctness; and proactive goal stream state machines that inspect graph state and emit structured interaction content (option arrays, governance affordances, clarification prompts) without awaiting user input. The paper's central formal result is the Proactive Dominance Theorem: proactive agents weakly dominate reactive agents on expected turns to reach a terminal state, because any transition condition satisfiable by a background event (job completion, vote threshold, dependency resolution) can be acted on immediately rather than waiting for the next user message. Combined with a Quality Preservation argument—eliminated turns are coordination turns, not deliberation turns, so removing them does not degrade artifact quality—the paper claims a Pareto improvement: strictly faster, equal or higher quality, no tradeoff. Additional theorems establish correctness of program composition, soundness of declarative event wiring, cross-platform vote consistency, and a hierarchy-cache correspondence for multi-level artifact generation.","feed_headline":"Proactive AI agents provably beat reactive ones on turn count","feed_subtitle":"Architecture with state-machine-driven agents eliminates coordination overhead in multi-participant task chats, claiming a Pareto win with","key_machinery":"The central object is the proactive advancement condition: a triple (q, γ, μ) where q is a target state, γ is a predicate over stream attributes and graph state, and μ is a deterministic message generator. When the goal stream instance reaches state q and γ evaluates true on current graph state, the system emits structured content without any user input. This mechanism is what separates proactive from reactive agents and is what the dominance theorem turns on. Supporting it are the wisdom library (sandboxed imperative programs with phase ordering and typed I/O schemas), the policy graph for declarative event wiring, and the context block hierarchy for KV-cache reuse.","core_discovery":"The paper's load-bearing claim is that proactive agents—defined as agents that emit output whenever a graph-state condition is satisfied, not just when a user message arrives—provably require fewer expected interaction turns to complete a goal than reactive agents, and that the eliminated turns are coordination overhead (state inquiry, blocker identification, responsibility assignment, vote solicitation) rather than substantive deliberation. This makes proactivity a Pareto improvement: fewer turns, equal or higher quality, with no speed-quality tradeoff. The argument is structural rather than empirical: the turns removed are those where a reactive agent must wait for a user to trigger a step","pith_inferences":["The Pareto improvement claim depends on a sharp distinction between coordination turns and deliberation turns. In real human-AI-human collaboration, some 'coordination' turns may build shared understanding, trust, or creative alignment that feeds back into artifact quality. If coordination turns have indirect quality contributions, the Pareto frontier may not be as clean as the formal model sugges","The dominance theorem is asymptotic in coverage: as the wisdom library and advancement conditions mature, savings grow. For early-stage systems with sparse coverage, the practical advantage over reactive agents may be modest, and the cost of building and maintaining the library may exceed the coordination savings it eliminates.","The architecture implicitly assumes that the correct next action is often determinable from graph state alone. For genuinely ambiguous or creative tasks, proactive actions based on state conditions could be premature or wrong, potentially introducing noise rather than reducing overhead. The paper acknowledges this with its domain-dependence discussion but does not bound the failure mode.","The independence assumption in the total efficiency gain formula (Corollary 6.5)—that coordination overhead elimination, LM-call elimination, and KV-cache savings act on independent cost components—is likely conservative in some directions and optimistic in others, since eliminated coordination turns also eliminate wisdom program invocations, creating coupling the product formula does not capture."],"forward_implications":["If the dominance theorem holds in practice, multi-participant task chats (document review, support resolution, capability building) could see coordination overhead approach zero as the wisdom library matures, meaning fewer human turns spent on 'who does what' and 'what state are we in.'","The write-time context assembly approach—precomputing enriched attributes so context blocks are byte-identical between semantic changes—offers a structurally different cost model from RAG, where query-time retrieval produces variable context. Systems that can tolerate write-time latency could see substantial per-turn cost reductions.","The cross-platform vote consistency theorem means governance decisions (approvals, promotions, forks) can be shared across Telegram, email, web, and mobile with a single serialized ledger, enabling genuinely platform-agnostic organizational governance.","The program composition correctness theorem implies that a library of LM-generated programs can grow monotonically in coverage without breaking existing pipelines, provided addition-time phase-correctness validation is enforced—suggesting a path to self-improving agent systems."],"fun_headline_variants":["Proactive AI agents provably cut goal-completion turns vs reactive","Formal proof: proactive AI agents need fewer turns than reactive ones","Proactive agents provably Pareto-dominate reactive agents on turn count","Proving proactive AI cuts coordination turns without losing quality","Proactive agents reduce task turns by eliminating coordination overhead"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The Quality Preservation Theorem assumes that artifact quality depends only on deliberation turns (where the language model makes a routing decision) and not on coordination turns. This means the turns eliminated by proactivity are defined as non-quality-contributing by construction. If coordination turns in real collaborations actually contribute to shared understanding, trust, or creative alignment, removing them could degrade quality and the Pareto improvement would not be","fun_headline_variants_meta":{"raw":{"variants":["Proactive AI agents provably cut goal-completion turns vs reactive","Formal proof: proactive AI agents need fewer turns than reactive ones","Proactive agents provably Pareto-dominate reactive agents on turn count","Proving proactive AI cuts coordination turns without losing quality","Proactive agents reduce task turns by eliminating coordination overhead","Proactive vs reactive: formal proof of fewer turns for goal-driven AI","Goal-directed proactive AI provably cuts coordination overhead"]},"model":"glm-5.2","effort":"high","cost_usd":0.0,"raw_usage":{"total_tokens":1106,"prompt_tokens":581,"completion_tokens":525,"prompt_tokens_details":null},"tokens_in":581,"tokens_out":525,"duration_ms":14487,"temperature":1.0,"reasoning_tokens":464,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-05T07:34:46.725952+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"Measure artifact quality in multi-participant goal chats under proactive vs. reactive agents where coordination turns are independently rated for quality contribution. If coordination turns carry nonzero quality signal, the Pareto claim fails.","supporting_citations":[],"review_version":1}