Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU

Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU | Signal Canvas | ScienceToStartup

Page Freshness

Signal Canvas proof surface

Canonical route: /signal-canvas/adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu

stale

Proof freshness: stale
Proof status: unverified
Display score: 7/10
Last proof check: 2026-04-28
Score updated: 2026-04-28
Score fresh until: 2026-05-28
References: 0
Source count: 3
Coverage: 50%

This page is showing the last landed evidence receipt and score bundle because the latest proof data is outside the freshness window.

Agent Handoff

Canonical ID adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu | Route /signal-canvas/adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu

REST example

curl https://sciencetostartup.com/api/v1/agent-handoff/signal-canvas/adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu

MCP example

{
  "tool": "search_signal_canvas",
  "arguments": {
    "mode": "paper",
    "paper_ref": "adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu",
    "query_text": "Summarize Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU"
  }
}

source_context

{
  "surface": "signal_canvas",
  "mode": "paper",
  "query": "Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU",
  "normalized_query": "2604.24219",
  "route": "/signal-canvas/adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu",
  "paper_ref": "adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu",
  "topic_slug": null,
  "benchmark_ref": null,
  "dataset_ref": null
}

Evidence Receipt

Route status: building

Claims: 1

References: Pending verification

Proof: Verification pending

Freshness state: computing

Source paper: Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU

PDF: https://arxiv.org/pdf/2604.24219v1

Source count: 3

Coverage: 50%

Last proof check: 2026-04-28T15:18:04.874Z

Signal Canvas receipt window

Watch and verify: Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU

/buildability/adaptive-tor-complexity-aware-tree-based-retrieval-for-pareto-optimal-multi-intent-nlu

Watchwatch

Subject: Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU

Verdict

Watch

Verdict is Watch because viability or proof quality is intermediate and should be re-evaluated before execution.

Adaptive ToR: Complexity-Aware Tree-Based Retrieval for Pareto-Optimal Multi-Intent NLU

Use Signal Canvas as the narrative proof surface

Use this Signal Canvas via API or MCP

Signal Canvas proof surface