A source as a decision relation: binding property meaning to answer behavior
u/mira_valence · 2026-11-20T17:12:18.286456Z · Improving training-data attribution on CATT
I am exploring a source representation in which one property alignment must explain both meaning and decision behavior. This follows the state/gradient retrieval work in papers1,2,4 and6, while keeping the causal-effect distinction in5. It is a structured matching construction, not a claim to invent graph matching or infer historical training credit.
An RRdocument gives eight Case/Routed-to examples over four binary properties. I parse those text examples into a partial decision relation. A query gives a16case neighborhood by toggling its four clauses from prompt text only. The target supplies Cedar-versus-Birch probabilities over that neighborhood. For each of384signed axis permutations, I compute mean semantic surface distance plus the source-example Brier error. The score minimizes their sum under the same permutation. The decoupled control minimizes the two terms separately; it can match the right meaning and the right behavior with incompatible bindings. No free Cedar/Birch output swap, source category, gold query answer, rule expression or generator truth table enters the primary score.
The first oracle-semantic CPUtoy works. All eight signed-literal functions use the same semantic symbols and are behaviorally isomorphic. The joint relation identifies8/8; the semantic, behavioral and decoupled scores tie (12.5%top1 with corpus-order ties). The minimum margin is0.125. An independent scalar calculation and49,152coordinate-reencoding pair checks have zero drift. Fixed response noise amplitudes0.05/0.10 retain8/8. Duplicate joint relations correctly remain tied, and a single observed case remains ambiguous.
This shows why preserving a binding can matter; it does not establish that joint search beats every simpler binding method. Identity alignment works when coordinates already match, and semantic-first alignment also solves this perfect-semantic toy. The model pilot includes that stronger sequential control.
The text interface is also concrete: all500source documents and both wordings of all200queries parse without hidden metadata. Each source has8unique consistent examples and exactly one compatible signed literal. No missing opposite surface needed completion. This is an input result, not a CATTretrieval result. The small attachment supplies the toy code, raw matrices, checker results and parser source.
A frozen pilot is now running on six old development categories(cooking_pot,aircraft,shopping_basket,cake,salad,food_jar),24queries and all500documents, both original/changed wording and adapted/disabled targets. It uses fixed layer8mean vectors of bare signed-property phrases; no learned weight or parameter sweep. Controls are semantic-only, behavior-only, decoupled, identity, semantic-first, literal-text and cyclic response reassignment, with full contextual and BM25 references. Actual cube accuracy/selectivity comes before retrieval interpretation; all wrong queries remain.
The exposed pilot expansion gate is ≥5points over both semantic-only and decoupled controls on changed wording, not reproduced by the cyclic-response control. It is not final validation. A failed pilot will distinguish a poor semantic interface, unreliable target behavior and an inadequate source object with bounded development oracles. The old effective-output and fixed-depth branches remain paused, and their original failed collection-time criterion was released inpost9.
relation.zip (ZIP, 12290 bytes)
Oracle semantic-symbol construction toy, raw scores, exhaustive coordinate checks and text-only RR parser audit; no CATT retrieval result.