Every product.
Its useful connection.

SUPPLIED ROLE
Supported discrete optimization and execution planning.

CONNECTION / CONTRIBUTION
Generate candidate customer decisions and execution plans; evaluate whether a different representation or resource configuration changes attainable results.

BOUNDARY
Shared cost model; original-model mapping; source-bound checks.

SUPPLIED ROLE
QUBO-based inference routing for supported cache-locality and mixture-of-experts load-balancing workflows.

CONNECTION / CONTRIBUTION
Choose routing together with cache locality, concurrency and eligible kernel configurations.

BOUNDARY
Preserve model quality and semantic routing requirements; this is not HTTP request routing or VRP.

SUPPLIED ROLE
Optimal data-placement software for memory-bound LLM inference across L2, HBM, CXL and NVMe.

CONNECTION / CONTRIBUTION
Price retention and placement using future reuse and avoided recomputation, not only bytes occupied.

BOUNDARY
KV compatibility and placement contracts; savings measured including movement.

SUPPLIED ROLE
GPU kernel optimization as a QUBO, with supported configuration selection and code generation.

CONNECTION / CONTRIBUTION
Tune for the representation, batching and placement actually selected by the system; optimize frequently used internal operations where supported.

BOUNDARY
Not a universal compiler or semantic proof engine; numerical and end-to-end qualification remain required.

SUPPLIED ROLE
Turnkey sovereign-AI infrastructure with supported compliance and placement rules expressed as QUBO constraints.

CONNECTION / CONTRIBUTION
Choose the compute work that best improves the downstream decision within authorized resource and policy limits.

BOUNDARY
Runtime authority, deadlines, policies and control timescales must be explicit.

SUPPLIED ROLE
Profiling, ranked improvement plans and performance/quality evaluation.

CONNECTION / CONTRIBUTION
Measure whether combinations improve accepted useful work, including overhead and quality.

BOUNDARY
Empirical quality tests are not mathematical optimality certificates.

SUPPLIED ROLE
KV compression and supported direct decode.

CONNECTION / CONTRIBUTION
Change the memory representation so a new batching/routing regime becomes feasible; evaluate task-sensitive fidelity.

BOUNDARY
No inherited end-to-end error guarantee; allowed representations and customer quality thresholds need validation.

SUPPLIED ROLE
Native search for supported constraint models.

CONNECTION / CONTRIBUTION
Express joint resource, decision and candidate-eligibility constraints where supported.

BOUNDARY
Do not equate its model support with every UNISOLVE theory; define ownership of search.

SUPPLIED ROLE
Structure-aware formulation, strategy selection and repair.

CONNECTION / CONTRIBUTION
Coordinate representation and repair choices rather than blindly trying every engine.

BOUNDARY
Do not duplicate UNISOLVE and Atlas controllers; explicit budget and objective ownership.

SUPPLIED ROLE
Supported solve-any dispatch, exact/numerical paths, original-source checks, theorem transport, sessions and recovery.

CONNECTION / CONTRIBUTION
Act as one computational and checking backbone for admitted cross-product claims.

BOUNDARY
82 registered profiles are not 82 independent algorithms; global, regional, statistical and numerical trust remain distinct.

SUPPLIED ROLE
Lattice basis reduction with reduction/lattice-related checks.

CONNECTION / CONTRIBUTION
Propose useful integer-coordinate changes for compatible MIP/constraint subproblems, not only crypto workloads.

BOUNDARY
Requires a complete integer parametrization and explicit exact transformation evidence; equal determinants alone do not prove lattice equality.

SUPPLIED ROLE
Exact determinant and linear-solve computations.

CONNECTION / CONTRIBUTION
Assist exact algebraic checking and reconstruction for model transformations and retained evidence.

BOUNDARY
Use valid bounds/reconstruction and admitted arithmetic; it is not automatically an HNF/SNF implementation.

SUPPLIED ROLE
Approximate nearest-neighbor retrieval and recall evaluation.

CONNECTION / CONTRIBUTION
Retrieve candidate reusable proofs, policies, configurations or diverse prior solutions.

BOUNDARY
Similarity is never a validity proof; misses reduce reuse, not correctness, if fallback is sound.

SUPPLIED ROLE
Compact frequency/cardinality estimation over streams.

CONNECTION / CONTRIBUTION
Estimate hot workload/state classes and target profiling or retrieval effort.

BOUNDARY
Approximate telemetry must not authorize hard constraints without a sufficient conservative or exact check.

SUPPLIED ROLE
PageRank, connected components and shortest paths with algorithm-specific checks.

CONNECTION / CONTRIBUTION
Analyze an explicitly built dependency or candidate-transition graph for locality, reuse and alternatives.

BOUNDARY
Correct dependency extraction and source provenance are additional work; generic graph algorithms do not establish business semantics.

SUPPLIED ROLE
SAT solving and independent satisfying-assignment checks.

CONNECTION / CONTRIBUTION
Check supported logical eligibility and candidate decisions in fast specialized paths.

BOUNDARY
Assignment checking alone gives no UNSAT proof.

SUPPLIED ROLE
Exact 0/1 knapsack optimization.

CONNECTION / CONTRIBUTION
Choose a bounded subset of independent optional compute/profiling tasks under a budget.

BOUNDARY
Dependency-rich scheduling requires a more appropriate model; not a general MIP replacement.

SUPPLIED ROLE
Supported MDP value iteration and error checking.

CONNECTION / CONTRIBUTION
Plan which computational action or future decision has value under a bounded, calibrated transition model.

BOUNDARY
Not general POMDP support; state abstraction and error conditions must be checked.

SUPPLIED ROLE
Matrix-free systems and extreme eigenvalues with true-residual checking.

CONNECTION / CONTRIBUTION
Refine only decision-relevant numerical quantities where residual-to-error bounds exist.

BOUNDARY
Conditioning matters; a residual alone does not bound solution error.

SUPPLIED ROLE
FFT, convolution and spectral-PDE computations.

CONNECTION / CONTRIBUTION
Provide numerical model evaluations at qualified resolutions as part of a decision-driven computation plan.

BOUNDARY
Round-trip/Parseval checks do not bound every downstream physical-model error.

SUPPLIED ROLE
Reconstruction from noisy linear measurements with data-fit residual.

CONNECTION / CONTRIBUTION
Recover the state information that could change a customer decision; choose additional measurement work where supported.

BOUNDARY
A small data-fit residual is not a universal state-error guarantee. Supplied campaign did not exercise the matrix-free GPU path.

SUPPLIED ROLE
Discrete optimal transport with marginal checks.

CONNECTION / CONTRIBUTION
Compare or align admissible demand/state distributions or candidate portfolios.

BOUNDARY
Marginal agreement is not an unregularized optimum proof or a calibrated world-model guarantee.

SUPPLIED ROLE
Ensemble-based state estimation with observations.

CONNECTION / CONTRIBUTION
Maintain a calibrated estimate of evolving resources/environment for the compute and decision planner.

BOUNDARY
Ensemble spread alone is not a universal certified uncertainty set.

SUPPLIED ROLE
Monte Carlo estimates with stated confidence intervals.

CONNECTION / CONTRIBUTION
Spend sampling effort on ambiguous decisions and estimated future recourse costs.

BOUNDARY
Adaptive sampling needs valid simultaneous/anytime coverage or a predeclared fixed sampling scheme.

SUPPLIED ROLE
Ising log-partition estimation with confidence information.

CONNECTION / CONTRIBUTION
Study the distribution of supported low-energy solutions, rather than retaining only the best score.

BOUNDARY
Not general exact counting or universal uniform sampling; constraints/encodings and statistical scope matter.

SUPPLIED ROLE
GPU-native state, indexing, transactions and persistence.

CONNECTION / CONTRIBUTION
Persist typed computational artifacts, source revisions, reuse conditions and replay records close to appropriate workloads.

BOUNDARY
Artifact schema, tenant isolation and actual durability guarantees must be qualified; not every metadata operation needs a GPU.

SUPPLIED ROLE
KV-cache compression, offload and restoration across supported tiers.

CONNECTION / CONTRIBUTION
Carry the chosen cache plan into execution and balance retained KV against recomputation.

BOUNDARY
It is a KV runtime, not an already demonstrated arbitrary proof-memory tier manager.

SUPPLIED ROLE
Workload mapping across compute, power, cooling, memory and network.

CONNECTION / CONTRIBUTION
Expose physical-resource feasibility and costs to the customer-decision compute planner.

BOUNDARY
Planning does not imply live power/cooling control; models require calibration.

SUPPLIED ROLE
Generation, scheduling, validation, storage and replay of agent workloads.

CONNECTION / CONTRIBUTION
Execute bounded observe/propose/solve/check/learn actions with retained traces.

BOUNDARY
It does not automatically contain a trained model, a safe multi-tenant host, or unrestricted execution authority.

SUPPLIED ROLE
Differentiable annealing that lets a learning workflow backpropagate through optimization.

CONNECTION / CONTRIBUTION
Differentiable annealing that lets a learning workflow backpropagate through optimization.

BOUNDARY
Differentiability is a product capability, not a guarantee of a global optimum or a universal learning speedup. The supplied table does not provide a product-specific benchmark, arbitrary-operation coverage or a universal gradient-correctness claim.

SUPPLIED ROLE
Physics-grounded drug-discovery scoring through GPU molecular dynamics.

CONNECTION / CONTRIBUTION
Physics-grounded drug-discovery scoring through GPU molecular dynamics.

BOUNDARY
Computational scoring is not evidence of experimental binding, efficacy, toxicity or clinical suitability. Discovery Core is explicitly the engine behind AMDE; no separate unprovided ALCHEMI dependency is invented.

SUPPLIED ROLE
Learned temperature schedules for annealing through a Fourier neural operator.

CONNECTION / CONTRIBUTION
Learned temperature schedules for annealing through a Fourier neural operator.

BOUNDARY
“Learned > heuristic” is the README’s claim; no general performance multiplier or cross-domain superiority is asserted here. A learned schedule does not supply an optimality certificate by itself.

SUPPLIED ROLE
An autonomous discovery product organized around perceive → hypothesize → experiment → learn.

CONNECTION / CONTRIBUTION
An autonomous discovery product organized around perceive → hypothesize → experiment → learn.

BOUNDARY
Autonomous discovery describes the product’s role. It is not permission to control physical equipment, a guarantee of a new discovery or confirmation that every domain-specific integration is already qualified.

SUPPLIED ROLE
Hybrid 3D reconstruction using annealing for structure and gradients for parameters.

CONNECTION / CONTRIBUTION
Hybrid 3D reconstruction using annealing for structure and gradients for parameters.

BOUNDARY
The README table establishes hybrid 3D reconstruction, not universal scene coverage, a specific sensor interface or a measured speedup on all scenes.

SUPPLIED ROLE
A quantum–classical optimization bridge for warm starts, validation and hybrid workflows.

CONNECTION / CONTRIBUTION
A quantum–classical optimization bridge for warm starts, validation and hybrid workflows.

BOUNDARY
The June 18 quantum head-to-head study used statevector simulation, not quantum hardware. It is not evidence of a particular QC Bridge hardware integration or a universal quantum/classical advantage.

SUPPLIED ROLE
A self-evolving optimizer that improves its optimization algorithms.

CONNECTION / CONTRIBUTION
A self-evolving optimizer that improves its optimization algorithms.

BOUNDARY
“Self-evolving” is the supplied product role. No universal monotonic improvement, proof of arbitrary generated code or autonomous production change is implied.

SUPPLIED ROLE
A self-improving materials-data pipeline built on the SpinForge core.

CONNECTION / CONTRIBUTION
A self-improving materials-data pipeline built on the SpinForge core.

BOUNDARY
The README states “1000× wet-lab speed.” No matched measurement record accompanies the supplied table, so this is not published as a general speed or experimental-equivalence promise.

SUPPLIED ROLE
Physical optimization in which a robot solves combinatorial problems.

CONNECTION / CONTRIBUTION
Physical optimization in which a robot solves combinatorial problems.

BOUNDARY
The supplied table does not identify a universal robot adapter, external safety certification or authority for unrestricted physical control. Hardware and operating responsibilities are separately scoped.

SUPPLIED ROLE
GPU-fleet scheduling formulated as a QUBO to maximize tokens per watt.

CONNECTION / CONTRIBUTION
GPU-fleet scheduling formulated as a QUBO to maximize tokens per watt.

BOUNDARY
Maximizing the modeled objective is the product purpose, not a claim of globally optimal production schedules or a guaranteed energy saving on every fleet. No multiplier is supplied in the table.

SUPPLIED ROLE
The synthesis meta-system through which its eleven products improve one another.

CONNECTION / CONTRIBUTION
Existing synthesis meta-system for its products improving one another. Cross-portfolio additions are separately scoped.

BOUNDARY
The eleven-product family and Recursive Engine are existing products by the owner’s confirmation. The supplied table does not enumerate every runtime connection or establish a universal improvement rate. Cross-family additions require their own integration scope.

SUPPLIED ROLE
The shared computational engine behind AMDE and SpinForge Bio.

CONNECTION / CONTRIBUTION
Confirmed shared engine behind AMDE and SpinForge Bio; no Bench dependency asserted.

BOUNDARY
The supplied clarification establishes dependencies on AMDE and SpinForge Bio. It does not establish a Bench dependency or a separate ALCHEMI engine link. A shared computational engine does not establish experimental biological validation.

SUPPLIED ROLE
Protein binder design producing a ranked candidate panel for downstream synthesis and evaluation.

CONNECTION / CONTRIBUTION
Protein binder design producing a ranked candidate panel for downstream synthesis and evaluation.

BOUNDARY
A computational candidate panel is not evidence that sequences were synthesized, bind experimentally, are safe or are suitable for clinical use. The publication does not provide biological sequences, experimental instructions or an efficacy claim.

SUPPLIED ROLE
A distinct offering focused on certified Gset optimality.

CONNECTION / CONTRIBUTION
A distinct offering focused on certified Gset optimality.

BOUNDARY
The supplied description does not enumerate the proved Gset instance set or name a universal completion budget. No claim that all Gset instances are solved is made. No dependency on Discovery Core is asserted.

SUPPLIED ROLE
Satisfy hard clauses while optimizing weighted soft requirements.

CONNECTION / CONTRIBUTION
Satisfy hard clauses while optimizing weighted soft requirements.

BOUNDARY
A feasible assignment and a proved optimum are different outcomes.

SUPPLIED ROLE
Solve Max-Cut/Ising problems with independently checkable optimality evidence where completed.

CONNECTION / CONTRIBUTION
Solve Max-Cut/Ising problems with independently checkable optimality evidence where completed.

BOUNDARY
An objective recount alone is not a proof that no better cut exists.

SUPPLIED ROLE
Constraint programming for supported XCSP3 models and scheduling.

CONNECTION / CONTRIBUTION
Constraint programming for supported XCSP3 models and scheduling.

BOUNDARY
General XCSP parsing and deciding coverage are distinct.

SUPPLIED ROLE
Divide a supported graph or hypergraph while evaluating its partition objective.

CONNECTION / CONTRIBUTION
Divide a supported graph or hypergraph while evaluating its partition objective.

BOUNDARY
A partition score is not automatically a measured system-wide communication saving.

SUPPLIED ROLE
Plan vehicle routes under supported CVRP and VRPTW requirements.

CONNECTION / CONTRIBUTION
Plan vehicle routes under supported CVRP and VRPTW requirements.

BOUNDARY
Customer-specific routing requirements outside CVRP/VRPTW require an admitted representation.

SUPPLIED ROLE
Check supported bit-vector and integer-arithmetic requirements.

CONNECTION / CONTRIBUTION
Check supported bit-vector and integer-arithmetic requirements.

BOUNDARY
Supported theory fragments do not imply complete SMT-LIB coverage.

SUPPLIED ROLE
Select compatible computational backends, race them and apply execution guards.

CONNECTION / CONTRIBUTION
Select compatible computational backends, race them and apply execution guards.

BOUNDARY
This is backend selection, not inference token routing, vehicle routing or network path construction. Its evidence is separate from UNISOLVE’s internal router.

SUPPLIED ROLE
Solve quantified Boolean formulas with their quantifier order retained.

CONNECTION / CONTRIBUTION
Solve quantified Boolean formulas with their quantifier order retained.

BOUNDARY
Broader dependency/proof variants and competition parity are not implied.

SUPPLIED ROLE
Find tours for supported traveling-salesman problems.

CONNECTION / CONTRIBUTION
Find tours for supported traveling-salesman problems.

BOUNDARY
This is separate from vehicle-routing constraints such as capacity and time windows.

SUPPLIED ROLE
Preprocess supported CNF before MaxSAT execution.

CONNECTION / CONTRIBUTION
Preprocess supported CNF before MaxSAT execution.

BOUNDARY
The held-out improvement was not confirmed; the product remains off by default in the described release.

SUPPLIED ROLE
Solve supported linear, quadratic and second-order-cone models.

CONNECTION / CONTRIBUTION
Solve supported linear, quadratic and second-order-cone models.

BOUNDARY
The product includes a labeled portfolio; native and external backend results remain distinguished.

SUPPLIED ROLE
Solve optimal-transport and assignment problems with the appropriate checks.

CONNECTION / CONTRIBUTION
Solve optimal-transport and assignment problems with the appropriate checks.

BOUNDARY
Certified marginals and a global assignment optimum are different guarantees.

SUPPLIED ROLE
Evaluate supported mixed-integer nonlinear models from OSiL/PIP inputs.

CONNECTION / CONTRIBUTION
Evaluate supported mixed-integer nonlinear models from OSiL/PIP inputs.

BOUNDARY
This product runs on SCIP; it is not presented as a newly invented native nonlinear algorithm.

SUPPLIED ROLE
Optimize binary quadratic choices subject to linear constraints.

CONNECTION / CONTRIBUTION
Optimize binary quadratic choices subject to linear constraints.

BOUNDARY
The stated examples include k-cluster, independent set and quadratic knapsack; broader scope requires confirmation.

SUPPLIED ROLE
One product for certified MDP values, partition-function bounds and model counting.

CONNECTION / CONTRIBUTION
One product for certified MDP values, partition-function bounds and model counting.

BOUNDARY
The three modes are capabilities inside one product, not three additional current solver products.

SUPPLIED ROLE
Select a mixed-integer programming path for a supported constrained model.

CONNECTION / CONTRIBUTION
Select a mixed-integer programming path for a supported constrained model.

BOUNDARY
Numerical backend completion is not automatically independent mathematical proof.

SUPPLIED ROLE
Solve matrix-free linear systems with a recomputed true-residual certificate.

CONNECTION / CONTRIBUTION
Solve matrix-free linear systems with a recomputed true-residual certificate.

BOUNDARY
A residual is not a universal solution-error bound without the appropriate conditioning assumptions.

SUPPLIED ROLE
Optimize higher-order binary models with three- and four-body terms.

CONNECTION / CONTRIBUTION
Optimize higher-order binary models with three- and four-body terms.

BOUNDARY
The current release describes three- and four-body models; historical LABS wording is not a new unrestricted domain claim.

SUPPLIED ROLE
Solve supported toroidal and planar spin-glass instances exactly.

CONNECTION / CONTRIBUTION
Solve supported toroidal and planar spin-glass instances exactly.

BOUNDARY
A theorem for the admitted structure is not a proof for arbitrary graphs.

SUPPLIED ROLE
Execute thousands of supported tiny QUBO or SAT instances in a batch.

CONNECTION / CONTRIBUTION
Execute thousands of supported tiny QUBO or SAT instances in a batch.

BOUNDARY
Batch throughput must include input preparation, execution and checking, not only one launch.

SUPPLIED ROLE
Prove early when a supported routing or flow problem cannot be routed.

CONNECTION / CONTRIBUTION
Prove early when a supported routing or flow problem cannot be routed.

BOUNDARY
This product is an infeasibility checker, not a general route-construction engine.