[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6MA2YEC1S4T71KATDHTSFQ3":3,"skill-same:01M6MA2YEC1S4T71KATDHTSFQ3":80},{"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":39,"linkOnly":40,"markdownContent":41,"markdownBody":42,"frontMatter":43,"refName":50,"commitSha":51,"skillDirectory":52,"forksCount":53,"repositoryHtmlUrl":54,"repositoryHomepageUrl":55,"ownerHtmlUrl":56,"ownerBlogUrl":57,"ownerDescription":58,"updatedAt":59,"install":60,"resources":73},"01M6MA2YEC1S4T71KATDHTSFQ3","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.","hashgraph-online\u002Fawesome-codex-plugins","hashgraph-online","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F160371962?v=4","01M6CNB6NRJVNNGN14TR01Q6D3","HOL (Hashgraph Online)","01M6JT1HSKKG9V68KQAQGBA7XP",1575,"MIT","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002FKalarisLabs\u002Fresearch-agent-skills\u002Fskills\u002Ffaiss\u002FSKILL.md",[],[5,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38],"high-performance","when","for","you","types","Large Scale","K-NN","Billion-Scale","GPU Acceleration","Facebook AI","CPU","performance","knowledge","applications","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.\nlicense: MIT\nmetadata:\n  version: 1.0.0\n  category: knowledge-and-rag\n  maintainer: Kalaris Labs\n  tags: RAG, FAISS, Similarity Search, Vector Search, Facebook AI, GPU Acceleration, Billion-Scale, K-NN, HNSW, High Performance, Large Scale\n  dependencies: 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- 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## Agent operating procedure\n\n1. **Check the environment.** Confirm the corpus, embedding model and vector store versions, and where the index will live.\n2. **Pin down the inputs.** Confirm formats, identifiers and parameters from the data or the user. Ask rather than guess any value that changes the result.\n3. **Run a small version first.** Index a small subset and test retrieval on known question-passage pairs.\n4. **Execute the full task** using the instructions and references above.\n5. **Validate the result.** Measure recall@k on a labeled set; answers cite retrieved passages only.\n6. **Report.** State what was run (versions, commands, parameters), what was checked, and what is still uncertain.\n\n| If this happens | Do this |\n|---|---|\n| Retrieval returns irrelevant chunks | Revisit chunking, add BM25\u002Fhybrid search, or re-rank before changing the generator. |\n| A function, flag or endpoint in these instructions is missing in the installed version | Check the installed version's own documentation (`help()`, `--help`, official docs), adapt, and tell the user. Never invent an API. |\n| A required input, identifier or parameter is ambiguous | Ask the user, or state the assumption explicitly before running. |\n\n**Integrity rules**\n\n- Never fabricate results, parameters, identifiers, citations or statistics. If something cannot be run or verified, say so plainly.\n- Answers must come from retrieved text; say when the corpus does not contain the answer.\n- Treat version-specific details here as possibly outdated: confirm them against the official documentation for the installed version.\n- Ask before actions that cost money, consume shared GPUs or cloud quota, touch personal or patient data, or cannot be undone.\n\n## Related skills\n\n- `pinecone`: Guides use of Pinecone, a managed serverless vector database, through its Python client and the LangChain and LlamaIndex integrations.\n- `qdrant-vector-search`: High-performance vector similarity search engine for RAG and semantic search.\n- `chroma`: Open-source embedding database for AI applications.\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- 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## Agent operating procedure\n\n1. **Check the environment.** Confirm the corpus, embedding model and vector store versions, and where the index will live.\n2. **Pin down the inputs.** Confirm formats, identifiers and parameters from the data or the user. Ask rather than guess any value that changes the result.\n3. **Run a small version first.** Index a small subset and test retrieval on known question-passage pairs.\n4. **Execute the full task** using the instructions and references above.\n5. **Validate the result.** Measure recall@k on a labeled set; answers cite retrieved passages only.\n6. **Report.** State what was run (versions, commands, parameters), what was checked, and what is still uncertain.\n\n| If this happens | Do this |\n|---|---|\n| Retrieval returns irrelevant chunks | Revisit chunking, add BM25\u002Fhybrid search, or re-rank before changing the generator. |\n| A function, flag or endpoint in these instructions is missing in the installed version | Check the installed version's own documentation (`help()`, `--help`, official docs), adapt, and tell the user. Never invent an API. |\n| A required input, identifier or parameter is ambiguous | Ask the user, or state the assumption explicitly before running. |\n\n**Integrity rules**\n\n- Never fabricate results, parameters, identifiers, citations or statistics. If something cannot be run or verified, say so plainly.\n- Answers must come from retrieved text; say when the corpus does not contain the answer.\n- Treat version-specific details here as possibly outdated: confirm them against the official documentation for the installed version.\n- Ask before actions that cost money, consume shared GPUs or cloud quota, touch personal or patient data, or cannot be undone.\n\n## Related skills\n\n- `pinecone`: Guides use of Pinecone, a managed serverless vector database, through its Python client and the LangChain and LlamaIndex integrations.\n- `qdrant-vector-search`: High-performance vector similarity search engine for RAG and semantic search.\n- `chroma`: Open-source embedding database for AI applications.\n",{"name":5,"license":15,"metadata":44,"description":7},{"tags":45,"version":46,"category":47,"maintainer":48,"dependencies":49},"RAG, FAISS, Similarity Search, Vector Search, Facebook AI, GPU Acceleration, Billion-Scale, K-NN, HNSW, High Performance, Large Scale","1.0.0","knowledge-and-rag","Kalaris Labs","faiss-cpu, faiss-gpu, numpy","main","2b63f856ce19c2a797929cacabd9e0fc936812fa","plugins\u002FKalarisLabs\u002Fresearch-agent-skills\u002Fskills\u002Ffaiss",491,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins","https:\u002F\u002Fhol.org\u002Fplugins\u002Fbest-codex-plugins","https:\u002F\u002Fgithub.com\u002Fhashgraph-online","https:\u002F\u002Fhol.org","Open-source standards and developer tools for interoperable AI agents: discovery, identity, communication, payments, privacy and security.","2026-11-14 14:06:13",{"source":8,"skillName":5,"commands":61,"prompt":71,"zipAvailable":72},[62,65,68],{"tool":63,"command":64},"npx","npx skills add hashgraph-online\u002Fawesome-codex-plugins --skill faiss",{"tool":66,"command":67},"bunx","bunx skills add hashgraph-online\u002Fawesome-codex-plugins --skill faiss",{"tool":69,"command":70},"pnpm","pnpm dlx skills add hashgraph-online\u002Fawesome-codex-plugins --skill faiss","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002FKalarisLabs\u002Fresearch-agent-skills\u002Fskills\u002Ffaiss\u002FSKILL.md",true,[74],{"path":75,"resourceType":76,"resourceTypeDesc":77,"sizeBytes":78,"sourceHtmlUrl":79},"references\u002Findex_types.md","REFERENCE","参考文档",6181,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002FKalarisLabs\u002Fresearch-agent-skills\u002Fskills\u002Ffaiss\u002Freferences\u002Findex_types.md",[81,90,98,106,114,122],{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":85,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":89},"01M7DV332YQMGD8WTRJ9DZQXTB","worktable-review-with-annotations","Create, inspect, reply to, update, or resolve situated Worktable annotations. Use when feedback belongs to a Doc section, block, text range, or HTML Doc, or when the user asks to address existing review feedback and coordinate a requested artifact edit.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-review-with-annotations\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-review-with-annotations\u002FSKILL.md",[],[],"2026-11-15 14:19:17",{"skillNo":91,"name":92,"nameZh":6,"description":93,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":94,"sourceHtmlUrl":95,"categories":96,"keywords":97,"publishedAt":89},"01M7DV2YGHCZVBEB1AHYB6CGHE","worktable-find-and-synthesize-context","Find, assess, and synthesize context from Worktable Docs and Records. Use when the user asks what a workspace contains, wants workspace-backed research, needs current facts reconciled across artifacts, or requests a cited synthesis without changing workspace state.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-find-and-synthesize-context\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-find-and-synthesize-context\u002FSKILL.md",[],[],{"skillNo":99,"name":100,"nameZh":6,"description":101,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":102,"sourceHtmlUrl":103,"categories":104,"keywords":105,"publishedAt":89},"01M7DV2TQN1H11ME2SAF9MXN7V","worktable-create-or-update-docs","Create, edit, rename, or maintain narrative Worktable Docs. Use for plans, decisions, briefs, notes, research syntheses, and other durable prose when the user requests a new artifact or a safe update to an existing one.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-update-docs\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-update-docs\u002FSKILL.md",[],[],{"skillNo":107,"name":108,"nameZh":6,"description":109,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":110,"sourceHtmlUrl":111,"categories":112,"keywords":113,"publishedAt":89},"01M7DV2NE452NEA8TXATKSNAJH","worktable-create-or-manage-records","Organize repeated structured information as durable Worktable Records. Use for research datasets, inventories, directories, pipelines, trackers, and other collections whose items need identity, fields, filtering, links, validation, or individual updates.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-records\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-records\u002FSKILL.md",[],[],{"skillNo":115,"name":116,"nameZh":6,"description":117,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":118,"sourceHtmlUrl":119,"categories":120,"keywords":121,"publishedAt":89},"01M7DV2HENRBR2KSCVM064WH0Y","worktable-create-or-manage-interactive-html","Create or improve durable visual and interactive artifacts in Worktable. Use for dashboards, trackers, calculators, mini apps, slide presentations, and other requests that benefit from a polished HTML Doc.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-interactive-html\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-create-or-manage-interactive-html\u002FSKILL.md",[],[],{"skillNo":123,"name":124,"nameZh":6,"description":125,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":126,"sourceHtmlUrl":127,"categories":128,"keywords":129,"publishedAt":89},"01M7DV2CADR5R7RQFFYPNAGR9Y","worktable-collaborate-threads","Read, answer, and hand off messages through durable Worktable threads with users or other authenticated participants. Use when the user asks to check addressed messages, reply to a participant, continue a thread, request another agent's help, wait briefly for a response, or watch for comments and messages sent to the agent.","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-collaborate-threads\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Fworktable\u002Fworktable-plugin\u002Fskills\u002Fworktable-collaborate-threads\u002FSKILL.md",[],[]]