C:\dummiesworld\papers> run wordscillation.exe

WordscillationDo not collapse the meaning too early.

A compact structured-memory experiment about keeping a few complete interpretations alive long enough for the evidence to judge them together.

Jaharri Gassaway (aka DumbButt) · Inquirion Labs · Paper 1 · 2026

REGISTERED WITHIN-FAMILY RESULTSYNTHETIC TASKNOT PEER REVIEWEDcs.LG PREPRINT CANDIDATE
Four uncertain wave paths converging into one stable output
/ abstract.txt

The small claim.

The name came from waves. The experiment ended up testing something less poetic and more useful: whether uncertainty should stay structured until complete explanations can compete.

I started Wordscillation with a simple intuition: when the evidence is uncertain, a model should not collapse to one meaning too early. Paper 1 turns that intuition into a controlled test. Synthetic memory packets bind source, relation, context, and target under a fixed storage budget. A width-8 beam keeps complete four-hop paths alive, then a 1,153-parameter scorer—without entity identities—learns how to rank those paths from structural evidence.

On the registered within-family evaluation, dense moderate-corruption accuracy rises from 82.188% for the frozen structural score to 94.896%, close to a 95.625% retained-path oracle. A separately registered fixed top-16 retriever reaches 95.729%. But the learned rule does not transfer without adaptation when the branching structure changes: it reaches 28.333%, near the frozen and shuffled controls. The honest conclusion is narrow. Late ranking can recover information lost by early commitment inside the tested family. This is not yet a language model, a general reasoning rule, or evidence for a literal oscillatory mechanism.

SUPPORTED :: Under corruption in the tested synthetic family, preserving a bounded set of coherent whole hypotheses and ranking them late can recover information lost by early local commitment.
/ result.log

Receipts and boundary.

The positive result and the failure belong together. Removing either one would make the project look stronger and teach less.

FROZEN STRUCTURAL SCORE82.188%

Dense moderate-corruption accuracy on the registered within-family evaluation.

LEARNED WHOLE-PATH SCORE94.896%

A 12.708-point paired gain, close to the 95.625% retained-path oracle.

CHANGED BRANCHING FAMILY28.333%

Near frozen 25.625% and shuffled 25.208%. The learned score is not yet general.

What survived testing

  • Complete path hypotheses can preserve useful structure that isolated early decoding loses.
  • A tiny identity-free scorer can learn better structural weighting inside the tested family.
  • A fixed top-16 retriever can remove the oracle-shortlist dependency in a separate registered test.

What did not survive

  • The score did not generalize to the qualified changed-branching family.
  • A parameter-matched message-passing graph did not repair that branch case.
  • No experiment here validates waves, attention replacement, natural-language understanding, or general reasoning.
/ toy_ranker.exe

Watch the commitment move.

The frozen rule begins by trusting the strongest-looking local clue. Training changes the feature weights until the complete path with consistent transitions becomes the top hypothesis.

CONCEPTUAL TRAINING DEMO

A deterministic four-feature linear stand-in for the paper’s listwise ranking idea. Every button press performs real gradient updates in your browser.

WRONG PATH LEADS
EPOCH0
LISTWISE LOSS
SUPPORTED PATH PROBABILITY
LOCAL EVIDENCE
LINK COHERENCE
COMPETITOR MARGIN
CERTAINTY
MODEL BOUNDARY :: This toy uses four features and a linear score for explanation. Paper 1 used 70 structural features, a 70→16→1 tanh MLP, width-8 beams, 300 fixed full-batch epochs, disjoint seeds, and registered holdouts. The percentages above—not this animation—are the scientific result.
/ pipeline.map

What the system actually does.

The wave is the project’s visual metaphor. In Paper 1, “amplitude” means hypothesis weight and “settling” means bounded selection—not physical oscillation.

PACKETSrole-bound memory
TOP 16fixed retrieval
BEAM 8complete paths
COMMITlearned ranking
/ paper1.pdf

Read the full evidence.

The 14-page single-column paper includes the complete method, controls, registered result, statistical treatment, exploratory transfer tests, limitations, and references.

SHA-256 :: 17e798ab3fd9b38b1053fe9f79b7d6e5dad64df7bae8d8d3b60a3c505b50d9db