Coupled resources

Coupled resources run in the existing physical-graph labeling framework. Install selected/binary value domains, simultaneous pickup/delivery, cumulative costs, bounded affine or piecewise-linear dependencies, base-state maps, and state-dependent costs, and free-entry interval-cost fronts with Graph::set_coupled_resources, Solver::set_coupled_resources, or Python ResourceModel.install. No graph expansion or separate pricing front is used by this path. Paired pickup-before-delivery constraints are outside the requested scope.

Resource definitions

All per-arc vectors use the original graph's arc vector order, including arcs into the sink. They do not use physical arc IDs as array indices. Multiple resources compose in declaration order.

For simultaneous pickup/delivery the state is total deliveries D, net pickups minus deliveries N, and the greatest prefix value M of N, including zero. After a service (d,p), update D += d, N += p-d, M = max(M,N) and require D+M <= capacity. This is sufficient for the completed route: its departure load is D, and its maximum load is D+M. Increasing D at a later stop also checks the load required at earlier stops. Two independent delivery/pickup totals would miss that constraint. Deliveries and pickups must be nonnegative.

Cumulative weights, increments and affine dependency coefficients may be signed but must be finite. Arithmetic overflow is reported as an error. Dependencies use the parent's value after its transition on the same arc, and do not wait or clamp to bounds. These are explicit modeling contracts; arbitrary external dependency-type conventions are not asserted to have identical semantics.

CustomResource exposes the fixed cumulative-style custom family separately from CumulativeCost. It shares the numeric kernel, joins, dependency handling and directed path certification, but always starts its state and objective at zero. Signed finite increments and weights are allowed. forward_bound promises an upper bound on the total weight of any completion; backward_bound promises an upper bound on the increments of any prefix. These optional constants only help dominance with nonnegative increments and weights. They do not impose hard feasibility limits, and omitting them keeps conservative dominance. Both must be finite and nonnegative when supplied.

Rust uses CoupledResource::CustomResource { increments, weights, forward_bound, backward_bound }. Python uses model.add_custom_resource(increments, weights, forward_bound=None, backward_bound=None). For example, increments [2, 1] and weights [3, 4] charge 2*3 + 3*4 = 18. The JSON descriptor retains its own kind:

{"kind":"custom_resource","increments":[2,1],"weights":[3,4],"forward_bound":7,"backward_bound":3}

There is no initial parameter. This descriptor is a built-in numeric cost resource; use CoupledPlugin for extension-defined feasibility callbacks.

Piecewise-linear functions have at least two knots [argument,value], strictly increasing finite arguments, and finite adjacent argument/value differences. They are continuous and may increase, decrease or have flat segments. Exact knots return the supplied value. Interpolation uses (x-x0)/(x1-x0), then y0 + t*(y1-y0), clamped to the segment's endpoint value range to preserve monotonicity despite rounding. Outside-domain arguments are infeasible; no extrapolation, resource waiting or state clamping is introduced.

Explicit slope encodings for numeric resources

The encoded numeric variants preserve the supplied function representation: EncodedPiecewiseLinearResource, EncodedPiecewiseLinearDependent, and EncodedPiecewiseLinearCost. Existing knot-based variants and their constructors keep their current behavior. A slope function is evaluated with ordered segment multiply/add operations, rather than converting it into argument/value knots. Those two evaluation methods can differ for fractional arguments.

Prepared slope pairs have a distinct layout: the first pair is (value_at_lower, lower_argument); each remaining pair is (slope, segment_end). A single prepared pair is a point function. An affine input pair instead means (intercept, slope) and must be prepared over a domain; it is not a point or a knot pair.

from pybaldes import EncodedFunction, ResourceModel

function = EncodedFunction.slope_segments(
    [(2.0, 0.0), (3.0, 5.0), (-1.0, 10.0)],
    policy="strict_domain",
)
assert function.value(2.0) == 8.0
assert function.value(7.0) == 15.0
assert function.value(11.0) is None
copy = EncodedFunction.from_dict(function.to_dict())

model = ResourceModel()
resource = model.add_encoded_piecewise_linear_resource(
    initial=0.0, lower=0.0, upper=100.0,
    functions=[function],  # One function per physical arc, in insertion order.
)

strict_domain rejects arguments outside the exact stored domain. native_tolerance explicitly selects the recovered endpoint comparison policy, which may snap arguments just inside or outside the endpoints. It does not apply that tolerance to other resources or interior knots. Both policies report nonfinite/intermediate overflow as an error. An outside-domain result is None; a genuine function value of 1e12 remains a value. Dictionary/JSON round trips retain the encoding and policy and validate their contents.

Raw-domain image, preimage and directed-certificate proofs remain conservative. Unknown bounds retain candidates; native-tolerance preprocessing must not discard accepted near-boundary states using the nominal endpoints. Phase I still enforces function domains while suppressing objective contributions. Raw interval and paired-front support is separate work and is not provided by the numeric variants. The implementation and tests are written, with compile checks completed; runtime validation of this new API is deferred at the user's request during concurrent work.

SlopeIntervalCost provides a separate free-entry interval resource using prepared slope functions. The Python builder is add_slope_interval_cost(initial_lower, initial_upper, lower, upper, increments, functions, policy="strict_domain"). Functions must be slope-encoded; knot conversion is rejected. The alternate operation policy native_front_algebra requires functions with leaf policy native_tolerance; strict_domain requires matching strict leaves. This keeps function evaluation and front operation choices explicit.

Each forward extension translates the coordinate, restricts the allowed domain, adds the charge front and scans its segment endpoints for a minimum. Backward labels retain ordered suffix replay for the final joined objective. Unproved operations produce an explicit incomplete result. Unsupported dominance, completion bounds, fixing and certificates remain conservative. The result is a minimum of the computed front algebra, not a promise of a global minimum over every sequential binary64 evaluation of the source program. Compile checks pass; new runtime regressions remain deferred.

Free-entry interval costs

IntervalCost { initial, bounds, increments, functions } retains a continuous piecewise-linear cost function in each physical label. Unlike a deterministic base state, its initial value is chosen over the whole route. Minimizing each arc or each half independently is invalid: charges x and -x on [0,4] jointly cost zero, although their independent minima sum to -4.

Forward extension shifts the cost frontier by the arc increment and adds the charge at the arrival state. Backward extension pulls the suffix frontier and charge back through that increment. Joins intersect domains and minimize the sum at the common state, correcting the independently minimized prefix/suffix costs. Signed increments, signed/nonmonotone continuous charges, singleton feasible intersections, and multiple independent interval resources are supported. Initial and global windows must be finite, nested closed intervals. Every arc has one increment and one charge function. Charge domains remain constraints in phase I.

These fronts participate in pricing, original-cost replay, cuts, fixing, enumeration, retained repricing and node forks. CoupledLabelState::interval_cost_fronts exposes the current knots in declaration order. A frontier cannot be a numeric dependency parent because it has no single arrival value. Reversal reuse remains disabled for this family. Production dominance normally requires equal cost fronts. Domain inclusion is sufficient for the restricted all-zero front with zero future charges; frozen-front comparisons additionally require independent scalar and resource accounting. A current normalized front difference alone is not a certificate for future rounded additions. Completion caches do not approximate missing frontier correlations.

Floating-point operations can report arithmetic failure. A translation that merges distinct frontier knots is rejected rather than silently dropping a cheaper initial choice. Directed witness replay supports conservative objective intervals for exact integral state translations, argument knots and window endpoints within its bounded exact domain; other cases return unknown. These intervals may be loose and do not establish an original-domain pricing certificate.

This is an explicit additive-transition interval-front contract. Use the paired relation below for function-valued transitions with waiting. Raw external descriptor import and tolerance parity are separate work.

from pybaldes import ResourceModel

model = ResourceModel()
model.add_interval_cost(
    initial_lower=0.0, initial_upper=4.0, lower=0.0, upper=4.0,
    increments=[0.0, 0.0],
    functions=[[(0.0, 0.0), (4.0, 4.0)],
               [(0.0, 0.0), (4.0, -4.0)]],
)
# Install on a two-arc physical graph: the joint resource charge is zero.

Paired function relations and waiting

PairedPiecewiseLinear { initial, initial_base, arcs, mode } retains the least attainable dependent value at every feasible base coordinate. The initial function describes the dependent value over the initial base window. Every PairedResourceArc supplies total base arrival(t), departure-dependent increment(t), head-dependent lower(x) and upper(x), and an integer waiting slope. Arrival must be strictly increasing and satisfy arrival(t) >= t. It is the total arrival coordinate, not the consumption alone.

For departure base t and a chosen head base x >= arrival(t), the least next dependent value is

max(previous(t) + increment(t) + waiting * (x - arrival(t)), lower(x))

It must not exceed upper(x). Function domains also constrain the departure and head coordinates. Waiting choices, lower-bound clamping and disconnected feasible intervals are retained in the front; choosing one locally cheapest arrival would lose valid routes. Waiting provenance is retained per piece.

PairedResourceMode::Feasibility adds no objective and permits function-valued bounds. CostUnbounded permits signed increments and waiting slopes but requires constant dependent bounds shared across arcs; its name does not remove those bounds or the finite base domains. CostBounded additionally requires positive increments, nonnegative waiting slopes, and an initial function no lower than the shared lower bound. Both cost modes charge the final dependent minimum minus the initial dependent minimum. An empty path costs zero. These restrictions do not apply to the existing signed IntervalCost contract.

Forward extension builds the full relation. Backward labels retain an ordered physical suffix program; joins apply that suffix to the actual forward relation. This preserves lower-bound clamping and waiting without assuming that they have an additive inverse. A feasibility adjoint is available internally, but backward cost joins currently use replay and can cost more than a specialized suffix envelope. Completion bounds remain conservative. Forward feasibility dominance requires a front that covers the other front and stays below it; backward feasibility dominance compares known upper fronts by coverage and the opposite value order. Numerical comparisons use absolute tolerance 1e-4 or relative 2.22e-10. Cost-unbounded fronts with an upper bound of at least 1e12 can compensate a higher front through a cost penalty, provided the independent scalar and resource cost orders also hold. Reversal reuse is disabled.

This is a numerical resource contract. Arithmetic ambiguity or excessive front work produces an error; it is never converted to infeasibility or a complete-pricing claim. Directed path certification currently returns unknown for this family, including during phase I. Consequently proof-dependent enumeration/MIP transfer can decline the transfer and continue normal solving. No original-domain pricing certificate or raw external descriptor compatibility is claimed. Phase I suppresses objective charges while retaining dependent transitions and feasibility.

Python exposes the same contract through ResourceModel.add_paired_piecewise_linear(initial_lower, initial_upper, initial, arrivals, increments, lowers, uppers, waiting, mode="feasibility"). Function arguments are lists of (base, dependent) knots; each per-arc vector uses the original arc order. waiting contains signed 32-bit integers. Mode strings are "feasibility", "cost_unbounded", and "cost_bounded". The complete network example is examples/networks/paired_piecewise_linear.json. Its two required physical routes contribute paired costs 7 and 5.

The separate raw SlopePaired variant uses prepared slope functions for every function role. Python exposes add_slope_paired(initial_lower, initial_upper, initial, arrivals, increments, lowers, uppers, waiting, mode="feasibility", policy="strict_domain", normalization="absolute_final_value"). All functions must be EncodedFunction slope encodings with leaf policies matching the operation policy, as for SlopeIntervalCost. The existing knot builder retains its stated delta cost.

For a nonempty raw cost route, absolute_final_value charges the final dependent minimum, including the initial value. The alternate final_minus_initial_minimum subtracts the initial minimum. A fresh root charges zero under both conventions. Phase I suppresses this objective while keeping dependent transitions and bounds.

Raw paired forward dominance compares covering fronts under the selected policy. In feasibility mode with strict_domain, backward labels also retain an upper front when the slope functions can be converted into knot functions without changing their stored segment slopes. Unsupported conversions, singleton function domains, terminal upper bounds above the 1e12 numerical infinity marker, and failed adjoints leave that upper front unknown; joins continue to replay the physical suffix. Different suffix programs can dominate only when every active feasibility relation has a known upper front and no other resource requires replay-dependent comparison. native_front_algebra continues to use suffix replay without this backward dominance optimization.

The raw implementation retains front-operation provenance and uses a correct running-minimum waiting envelope. The name native_front_algebra selects recovered arithmetic/comparison choices where supported; it does not promise reproduction of the reference's underpricing on accepted nonconvex waiting fixtures. A computed front minimum, a source replay and a directed global pricing certificate remain distinct. Unproved operations return an explicit incomplete result; raw directed certificates and unsafe pruning remain disabled.

The native-front composition policy handles in-domain start snapping, tolerance-sized constant intervals, near-knot segment advancement, and the separate near-equal-slope merge rules for outer knots and inner endpoints. These choices do not change strict_domain arithmetic. A point front already satisfying constant bounds can retain nearby bound-domain endpoints when it lies inside their exact intersection. Tolerance does not extend a disjoint domain.

Runtime checks include direct coupled/paired route tests and selected original binary helpers. The October 24 comparison matched 1,600 finite composition cases and 36,872 extended-label insertions with nonempty cut descriptors. These are bounded operator/consumer checks, not complete resource or solver equivalence. Near-disjoint domains, unproved bound crossings and other unsupported numerical cases still return explicit incomplete outcomes. Evidence and reproduction artifacts are retained locally under results/metasolver-parity-fixes-20261024/.

Rust

use baldes::Graph;
use baldes::graph::coupled::CoupledResource;

let mut physical = Graph::<2>::new(4, 0)?;
for (tail, head) in [(0,1), (1,2), (2,3), (0,2), (2,1), (1,3)] {
    physical.add_arc(tail, head, -1.)?;
}
physical.elementary = true;
let deliveries = physical.arcs.iter()
    .map(|a| if a.head == 2 { 4. } else { 0. }).collect();
let pickups = physical.arcs.iter()
    .map(|a| if a.head == 1 { 4. } else { 0. }).collect();
physical.set_coupled_resources(&[
    CoupledResource::SimultaneousPickupDelivery {
        capacity: 4., deliveries, pickups,
        tolerance: baldes::graph::coupled::DEFAULT_LOAD_TOLERANCE,
    },
])?;
let result = baldes::price(&physical, &Default::default())?;
assert_eq!(result.columns[0].nodes, [0,2,1,3]);

For an existing stateful solver, use solver.set_coupled_resources(&definitions). It keeps physical IDs and options and invalidates labels, fixing and enumeration. Reinstall after changing the physical arc vector order. Set up the complete graph before installing resources. Resource validation also runs during preparation.

With clp, pass the attached physical graph to the ordinary RootProblem::set_partitioning or master::mp::Network constructor. Customer covering rows and cuts continue to refer to physical customers. No expanded-node adapter, duplicated rows, or route projection is needed. Coupled charges are included in priced and enumerated route objectives, master column reconstruction, retained-universe repricing, fixed-route objective validation and warm-start replay. Private phase I suppresses cumulative objective charges while retaining their state transitions and feasibility constraints.

Python

from pybaldes import ResourceModel, Solver

solver = Solver(4, 0)
for tail, head in [(0,1), (1,2), (2,3), (0,2), (2,1), (1,3)]:
    solver.new_arc(tail, head, -1.0)
model = ResourceModel()
model.add_simultaneous_pickup_delivery(
    capacity=4.0,
    deliveries=[0,4,0,4,0,0],
    pickups=[4,0,0,0,4,0],
)
model.install(solver)
minimum, routes = solver.price(50)
assert routes[0].nodes() == [0,2,1,3]

add_selection, add_cumulative_cost, add_custom_resource, add_dependent, and add_piecewise_linear_dependent install the other resource families through the same model. Route.original_cost reports the original coupled objective; Route.cost reports its priced cost.

The shared network JSON interface, used by baldes networks and Python PricingNetwork, accepts an optional coupled_resources list and optional elementary flag. Each descriptor uses a kind tag:

{
  "coupled_resources": [
    {"kind": "selection", "initial": 3, "allowed": [3,3,3,3,3,3]},
    {"kind": "simultaneous_pickup_delivery", "capacity": 4,
     "deliveries": [0,4,0,4,0,0], "pickups": [4,0,0,0,4,0]},
    {"kind": "cumulative_cost", "initial": 0,
     "increments": [1,1,1,1,1,1], "weights": [1,1,1,1,1,1]},
    {"kind": "dependent", "parent": 2, "initial": 0,
     "bounds": {"lower": 0, "upper": 100},
     "offsets": [0,0,0,0,0,0], "factors": [1,1,1,1,1,1]}
  ],
  "elementary": true
}

This is a fragment of a pricing network, not a complete model. Python accepts these same descriptors in PricingNetwork(coupled_resources=(...), ...). The specialized CVRP/VRPTW text instance readers do not infer these quantities.

For example, the additional JSON descriptor below defines one physical arc's piecewise function. Supply one function for every physical arc:

{"kind": "piecewise_linear_dependent", "parent": 0, "initial": 0,
 "bounds": {"lower": 0, "upper": 100},
 "functions": [{"points": [[0,0], [2,1], [4,3]]}]}

The corresponding Python method accepts functions=[[(0,0), (2,1), (4,3)]]. Parent indices always refer to the same resource declaration list. Base maps use kind: "piecewise_linear_resource" with initial, bounds, and functions; state costs use kind: "piecewise_linear_cost" with parent and functions. Python provides add_piecewise_linear_resource and add_piecewise_linear_cost. Base maps can express state-dependent consumption, waiting, saturation and resets explicitly by their knots; the engine adds no implicit waiting or reset rule.

Label operations and current limits

Charging uses ChargingResourceArc entries in physical arc-vector order. Each entry supplies travel time/energy, a service-start window, service duration, and an optional cumulative energy-to-time curve. Curves strictly increase from [0,0] through the battery capacity. The initial energy and departure time are explicit. Stations also constrain charging completion by closing time. The full continuous front survives; backward joins replay their retained suffix on the actual forward state. Front work is bounded per extension and exhaustion returns an error. Charging adds no cost, is not a numeric dependency parent, uses conservative equality dominance, and disables reversal reuse. Directed path certification declines this family, including in phase I. See the EVRP adapter for end-to-end pricing and schedule reconstruction.

Selection labels carry the remaining domains. Simultaneous load labels carry composable delivery/net-load/peak summaries. Forward numeric labels carry actual values. Backward numeric labels carry affine entry conditions and a cumulative cost function; a join evaluates them at the forward label's actual values. Kernels containing piecewise dependencies instead retain shared continuation programs for numeric constraints. A join replays that suffix from its actual forward entry values. Composition therefore adds a shared link rather than multiplying piecewise regions, and flat/nonmonotone functions need no inverse. Cumulative cost remains affine in its independent numeric coordinates; these kernels cache diagonal cumulative-cost maps in linear per-arc space. State-dependent nonlinear charges are kept out of the backward baseline and replayed at the actual forward entry state during joins. Each suffix carries an exact-sum interval, an absolute charge bound and a count; these provide an outward roundoff allowance for the ordered charge sum without rescanning the whole suffix to build a bound. Unknown/overflowing envelopes disable cost pruning. Affine-only kernels retain the dense precomputed-map fast path. Shared programs have iterative release to avoid recursive destruction of long paths. Dependency constraints are therefore not tested at an invented backward arrival value. All original scalar coordinates and cut/branch states still participate.

Numeric transitions are prepared once per physical arc when resources are installed. Forward programs retain declaration order with resolved parent slots; backward programs cache the triangular affine map, offsets, entry conditions and cost coefficients. Label extension composes the cached map with its suffix. This trades per-arc storage (quadratic in numeric resource count) for avoiding repeated matrix construction. Phase I rebuilds the cached cost terms with zero weights while preserving the resource transitions and constraints. A symbolic map overflow is recorded and reported if backward extension uses that arc; it does not prevent finite forward replay.

Dependency preprocessing first checks each arc's declared entry/exit windows. It then propagates source-reachable numeric intervals forward and sink-compatible intervals backward through the full graph. Rounded-addition preimages are expanded before subtraction. Direct base-map preimages use bounded searches over ordered binary64 arguments on each segment. They preserve flat portions, nonmonotone branches and rounding plateaus without requiring an algebraic inverse; segments already entirely inside the target range bypass the searches. Piecewise argument domains participate in both passes. Arcs with empty necessary domains are disabled without renumbering the physical graph. The work limit is at most 64 paired passes; each descending iterate is conservative, so stopping early only weakens pruning. Unknown arithmetic retains candidates. kernel.preprocessing() reports pass count, convergence and usable-arc counts; route_arc_possible reports the necessary complete-route filter for an arc. replay/replay_state still evaluate standalone partial resource paths without the complete-route filter.

Resource dominance now uses directional orders. A forward simultaneous state (D,N,M) can dominate another when all three coordinates are no larger; backward feasibility only needs D and M, so backward net load may differ. Selected value domains use superset dominance. Forward dependency dominance propagates possible comparison directions through the earlier-parent chain. A smaller state is allowed when the lower window is protected by nonnegative increments; a larger state is allowed when nonpositive increments protect the upper window. Negative factors reverse the parent comparison. Competing effects retain both possible directions and must satisfy both protections, otherwise dominance is rejected. Preparation encloses every intermediate operation over declared and prepared numeric domains, and unequal comparisons require finite arithmetic. Both entry states must lie in those domains. Equality remains available when these sufficient conditions cannot establish an order; backward conditions keep the existing identical-expression/window-implication rule. Piecewise slope signs participate in forward order propagation when the prepared parent domain is contained in every arc function's domain. Backward nonlinear comparisons require identical continuation programs before applying cost compensation. A flat function still constrains its parent through the argument domain; output equality does not erase that constraint. Unbounded cumulative parent comparisons also retain directional guards against overflow unique to the dominator. Direct base maps retain equality dominance until a whole-map feasibility order is established. Parents of arbitrary nonlinear cost functions retain equality (including differences induced by ancestors), so cost-free numeric comparisons cannot discard a better future objective.

Charged-resource dominance separately orders physical scalar reduced costs and accumulated numeric costs before considering the mixed label key. Equal numeric inputs retain the repaired baseline rule. Unequal inputs can use a prepared zero-compensation proof for cumulative-cost models, optionally combined with selection and simultaneous loads: nonnegative increments and weights permit 0 <= a <= b; nonpositive increments and weights permit b <= a <= 0. Both cones produce ordered nonnegative future charges, and the dominator's accumulated numeric charge must also be nonnegative. Zero-weight coordinates retain directional overflow guards. Signed cases outside those cones retain conservative equality conditions. Dependency/domain checks remain mandatory. Composite numeric/dependency models keep the baseline identity rule because the broader checks did not improve the measured workload. No positive current-key margin or cost compensation is spent by charged forward dominance.

Backward dominance requires identical continuation programs, compatible entry windows and numeric state, with its outward coefficient-difference bound where applicable. Unknown arithmetic retains both labels; an overflow during actual extension is reported rather than silently proving route infeasibility.

Completion pruning now includes an outward lower bound on the cumulative join correction. The engine builds direction-wide hulls of actual retained numeric states and suffix cost coefficients after labeling. Individual bucket scans use narrower per-bucket hulls, while inherited completion minima keep the broader hull that includes predecessor candidates. Per-bucket compatibility checks also use selected-domain unions, simultaneous-load envelopes and supported backward affine entry conditions. Skipping one bucket's scan never skips its predecessor traversal. Each completion query fixes its own state and bounds the opposite states. This works with signed coefficients without assuming a finite walk length. The two dot products in the implemented join are enclosed separately, preserving their floating-point evaluation scope. Missing hulls or arithmetic overflow leave the bound unknown and retain the candidate. These bounds are used by pricing, completion, fixing and directional enumeration; they are not scalar-only original-domain certificates.

Hulls are rebuilt after fresh/continued labeling and discarded on new pricing, continuation or node forks. If elementarity or physical topology changes after resource installation, reinstall the definitions so prepared dominance domains cannot become stale. Replacing the resource preparation also invalidates labels at unchanged scalar arc costs.

Forward-prefix reversal reuse is available for symmetric selection masks and simultaneous loads with symmetric physical-arc quantities, integral deliveries and pickups, and capacity at most 2^52. Uniform-sign net increments retain the original compact reuse rule. Mixed signs additionally track an internal suffix peak R = max suffix net load, updated by R = max(0, R + pickup - delivery). Reversing the arc sequence swaps prefix and suffix peaks; public load_summaries() remains (D,N,M).

Mixed-sign reuse builds a union of the two feasible prefix orientations. Each load resource retains a prefix while D+M <= capacity or D+R <= capacity. With several resources this may retain extra prefixes whose feasible orientations differ; every complete join still checks all resources in the actual physical route orientation. Dominance preserves both roles through ordered D,N,M,R. Standalone extension/replay and ordinary backward labels remain strictly feasible. Single-orientation completion hulls, completion-existence fixing and arbitrary ordinary completion callbacks cannot certify this union, so those pruning operations conservatively decline in the mixed reuse path.

The scalar resource/depot symmetry checks and conservative reduced-cost potential checks must also pass. Numeric and PWL resources, fractional loads, asymmetric resource events and presence rows retain ordinary directional labeling. Phase-I cost suppression does not make a numeric resource reversible. Pricing, fixing and enumeration use the same eligibility rules. Arithmetic failures invalidate completion instead of proving that no route exists.

The physical graph retains its ordinary 1024-vertex limit. There is no extra 1024-state expansion limit on this production path. Labels remain subject to normal label, time and path limits. A cyclic graph without a justified route length/resource bound can still exhaust those limits.

Integer witnesses use outward interval replay for coupled feasibility and objective contributions. A straddling boundary or unsupported arithmetic remains unknown. Original-domain scalar relaxation collectors and additive-cost certificates do not silently claim support for coupled resources. General external dependency-type semantics and exact native dominance/bound policies are not claimed to match the reference binary.

Validation status

The earlier state-expansion compiler and its public adapters have been removed. The direct kernel is the only coupled-resource implementation.

Implementation was completed before executing runtime tests. The direct-resource integration cases cover both directions, all split joins, standalone replay, base maps, signed state-dependent objectives, function domains, complete-route reduction, fixing/enumeration, node forks and root phase-I cost restoration. Independent physical-load/path and numerical-interval oracles supplement those integration cases. A freshly built native Python wheel exercises the public resource methods. Commands, source/wheel hashes and results are recorded in the current validation manifest. Earlier expansion smoke results do not validate these kernels, and the current regressions do not claim exact native descriptor, tolerance or performance parity.