{
 "@context": "https://schema.org",
 "@type": "DefinedTerm",
 "@id": "https://wulfkaal.github.io/entities/selection",
 "identifier": "kaal:entity:selection",
 "name": "Selection",
 "termCode": "selection",
 "inDefinedTermSet": {
  "@id": "https://wulfkaal.github.io/entities/index.json"
 },
 "author": {
  "@type": "Person",
  "name": "Wulf A. Kaal",
  "identifier": "https://orcid.org/0009-0008-7840-1847"
 },
 "canonicalForm": "https://wulfkaal.github.io/entities/selection.md",
 "sha256": "29abe81ca3fc17722e96d92548b1f6e5ee6e226e98ea74a46e5d1561893fe8cc",
 "additionalProperty": [
  {
   "@type": "PropertyValue",
   "name": "status",
   "value": "derived"
  },
  {
   "@type": "PropertyValue",
   "name": "claim_count",
   "value": 3
  },
  {
   "@type": "PropertyValue",
   "name": "work_count",
   "value": 2
  },
  {
   "@type": "PropertyValue",
   "name": "year_span",
   "value": [
    "2018",
    "2026"
   ]
  },
  {
   "@type": "PropertyValue",
   "name": "non_current_claims",
   "value": 0
  }
 ],
 "subjectOf": [
  {
   "@type": "Claim",
   "@id": "https://wulfkaal.github.io/claims/3128900-027",
   "identifier": "kaal:claim:3128900-027",
   "text": "Because requesters select workers by reputation score, workers acquire an incentive to keep their scores high by performing tasks with high accuracy and efficiency.",
   "abstract": "Requesters can select workers based on their reputation score, giving workers an incentive to keep the reputation scores high by performing micro tasks with high accuracy and efficiency.",
   "citation": "Wulf A. Kaal, Decentralized Mechanical Turk Through Verified Reputation (2018). SSRN: https://ssrn.com/abstract=3128900",
   "datePublished": "2018",
   "claim_type": "mechanism",
   "confidence": "argued",
   "is_failure_mode": false,
   "scope_conditions": [
    "requesters can observe and select on reputation score"
   ],
   "source_pdf_sha256": "381d72e85d976e2af852e8ec3bba87bc6a05ccb3349a2c3dd6f9e64de96ab4b0",
   "status": "current"
  },
  {
   "@type": "Claim",
   "@id": "https://wulfkaal.github.io/claims/7598518-015",
   "identifier": "kaal:claim:7598518-015",
   "text": "Feng et al. (2025) show that verifier-selected synthetic data can prevent collapse, and the paper concedes the core of that result: verifier selection is an established remedy, and the oracle ceiling and the Gaussian setting are established.",
   "abstract": "Intelligence models increasingly learn from data that earlier Intelligence models produced, and when that loop repeats the rare cases disappear first. This paper preregisters a test of whether a reputation-weighted validator pool, filtering the training data of a recursive replacement loop, keeps those rare cases alive. The outcomes remain sealed until a replication of the original model-collapse result succeeds.",
   "citation": "Wulf A. Kaal, Can Reputation Prevent Model Collapse? A Preregistered Test of Reputation-Weighted Data Filtering (2026). SSRN: https://ssrn.com/abstract=7598518",
   "datePublished": "2026",
   "claim_type": "condition",
   "confidence": "reported",
   "is_failure_mode": false,
   "scope_conditions": [
    "The result is prior work, not a finding of this study.",
    "What this paper isolates is how to weight several assessors behind a validity filter, not whether verifier selection works."
   ],
   "source_pdf_sha256": "cd22d148b2b55c2e27f087dcaa61cdf44ad7022b400b355c31a9cd7e43a31749",
   "status": "current"
  },
  {
   "@type": "Claim",
   "@id": "https://wulfkaal.github.io/claims/7598518-019",
   "identifier": "kaal:claim:7598518-019",
   "text": "Filters that select on surprise or entropy, not validity, work where they work because they see what a validity filter is forbidden to see, and against that literature a null here is a literature rather than a caveat.",
   "abstract": "Intelligence models increasingly learn from data that earlier Intelligence models produced, and when that loop repeats the rare cases disappear first. This paper preregisters a test of whether a reputation-weighted validator pool, filtering the training data of a recursive replacement loop, keeps those rare cases alive. The outcomes remain sealed until a replication of the original model-collapse result succeeds.",
   "citation": "Wulf A. Kaal, Can Reputation Prevent Model Collapse? A Preregistered Test of Reputation-Weighted Data Filtering (2026). SSRN: https://ssrn.com/abstract=7598518",
   "datePublished": "2026",
   "claim_type": "mechanism",
   "confidence": "argued",
   "is_failure_mode": false,
   "scope_conditions": [
    "The comparison rests on published surprise-filter and entropy-filter results.",
    "The paper runs no surprise or entropy arm, so it supplies no measured comparison with them."
   ],
   "source_pdf_sha256": "cd22d148b2b55c2e27f087dcaa61cdf44ad7022b400b355c31a9cd7e43a31749",
   "status": "current"
  }
 ],
 "description": "3 claims in the published works of Wulf A. Kaal carry the concept tag 'selection'. Derived node: a roster, not an adjudicated definition."
}