{"record": {"aliases": [], "artifacts": [{"id": "arxiv:2607.24471", "kind": "paper", "url": "https://arxiv.org/abs/2607.24471"}], "authors": ["Xiangbo Zhang", "Xiaoxu Ma"], "authors_reference": {"basis": "arxiv_metadata", "retrieved_at": "2026-11-03", "source_key": "claire-radar:2607.24471", "source_url": "https://arxiv.org/abs/2607.24471"}, "categories": ["General AI", "Reasoning", "Robustness", "Safety & Trustworthiness"], "description": {"en": "ROUTEBENCH evaluates whether transformers can learn latent algorithm routing across four solver families (ridge, lasso, Huber, kNN) in a controlled diagnostic setting."}, "documents": [{"document_type": "registry_page", "id": "claire_radar:https://arxiv.org/abs/2607.24471", "source": "claire_radar", "source_url": "https://arxiv.org/abs/2607.24471", "title": "ROUTEBENCH"}], "evidence_summary": {"document_count": 1, "model_count": null, "model_count_basis": null}, "institutions": ["Georgia Institute of Technology"], "institutions_reference": {"basis": "openalex_linked_institutions", "doi": "10.48550/arxiv.2607.24471", "retrieved_at": "2026-11-04", "source_key": "claire-radar:2607.24471", "source_url": "https://openalex.org/W7171511194"}, "key": "claire-radar:2607.24471", "modality": null, "name": "ROUTEBENCH", "openness": {"code_license": null, "data_license": null, "evidence": [], "status": "unknown"}, "provenance": {"confidence": "Medium", "crawl_bundle": "claire_radar_2026-10-14", "crawled_at": "2026-10-14T09:44:51Z", "data_status": "primary-source-indexed", "display_eligible": "unknown", "origin_record_id": "bm_routebench_6fe659bf", "origin_source": "arxiv", "recognition_confidence": "0.85", "record_sha256": "5bae1ecb2a99a7608f9d0b33aab3f882b32747479eca7b7068f7e9f81b6c4326", "relation": "introduces", "review_state": "unreviewed", "source_url": "https://arxiv.org/abs/2607.24471"}, "publisher": null, "released": "2026-07-27", "released_reference": {"basis": "benchmark_release", "source_key": "claire-radar:2607.24471", "source_url": "https://arxiv.org/abs/2607.24471"}, "schema_version": 1, "sizes": [], "slug": "claire-radar-2607-24471", "source": "claire_radar", "source_benchmark_id": "2607.24471", "source_metadata": {"claire_radar": {"adoption30d": null, "aliases": [], "annotation": "Unknown", "applicationDomains": ["General AI"], "area": "Safety & Trustworthiness", "attention": {"asOf": "2026-10-05", "attemptedAt": "2026-10-04T15:31:48.030916Z", "githubRepo": null, "githubScope": null, "githubStars": null, "hfDailySubmittedAt": null, "hfDataset": null, "hfDatasetDownloads": null, "hfDatasetLikes": null, "hfPaperUpvotes": null, "hfPaperUrl": "https://huggingface.co/papers/2607.24471", "observedAt": "2026-10-04T03:02:42.754940Z", "signalStatus": {"githubStars": {"state": "not_applicable"}, "hfDatasetDownloads": {"state": "not_applicable"}, "hfDatasetLikes": {"state": "not_applicable"}, "hfPaperUpvotes": {"checkedAt": "2026-10-04T15:31:48.030916Z", "state": "unavailable"}}, "status": "unavailable"}, "capabilities": ["Reasoning", "Robustness"], "confidence": "Medium", "construction": "Unknown", "constructionDetail": "Unknown — the indexer does not infer construction details without explicit source evidence.", "copyGeneration": {"generatedAt": "2026-08-20T15:22:10.044731Z", "inputHash": "f67a2cb06183b1d8085e2266d7c81b1f360e6a534ec56ce0b6f83ad1302ea8f2", "model": "deepseek-v4-flash"}, "dataStatus": "primary-source-indexed", "demo": false, "description": "ROUTEBENCH evaluates whether transformers can learn latent algorithm routing across four solver families (ridge, lasso, Huber, kNN) in a controlled diagnostic setting.", "domainCuration": {"method": "rules-v1", "state": "auto"}, "evidence": {"reasonCodes": ["exact named benchmark artifact released in abstract", "benchmark release stated in one sentence"], "snippet": "We introduce ROUTEBENCH, a diagnostic benchmark whose regimes differentially favor global shrinkage, sparsity, robustness, and locality, operationalized by ridge-like, lasso-like, Huber-like, and kNN-like family representatives."}, "familyId": "bmf_16ecd82fb9ee", "firstSeenAt": "2026-08-19", "githubIndex": {"candidateCount": 0, "indexedAt": "2026-09-17T04:40:34.111665+00:00", "repositories": [], "status": "not-found"}, "heat": null, "id": "bm_routebench_6fe659bf", "indexedAt": "2026-08-19T11:05:13.395391Z", "industrySectors": [], "links": {"code": null, "data": null, "hfPaper": "https://huggingface.co/papers/2607.24471", "paper": "https://arxiv.org/abs/2607.24471", "pdf": "https://arxiv.org/pdf/2607.24471", "project": null, "report": "https://arxiv.org/abs/2607.24471"}, "metrics": [], "motivation": "A central question in the in-context learning literature is whether transformers can organize episode-level adaptation around different inductive-bias families.", "name": "ROUTEBENCH", "oneLine": "ROUTEBENCH evaluates whether transformers can learn latent algorithm routing across four solver families (ridge, lasso, Huber, kNN) in a controlled diagnostic setting.", "paperTitle": "Grounding latent algorithm routing in transformer reasoning", "primaryDomain": "General AI", "publication": {"evidence": "Accepted by COLM 2026", "evidenceLevel": "author-claim", "evidenceUrl": "https://arxiv.org/abs/2607.24471", "source": "arxiv-comments", "status": "acceptance_claimed", "venue": "COLM 2026", "verifiedAt": "2026-10-14T01:46:58.058199Z"}, "publications": [], "ranking": {"90d": {"confidence": "Low", "coverage": 0.0, "growth": {"components": {"githubStars": {"normalization": "percentile", "normalized": null, "percentile": null, "value": null}, "hfDatasetDownloads": {"normalization": "percentile", "normalized": null, "percentile": null, "value": null}, "hfPaperUpvotes": {"normalization": "percentile", "normalized": null, "percentile": null, "value": null}}, "confidence": "Low", "coverage": 0.0, "elapsedDays": null, "historyDate": null, "rank": null, "score": null, "windowDays": 90}, "level": {"components": {"githubStars": {"normalization": "log-max", "normalized": null, "value": null}, "hfDatasetDownloads": {"normalization": "log-max", "normalized": null, "value": null}, "hfPaperUpvotes": {"normalization": "log-max", "normalized": null, "value": null}}, "confidence": "Low", "coverage": 0.0, "rank": null, "score": null}, "method": "attention-ranking-v13", "rank": null, "score": null}}, "readiness": "Paper only", "recognitionConfidence": 0.85, "relation": "introduces", "releasedAt": "2026-07-27", "source": {"authors": ["Xiangbo Zhang", "Xiaoxu Ma"], "categories": ["cs.CL"], "id": "2607.24471", "title": "Grounding latent algorithm routing in transformer reasoning", "type": "arxiv", "url": "https://arxiv.org/abs/2607.24471"}, "sourceUpdatedAt": "2026-07-27T14:07:12Z", "topics": ["Reasoning"], "venueAttempts": [{"decisionRaw": "Accepted by COLM 2026", "evidence": [{"level": "author-claim", "observedAt": "2026-10-14T01:46:58.058199Z", "rawValue": "Accepted by COLM 2026", "sourceType": "arxiv-comments", "sourceUrl": "https://arxiv.org/abs/2607.24471"}], "reviewStatus": "accepted", "venueName": "COLM 2026"}], "whyItMatters": "Provides controlled evidence on internal routing in transformers, but lacks a standalone public comparison path and is primarily a research probe."}}}, "schema_version": 1, "scores_by_source": {}, "siblings": []}
