# Reports and developer tools

Choose a defined job, inspect its input and result example, then review available payment options. Each is a one-time job with private JSON result access for 30 days. Save a downloaded copy.

## Dominant Resource Share Reconciliation

Service ID: dominant-resource-share-plan. USD 9.00 per job.

Reconcile divisible task allocations across heterogeneous resource capacities and see which cap or exhausted resource stops each task. Unweighted capped dominant-share progressive filling, fixed nonzero demand vectors; at most sixteen tasks, two to six resources and two independent records. Capacities are positive integers and demands/caps are nonnegative integers up to one million in consistent supplied units. Exact reduced fractions and event certificates preserve fractional work. Reported numerator and denominator fields accept safe integer numbers or canonical unsigned decimal strings without signs, whitespace, exponents or leading zeros; only the numerator may be zero. String numerators allow at most 141 digits and denominators at most 135 digits. Equivalent non-reduced claims are compared exactly. Whole-document limits still apply: 36,000 UTF-8 bytes, 6,000 value nodes and depth 24, with a 500,000-byte result profile; exact rational arithmetic retains its 16,384-bit and 100,000-operation guards. Individual fields fitting their bounds do not guarantee that all claims and identifiers fit together in one document. Zero-cap tasks freeze at event zero; simultaneous events freeze together in supplied order. Each event raises all active dominant shares equally until the next resource or cap limit. No indivisible-task scheduling, weights, arrivals, prediction or strategy-proofness claim. The shared pre-checkout check evaluates semantic dimensions, feasibility and the bounded exact calculation before acceptance. Private JSON report, retained for 30 days. One-time USD 9.00 job. Uses only supplied records; no external system changes. Exact within the stated finite model, with no inferred demand, travel data or operational guarantee. 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.

[Open this service](https://gatewayinformationgroup.com/data-tools?tool=dominant-resource-share-plan) · [Technical reference](https://www.usenix.org/legacy/events/nsdi11/tech/full_papers/Ghodsi.pdf)

Example input:

```json
{
  "records": [
    {
      "id": "R1",
      "resourceIds": [
        "CPU",
        "memory"
      ],
      "capacities": [
        12,
        12
      ],
      "tasks": [
        {
          "id": "A",
          "demand": [
            2,
            1
          ],
          "cap": 10
        },
        {
          "id": "B",
          "demand": [
            1,
            2
          ],
          "cap": 10
        }
      ],
      "reportedTaskAmounts": [
        {
          "numerator": 4,
          "denominator": 1
        },
        {
          "numerator": 4,
          "denominator": 1
        }
      ]
    }
  ]
}
```

Selected expected result fields:

```json
{
  "/records/0/taskAmounts": [
    {
      "numerator": "4",
      "denominator": "1"
    },
    {
      "numerator": "4",
      "denominator": "1"
    }
  ],
  "/records/0/dominantShares": [
    {
      "numerator": "2",
      "denominator": "3"
    },
    {
      "numerator": "2",
      "denominator": "3"
    }
  ],
  "/records/0/resourceUsage": [
    {
      "numerator": "12",
      "denominator": "1"
    },
    {
      "numerator": "12",
      "denominator": "1"
    }
  ],
  "/records/0/resourceSlack": [
    {
      "numerator": "0",
      "denominator": "1"
    },
    {
      "numerator": "0",
      "denominator": "1"
    }
  ],
  "/records/0/claimMatches": true
}
```

## Service Radius Center Plan Reconciliation

Service ID: discrete-service-radius-centers. USD 9.00 per job.

Choose permitted service centers to reduce the worst supplied distance and reconcile a recorded plan with complete finite-set witnesses. Exactly p distinct centers among at most twelve candidates and twenty-four demand points; one to six centers and two independent records. Enumerate every p-subset, at most 924, and minimize the maximum demand-to-nearest-selected-center distance. Nonnegative integer matrix entries up to one million use supplied consistent units; no symmetry, triangle inequality or geography is assumed. Equal objectives use lexicographically earliest supplied index tuple; assignments use earliest selected index on ties. Every subset carries a demand that prevents any strictly smaller radius, and all optimum ties are counted. No capacities, opening/shipping sum costs, center-to-center separation, road lookup or live dispatch. All matrix, reference and subset bounds are checked before checkout. Private JSON report, retained for 30 days. One-time USD 9.00 job. Uses only supplied records; no external system changes. Exact within the stated finite model, with no inferred demand, travel data or operational guarantee. 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.

[Open this service](https://gatewayinformationgroup.com/data-tools?tool=discrete-service-radius-centers) · [Technical reference](https://scipbook.readthedocs.io/en/latest/flp.html#the-k-center-problem)

Example input:

```json
{
  "records": [
    {
      "id": "R1",
      "centerIds": [
        "West",
        "Middle",
        "East"
      ],
      "demandIds": [
        "D0",
        "D4",
        "D10"
      ],
      "centerCount": 1,
      "distances": [
        [
          0,
          4,
          10
        ],
        [
          4,
          0,
          6
        ],
        [
          10,
          6,
          0
        ]
      ],
      "reportedCenters": [
        1
      ],
      "reportedRadius": 6
    }
  ]
}
```

Selected expected result fields:

```json
{
  "/records/0/selectedCenters": [
    1
  ],
  "/records/0/radius": 6,
  "/records/0/evaluatedSubsets": 3,
  "/records/0/optimalPlanCount": 1,
  "/records/0/reportedPlanRadius": 6,
  "/records/0/claimMatches": true
}
```

## Finite Point Set Hausdorff Witness API

Service ID: finite-pointset-hausdorff-witness. USD 1.00 per job.

Unordered finite point sets in dimension 2 or 3; each nonempty set has at most 128 distinct points, coordinates within plus/minus 1000000. Matching dimensions required; repeated points within a set reject, points shared across sets are allowed. Compute both directed max-min squared Euclidean distances and their symmetric maximum. Every source point receives one exact nearest witness; nearest-distance ties choose the smallest target input index, attaining-source ties choose the smallest source input index, and equal directional maxima select A_TO_B for the symmetric witness. Witness indices are zero-based positions in the submitted arrays. Distances are invariant to point order; witness indices follow input order. At most 16384 pair distances and 49152 coordinate-square terms; no randomization. Exact calculations on submitted integer coordinates in one caller-declared consistent Cartesian unit. Squared distances and dot products are authoritative decimal strings; no square-root approximation is returned. No map lookup, provider call, external access, data inference or live action. Strict bounds and semantic checks run in the existing pre-quote validation path. Private JSON result retained for 30 days; USD 1.00 per one-time job. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Open this service](https://gatewayinformationgroup.com/data-tools?tool=finite-pointset-hausdorff-witness) · [Technical reference](https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.distance.directed_hausdorff.html)

Example input:

```json
{
  "dimension": 2,
  "pointsA": [
    [
      0,
      0
    ],
    [
      2,
      0
    ]
  ],
  "pointsB": [
    [
      0,
      0
    ]
  ]
}
```

Selected expected result fields:

```json
{
  "/directedAB/squaredDistance": "4",
  "/directedBA/squaredDistance": "0",
  "/symmetricSquaredDistance": "4",
  "/symmetricWitness": {
    "direction": "A_TO_B",
    "sourceIndex": 1,
    "nearestIndex": 0
  }
}
```

## Planar Proximity Graph Pair API

Service ID: planar-proximity-graph-pair. USD 1.00 per job.

One combined relative-neighborhood/Gabriel graph offer from 1 through 48 distinct planar integer points. For candidate pair i<j, RNG excludes the edge iff a third point k has d(i,k)^2<d(i,j)^2 AND d(j,k)^2<d(i,j)^2; Gabriel excludes iff (k-i) dot (k-j)<0. These are open-lune and open-diameter-disk conventions: equality on a boundary does not exclude. Collinear, right-angle, cocircular and equidistant points are accepted. Every pair receives a decision for each graph, plus the smallest-index strictly interior exclusion witness when one exists. Kept edges have null exclusion witnesses. Edges/pair decisions sort by (i,j), input indices start at zero; the single-point graph has no edges. At most 1128 pair distances and 51888 third-point tests, each assessing both graphs. Exact calculations on submitted integer coordinates in one caller-declared consistent Cartesian unit. Squared distances and dot products are authoritative decimal strings; no square-root approximation is returned. No map lookup, provider call, external access, data inference or live action. Strict bounds and semantic checks run in the existing pre-quote validation path. Private JSON result retained for 30 days; USD 1.00 per one-time job. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

[Open this service](https://gatewayinformationgroup.com/data-tools?tool=planar-proximity-graph-pair) · [Technical reference](https://cgm.cs.mcgill.ca/~godfried/teaching/mir-reading-assignments/RNG.pdf)

Example input:

```json
{
  "points": [
    [
      0,
      0
    ],
    [
      1,
      0
    ],
    [
      2,
      0
    ]
  ]
}
```

Selected expected result fields:

```json
{
  "/relativeNeighborhoodEdges": [
    {
      "firstIndex": 0,
      "secondIndex": 1,
      "squaredLength": "1"
    },
    {
      "firstIndex": 1,
      "secondIndex": 2,
      "squaredLength": "1"
    }
  ],
  "/gabrielEdges": [
    {
      "firstIndex": 0,
      "secondIndex": 1,
      "squaredLength": "1"
    },
    {
      "firstIndex": 1,
      "secondIndex": 2,
      "squaredLength": "1"
    }
  ],
  "/pairDecisions/1/rngWitness": {
    "pointIndex": 1,
    "toFirstSquared": "1",
    "toSecondSquared": "1"
  },
  "/pairDecisions/1/gabrielWitness": {
    "pointIndex": 1,
    "dotProduct": "-1"
  }
}
```

Use authorized, non-sensitive input. Each service applies its stated profile and does not change external systems or provide professional certification. A quote is unpaid; a signature alone does not establish settlement.