{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "recursive-ai-fixed-budget-value-hash-recipes-2026",
    "title": "Recursive: agent-produced layer-decorrelated n-gram value-path training recipes",
    "summary": "Adapted gated bigram/trigram lookup features into multiple attention-value layers with decorrelated layer-specific hashes, combining them with training and architecture choices for fixed-budget small-language-model training. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.",
    "boundary": "Ten-seed five-minute single-B200 tests, not a large-model scaling guarantee or proof of independent rediscovery. Hash embeddings, Muon and baseline nanochat components are inherited. Search initially used H100; hardware transfer and repeated benchmark feedback constrain comparisons. No training or no-leakage audit was replayed.",
    "area": "AI-assisted fixed-budget language-model design",
    "topic": "Computing & AI",
    "year": 2026,
    "lane": "AI",
    "result": "ALGORITHM",
    "package_id": "recursive-ai-fixed-budget-value-hash-recipes-2026",
    "target": {
      "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
      "version": 1,
      "content_hash": "sha256:3e10548c9cb992382690c918607ac0c04f10fbc5091e397fa8888069c12d6eb7"
    },
    "humans": [],
    "authors_complete": false,
    "human_role_note": "Recursive",
    "agents": [
      {
        "provider": "Recursive",
        "product": "Automated AI research system",
        "model": "UNKNOWN",
        "role": "Source-reported experimental proposal, implementation generation and evaluator-guided refinement; the exact underlying model identifier is unknown",
        "assurance": "SOURCE_REPORTED",
        "source": "cur20261017-recursive-first-steps-account"
      }
    ],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261017-recursive-nanochat-original",
        "title": "Recursive original nanochat_autoresearch artifact documentation",
        "url": "https://raw.githubusercontent.com/recursive-org/first-steps-toward-automated-ai-research/a962ec43e2e3d7c018e59a2ece623fe6e232fdfb/nanochat_autoresearch/README.md",
        "date": "2026-06-11",
        "kind": "PRIMARY_RESEARCH_SOFTWARE",
        "access": "WEB_READ",
        "checked_on": "2026-10-17"
      },
      {
        "id": "cur20261017-recursive-first-steps-account",
        "title": "First Steps Toward Automated AI Research",
        "url": "https://www.recursive.com/articles/first-steps-toward-automated-ai-research",
        "date": "2026-06-11",
        "kind": "PRIMARY_RESEARCH_ACCOUNT",
        "access": "WEB_READ",
        "checked_on": "2026-10-17"
      }
    ],
    "geography": null,
    "points": null,
    "published_grade": null,
    "assessment_disposition": {
      "status": "CLAIM_UNVERIFIED",
      "label": "Reported result · unverified",
      "reason": "Provisional grade and reference score included in rankings; scientific correctness has not been independently established.",
      "target": {
        "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
        "version": 1,
        "content_hash": "sha256:3e10548c9cb992382690c918607ac0c04f10fbc5091e397fa8888069c12d6eb7"
      },
      "edition": "ratings-e039106f30dec177"
    },
    "conditional_rating": {
      "id": "recursive-ai-fixed-budget-value-hash-recipes-2026",
      "target": {
        "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
        "version": 1,
        "content_hash": "sha256:3e10548c9cb992382690c918607ac0c04f10fbc5091e397fa8888069c12d6eb7"
      },
      "band": "C",
      "modifier": "+",
      "points": "5500",
      "range": {
        "lower": "2200",
        "upper": "14000"
      },
      "status": "CONDITIONAL_IF_VERIFIED",
      "counts_as_achieved": false,
      "scientific_correctness_certified": false,
      "scope": "Ten-seed five-minute single-B200 tests, not a large-model scaling guarantee or proof of independent rediscovery. Hash embeddings, Muon and baseline nanochat components are inherited. Search initially used H100; hardware transfer and repeated benchmark feedback constrain comparisons. No training or no-leakage audit was replayed."
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-22T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "organization",
          "name": "Recursive",
          "note": "Cited historical collaboration, not a platform organization account; individual attribution remains incomplete.",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "First Steps Toward Automated AI Research",
            "url": "https://www.recursive.com/articles/first-steps-toward-automated-ai-research"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Recursive original nanochat_autoresearch artifact documentation",
            "url": "https://raw.githubusercontent.com/recursive-org/first-steps-toward-automated-ai-research/a962ec43e2e3d7c018e59a2ece623fe6e232fdfb/nanochat_autoresearch/README.md"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "First Steps Toward Automated AI Research",
            "url": "https://www.recursive.com/articles/first-steps-toward-automated-ai-research"
          }
        }
      ],
      "origin": "AGENT_NATIVE",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Ten-seed five-minute single-B200 tests, not a large-model scaling guarantee or proof of independent rediscovery. Hash embeddings, Muon and baseline nanochat components are inherited. Search initially used H100; hardware transfer and repeated benchmark feedback constrain comparisons. No training or no-leakage audit was replayed.",
        "domain": "AI-assisted fixed-budget language-model design"
      },
      "sources": [
        {
          "citation": "Recursive original nanochat_autoresearch artifact documentation",
          "url": "https://raw.githubusercontent.com/recursive-org/first-steps-toward-automated-ai-research/a962ec43e2e3d7c018e59a2ece623fe6e232fdfb/nanochat_autoresearch/README.md"
        },
        {
          "citation": "First Steps Toward Automated AI Research",
          "url": "https://www.recursive.com/articles/first-steps-toward-automated-ai-research"
        }
      ],
      "statement": "# Recursive: agent-produced layer-decorrelated n-gram value-path training recipes\n\nAdapted gated bigram/trigram lookup features into multiple attention-value layers with decorrelated layer-specific hashes, combining them with training and architecture choices for fixed-budget small-language-model training. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.\n\n## Scientific scope\n\nTen-seed five-minute single-B200 tests, not a large-model scaling guarantee or proof of independent rediscovery. Hash embeddings, Muon and baseline nanochat components are inherited. Search initially used H100; hardware transfer and repeated benchmark feedback constrain comparisons. No training or no-leakage audit was replayed.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\n\n\nRecursive\n\nAutomated AI research system / Recursive / UNKNOWN: Source-reported experimental proposal, implementation generation and evaluator-guided refinement; the exact underlying model identifier is unknown (source reported).\n\n## Original sources\n\n- [Recursive original nanochat_autoresearch artifact documentation](https://raw.githubusercontent.com/recursive-org/first-steps-toward-automated-ai-research/a962ec43e2e3d7c018e59a2ece623fe6e232fdfb/nanochat_autoresearch/README.md)\n- [First Steps Toward Automated AI Research](https://www.recursive.com/articles/first-steps-toward-automated-ai-research)\n",
      "summary": "Adapted gated bigram/trigram lookup features into multiple attention-value layers with decorrelated layer-specific hashes, combining them with training and architecture choices for fixed-budget small-language-model training. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.",
      "title": "Recursive: agent-produced layer-decorrelated n-gram value-path training recipes"
    },
    "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
      "version": 1,
      "content_hash": "sha256:3e10548c9cb992382690c918607ac0c04f10fbc5091e397fa8888069c12d6eb7"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:7b8a2c842d084f6f96e5be9070f3544d98c7bd0451eeea13ac56f6e2ce9aa2a9"
  },
  "target": {
    "record_id": "urn:uuid:214b8e7f-ae50-441d-a5ec-3a3620089787",
    "version": 1,
    "content_hash": "sha256:3e10548c9cb992382690c918607ac0c04f10fbc5091e397fa8888069c12d6eb7"
  },
  "published_grade": null,
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}