Display
Find

Find your next step

Filter public starting points, or search the full product catalog.

Public starting points

8 shown
Gateway Information Group

Gateway / Product catalog

Find your next advantage.

Practical report services, data tools and digital products. Compare the scope, see what’s included, and choose the right fit.

A little guidance

Find the right service.

Tell us what you want to accomplish. We’ll suggest a service and show its price, delivery and available payment options.

Optional matching uses OpenAI to process your description. Use general task details; leave out personal information, passwords and wallet credentials. Privacy details

Browse all products ↘

Not sure where to start?

Describe your goal and explore relevant products with the optional Gateway Guide. You stay in control of every purchase.

Find your fit →

3698 results found across 3699 products · Showing 1351–1375

Link to these results

Report servicesCheckout & wallet API

Grammar Ambiguity Exposure Report

Review supplied example-word ambiguity claims and unreachable grammar scope with two concrete production histories.

Includes Private access follows the service-specific retention terms.

USD 9.00 / report

Final payment terms are supplied by the live quote.

Choose payment · USD 9.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grammar Ambiguity Exposure Report
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Final payment terms are supplied by the live quote.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grammar-ambiguity-exposure-report

Scope & limitations

  • A witness pair is retained for each claimed word with bounded ambiguity; no unbounded unambiguity assertion follows from absence. Exact finite supplied-model inspection only. Input bounds limit computation. No external connection, execution, rendering, deployment, certification or control. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Report servicesCheckout & wallet API

Grammar Compiler Readiness Report

Review a whole finite grammar for symbol partition, unreachable and unproductive rules, nullable left-corner recursion and duplicate productions, with derived productivity and nullability evidence.

Includes Private access follows the service-specific retention terms.

USD 9.00 / report

Final payment terms are supplied by the live quote.

Choose payment · USD 9.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grammar Compiler Readiness Report
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Final payment terms are supplied by the live quote.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grammar-compiler-readiness-report

Scope & limitations

  • Normalized supplied artifact profile only; no source execution, external verification, certification or security endorsement. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Grammar FIRST FOLLOW Sets API

Compute nullable, FIRST and FOLLOW sets by fixed point for a supplied token grammar.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grammar FIRST FOLLOW Sets API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grammar-first-follow-sets

Scope & limitations

  • Reserve $ as end marker; keep nullable separate from FIRST. Up to 32 nonterminals, 32 terminals, 128 rules and 16 right-side symbols. This does not certify LL(1) suitability. Uses supplied non-sensitive data only. No live account access, automatic changes or certification. Calculation profile 1.0.0; approximate non-integer numeric outputs use twelve significant digits; representable safe integer numbers and declared decimal-string integers are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Report servicesCheckout & wallet API

Grammar Normalization Language Report

Review proposed CNF shape and finite token-language agreement using separately supplied original/proposed rewrite budgets.

Includes Private access follows the service-specific retention terms.

USD 9.00 / report

Final payment terms are supplied by the live quote.

Choose payment · USD 9.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grammar Normalization Language Report
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Final payment terms are supplied by the live quote.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grammar-normalization-language-report

Scope & limitations

  • Both grammars are bounded to 8 nonterminals/20 productions. Budget differences can explain missing words; bounded agreement does not establish unbounded grammar equivalence. Exact finite supplied-model inspection only. Input bounds limit computation. No external connection, execution, rendering, deployment, certification or control. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Gran Acid Titration Equivalence Intercept

Fit the acid-side Gran function (sample+added mL)*10^-pH against acid volume and return its x-intercept mL.

Includes Private access follows the service-specific retention terms.

USD 1.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 1.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Gran Acid Titration Equivalence Intercept
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
gran-acid-titration-equivalence-intercept

Scope & limitations

  • Caller selects appropriate post-equivalence region; no endpoint validity, activities, acid strength or water-quality certification. Supplied data and declared assumptions only. No physical inspection, clinical use, certification, external access or control. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Grant Deliverable Evidence Coverage

Match operator-accepted evidence types with grant deliverables and supplied deadlines.

Includes Private access follows the service-specific retention terms.

USD 19.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 19.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grant Deliverable Evidence Coverage
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grant-deliverable-evidence-coverage

Scope & limitations

  • No grantor acceptance, certification or legal compliance is independently verified. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Grant Drawdown Reconciliation

Reconcile declared grant expense allocations across supplied budgets and eligibility flags.

Includes Private access follows the service-specific retention terms.

USD 19.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 19.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Grant Drawdown Reconciliation
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
grant-drawdown-reimbursement-reconciliation

Scope & limitations

  • Does not interpret award terms, decide eligibility, prepare a tax receipt or submit a claim. One declared currency; exact integer minor units. No financial, accounting, tax or legal advice, account connection or payment action. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Balanced Orientation Count

Count orientations with equal incoming and outgoing degree at every vertex through bounded exact enumeration.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Balanced Orientation Count
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-balanced-orientation-count

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Betweenness Centrality API

Measure each vertex share of shortest paths between other vertices.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Betweenness Centrality API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-betweenness-centrality

Scope & limitations

  • Unweighted simple graphs with 1–32 vertices; directed or undirected. Exact shortest-path counts with approximate ratios, endpoint-excluding raw and normalized scores; disconnected pairs contribute zero. No weighted or sampled approximation. Supplied non-sensitive data only; no live account access, automated changes or certification. Profile 1.0.0: approximate non-integers use 12 significant digits; safe integers and declared integer strings are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Biconnected Edge Blocks

Partition edges into vertex-biconnected blocks using a DFS low-link stack; isolated vertices have no edge block.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Biconnected Edge Blocks
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-biconnected-edge-blocks

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Bipartite Coloring API

Check two-colorability of a supplied undirected multigraph.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Bipartite Coloring API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-bipartite-coloring

Scope & limitations

  • A conflicting edge is evidence of failure; returned groups are empty for a non-bipartite graph. Uses supplied non-sensitive data only. No live account access, automatic changes or certification. Calculation profile 1.0.0; approximate non-integer numeric outputs use twelve significant digits; representable safe integer numbers and declared decimal-string integers are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Bridges and Articulation API

Find bridges and articulation vertices in an undirected supplied multigraph using edge-aware DFS.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Bridges and Articulation API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-bridges-articulation

Scope & limitations

  • Self loops and parallel edges are retained; no live topology discovery. Uses supplied non-sensitive data only. No live account access, automatic changes or certification. Calculation profile 1.0.0; approximate non-integer numeric outputs use twelve significant digits; representable safe integer numbers and declared decimal-string integers are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Cartesian Product Construction

Construct the Cartesian product of two labelled graphs; output vertex index is leftIndex×rightSize+rightIndex.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Cartesian Product Construction
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-cartesian-product-construction

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Connected Edge Subset Counts

Count connected spanning edge subsets by cardinality, providing coefficients for all-terminal reliability without choosing a probability.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Connected Edge Subset Counts
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-connected-edge-subset-count

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Core Decomposition API

Compute every vertex core number and graph degeneracy.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Core Decomposition API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-core-decomposition

Scope & limitations

  • Simple undirected graphs with 1–64 vertices and up to 512 edges. Degree peeling returns maximal k-core membership numbers, including zero for isolated vertices; no directed or weighted-core interpretation. Supplied non-sensitive data only; no live account access, automated changes or certification. Profile 1.0.0: approximate non-integers use 12 significant digits; safe integers and declared integer strings are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Distance Regularity Profile

Test connected graph distance regularity across every root and vertex using explicit intersection counts.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Distance Regularity Profile
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-distance-regularity-profile

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Geodesic Convex Hull API

Expand seed vertices until every shortest path between included vertices stays inside the set.

Includes Private access follows the service-specific retention terms.

USD 1.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 1.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Geodesic Convex Hull API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-geodesic-convex-hull

Scope & limitations

  • Unit-weight undirected graph; return the first closure round for each added vertex. Exact finite supplied graph model. Node order is supplied order; tie choices use node or edge indices. At most twelve vertices and sixty-six edges unless a stricter service profile applies. Integer weights are exact within the input profile. No network access, account change or live routing. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Isomorphism Witness API

Compare small graphs and return a vertex relabeling when they are isomorphic.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Isomorphism Witness API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-isomorphism-witness

Scope & limitations

  • Two simple undirected graphs on the same 1–12 vertices. Degree-pruned exact search; the first ascending mapping is returned. At most two million search states; labels, weights and multigraphs excluded. Supplied non-sensitive data only; no live account access, automated changes or certification. Profile 1.0.0: approximate non-integers use 12 significant digits; safe integers and declared integer strings are preserved.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Line Graph Construction

Construct the line graph with one output vertex per input edge and adjacency through a shared endpoint.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Line Graph Construction
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-line-graph-construction

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Maximum Cut Exact

Find a maximum unweighted edge cut by bounded exact enumeration, with one vertex fixed to remove complementary duplicates.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Maximum Cut Exact
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-maximum-cut-exact

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Minimum Bandwidth Order

Find a vertex ordering minimizing the largest index separation over supplied undirected edges, with exact bounded permutation enumeration.

Includes Private access follows the service-specific retention terms.

USD 1.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 1.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Minimum Bandwidth Order
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-minimum-bandwidth-order

Scope & limitations

  • Off-diagonal zero graph/cost entries denote absent edges; all matrix indices are zero-based. Declared ideal or supplied-record model only; no physical inspection, live control, certification or professional approval. Nonzero model inputs have magnitude from 1e-12 through 1e9; zero remains permitted only where the specific semantic model permits it. reportedValue and absoluteTolerance may use smaller finite magnitudes. Explicit matrix pivot/spectral conditioning floor is 1e-12 of the stated scale; symmetric eigensystem stopping is 1e-14 of scale. Matrix and enumeration bounds are input work profiles. Floating arithmetic uses finite double precision and twelve-significant-digit presentation; integral quantities must remain exactly representable. No external device or account is accessed. Aggregate enumeration estimates must not exceed 10000000 elementary work units per request. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Minimum Fill Elimination

Enumerate elimination orders of a bounded undirected graph and return a minimum-fill chordal completion with recorded fill edges.

Includes Private access follows the service-specific retention terms.

USD 1.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 1.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Minimum Fill Elimination
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-minimum-fill-elimination

Scope & limitations

  • Off-diagonal zero graph/cost entries denote absent edges; all matrix indices are zero-based. Declared ideal or supplied-record model only; no physical inspection, live control, certification or professional approval. Nonzero model inputs have magnitude from 1e-12 through 1e9; zero remains permitted only where the specific semantic model permits it. reportedValue and absoluteTolerance may use smaller finite magnitudes. Explicit matrix pivot/spectral conditioning floor is 1e-12 of the stated scale; symmetric eigensystem stopping is 1e-14 of scale. Matrix and enumeration bounds are input work profiles. Floating arithmetic uses finite double precision and twelve-significant-digit presentation; integral quantities must remain exactly representable. No external device or account is accessed. Aggregate enumeration estimates must not exceed 10000000 elementary work units per request. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Minimum Resolving Landmarks API

Choose the fewest landmarks that distinguish every vertex by distance.

Includes Private access follows the service-specific retention terms.

USD 1.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 1.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Minimum Resolving Landmarks API
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-minimum-resolving-landmarks

Scope & limitations

  • Connected unit-weight undirected graph; return unique distance signatures. Exact finite supplied graph model. Node order is supplied order; tie choices use node or edge indices. At most twelve vertices and sixty-six edges unless a stricter service profile applies. Integer weights are exact within the input profile. No network access, account change or live routing. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Shortest Cycle Witness

Find a shortest simple cycle by excluding each edge and finding a shortest replacement path.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Shortest Cycle Witness
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-shortest-cycle-witness

Scope & limitations

  • Forests return null. Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Data & automationCheckout & wallet API

Graph Spanning Tree Count Kirchhoff

Count spanning trees with an exact integer matrix-tree determinant and fraction-free elimination.

Includes Private access follows the service-specific retention terms.

USD 3.00 / completed job

Price per completed job. Review supported inputs, processing scope and live availability before checkout.

Choose payment · USD 3.00
USDC, EURC, DAI, PYUSD · wallet choices
  • USDC · Base
  • USDC · Arbitrum
  • USDC · Polygon
  • USDC · World
  • USDC · Monad
  • EURC · Base
  • EURC · World
  • DAI · Base
  • PYUSD · Arbitrum
  • PYUSD · Polygon
Details for Graph Spanning Tree Count Kirchhoff
What you receive
Private access follows the service-specific retention terms.
Input required
Use the exact hosted input schema and purchase.request example.
Pricing basis
Price per completed job. Review supported inputs, processing scope and live availability before checkout.
Availability
Wallet API available. Review the exact quote before payment. Browser checkout is separately qualified.

Browser checkout: available.

Product ID
graph-spanning-tree-count-kirchhoff

Scope & limitations

  • Supplied simple undirected graphs only; vertex IDs are zero-based integers. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.
  • One completed job; no automatic monthly billing. Private result access lasts 30 days.
Technical references

Qualified hosted service; current wallet availability checked at discovery

Ongoing care

Monthly monitoring

Private history and email notifications. Automatic monthly PayPal billing; cancel at any time. Availability is checked during setup.

Read monitoring availability as JSON ↗

Machine-readable by design

A clear path
for your agent.

Discover by category or product ID. Check availability before attempting a purchase. An existing storefront or source repository is a reference, not a wallet payment endpoint.

Discovery OpenAPI specification ↗ Checkout integration example ↗
  1. Discover products

    Read the catalog to match a task with an intended output or digital edition.

    GET /api/catalog/v1/products?category=tools
  2. Check availability

    Refresh the JSON catalog before purchase. Use an enabled browser checkout or wallet API offer. Skip items with neither channel available.

    product.checkout?.available || product.purchase.available
  3. Review the offer before purchase

    Follow the service schemas and quote URL. Save your private receipt, validate the wallet challenge against your spending policy, then retrieve the report or digital files.

    Discover → quote → authorize → retrieve

One source for people and agents

Inspect before you integrate.

The page and discovery API use the same product registry. Input, output, source status and delivery limits stay together.