{
 "@context": "https://schema.org",
 "@type": "DefinedTerm",
 "@id": "https://wulfkaal.github.io/entities/agent-tuple",
 "identifier": "kaal:entity:agent-tuple",
 "name": "Agent tuple",
 "termCode": "agent-tuple",
 "inDefinedTermSet": {
  "@id": "https://wulfkaal.github.io/entities/index.json"
 },
 "author": {
  "@type": "Person",
  "name": "Wulf A. Kaal",
  "identifier": "https://orcid.org/0000-0003-0757-275X"
 },
 "dateModified": "2026-07-29",
 "canonicalForm": "https://wulfkaal.github.io/entities/agent-tuple.md",
 "sha256": "20f6ea8e718eeb6e14fa42bdad66cbd61410158448e87ba75044995d69e23762",
 "additionalProperty": [
  {
   "@type": "PropertyValue",
   "name": "status",
   "value": "derived"
  },
  {
   "@type": "PropertyValue",
   "name": "claim_count",
   "value": 2
  },
  {
   "@type": "PropertyValue",
   "name": "work_count",
   "value": 1
  },
  {
   "@type": "PropertyValue",
   "name": "year_span",
   "value": [
    "2026",
    "2026"
   ]
  },
  {
   "@type": "PropertyValue",
   "name": "non_current_claims",
   "value": 0
  }
 ],
 "subjectOf": [
  {
   "@type": "Claim",
   "@id": "https://wulfkaal.github.io/claims/6655138-033",
   "identifier": "kaal:claim:6655138-033",
   "text": "In any architecture instantiating Computative Economics the number of distinct possibility loops must be at least the number of distinguishable generative and reflective components of the agent tuple that produce protocol-recognized output, with the reflection operator counted as two components.",
   "abstract": "In any agent coordination architecture instantiating Computative Economics, the number of distinct possibility loops must be at least equal to the number of distinguishable generative and reflective components of the agent tuple that produce protocol-recognized output",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138",
   "datePublished": "2026",
   "claim_type": "condition",
   "confidence": "argued",
   "is_failure_mode": false,
   "scope_conditions": [
    "architectures instantiating Computative Economics"
   ],
   "source_pdf_sha256": "52cb210167f06f0c7a2581214b156326216543de80b8394320b629c045c9e214",
   "status": "current"
  },
  {
   "@type": "Claim",
   "@id": "https://wulfkaal.github.io/claims/6655138-040",
   "identifier": "kaal:claim:6655138-040",
   "text": "The six-surface architecture is complete for the computative agent tuple up to renaming: any architecture satisfying the conditions of Computative Economics reduces to a six-surface architecture by surface aggregation, and further refinement adds expressive power only by subdividing one of the six components.",
   "abstract": "The completeness claim is that any architecture satisfying the conditions of Computative Economics can be reduced to a six-surface architecture by surface aggregation, and any further refinement adds expressive power only by subdividing one of the six components.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138",
   "datePublished": "2026",
   "claim_type": "design",
   "confidence": "argued",
   "is_failure_mode": false,
   "scope_conditions": [
    "architectures satisfying the conditions of Computative Economics"
   ],
   "source_pdf_sha256": "52cb210167f06f0c7a2581214b156326216543de80b8394320b629c045c9e214",
   "status": "current"
  }
 ],
 "description": "2 claims in the published works of Wulf A. Kaal carry the concept tag 'agent-tuple'. Derived node: a roster, not an adjudicated definition."
}