arXiv (All)
open access
The Concrete-Arbitrary Gap: Kinship Reasoning in LLMs Is Not Indifferent to Presentation
We test whether large language models solve formally matched kinship problems equally well when relations are expressed in familiar vocabulary or by explicitly defined nonce predicates. Across 500 paired graphs, concrete accuracy exceeds arbitrary accuracy by 35.6 percentage points in local Qwen3.8-
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- IntroConformal: Conformal Factuality Guarantees for Large Vision-Language Models via Introspective Signals#821315
- Kinship Data Benchmark for Multi-hop Reasoning#798724
- Kinship Data Benchmark for Multi-hop Reasoning#797310
- The First ChineseBabyLM Challenge: training data-efficient and cognitively plausible language models for Chinese#620371
- The First ChineseBabyLM Challenge: training data-efficient and cognitively plausible language models for Chinese#618692
Record · ID 1145080
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive