[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6XG2FD4VAX4F1YD0APDDYDA":3,"skill-same:01M6XG2FD4VAX4F1YD0APDDYDA":83},{"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":38,"linkOnly":39,"markdownContent":40,"markdownBody":41,"frontMatter":42,"refName":57,"commitSha":58,"skillDirectory":59,"forksCount":14,"repositoryHtmlUrl":60,"repositoryHomepageUrl":6,"ownerHtmlUrl":61,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":62,"install":63,"resources":76},"01M6XG2FD4VAX4F1YD0APDDYDA","faiss",null,"Facebook's library for efficient similarity search and clustering of dense vectors. Supports billions of vectors, GPU acceleration, and various index types (Flat, IVF, HNSW). Use for fast k-NN search, large-scale vector retrieval, or when you need pure similarity search without metadata. Best for high-performance applications.","fadrienne\u002FMyGitHub","fadrienne","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F197874571?v=4","01M6X64V8VWCRSMFZ4EPS2BWXG","Francesca Adrienne","01M6X64VD5MW4F9PHDWQKS7ZAF",0,"MIT","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fopenscience\u002Fbackend\u002Fcli\u002Fskills\u002Fllm-tools\u002Ffaiss\u002FSKILL.md",[],[5,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37],"high-performance","when","you","types","Large Scale","K-NN","Billion-Scale","GPU Acceleration","Facebook AI","CPU","performance","synthetic","Tools","clustering","library","high performance","vector","search","rag","2026-11-10 10:12:30",false,"---\nname: faiss\ndescription: Facebook's library for efficient similarity search and clustering of dense vectors. Supports billions of vectors, GPU acceleration, and various index types (Flat, IVF, HNSW). Use for fast k-NN search, large-scale vector retrieval, or when you need pure similarity search without metadata. Best for high-performance applications.\ncategory: llm-tools\nversion: 1.0.0\nauthor: Synthetic Sciences\nlicense: MIT\ntags: [RAG, FAISS, Similarity Search, Vector Search, Facebook AI, GPU Acceleration, Billion-Scale, K-NN, HNSW, High Performance, Large Scale]\ndependencies: [faiss-cpu, faiss-gpu, numpy]\n---\n\n# FAISS - Efficient Similarity Search\n\nFacebook AI's library for billion-scale vector similarity search.\n\n## When to use FAISS\n\n**Use FAISS when:**\n- Need fast similarity search on large vector datasets (millions\u002Fbillions)\n- GPU acceleration required\n- Pure vector similarity (no metadata filtering needed)\n- High throughput, low latency critical\n- Offline\u002Fbatch processing of embeddings\n\n**Metrics**:\n- **31,700+ GitHub stars**\n- Meta\u002FFacebook AI Research\n- **Handles billions of vectors**\n- **C++** with Python bindings\n\n**Use alternatives instead**:\n- **Chroma\u002FPinecone**: Need metadata filtering\n- **Weaviate**: Need full database features\n- **Annoy**: Simpler, fewer features\n\n## Quick start\n\n### Installation\n\n```bash\n# CPU only\npip install faiss-cpu\n\n# GPU support\npip install faiss-gpu\n```\n\n### Basic usage\n\n```python\nimport faiss\nimport numpy as np\n\n# Create sample data (1000 vectors, 128 dimensions)\nd = 128\nnb = 1000\nvectors = np.random.random((nb, d)).astype('float32')\n\n# Create index\nindex = faiss.IndexFlatL2(d)  # L2 distance\nindex.add(vectors)             # Add vectors\n\n# Search\nk = 5  # Find 5 nearest neighbors\nquery = np.random.random((1, d)).astype('float32')\ndistances, indices = index.search(query, k)\n\nprint(f\"Nearest neighbors: {indices}\")\nprint(f\"Distances: {distances}\")\n```\n\n## Index types\n\n### 1. Flat (exact search)\n\n```python\n# L2 (Euclidean) distance\nindex = faiss.IndexFlatL2(d)\n\n# Inner product (cosine similarity if normalized)\nindex = faiss.IndexFlatIP(d)\n\n# Slowest, most accurate\n```\n\n### 2. IVF (inverted file) - Fast approximate\n\n```python\n# Create quantizer\nquantizer = faiss.IndexFlatL2(d)\n\n# IVF index with 100 clusters\nnlist = 100\nindex = faiss.IndexIVFFlat(quantizer, d, nlist)\n\n# Train on data\nindex.train(vectors)\n\n# Add vectors\nindex.add(vectors)\n\n# Search (nprobe = clusters to search)\nindex.nprobe = 10\ndistances, indices = index.search(query, k)\n```\n\n### 3. HNSW (Hierarchical NSW) - Best quality\u002Fspeed\n\n```python\n# HNSW index\nM = 32  # Number of connections per layer\nindex = faiss.IndexHNSWFlat(d, M)\n\n# No training needed\nindex.add(vectors)\n\n# Search\ndistances, indices = index.search(query, k)\n```\n\n### 4. Product Quantization - Memory efficient\n\n```python\n# PQ reduces memory by 16-32×\nm = 8   # Number of subquantizers\nnbits = 8\nindex = faiss.IndexPQ(d, m, nbits)\n\n# Train and add\nindex.train(vectors)\nindex.add(vectors)\n```\n\n## Save and load\n\n```python\n# Save index\nfaiss.write_index(index, \"large.index\")\n\n# Load index\nindex = faiss.read_index(\"large.index\")\n\n# Continue using\ndistances, indices = index.search(query, k)\n```\n\n## GPU acceleration\n\n```python\n# Single GPU\nres = faiss.StandardGpuResources()\nindex_cpu = faiss.IndexFlatL2(d)\nindex_gpu = faiss.index_cpu_to_gpu(res, 0, index_cpu)  # GPU 0\n\n# Multi-GPU\nindex_gpu = faiss.index_cpu_to_all_gpus(index_cpu)\n\n# 10-100× faster than CPU\n```\n\n## LangChain integration\n\n```python\nfrom langchain_community.vectorstores import FAISS\nfrom langchain_openai import OpenAIEmbeddings\n\n# Create FAISS vector store\nvectorstore = FAISS.from_documents(docs, OpenAIEmbeddings())\n\n# Save\nvectorstore.save_local(\"faiss_index\")\n\n# Load\nvectorstore = FAISS.load_local(\n    \"faiss_index\",\n    OpenAIEmbeddings(),\n    allow_dangerous_deserialization=True\n)\n\n# Search\nresults = vectorstore.similarity_search(\"query\", k=5)\n```\n\n## LlamaIndex integration\n\n```python\nfrom llama_index.vector_stores.faiss import FaissVectorStore\nimport faiss\n\n# Create FAISS index\nd = 1536\nfaiss_index = faiss.IndexFlatL2(d)\n\nvector_store = FaissVectorStore(faiss_index=faiss_index)\n```\n\n## Best practices\n\n1. **Choose right index type** - Flat for \u003C10K, IVF for 10K-1M, HNSW for quality\n2. **Normalize for cosine** - Use IndexFlatIP with normalized vectors\n3. **Use GPU for large datasets** - 10-100× faster\n4. **Save trained indices** - Training is expensive\n5. **Tune nprobe\u002Fef_search** - Balance speed\u002Faccuracy\n6. **Monitor memory** - PQ for large datasets\n7. **Batch queries** - Better GPU utilization\n\n## Performance\n\n| Index Type | Build Time | Search Time | Memory | Accuracy |\n|------------|------------|-------------|--------|----------|\n| Flat | Fast | Slow | High | 100% |\n| IVF | Medium | Fast | Medium | 95-99% |\n| HNSW | Slow | Fastest | High | 99% |\n| PQ | Medium | Fast | Low | 90-95% |\n\n## Resources\n\n- **GitHub**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss ⭐ 31,700+\n- **Wiki**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss\u002Fwiki\n- **License**: MIT\n\n\n","# FAISS - Efficient Similarity Search\n\nFacebook AI's library for billion-scale vector similarity search.\n\n## When to use FAISS\n\n**Use FAISS when:**\n- Need fast similarity search on large vector datasets (millions\u002Fbillions)\n- GPU acceleration required\n- Pure vector similarity (no metadata filtering needed)\n- High throughput, low latency critical\n- Offline\u002Fbatch processing of embeddings\n\n**Metrics**:\n- **31,700+ GitHub stars**\n- Meta\u002FFacebook AI Research\n- **Handles billions of vectors**\n- **C++** with Python bindings\n\n**Use alternatives instead**:\n- **Chroma\u002FPinecone**: Need metadata filtering\n- **Weaviate**: Need full database features\n- **Annoy**: Simpler, fewer features\n\n## Quick start\n\n### Installation\n\n```bash\n# CPU only\npip install faiss-cpu\n\n# GPU support\npip install faiss-gpu\n```\n\n### Basic usage\n\n```python\nimport faiss\nimport numpy as np\n\n# Create sample data (1000 vectors, 128 dimensions)\nd = 128\nnb = 1000\nvectors = np.random.random((nb, d)).astype('float32')\n\n# Create index\nindex = faiss.IndexFlatL2(d)  # L2 distance\nindex.add(vectors)             # Add vectors\n\n# Search\nk = 5  # Find 5 nearest neighbors\nquery = np.random.random((1, d)).astype('float32')\ndistances, indices = index.search(query, k)\n\nprint(f\"Nearest neighbors: {indices}\")\nprint(f\"Distances: {distances}\")\n```\n\n## Index types\n\n### 1. Flat (exact search)\n\n```python\n# L2 (Euclidean) distance\nindex = faiss.IndexFlatL2(d)\n\n# Inner product (cosine similarity if normalized)\nindex = faiss.IndexFlatIP(d)\n\n# Slowest, most accurate\n```\n\n### 2. IVF (inverted file) - Fast approximate\n\n```python\n# Create quantizer\nquantizer = faiss.IndexFlatL2(d)\n\n# IVF index with 100 clusters\nnlist = 100\nindex = faiss.IndexIVFFlat(quantizer, d, nlist)\n\n# Train on data\nindex.train(vectors)\n\n# Add vectors\nindex.add(vectors)\n\n# Search (nprobe = clusters to search)\nindex.nprobe = 10\ndistances, indices = index.search(query, k)\n```\n\n### 3. HNSW (Hierarchical NSW) - Best quality\u002Fspeed\n\n```python\n# HNSW index\nM = 32  # Number of connections per layer\nindex = faiss.IndexHNSWFlat(d, M)\n\n# No training needed\nindex.add(vectors)\n\n# Search\ndistances, indices = index.search(query, k)\n```\n\n### 4. Product Quantization - Memory efficient\n\n```python\n# PQ reduces memory by 16-32×\nm = 8   # Number of subquantizers\nnbits = 8\nindex = faiss.IndexPQ(d, m, nbits)\n\n# Train and add\nindex.train(vectors)\nindex.add(vectors)\n```\n\n## Save and load\n\n```python\n# Save index\nfaiss.write_index(index, \"large.index\")\n\n# Load index\nindex = faiss.read_index(\"large.index\")\n\n# Continue using\ndistances, indices = index.search(query, k)\n```\n\n## GPU acceleration\n\n```python\n# Single GPU\nres = faiss.StandardGpuResources()\nindex_cpu = faiss.IndexFlatL2(d)\nindex_gpu = faiss.index_cpu_to_gpu(res, 0, index_cpu)  # GPU 0\n\n# Multi-GPU\nindex_gpu = faiss.index_cpu_to_all_gpus(index_cpu)\n\n# 10-100× faster than CPU\n```\n\n## LangChain integration\n\n```python\nfrom langchain_community.vectorstores import FAISS\nfrom langchain_openai import OpenAIEmbeddings\n\n# Create FAISS vector store\nvectorstore = FAISS.from_documents(docs, OpenAIEmbeddings())\n\n# Save\nvectorstore.save_local(\"faiss_index\")\n\n# Load\nvectorstore = FAISS.load_local(\n    \"faiss_index\",\n    OpenAIEmbeddings(),\n    allow_dangerous_deserialization=True\n)\n\n# Search\nresults = vectorstore.similarity_search(\"query\", k=5)\n```\n\n## LlamaIndex integration\n\n```python\nfrom llama_index.vector_stores.faiss import FaissVectorStore\nimport faiss\n\n# Create FAISS index\nd = 1536\nfaiss_index = faiss.IndexFlatL2(d)\n\nvector_store = FaissVectorStore(faiss_index=faiss_index)\n```\n\n## Best practices\n\n1. **Choose right index type** - Flat for \u003C10K, IVF for 10K-1M, HNSW for quality\n2. **Normalize for cosine** - Use IndexFlatIP with normalized vectors\n3. **Use GPU for large datasets** - 10-100× faster\n4. **Save trained indices** - Training is expensive\n5. **Tune nprobe\u002Fef_search** - Balance speed\u002Faccuracy\n6. **Monitor memory** - PQ for large datasets\n7. **Batch queries** - Better GPU utilization\n\n## Performance\n\n| Index Type | Build Time | Search Time | Memory | Accuracy |\n|------------|------------|-------------|--------|----------|\n| Flat | Fast | Slow | High | 100% |\n| IVF | Medium | Fast | Medium | 95-99% |\n| HNSW | Slow | Fastest | High | 99% |\n| PQ | Medium | Fast | Low | 90-95% |\n\n## Resources\n\n- **GitHub**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss ⭐ 31,700+\n- **Wiki**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss\u002Fwiki\n- **License**: MIT\n\n\n",{"name":5,"tags":43,"author":50,"license":15,"version":51,"category":52,"description":7,"dependencies":53},[44,45,46,47,27,26,25,24,48,49,23],"RAG","FAISS","Similarity Search","Vector Search","HNSW","High Performance","Synthetic Sciences","1.0.0","llm-tools",[54,55,56],"faiss-cpu","faiss-gpu","numpy","main","4aa39efd1cdab0b4657ecee16c92a92011a5b10f","openscience\u002Fbackend\u002Fcli\u002Fskills\u002Fllm-tools\u002Ffaiss","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub","https:\u002F\u002Fgithub.com\u002Ffadrienne","2026-10-28 00:43:09",{"source":8,"skillName":5,"commands":64,"prompt":74,"zipAvailable":75},[65,68,71],{"tool":66,"command":67},"npx","npx skills add fadrienne\u002FMyGitHub --skill faiss",{"tool":69,"command":70},"bunx","bunx skills add fadrienne\u002FMyGitHub --skill faiss",{"tool":72,"command":73},"pnpm","pnpm dlx skills add fadrienne\u002FMyGitHub --skill faiss","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fopenscience\u002Fbackend\u002Fcli\u002Fskills\u002Fllm-tools\u002Ffaiss\u002FSKILL.md",true,[77],{"path":78,"resourceType":79,"resourceTypeDesc":80,"sizeBytes":81,"sourceHtmlUrl":82},"references\u002Findex_types.md","REFERENCE","参考文档",6181,"https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fopenscience\u002Fbackend\u002Fcli\u002Fskills\u002Fllm-tools\u002Ffaiss\u002Freferences\u002Findex_types.md",[84,115,141,175,202,229],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":95,"publishedAt":38},"01M7167B28PK20HP7R7ZED2DY0","statistical-power","Sample size calculation, power analysis, and effect size conversion for scientific studies. Use BEFORE data collection (a priori) to determine required N, or after (post-hoc) to compute achieved power. Covers parametric tests (t-test, ANOVA, chi-square, proportions, correlation, regression), simulation-based power for complex\u002Fclustered\u002Fnested designs, and power curves. Use this skill when someone asks 'how many samples do I need', 'what is my power', 'what effect size can I detect', or any variant. Pairs with \u002Fexperimental-design (choose design first, then compute power) and \u002Fstatistical-analysis (analyze data after collection).","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fstatistical-power\u002FSKILL.md",[90],{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[96,97,98,99,100,101,102,103,20,104,105,106,107,108,109,110,111,112,113,114],"power","statistical power","effect","scipy","regression","choose","design","uv","Bash","collection","analysis","calculation","ANOVA","conversion","analyze","t-test","chi-square","simulation","sample",{"skillNo":116,"name":117,"nameZh":6,"description":118,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":119,"categories":120,"keywords":124,"publishedAt":38},"01M71677EBCM8EPCE9BZCK8505","statistical-analysis","Guided statistical analysis with test selection and reporting. Use when you need help choosing appropriate tests for your data, assumption checking, power analysis, and APA-formatted results. Best for academic research reporting, test selection guidance. For implementing specific models programmatically use statsmodels.","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fstatistical-analysis\u002FSKILL.md",[121],{"categoryNo":122,"categoryName":123,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000008","测试与质量",[106,125,96,126,127,128,20,21,129,130,131,132,133,134,135,136,137,138,139,140],"statistical analysis","academic research","implementing","selection","reporting","data","for","tests","use","with","test","research","results","statsmodels","models","help",{"skillNo":142,"name":143,"nameZh":6,"description":144,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":145,"categories":146,"keywords":156,"publishedAt":38},"01M71673R93XAHFH81DBNVNG7H","scientific-writing","Core skill for the deep research and writing tool. Write scientific manuscripts in full paragraphs (never bullet points). Use two-stage process with (1) section outlines with key points using research-lookup then (2) convert to flowing prose. IMRAD structure, citations (APA\u002FAMA\u002FVancouver), figures\u002Ftables, reporting guidelines (CONSORT\u002FSTROBE\u002FPRISMA), for research papers and journal submissions.","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fscientific-writing\u002FSKILL.md",[147,150,151],{"categoryNo":148,"categoryName":149,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000018","写作与文案",{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},{"categoryNo":152,"categoryName":153,"taxonomyType":154,"taxonomyTypeDesc":155},"01JBSEEDCAT000000000000036","内容创作者","PROFESSION","适用职业",[157,158,159,160,161,162,163,164,165,166,104,167,168,169,170,171,172,173,129,174],"writing","scientific","scientific writing","Citations","deep","deep research","never","papers","journal","false","api","prisma","structure","openrouter","Outlines","core skill","read","features",{"skillNo":176,"name":177,"nameZh":6,"description":178,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":179,"categories":180,"keywords":185,"publishedAt":38},"01M7166ZPKXBF4EBPHVTJPQBB1","scientific-visualization","Meta-skill for publication-ready figures. Use when creating journal submission figures requiring multi-panel layouts, significance annotations, error bars, colorblind-safe palettes, and specific journal formatting (Nature, Science, Cell). Orchestrates matplotlib\u002Fseaborn\u002Fplotly with publication styles. For quick exploration use seaborn or plotly directly.","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fscientific-visualization\u002FSKILL.md",[181,184],{"categoryNo":182,"categoryName":183,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000013","分析与可视化",{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},[186,158,187,188,189,190,191,192,193,165,20,194,195,196,197,198,199,200,131,201],"visualization","scientific visualization","error","ready","quick","exploration","meta-skill","Meta","safe","plotly","annotations","formatting","Publication","figures","panel","submission",{"skillNo":203,"name":204,"nameZh":6,"description":205,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":206,"categories":207,"keywords":214,"publishedAt":38},"01M7166VXJWQSSC3RQZP60WBGR","research-code","Debug, profile, review, and restructure Python research and analysis code. Use when analysis scripts crash, produce wrong results, run too slowly, or need a correctness review. Covers: reading tracebacks and diagnosing root causes, hypothesis-driven debugging, reviewing code for common statistical\u002Fnumerical errors, profiling data pipelines, improving reproducibility (seeds, environments, determinism), and structuring analysis scripts for sharing. Distinct from \u002Fexploratory-data-analysis (which understands data) and \u002Fstatistical-analysis (which chooses and runs tests) — this skill focuses on the code itself.","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fresearch-code\u002FSKILL.md",[208,211],{"categoryNo":209,"categoryName":210,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000021","资料检索与研究",{"categoryNo":212,"categoryName":213,"taxonomyType":154,"taxonomyTypeDesc":155},"01JBSEEDCAT000000000000030","开发工程师",[215,216,136,217,218,219,220,103,221,20,104,106,222,223,224,225,226,227,173,228],"code","research code","which","memory","data-analysis","errors","debugging","common","review","data pipelines","run","scripts","line","write",{"skillNo":230,"name":231,"nameZh":6,"description":232,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":233,"licenseFileUrl":6,"sourceHtmlUrl":234,"categories":235,"keywords":242,"publishedAt":38},"01M7166CF5HSR7SVZYZFWTDX55","markdown-mermaid-writing","Comprehensive markdown and Mermaid diagram writing skill. Use when creating any scientific document, report, analysis, or visualization. Establishes text-based diagrams as the default documentation standard with full style guides (markdown + mermaid), 24 diagram type references, and 9 document templates.","Apache-2.0","https:\u002F\u002Fgithub.com\u002Ffadrienne\u002FMyGitHub\u002Fblob\u002Fmain\u002Fscientific-agent-skills\u002Fskills\u002Fmarkdown-mermaid-writing\u002FSKILL.md",[236,239,240,241],{"categoryNo":237,"categoryName":238,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000002","文档处理",{"categoryNo":148,"categoryName":149,"taxonomyType":93,"taxonomyTypeDesc":94},{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},{"categoryNo":152,"categoryName":153,"taxonomyType":154,"taxonomyTypeDesc":155},[157,243,244,245,246,247,186,248,249,20,104,106,250,251,252,253,254,255,158,173],"markdown mermaid writing","mermaid","markdown","community","diagrams","project","default","team","guides","text","documentation","references","diagram"]