{
  "version": "learned-route-latch-placement-transfer-v1",
  "namespace": "lp-v1-study01-20261014",
  "parameterization": {"parameters": 25, "precision": "Python IEEE754 binary64; JSON round-trip", "bounds": [-4,4], "features": ["charged write-to-site delay / 32", "charged query-to-site delay / 32", "public w times fixed 8", "public q times fixed 8"], "hidden_units": 4, "activation": "tanh", "initialization": "fixed hidden input weights; zero output weights; explicit own-write coefficient -0.25"},
  "optimizer": {"runs": 4, "vectors_per_run": 128, "seed_purpose": "mutation", "parent": "best training score; earlier evaluation wins exact ties", "mutation": "independent Gaussian perturbation of all 25 coordinates, clip each to [-4,4]", "scales": [[1,32,0.25],[33,64,0.15],[65,96,0.08],[97,127,0.04]], "repeated_candidates": "evaluate and charge again; distinct theta is canonical tuple equality", "acceptance": "strictly smaller mean correctness-gated expected cost only", "validation": "three best distinct vectors by (training score,evaluation index), plus theta0; omit duplicate theta0 slot; pad to four slots with explicitly cached theta0, no new vector; select by (validation score,evaluation index)"},
  "training": {"hosts_per_run": 8, "L":4,"K":4,"p_order":[0,0.15,0,0.15,0,0.15,0,0.15],"profiles":[0.25,0.75]},
  "validation": {"hosts_per_run":4,"L":4,"K":4,"p_order":[0,0.15,0,0.15],"profiles":[0.25,0.75]},
  "test": {"groups":12,"settings":[[4,4,0],[4,4,0.15],[4,8,0],[4,8,0.15],[6,4,0],[6,4,0.15],[6,8,0],[6,8,0.15]],"profiles":[0.25,0.75],"contexts":192,"conditions":2304,"ordinary_episodes":2,"subsequent_events":64,"initialization":"independent signs for every address before each ordinary episode","forced_minimum_queries":0},
  "comparators": ["D_initial","D_analytic","B_original","B_cost","D_learned_0","D_learned_1","D_learned_2","D_learned_3","D_mismatch_0","D_mismatch_1","D_mismatch_2","D_mismatch_3"],
  "assignment": "same D fixed growth tree; write-to-root path excludes interface, response and other write attachments; own attachment feasible; distinct latches; ascending address order; reduction minimizes (score,opaque handle); reserve winner, install routes, acknowledge before next address; no retries or repairs",
  "B_original": "previous build source exact bytes in legacy.py, compatible runtime observers only; ignores supplied workload as original behavior",
  "B_cost": "same independent weighted Dijkstra construction and shortest-path parent ties as B_original; exact rectangular Hungarian integer-cost assignment",
  "objective": "J=sum(w*write commit latency + q*single correct query response latency); J_star=J on full gate, otherwise physical T_cap=1292; raw measured costs retained separately; unexecuted conditions unobserved",
  "primary": "per search paired fractional D_initial-D_learned / D_initial, equal average 6 size-transfer settings x 2 workloads x 12 groups; also raw tick difference, all-setting and two in-distribution settings separately; zero denominator stops as semantic defect",
  "analysis": "all four searches, full range and 12 per-group effects, fixed setting/workload strata; same signed fractional comparator contrasts against analytic, original B, cost B; learned minus D-tree optimum gap; mismatch minus intact true cost; no significance or powered equivalence claims; shared references executed once per context",
  "diagnostics": "fixed all-address writes/queries, all-address opposite overwrite queries, reset then all-address zero queries; two opposite-answer cloned bank pairs; initialization/diagnostic actual costs separate from stationary J",
  "representatives": "group0 L4/K4/p0 rho .25 and group0 L6/K8/p.15 both rho profiles, all twelve methods full construction and delivery/state trajectories; strongest adverse learned-vs-B_cost case first-order tie separately identified from saved results",
  "author_rerun": "first selected policy (run0), group0 L6/K8/p.15 both workloads, four controls and mismatch; disposable source copy; compare compiled/trajectory hashes, observations and scores, not CPU times",
  "cache": "growth discovered once per host per split, pure locally obtained tree state copied for each D placement; deployment includes growth charge, actual numerical ledger counts growth once; no policy layout/candidate/score caching except documented validation padding; exact D-tree oracle computed only after selection seal",
  "resources": {"cpu_seconds":3600,"wall_seconds":5400,"rss_bytes":1073741824,"retained_bytes":134217728,"setup_analysis_allowance_seconds":120,"full_job_timeout":1800,"other_job_timeout":120,"cells":216,"edges":540,"growth_ticks":1024,"growth_messages":4096,"growth_bytes":65536,"placement_ticks":16384,"inclusive_development_messages":12000,"inclusive_development_bytes":1048576,"development_queue":2048,"local_policy_bytes":2048,"proposals":1728,"retries":0,"model_bytes":1048576,"messages_per_transaction":1024,"task_queue":512,"incoming_per_cell":16,"interface_slots":1,"output_records":16,"episode_ticks":110000,"construction_seconds":2},
  "stopping": "no source/config changes after optimization freeze; semantic objective/locality/oracle/hidden-planning/replay defect stops affected comparison with records retained, no repair/rerun exposed tests; poor optimizer and invalid individual candidates consume budget and remain outcomes; one campaign only"
}