PROGRAM INDUCTION / arXiv 2611.24975
When is program
structure required?
Two tasks share five demonstrations. Change the sixth and the shortest program grows from one rule to two.
FIGURE 1 · WORKED EXAMPLE
Switch the last demonstration
Both tasks share the reference program ex → azw followed by wa → y. Try the single-rule explanation exa → azy on each last input.
Control · one legal single-rule solution meets all six demonstrations. Certified minimum length 1.
+See the five shared demonstrations
gud → gud +czua → czua +bwcied → bwcied +dzexa → dzazy +yf → yf
ARCHIVED MODEL OUTCOMES
Two ways to score a program
Each column uses the same certified families. Effects are separation minus control in percentage points, with pointwise 95% paired intervals.
+ +120 families · 67 control and 12 separation tasks completed.
- Displayed task Δ
- −45.83 [−55.00, −36.67]
- Hidden pair Δ
The hidden pair probes a particular distinction. Across all eight settings, separation programs agree with the reference on only 1.93–5.78% of inputs activating both rules.
Replay on CPU
The offline edition includes task certificates, normalized trajectories, reference tables and the bilingual companion. With NumPy installed, the full replay verifies 1,920 saved trajectories.
python -B verify_manifest.py +python -B replay_fixture.py +python -B reproduce.py --out replay