ToolAssay

Shortest Path daily graph — find the unique minimum-weight route in a determinis

Shortest Path daily graph — find the unique minimum-weight route in a deterministic directed or undirected graph.

Answeringour last check, 2026-09-24
1 of 1checks answered this week
645 msmedian answer time
$0.005listed price per call
$0.005price it asked us

Paid test badge: not yet. The checks above are free: we call the tool without paying and read the payment request it sends back. The Verified badge needs paid calls whose answers match the promised output, and nobody can buy a badge.

Endpoint

GET https://agent-arcade.use.x402atlas.com/shortest-path/daily

CategoryEverything else
Provider hostagent-arcade.use.x402atlas.com
Networkseip155:137, eip155:42161, eip155:8453
Payment schemesexact
Self-reported calls, 30 days6 from 3 payers (the provider's figure, not ours)

Our checks, last 30 days

DayResultHTTPAskedTime
2026-09-24 valid payment request 402$0.005 645 ms

Example input (from the provider)

{
  "method": "GET",
  "type": "http"
}

Promised output schema (from the provider)

{
  "$schema": "https://json-schema.org/draft/2020-12/schema",
  "properties": {
    "input": {
      "additionalProperties": false,
      "properties": {
        "method": {
          "enum": [
            "GET"
          ],
          "type": "string"
        },
        "queryParams": {
          "additionalProperties": false,
          "description": "Shortest Path daily takes no query parameters; it always returns today's UTC graph.",
          "properties": {},
          "type": "object"
        },
        "type": {
          "const": "http",
          "type": "string"
        }
      },
      "required": [
        "type",
        "method"
      ],
      "type": "object"
    },
    "output": {
      "properties": {
        "example": {
          "additionalProperties": false,
          "description": "Shortest Path daily weighted-graph challenge envelope.",
          "properties": {
            "attribution": {
              "description": "Always null because Shortest Path is natively generated.",
              "type": "null"
            },
            "challenge_id": {
              "description": "Canonical content-addressed Shortest Path challenge identity.",
              "pattern": "^sha256:[0-9a-f]{64}$",
              "type": "string"
            },
            "date": {
              "description": "UTC Shortest Path challenge date.",
              "format": "date",
              "type": "string"
            },
            "difficulty": {
              "description": "Shortest Path challenge difficulty.",
              "enum": [
                "normal"
              ],
              "type": "string"
            },
            "game": {
              "description": "Shortest Path game identity.",
              "enum": [
                "shortest-path"
              ],
              "type": "string"
            },
            "generation_version": {
              "description": "Pinned Shortest Path generator version.",
              "enum": [
                "v1"
              ],
              "type": "string"
            },
            "prompt": {
              "additionalProperties": false,
              "description": "Shortest Path bounded weighted graph, source, and target.",
              "properties": {
                "directed": {
                  "type": "boolean"
                },
                "edges": {
                  "items": {
                    "additionalProperties": false,
                    "description": "One declared Shortest Path weighted edge.",
                    "properties": {
                      "from": {
                        "maxLength": 32,
                        "minLength": 1,
                        "pattern": "^[A-Za-z0-9_-]+$",
                        "type": "string"
                      },
                      "to": {
                        "maxLength": 32,
                        "minLength": 1,
                        "pattern": "^[A-Za-z0-9_-]+$",
                        "type": "string"
                      },
                      "weight": {
                        "maximum": 100,
                        "minimum": 1,
                        "type": "integer"
                      }
                    },
                    "required": [
                      "from",
                      "to",
                      "weight"
                    ],
                    "type": "object"
                  },
                  "maxItems": 256,
                  "minItems": 1,
                  "type": "array"
                },
                "nodes": {
                  "items": {
                    "maxLength": 32,
                    "minLength": 1,
                    "pattern": "^[A-Za-z0-9_-]+$",
                    "type": "string"
                  },
                  "maxItems": 64,
                  "minItems": 2,
                  "type": "array",
                  "uniqueItems": true
                },
                "source": {
                  "maxLength": 32,
                  "minLength": 1,
                  "pattern": "^[A-Za-z0-9_-]+$",
                  "type": "string"
                },
                "target": {
                  "maxLength": 32,
                  "minLength": 1,
                  "pattern": "^[A-Za-z0-9_-]+$",
                  "type": "string"
                }
              },
              "required": [
                "directed",
                "nodes",
                "edges",
                "source",
                "target"
              ],
              "type": "object"
            },
            "rules": {
              "additionalProperties": false,
              "description": "Complete Shortest Path v1 direction, weight, and optimality rules.",
              "properties": {
                "answer_format": {
                  "type": "string"
                },
                "direction_rule": {
                  "type": "string"
                },
                "edge_weights": {
                  "type": "string"
                },
                "maximum_path_nodes": {
                  "enum": [
                    128
                  ],
                  "type": "integer"
                },
                "objective": {
                  "type": "string"
                },
                "repeated_nodes_allowed": {
                  "const": true,
                  "type": "boolean"
                },
                "respect_edge_direction": {
                  "type": "boolean"
                }
              },
              "required": [
                "answer_format",
                "edge_weights",
                "respect_edge_direction",
                "direction_rule",
                "repeated_nodes_allowed",
                "objective",
                "maximum_path_nodes"
              ],
              "type": "object"
            }
          },
          "required": [
            "challenge_id",
            "game",
            "gen

This page as JSON