[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7C0QYVDAFVFXXVC4ZC5MC6A":3,"skill-same:01M7C0QYVDAFVFXXVC4ZC5MC6A":51},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":6,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":30,"install":31,"resources":44},"01M7C0QYVDAFVFXXVC4ZC5MC6A","dialogue-graph",null,"A library for building, validating, visualizing, and serializing dialogue graphs. Use this when parsing scripts or creating branching narrative structures.","linyouxue\u002Fskill-repair-benchmark","linyouxue","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F216151464?v=4","01M7BJEVCXKD74KH6FG9CBVSQB","林宥学","01M7BJEVE02NP217V93BKZFC0J",0,"Apache-2.0","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fevaluation\u002Fresults\u002FSkillOpt-adapted-gpt52-n3L4R2-v25\u002Ftasks\u002Fdialogue-parser\u002Frepaired_skill\u002Fdialogue-graph\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: dialogue-graph\ndescription: A library for building, validating, visualizing, and serializing dialogue graphs. Use this when parsing scripts or creating branching narrative structures.\n---\n\n# Dialogue Graph Skill\n\nThis skill provides a `dialogue_graph` module to easily build valid dialogue trees\u002Fgraphs.\n\n## When to use\n\n*   **Script Parsers**: When converting text to data.\n*   **Dialogue Editors**: When building tools to edit conversation flow.\n*   **Game Logic**: When traversing a dialogue tree.\n*   **Visualization**: When generating visual diagrams of dialogue flows.\n\n## How to use\n\nImport the module:\n```python\nfrom dialogue_graph import Graph, Node, Edge\n```\n\n### 1. The `Graph` Class\nThe main container.\n\n```python\ngraph = Graph()\n```\n\n### 2. Adding Nodes\nDefine content nodes.\n\n```python\n# Regular line\ngraph.add_node(Node(id=\"Start\", speaker=\"Guard\", text=\"Halt!\", type=\"line\"))\n\n# Choice hub\ngraph.add_node(Node(id=\"Choices\", type=\"choice\"))\n```\n\n### 3. Adding Edges\nConnect nodes (transitions).\n\n```python\n# Simple transition\ngraph.add_edge(Edge(source=\"Start\", target=\"Choices\"))\n\n# Choice transition (with text)\ngraph.add_edge(Edge(source=\"Choices\", target=\"End\", text=\"1. Run away\"))\n```\n\n### 4. Export\nSerialize to JSON format for the engine.\n\n```python\ndata = graph.to_dict()\n# Before serialization, convert Edge(source, target, text) objects to:\n# {\"from\": source, \"to\": target, \"text\": text}\n# The evaluator-facing JSON is exactly:\n# {\"nodes\":[{\"id\":\"\",\"text\":\"\",\"speaker\":\"\",\"type\":\"\"}],\n#  \"edges\":[{\"from\":\"\",\"to\":\"\",\"text\":\"\"}]}\njson_str = json.dumps(data, sort_keys=False, separators=(\",\", \":\"))\n```\n\n### 5. Validation\nCheck for integrity.\n\n```python\nerrors = graph.validate()\n# Returns list of strings, e.g., [\"Edge 'Start'->'Unk' points to missing node 'Unk'\"]\n```\n\n### 6. Visualization\nGenerate a PNG\u002FSVG graph diagram.\n\n```python\n# Requires: pip install graphviz\n# Also requires Graphviz binary: https:\u002F\u002Fgraphviz.org\u002Fdownload\u002F\n\ngraph.visualize('dialogue_graph')  # Creates dialogue_graph.png\ngraph.visualize('output', format='svg')  # Creates output.svg\n```\n\nThe visualization includes:\n- **Diamond shapes** for choice nodes (light blue)\n- **Rounded boxes** for dialogue nodes (colored by speaker)\n- **Bold blue edges** for skill-check choices like `[Lie]`, `[Attack]`\n- **Gray edges** for regular choices\n- **Black edges** for simple transitions\n\n### 7. Loading from JSON\nLoad an existing dialogue graph.\n\n```python\n# From file\ngraph = Graph.from_file('dialogue.json')\n\n# From dict\ngraph = Graph.from_dict({'nodes': [...], 'edges': [...]})\n\n# From JSON string\ngraph = Graph.from_json(json_string)\n```\n\n\n\n## Task-oriented script parsing contract\n\nFor the parser task, implement `def parse_script(text: str)` in `\u002Fapp\u002Fsolution.py`. It may return the dictionary directly or a `Graph`, but the final serialized object must have exactly the top-level keys `nodes` and `edges`, with node objects containing exactly `id`, `text`, `speaker`, and `type`, and edge objects containing exactly `from`, `to`, and `text`.\n\n### Grammar and deterministic construction\n\nParse the input line by line after normalizing newlines. Ignore blank lines, but do not silently ignore nonblank malformed lines. The supported forms are:\n\n```text\n[SceneId]\nSpeaker: dialogue text -> Target\nN. choice text -> Target\nN. [Tag] choice text -> Target\n```\n\n`SceneId`, `Speaker`, and `Target` are nonempty strings without the surrounding brackets, colon, or arrow. A choice number is one or more decimal digits followed by a period. The arrow target is required on every dialogue and choice line. Split dialogue at the final valid ` -> ` separator so dialogue text can contain other punctuation; split a choice similarly. Trim surrounding whitespace from fields.\n\nHeaders are labels, not emitted nodes. Maintain a label table from each header identifier to the first generated node for that section. A section containing choices maps its header to one choice hub; a section containing dialogue maps its header to its first line node. Reject duplicate headers. A target must resolve to a header label or the special terminal target `End`.\n\nCreate dialogue nodes in source order with deterministic IDs `line_001`, `line_002`, and so on. Their `type` is `line`, `speaker` is the parsed speaker, and `text` is the dialogue text without the arrow and target. For consecutive dialogue lines in one section, add a simple edge from each line to the next line. The final dialogue line's target edge goes to the resolved target.\n\nFor each contiguous block of numbered choices, create one deterministic hub node with ID `choice_\u003CSceneId>` (use a collision-safe deterministic suffix if the same sanitized ID would collide). Its `type` is `choice`, and its `text` and `speaker` are empty strings. The section label resolves to this hub. Add one edge from the hub for each choice in source order. The edge `text` is the trimmed choice text after the numeric prefix, including an optional bracketed tag such as `[Lie]` or `[Attack]`; preserve the tag exactly rather than discarding it. Choice numbers determine ordering and are not required in the edge text. Repeated destinations are valid and must produce separate edges. Do not create implicit nodes for choices: all choice destinations resolve through the label table or `End`.\n\nWhen `End` is referenced, create exactly one terminal node with ID `End`, empty `text` and `speaker`, and `type` `terminal` if it is not already present. `End` is the only permitted unresolved target and may have multiple incoming edges. A literal `[End]` header is not needed and should be rejected as a duplicate\u002Fconflicting terminal declaration. The first generated line or choice hub in the first section is the graph's start node.\n\nUse stable source order for nodes and edges: line nodes and hubs are emitted in the order their sections\u002Fcontent first appear, and edges are emitted in construction order. Do not use hash iteration order for serialization. Convert library `Edge(source, target, text)` values explicitly to `{\"from\": edge.source, \"to\": edge.target, \"text\": edge.text}`; never expose `source` or `target` in the final JSON.\n\n### Errors and validation\n\nRaise a clear `ValueError` containing the 1-based input line number for malformed nonblank lines, including an invalid header, missing speaker colon, missing `->` target, missing choice number, empty choice text, or empty target. Reject an unknown non-terminal target with an error identifying the source and target. Reject duplicate labels. A section must contain at least one valid dialogue line or choice block.\n\nAfter construction, validate that every non-terminal edge target exists, that every generated node is reachable from the first parsed node, and that the special `End` node is allowed as a terminal target. Multiple paths to `End` must remain valid. Report missing targets and unreachable node IDs explicitly instead of silently repairing them.\n\n### Required files and DOT output\n\nWhen run as the task solution, read `\u002Fapp\u002Fscript.txt`, call `parse_script`, validate the result, and write stable JSON to `\u002Fapp\u002Fdialogue.json` using UTF-8 and deterministic separators. Also write `\u002Fapp\u002Fdialogue.dot`. The DOT graph must contain the same nodes and edges as the JSON, use quoted IDs, escape backslashes, quotes, and newlines in labels, and use edge labels from the serialized `text` field. Give `choice` nodes a distinct shape (for example `diamond`), terminal nodes a distinct shape, and line nodes a readable shape; styling must not change graph semantics.\n\n### Representative example and tests\n\nFor the input:\n\n```text\n[GateScene]\nGuard: Halt! State your name and business. -> NameChoice\n\n[NameChoice]\n1. I am Sir Aldric, Knight of the Realm. -> KnightPath\n2. Just a humble traveler seeking shelter. -> TravelerPath\n3. [Lie] I'm a merchant with important goods. -> MerchantPath\n4. [Attack] Draw your sword! -> CombatStart\n```\n\n`GateScene` resolves to a `line_001` node, `NameChoice` resolves to its choice hub, and the hub has four ordered outgoing edges whose texts retain `[Lie]` and `[Attack]`. The parser must also be tested with ordinary dialogue lines, tagged and untagged choices, repeated destinations, a terminal `-> End`, multiple incoming edges to `End`, an unknown target, an unreachable section, and malformed lines such as `Guard: missing target`. Tests should assert exact node\u002Fedge keys, deterministic IDs and ordering, preservation of choice tags, and matching JSON\u002FDOT edge semantics.\n","# Dialogue Graph Skill\n\nThis skill provides a `dialogue_graph` module to easily build valid dialogue trees\u002Fgraphs.\n\n## When to use\n\n*   **Script Parsers**: When converting text to data.\n*   **Dialogue Editors**: When building tools to edit conversation flow.\n*   **Game Logic**: When traversing a dialogue tree.\n*   **Visualization**: When generating visual diagrams of dialogue flows.\n\n## How to use\n\nImport the module:\n```python\nfrom dialogue_graph import Graph, Node, Edge\n```\n\n### 1. The `Graph` Class\nThe main container.\n\n```python\ngraph = Graph()\n```\n\n### 2. Adding Nodes\nDefine content nodes.\n\n```python\n# Regular line\ngraph.add_node(Node(id=\"Start\", speaker=\"Guard\", text=\"Halt!\", type=\"line\"))\n\n# Choice hub\ngraph.add_node(Node(id=\"Choices\", type=\"choice\"))\n```\n\n### 3. Adding Edges\nConnect nodes (transitions).\n\n```python\n# Simple transition\ngraph.add_edge(Edge(source=\"Start\", target=\"Choices\"))\n\n# Choice transition (with text)\ngraph.add_edge(Edge(source=\"Choices\", target=\"End\", text=\"1. Run away\"))\n```\n\n### 4. Export\nSerialize to JSON format for the engine.\n\n```python\ndata = graph.to_dict()\n# Before serialization, convert Edge(source, target, text) objects to:\n# {\"from\": source, \"to\": target, \"text\": text}\n# The evaluator-facing JSON is exactly:\n# {\"nodes\":[{\"id\":\"\",\"text\":\"\",\"speaker\":\"\",\"type\":\"\"}],\n#  \"edges\":[{\"from\":\"\",\"to\":\"\",\"text\":\"\"}]}\njson_str = json.dumps(data, sort_keys=False, separators=(\",\", \":\"))\n```\n\n### 5. Validation\nCheck for integrity.\n\n```python\nerrors = graph.validate()\n# Returns list of strings, e.g., [\"Edge 'Start'->'Unk' points to missing node 'Unk'\"]\n```\n\n### 6. Visualization\nGenerate a PNG\u002FSVG graph diagram.\n\n```python\n# Requires: pip install graphviz\n# Also requires Graphviz binary: https:\u002F\u002Fgraphviz.org\u002Fdownload\u002F\n\ngraph.visualize('dialogue_graph')  # Creates dialogue_graph.png\ngraph.visualize('output', format='svg')  # Creates output.svg\n```\n\nThe visualization includes:\n- **Diamond shapes** for choice nodes (light blue)\n- **Rounded boxes** for dialogue nodes (colored by speaker)\n- **Bold blue edges** for skill-check choices like `[Lie]`, `[Attack]`\n- **Gray edges** for regular choices\n- **Black edges** for simple transitions\n\n### 7. Loading from JSON\nLoad an existing dialogue graph.\n\n```python\n# From file\ngraph = Graph.from_file('dialogue.json')\n\n# From dict\ngraph = Graph.from_dict({'nodes': [...], 'edges': [...]})\n\n# From JSON string\ngraph = Graph.from_json(json_string)\n```\n\n\n\n## Task-oriented script parsing contract\n\nFor the parser task, implement `def parse_script(text: str)` in `\u002Fapp\u002Fsolution.py`. It may return the dictionary directly or a `Graph`, but the final serialized object must have exactly the top-level keys `nodes` and `edges`, with node objects containing exactly `id`, `text`, `speaker`, and `type`, and edge objects containing exactly `from`, `to`, and `text`.\n\n### Grammar and deterministic construction\n\nParse the input line by line after normalizing newlines. Ignore blank lines, but do not silently ignore nonblank malformed lines. The supported forms are:\n\n```text\n[SceneId]\nSpeaker: dialogue text -> Target\nN. choice text -> Target\nN. [Tag] choice text -> Target\n```\n\n`SceneId`, `Speaker`, and `Target` are nonempty strings without the surrounding brackets, colon, or arrow. A choice number is one or more decimal digits followed by a period. The arrow target is required on every dialogue and choice line. Split dialogue at the final valid ` -> ` separator so dialogue text can contain other punctuation; split a choice similarly. Trim surrounding whitespace from fields.\n\nHeaders are labels, not emitted nodes. Maintain a label table from each header identifier to the first generated node for that section. A section containing choices maps its header to one choice hub; a section containing dialogue maps its header to its first line node. Reject duplicate headers. A target must resolve to a header label or the special terminal target `End`.\n\nCreate dialogue nodes in source order with deterministic IDs `line_001`, `line_002`, and so on. Their `type` is `line`, `speaker` is the parsed speaker, and `text` is the dialogue text without the arrow and target. For consecutive dialogue lines in one section, add a simple edge from each line to the next line. The final dialogue line's target edge goes to the resolved target.\n\nFor each contiguous block of numbered choices, create one deterministic hub node with ID `choice_\u003CSceneId>` (use a collision-safe deterministic suffix if the same sanitized ID would collide). Its `type` is `choice`, and its `text` and `speaker` are empty strings. The section label resolves to this hub. Add one edge from the hub for each choice in source order. The edge `text` is the trimmed choice text after the numeric prefix, including an optional bracketed tag such as `[Lie]` or `[Attack]`; preserve the tag exactly rather than discarding it. Choice numbers determine ordering and are not required in the edge text. Repeated destinations are valid and must produce separate edges. Do not create implicit nodes for choices: all choice destinations resolve through the label table or `End`.\n\nWhen `End` is referenced, create exactly one terminal node with ID `End`, empty `text` and `speaker`, and `type` `terminal` if it is not already present. `End` is the only permitted unresolved target and may have multiple incoming edges. A literal `[End]` header is not needed and should be rejected as a duplicate\u002Fconflicting terminal declaration. The first generated line or choice hub in the first section is the graph's start node.\n\nUse stable source order for nodes and edges: line nodes and hubs are emitted in the order their sections\u002Fcontent first appear, and edges are emitted in construction order. Do not use hash iteration order for serialization. Convert library `Edge(source, target, text)` values explicitly to `{\"from\": edge.source, \"to\": edge.target, \"text\": edge.text}`; never expose `source` or `target` in the final JSON.\n\n### Errors and validation\n\nRaise a clear `ValueError` containing the 1-based input line number for malformed nonblank lines, including an invalid header, missing speaker colon, missing `->` target, missing choice number, empty choice text, or empty target. Reject an unknown non-terminal target with an error identifying the source and target. Reject duplicate labels. A section must contain at least one valid dialogue line or choice block.\n\nAfter construction, validate that every non-terminal edge target exists, that every generated node is reachable from the first parsed node, and that the special `End` node is allowed as a terminal target. Multiple paths to `End` must remain valid. Report missing targets and unreachable node IDs explicitly instead of silently repairing them.\n\n### Required files and DOT output\n\nWhen run as the task solution, read `\u002Fapp\u002Fscript.txt`, call `parse_script`, validate the result, and write stable JSON to `\u002Fapp\u002Fdialogue.json` using UTF-8 and deterministic separators. Also write `\u002Fapp\u002Fdialogue.dot`. The DOT graph must contain the same nodes and edges as the JSON, use quoted IDs, escape backslashes, quotes, and newlines in labels, and use edge labels from the serialized `text` field. Give `choice` nodes a distinct shape (for example `diamond`), terminal nodes a distinct shape, and line nodes a readable shape; styling must not change graph semantics.\n\n### Representative example and tests\n\nFor the input:\n\n```text\n[GateScene]\nGuard: Halt! State your name and business. -> NameChoice\n\n[NameChoice]\n1. I am Sir Aldric, Knight of the Realm. -> KnightPath\n2. Just a humble traveler seeking shelter. -> TravelerPath\n3. [Lie] I'm a merchant with important goods. -> MerchantPath\n4. [Attack] Draw your sword! -> CombatStart\n```\n\n`GateScene` resolves to a `line_001` node, `NameChoice` resolves to its choice hub, and the hub has four ordered outgoing edges whose texts retain `[Lie]` and `[Attack]`. The parser must also be tested with ordinary dialogue lines, tagged and untagged choices, repeated destinations, a terminal `-> End`, multiple incoming edges to `End`, an unknown target, an unreachable section, and malformed lines such as `Guard: missing target`. Tests should assert exact node\u002Fedge keys, deterministic IDs and ordering, preservation of choice tags, and matching JSON\u002FDOT edge semantics.\n",{"name":5,"description":7},"main","cdcb6d230f3b15c3c33f8a2bdd16439f43602cbe","evaluation\u002Fresults\u002FSkillOpt-adapted-gpt52-n3L4R2-v25\u002Ftasks\u002Fdialogue-parser\u002Frepaired_skill\u002Fdialogue-graph",1,"https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark","https:\u002F\u002Fgithub.com\u002Flinyouxue","2026-11-14 20:28:35",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add linyouxue\u002Fskill-repair-benchmark --skill dialogue-graph",{"tool":37,"command":38},"bunx","bunx skills add linyouxue\u002Fskill-repair-benchmark --skill dialogue-graph",{"tool":40,"command":41},"pnpm","pnpm dlx skills add linyouxue\u002Fskill-repair-benchmark --skill dialogue-graph","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fevaluation\u002Fresults\u002FSkillOpt-adapted-gpt52-n3L4R2-v25\u002Ftasks\u002Fdialogue-parser\u002Frepaired_skill\u002Fdialogue-graph\u002FSKILL.md",true,[45],{"path":46,"resourceType":47,"resourceTypeDesc":48,"sizeBytes":49,"sourceHtmlUrl":50},"scripts\u002Fdialogue_graph.py","SCRIPT","脚本",5793,"https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fevaluation\u002Fresults\u002FSkillOpt-adapted-gpt52-n3L4R2-v25\u002Ftasks\u002Fdialogue-parser\u002Frepaired_skill\u002Fdialogue-graph\u002Fscripts\u002Fdialogue_graph.py",[52,59,66,73,78,83],{"skillNo":53,"name":54,"nameZh":6,"description":55,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":56,"categories":57,"keywords":58,"publishedAt":19},"01M7E1HGVRY73NBJ022CJG13X6","video-frame-extraction","Extract frames from video files and save them as images using OpenCV","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fvideo-frame-extraction\u002FSKILL.md",[],[],{"skillNo":60,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":63,"categories":64,"keywords":65,"publishedAt":19},"01M7E1HAG5R7CJ9C8NYJS771MB","openai-vision","Analyze images and multi-frame sequences using OpenAI GPT vision models","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fopenai-vision\u002FSKILL.md",[],[],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":19},"01M7E1H7DADKB6QBWKC2KQ63SZ","image-ocr","Extract text content from images using Tesseract OCR via Python, including structured field extraction from receipts and forms","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fimage-ocr\u002FSKILL.md",[],[],{"skillNo":74,"name":54,"nameZh":6,"description":55,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":75,"categories":76,"keywords":77,"publishedAt":19},"01M7E1H0WBNT43TENGQY7AVZHD","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fvideo-frame-extraction\u002FSKILL.md",[],[],{"skillNo":79,"name":61,"nameZh":6,"description":62,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":80,"categories":81,"keywords":82,"publishedAt":19},"01M7E1GTC7D4N4Q2EF03875J9E","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fopenai-vision\u002FSKILL.md",[],[],{"skillNo":84,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":19},"01M7E1GQ92CWFMGH53KSSE4WER","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fimage-ocr\u002FSKILL.md",[],[]]