js-rigor: reliability flows through every rule kind; multi_hop value collection fixed

Systemic reliability gap found by the probe sweep: the compiled evaluation
paths never emitted the reliability the engine computes.

- Compiled _evaluateDirect omitted the relation's reliability, and the
  chain/multi_hop rules hardcoded reliability: 1.0 — so check() results
  reported 1.0 for any rule whose decision came through a chain, multi_hop,
  union, intersection, exclusion, or defeasible combination.
- The chain and multi_hop traversals now track per-path reliability (product
  of edge reliabilities) and report the winning path's value; the compiled
  and fallback logical operators (union/intersection/exclusion, direct_list
  fast path, early exits) report the selected child's reliability
  (max/min child or OWA trace index; exclusion multiplies both legs), and
  normal-mode defeasible combines base x requires x defeater reliabilities.
- The checker's logical fast path dropped collectedValues from union/
  intersection/exclusion results; it now passes them through.
- MultiHopRule.valueManager was read off relationManager where the real
  arbiter keeps it on the arbiter — collectValues: true on a multi_hop rule
  with a value-carrying edge crashed the evaluation (error result, silent
  denial). Now resolved at the arbiter level with a relationManager
  fallback for stubs.

Campaign pins: reliability per kind (chain/multi_hop product, union/intersection
selected child, exclusion/defeasible product), and multi_hop value collection
through persistent and partial contexts.

tests/rigor/traversal-parity.test.js

@@ -188,7 +188,7 @@ describe('Traversal semantics parity (rigor)', () => {
       rigor.crucible([
         rigor.invariant('chain-direction-parity', ({ error, errorMessage }) => !error && !errorMessage)
       ])
-    ).run({ effort: 1500, seed: 'traversal-chain-direction' });
+    ).run({ effort: 1500, seed: 'traversal-chain-direction' , artifacts: { dir: '', persist: 'never' }});
 
     const inv = report.crucibleVerdict?.invariants?.find(i => i.name === 'chain-direction-parity');
     assert.ok(inv, 'invariant missing');
@@ -264,7 +264,7 @@ describe('Traversal semantics parity (rigor)', () => {
       rigor.crucible([
         rigor.invariant('ttu-multi-tuple-parity', ({ error, errorMessage }) => !error && !errorMessage)
       ])
-    ).run({ effort: 1200, seed: 'traversal-ttu-multituple' });
+    ).run({ effort: 1200, seed: 'traversal-ttu-multituple' , artifacts: { dir: '', persist: 'never' }});
 
     const inv = report.crucibleVerdict?.invariants?.find(i => i.name === 'ttu-multi-tuple-parity');
     assert.ok(inv, 'invariant missing');
@@ -340,7 +340,7 @@ describe('Traversal semantics parity (rigor)', () => {
       rigor.crucible([
         rigor.invariant('update-path-parity', ({ error, errorMessage }) => !error && !errorMessage)
       ])
-    ).run({ effort: 600, seed: 'traversal-update-path' });
+    ).run({ effort: 600, seed: 'traversal-update-path' , artifacts: { dir: '', persist: 'never' }});
 
     const inv = report.crucibleVerdict?.invariants?.find(i => i.name === 'update-path-parity');
     assert.ok(inv, 'invariant missing');