{
  "x402Version": 2,
  "id": 2223,
  "slug": "2223",
  "resource": "https://agent-arcade.use.x402atlas.com/shortest-path/daily",
  "description": "Shortest Path daily graph — find the unique minimum-weight route in a deterministic directed or undirected graph.",
  "type": "http",
  "accepts": [
    {
      "scheme": "exact",
      "network": "eip155:8453",
      "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
      "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
      "amount": "5000",
      "maxTimeoutSeconds": 300
    },
    {
      "scheme": "exact",
      "network": "eip155:137",
      "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
      "asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
      "amount": "5000",
      "maxTimeoutSeconds": 300
    },
    {
      "scheme": "exact",
      "network": "eip155:42161",
      "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
      "asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
      "amount": "5000",
      "maxTimeoutSeconds": 300
    }
  ],
  "outputSchema": {
    "bazaar": {
      "category": "games",
      "info": {
        "input": {
          "method": "GET",
          "type": "http"
        },
        "output": {
          "example": {
            "attribution": null,
            "challenge_id": "sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1",
            "date": "2026-07-01",
            "difficulty": "normal",
            "game": "shortest-path",
            "generation_version": "v1",
            "prompt": {
              "directed": false,
              "edges": [
                {
                  "from": "n0",
                  "to": "n1",
                  "weight": 16
                },
                {
                  "from": "n1",
                  "to": "n2",
                  "weight": 23
                },
                {
                  "from": "n2",
                  "to": "n3",
                  "weight": 17
                },
                {
                  "from": "n3",
                  "to": "n4",
                  "weight": 16
                },
                {
                  "from": "n4",
                  "to": "n5",
                  "weight": 23
                },
                {
                  "from": "n5",
                  "to": "n6",
                  "weight": 17
                },
                {
                  "from": "n6",
                  "to": "n7",
                  "weight": 8
                },
                {
                  "from": "n7",
                  "to": "n8",
                  "weight": 12
                },
                {
                  "from": "n8",
                  "to": "n9",
                  "weight": 25
                },
                {
                  "from": "n0",
                  "to": "n3",
                  "weight": 23
                },
                {
                  "from": "n0",
                  "to": "n5",
                  "weight": 5
                },
                {
                  "from": "n1",
                  "to": "n5",
                  "weight": 21
                },
                {
                  "from": "n2",
                  "to": "n6",
                  "weight": 18
                },
                {
                  "from": "n4",
                  "to": "n9",
                  "weight": 1
                },
                {
                  "from": "n5",
                  "to": "n7",
                  "weight": 19
                }
              ],
              "nodes": [
                "n0",
                "n1",
                "n2",
                "n3",
                "n4",
                "n5",
                "n6",
                "n7",
                "n8",
                "n9"
              ],
              "source": "n0",
              "target": "n9"
            },
            "rules": {
              "answer_format": "ordered node ID path including source and target",
              "direction_rule": "follow prompt.directed: traverse from→to only when true; either direction when false",
              "edge_weights": "positive bounded integers",
              "maximum_path_nodes": 128,
              "objective": "minimum total edge weight",
              "repeated_nodes_allowed": true,
              "respect_edge_direction": false
            }
          },
          "type": "json"
        }
      },
      "schema": {
        "$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",
                  "generation_version",
                  "date",
                  "difficulty",
                  "prompt",
                  "rules",
                  "attribution"
                ],
                "type": "object"
              },
              "type": {
                "type": "string"
              }
            },
            "required": [
              "type"
            ],
            "type": "object"
          }
        },
        "required": [
          "input"
        ],
        "type": "object"
      },
      "tags": [
        "shortest-path",
        "graph",
        "dijkstra",
        "pathfinding",
        "optimization",
        "reasoning",
        "daily-challenge"
      ]
    }
  },
  "tags": [
    "bazaar"
  ],
  "sourceHost": "agent-arcade.use.x402atlas.com",
  "lastUpdated": "2026-09-15T06:32:13.199Z",
  "quality": {
    "calls30d": 6,
    "uniquePayers30d": 3,
    "lastCalledAt": "2026-09-15T06:32:13.075Z"
  },
  "liveness": {},
  "verified": false,
  "featured": false,
  "provider": {
    "host": "agent-arcade.use.x402atlas.com",
    "manifest_name": "agent-arcade.use.x402atlas.com",
    "source": "cdp-mirror",
    "source_manifest_url": "https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources",
    "submitted_at": "2026-09-18T22:00:31.484Z"
  }
}