{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "A workflow needs specialist review, but extra agents may add more cost than useful work.",
    "change": "Test the proposed division of work against a single-agent implementation.",
    "baseline": "One agent with the same tools and an equal total token and time budget.",
    "steps": [
      "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.",
      "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.",
      "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.",
      "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test."
    ],
    "measure": "Accepted outputs, coordination failures, wall-clock time, and total cost across all agents.",
    "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation."
  },
  "builder_review": null,
  "arxiv_id": "2609.15054",
  "title": "BusMA: A Bus Communication Substrate for Multi-Agent Systems",
  "summary": "BusMA replaces hierarchical manager-worker and router-based message-passing topologies with a shared communication bus where any worker can address peers directly using typed intents (discussion, challenge, guidance, request for explanation), coordinated by a Chair agent over shared memory. It costs additional orchestration complexity (registration, routing, shared memory management) and higher token consumption, since more agents exchange more messages per task. It can fail through bus congestion or noisy cross-agent traffic, a Chair agent that becomes a coordination bottleneck or single point of failure, and error amplification if misleading messages are broadcast to all peers rather than contained.",
  "rationale": "The framework is implementable with API-based LLMs and modest engineering effort, but the unquantified 'consistent' improvement and added per-task token cost require validation on the reader's specific workloads before production adoption.",
  "technique": "Shared-bus communication for multi-agent systems",
  "family": "orquestracao_multiagente",
  "recommendation": "testar",
  "published": "2026-09-14",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2609.15054",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "BusMA replaces hierarchical manager-worker and router-based message-passing topologies with a shared communication bus where any worker can address peers directly using typed intents (discussion, challenge, guidance, request for explanation), coordinated by a Chair agent over shared memory. It costs additional orchestration complexity (registration, routing, shared memory management) and higher token consumption, since more agents exchange more messages per task. It can fail through bus congestion or noisy cross-agent traffic, a Chair agent that becomes a coordination bottleneck or single point of failure, and error amplification if misleading messages are broadcast to all peers rather than contained.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.15054",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Abstract states BusMA 'consistently outperforms state-of-the-art HMW and RMP methods' across 13 tasks on two frontier LLMs, but no specific quantitative margin is given in the abstract.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.15054",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "exposure_map": [
    {
      "dimension": "quality",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compute",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "latency",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "operations",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compatibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "security",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "data_and_training",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "reproducibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "risks": [],
  "minimum_test": [],
  "open_questions": [],
  "independent_tests": [],
  "lab_reproductions": [],
  "report_available": false,
  "validation_tier": "unknown",
  "evidence_tier": "unknown",
  "infrastructure_basis": "unknown",
  "equations": [],
  "equations_status": "not_formula",
  "core_kind": "system",
  "equations_fetched_at": "2026-10-04",
  "equations_source_url": "",
  "equations_source_sha256": "",
  "exposures_reviewed_at": "",
  "exposures_source_sha256": ""
}