{
 "@context": "https://schema.org",
 "@type": "Claim",
 "@id": "https://wulfkaal.github.io/positions/2026-08-26-012",
 "identifier": "kaal:position:2026-08-26-012",
 "additionalType": "https://wulfkaal.github.io/positions/schema.json#AffirmedPositionClaim",
 "name": "Workflow Arrangement Amortization",
 "text": "Scale is an amortization problem before it is a throughput problem. Chen and her coauthors make this distinction explicit in AgentSlimming. Their starting workflow is a graph of agents and communication edges. The method prunes redundant nodes, substitutes lower-cost models, and retains changes only when baseline performance survives. Across eight benchmarks, the resulting workflows reduced recurring token and API expense while preserving or improving selected task scores. The authors then separate the one-time search and evaluation burden from per-query inference savings and calculate time to break even.\n\nThis evidence extends Kaal's claim in a narrower and testable form. A benchmark that reports accuracy and inference cost after workflow selection measures the performance of an arrangement. It does not disclose what it cost to discover, validate, and maintain that arrangement. Scale cannot be inferred from per-query cost alone. The design cost must be amortized over actual use, and a topology change must be charged for the validation required to preserve acceptable behavior.\n\nThe limits are material. AgentSlimming studies cloud-model workflow graphs, public reasoning benchmarks, and task-level optimization. It does not examine sovereign local runtimes, latency, institutional coordination, security review, or legal arrangements. It also finds cost reductions for a compression method, not a universal constraint on scaling. Sovereign runtime benchmarks should therefore report design and search effort, validation cost, recurring inference cost, break-even volume, topology changes, and performance loss as separate quantities. The cost of arranging the system belongs in the scaling result.",
 "author": {
  "@type": "Person",
  "name": "Wulf A. Kaal",
  "identifier": "https://orcid.org/0009-0008-7840-1847"
 },
 "datePublished": "2026-08-26",
 "dateModified": "2026-08-26",
 "creativeWorkStatus": "Affirmed",
 "responseType": "extension",
 "keywords": [
  "economics",
  "research-methods",
  "ai-and-agents",
  "benchmarking",
  "coordination-costs",
  "workflow-optimization",
  "systems-integration",
  "performance-measurement"
 ],
 "scope_conditions": [
  "The response is limited to the exact full-text propositions and the one mapped Kaal claim.",
  "External evidence level: peer-reviewed conference paper with complete official proceedings full text.",
  "Mapping review tier: independent substantive scholarly-growth extension.",
  "The source studies cloud-model workflow graphs rather than sovereign local agent runtimes or organizational arrangements.",
  "Its experiments use public reasoning benchmarks and task-level optimization, not production runtime governance.",
  "The source measures optimization search cost and recurring API expense, not latency, security review, maintenance, or legal arrangement cost.",
  "The evidence establishes a useful amortization method for the tested workflows. It does not prove that coordination cost is universally the binding constraint on scale.",
  "Break-even volume depends on model prices, workflow use, benchmark choice, and acceptable performance loss."
 ],
 "currentDebate": {
  "name": "AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems",
  "url": "https://aclanthology.org/2026.acl-long.1387/"
 },
 "extends": {
  "identifier": "kaal:claim:7314479-012",
  "url": "https://wulfkaal.github.io/claims/7314479-012",
  "citation": "Wulf A. Kaal, Institutional Requirements for Sovereign Local Agent Runtimes (2026). SSRN: https://ssrn.com/abstract=7314479",
  "paper": "Wulf A. Kaal, Institutional Requirements for Sovereign Local Agent Runtimes",
  "authors": [
   "Wulf A. Kaal"
  ],
  "year": "2026",
  "ssrn": "https://ssrn.com/abstract=7314479",
  "source_pdf_sha256": "debace24a155ae924a155b1fafe98856d98cf83689feff2f87a32f1c06171ce6"
 },
 "isBasedOn": [
  {
   "@id": "https://wulfkaal.github.io/claims/7314479-012"
  },
  {
   "@type": "CreativeWork",
   "name": "AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems",
   "url": "https://aclanthology.org/2026.acl-long.1387/"
  }
 ],
 "batch_id": "kaal-review:2026-08-26:scholarly-growth-7314479-012-reviewed-v1",
 "review_provenance": "https://wulfkaal.github.io/positions/by-claim/7314479-012.html",
 "publicationStatus": "public",
 "recordTypeNote": "Dated commentary position extending a scholarly corpus claim. Not a verbatim claim extracted from the paper.",
 "isPartOf": {
  "@id": "https://wulfkaal.github.io/positions/index.json"
 },
 "version": "1.0",
 "canonical_url": "https://wulfkaal.github.io/positions/2026-08-26-012",
 "canonicalForm": "https://wulfkaal.github.io/positions/2026-08-26-012.md",
 "candidateId": "kaal:response-candidate:2026-08-26:scholarly-growth-7314479-012-workflow-arrangement-amortization-01",
 "evidenceLevel": "peer-reviewed conference paper with complete official proceedings full text",
 "reviewTier": "independent substantive scholarly-growth extension",
 "mappingConfidence": 0.97,
 "mappingAmbiguous": false,
 "mappingMethod": "independent substantive scholarly-growth one-to-one review",
 "mappingWhyRelevant": "The paper independently supports the measurement distinction in the Kaal claim. It treats workflow search as a one-time arrangement cost, recurring inference as a separate cost, and break-even volume as the bridge between them. A benchmark that reports only post-selection performance and per-query expense omits the cost of finding and validating the arrangement. The mapping remains bounded because the source studies cloud-model workflow graphs, not sovereign local runtimes or institutional coordination.",
 "sourceProvenance": {
  "source": "ACL 2026 peer-reviewed proceedings paper with complete official full text",
  "sourceRecordId": "doi:10.18653/v1/2026.acl-long.1387",
  "doi": "10.18653/v1/2026.acl-long.1387",
  "canonicalUrl": "https://aclanthology.org/2026.acl-long.1387/",
  "publicFullTextUrl": "https://aclanthology.org/2026.acl-long.1387.pdf",
  "retrievedAt": "2026-08-27T07:18:23.075Z",
  "fullTextPdfSha256": "b3acc39c06f1ac19716535ee71dfdbcc93e7a096fe097f75f0c8515cf0b05790",
  "extractedTextSha256": "c2f77bfe7c19091cf05fa8f1fc6ea7530a29935a442fd5ac6e39fa5a7a6ac9b3",
  "officialProceedingsRecordSha256": "dce33c2b77032854cde71ff1bdf29da70b904f5181b8369e8e37ce7eb7a81676",
  "primaryEvidenceReceiptSha256": "e2d500cc9fb2c529ee0356058c32b9c3f2a0db63192c2ef896c7c9bcd1199b24",
  "sourceProposition": "Chen and her coauthors separate the one-time cost of optimizing a graph-structured multi-agent workflow from recurring inference savings and calculate the execution volume required to amortize that arrangement cost.",
  "sourcePropositionSha256": "2fed213f9541519d7aac1b153644e24b0dd1983814ba20ab0ea2575233ee5948",
  "sourceEvidenceSetSha256": "70489857511f5b4cc91fcc5182c18c51738b2963495814ae2b617fb400da3c12",
  "sourceEvidencePassages": [
   {
    "text": "However, manually designing optimal communication topologies is labor-intensive, while automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption.",
    "locator": {
     "publication": "ACL 2026",
     "page": 30064,
     "section": "Abstract"
    },
    "sha256": "0d7b4708165bb1187f132eb677908387d7dfad8353251bbb70c0d91b1d28ce50"
   },
   {
    "text": "As the number of agents and interaction turns grows, a quadratic increase in token consumption renders these systems difficult to scale.",
    "locator": {
     "publication": "ACL 2026",
     "page": 30065,
     "section": "1 Introduction"
    },
    "sha256": "fc8bfe87332c626993c8f742e4a9dea79f3cfd398f68de7ee1e45d4bdf6eebc3"
   },
   {
    "text": "Therefore, as the optimized workflow is executed repeatedly, the upfront search cost is gradually amortized over time.",
    "locator": {
     "publication": "ACL 2026",
     "page": 30079,
     "section": "E Cost Analysis"
    },
    "sha256": "19c9fa495384bbb164a0d8ec62389246899cdee69ce63481bdd4488eede73cbf"
   }
  ],
  "workId": "work:doi:10.18653/v1/2026.acl-long.1387",
  "workAuthors": [
   "Yulang Chen",
   "Haoxuan Peng",
   "Jinyan Liu",
   "Zichen Wen",
   "Dongrui Liu",
   "Linfeng Zhang"
  ],
  "workPublishedAt": "2026",
  "identityKeys": [
   "doi:10.18653/v1/2026.acl-long.1387",
   "pdf:b3acc39c06f1ac19716535ee71dfdbcc93e7a096fe097f75f0c8515cf0b05790",
   "proposition:2fed213f9541519d7aac1b153644e24b0dd1983814ba20ab0ea2575233ee5948"
  ],
  "claimMappings": [
   {
    "claimId": "kaal:claim:7314479-012",
    "claimUrl": "https://wulfkaal.github.io/claims/7314479-012",
    "rank": 1,
    "confidence": 0.97,
    "method": "independent substantive scholarly-growth one-to-one review",
    "whyRelevant": "The paper independently supports the measurement distinction in the Kaal claim. It treats workflow search as a one-time arrangement cost, recurring inference as a separate cost, and break-even volume as the bridge between them. A benchmark that reports only post-selection performance and per-query expense omits the cost of finding and validating the arrangement. The mapping remains bounded because the source studies cloud-model workflow graphs, not sovereign local runtimes or institutional coordination.",
    "ambiguous": false
   }
  ],
  "substantiveReview": {
   "reviewedAt": "2026-08-27T07:18:23.075Z",
   "sourceIdentityVerified": true,
   "authorIndependenceVerified": true,
   "kaalReferenceFoundInSource": false,
   "temporalIndependence": "The ACL paper and Kaal paper are independent 2026 works with no Kaal reference in the reviewed source.",
   "canonicalPublicStatusVerified": true,
   "peerReviewedStatusVerified": true,
   "retractionOrSupersessionFound": false,
   "propositionFidelityVerified": true,
   "mechanismCorrespondence": "one-time workflow search and validation cost is separated from recurring inference expense and amortized over subsequent executions",
   "compatibleScope": "graph-structured cloud-model workflows, limited because the source does not study sovereign local runtimes or institutional coordination costs",
   "responseWordingDefensible": true,
   "oneToOneExtendsMapping": true,
   "exactSupportingQuotesVerified": true,
   "nonOverlap": {
    "candidateIdMatches": false,
    "canonicalUrlMatches": false,
    "propositionHashMatches": false,
    "priorPositionForClaim": false
   },
   "limitations": [
    "The source studies cloud-model workflow graphs rather than sovereign local agent runtimes or organizational arrangements.",
    "Its experiments use public reasoning benchmarks and task-level optimization, not production runtime governance.",
    "The source measures optimization search cost and recurring API expense, not latency, security review, maintenance, or legal arrangement cost.",
    "The evidence establishes a useful amortization method for the tested workflows. It does not prove that coordination cost is universally the binding constraint on scale.",
    "Break-even volume depends on model prices, workflow use, benchmark choice, and acceptable performance loss."
   ],
   "rejectionReasonsRecorded": true
  },
  "contentMap": {
   "proposition": "Workflow arrangement cost must be separated from recurring inference cost and amortized over actual use.",
   "evidenceLayer": "peer-reviewed conference paper with complete official proceedings full text",
   "strongestLimitation": "The study covers cloud-model workflow graphs and does not measure sovereign runtime, institutional, or legal arrangement cost.",
   "consequence": "Post-selection accuracy and per-query cost do not by themselves establish scalable operation.",
   "requestedAction": "Report design and search effort, validation cost, recurring inference cost, break-even volume, topology changes, and performance loss as separate quantities."
  },
  "stylePack": {
   "profile": "M1 early sole-author baseline v1.2.0",
   "verifiedProfileWorks": [
    "1428387",
    "1998455",
    "2150377",
    "2267560"
   ],
   "sameRegisterPassagePackAvailable": true,
   "limitation": "The short public position permits only bounded stylometric comparison."
  },
  "m1Validation": {
   "status": "M1-PASS-WITH-LIMITS",
   "deterministicGate": "pass",
   "hardFailures": 0,
   "warnings": 0,
   "words": 242,
   "reason": "The publication-bound position passed strict and public deterministic controls against a task-local multi-work style pack. Its short length limits stylometric comparison."
  }
 },
 "userAffirmation": "Authorized under public authority SHA-256 87aad20196a753015a36d970f742c885eb763efdbada4869949bfffe3298130c and event supersession SHA-256 7d47ef36085c4dce590f287c986e4106f3bf35a7da5a25322d6fc3d4abf456d4. Publication remains receipt-bound to successful workflows and exact live-byte verification.",
 "sha256": "d95a8ae378d6d44ff2a937f9ecd54116a1206c678e58ef35be92eadaafeb48bf"
}