{
  "system_prefix": null,
  "history_count": 1,
  "user_summary": {
    "text": "请详细回答：解释回溯算法的应用场景。汉诺塔问题是经典的递归教学案例，移动n个盘子需要先将n-1个盘子移到辅助柱。二叉树的遍历包括前序、中序和后序三种方式，它们都可以用递归简洁地实现。递归的深度过大会导致栈溢出，因此实际工程中常用迭代或尾递归优化。斐波那契数列中每个数字是前两个数字之和，用递归实现时需",
    "has_image": false,
    "has_tool_result": false
  },
  "assistant_summary": {
    "text": null,
    "tool_calls": [],
    "stop_reason": null
  }
}

{
  "user_message": "error[upstream_error]",
  "user_status": 502,
  "vendor_message": "{\"error\":{\"code\":\"AccountOverdueError\",\"message\":\"The request failed because your account has an overdue balance. Request id: 021788129412555de824baea9702e17bffa39e9c3bdc4f688ef32\",\"type\":\"Forbidden\"}}",
  "vendor_status": 403
}

Method: POST

URL: https://ark.cn-beijing.volces.com/api/v3/chat/completions

Headers:
{
  "authorization": "Bearer ark-f137c261-ce2c-4ac5-b065-fafb2270c3d7-1801e",
  "content-type": "application/json"
}

Body:
{
  "max_tokens": 300,
  "messages": [
    {
      "content": "请详细回答：解释回溯算法的应用场景。汉诺塔问题是经典的递归教学案例，移动n个盘子需要先将n-1个盘子移到辅助柱。二叉树的遍历包括前序、中序和后序三种方式，它们都可以用递归简洁地实现。递归的深度过大会导致栈溢出，因此实际工程中常用迭代或尾递归优化。斐波那契数列中每个数字是前两个数字之和，用递归实现时需要注意重复计算问题。例如计算阶乘时，n的阶乘等于n乘以n-1的阶乘，这就是典型的递归定义。理解递归的关键在于信任递归调用会正确工作，只需要关注当前层的逻辑。",
      "role": "user"
    }
  ],
  "model": "deepseek-v4-pro-ga-260813",
  "stream": false
}

Headers:
{
  "content-length": "212",
  "content-type": "application/json; charset=utf-8",
  "date": "Sun, 30 Aug 2026 22:36:51 GMT",
  "server": "istio-envoy",
  "x-envoy-upstream-service-time": "32",
  "x-request-id": "021788129412555de824baea9702e17bffa39e9c3bdc4f688ef32"
}

Body:
{
  "error": {
    "code": "AccountOverdueError",
    "message": "The request failed because your account has an overdue balance. Request id: 021788129412555de824baea9702e17bffa39e9c3bdc4f688ef32",
    "param": "",
    "type": "Forbidden"
  }
}

Method: POST

URL: /v1/chat/completions

Headers:
{
  "accept": "*/*",
  "accept-encoding": "gzip",
  "authorization": "Bearer sk_r4gAXloJQt74Cp4prb19OItKzoG77lLhjmWT4ei20Ua",
  "content-length": "770",
  "content-type": "application/json",
  "host": "api.tokendiet.cn",
  "user-agent": "Go-http-client/2.0",
  "via": "2.0 Caddy",
  "x-forwarded-for": "13.212.110.206",
  "x-forwarded-host": "api.tokendiet.cn",
  "x-forwarded-proto": "https"
}

Body:
{
  "model": "deepseek-v4-pro-g2",
  "messages": [
    {
      "role": "user",
      "content": "请详细回答：解释回溯算法的应用场景。汉诺塔问题是经典的递归教学案例，移动n个盘子需要先将n-1个盘子移到辅助柱。二叉树的遍历包括前序、中序和后序三种方式，它们都可以用递归简洁地实现。递归的深度过大会导致栈溢出，因此实际工程中常用迭代或尾递归优化。斐波那契数列中每个数字是前两个数字之和，用递归实现时需要注意重复计算问题。例如计算阶乘时，n的阶乘等于n乘以n-1的阶乘，这就是典型的递归定义。理解递归的关键在于信任递归调用会正确工作，只需要关注当前层的逻辑。"
    }
  ],
  "stream": false,
  "max_tokens": 300
}

Body:
{
  "error": {
    "message": "error[upstream_error]",
    "type": "Forbidden",
    "code": "upstream_error"
  }
}