Skip to main content
Glama
743,793 tools. Updated 2026-11-04 21:42

"Understanding the concept of 'handle' in different contexts" matching MCP tools:

  • List a public/competitor creator's videos by platform + handle. Sort by 'recent' or 'top' (best-performing); optionally with analysis inline. Only returns creators already in the analysis library — for one you haven't ingested yet this returns reason="creator_not_in_library" with a next_step of analyze_creator(platform, username), not an error. When more videos exist beyond this page the response includes next_cursor — pass it back as cursor (same sort/filters) to fetch the next page; when next_cursor is absent you have everything.
    ConnectorOAuth
  • Store a human-pasted sequence and return a handle to re-use it. For a sequence you've already pasted into the conversation, this gives back a short handle so you can run several tasks on it without re-pasting the bases in each predict_* call. Note that the full sequence still passes through the LLM on THIS call — it does not save context on its own. For large sequences, prefer fetch_ensembl_sequence / fetch_gene_for_expression / load_local_fasta, which acquire the bases server-side and never round-trip them. A line-wrapped FASTA *body* may be pasted verbatim: whitespace is stripped before storing, so the handle's `length` counts bases and a later `tss_index` counts into the same string the API measures. (A FASTA `>` header line is not a sequence and is rejected by the API's alphabet check.)
    ConnectorNo auth
  • Who am I? Returns the signed-in account: email, @handle, plan + limits, counts of sites/domains/drives, and connected DNS providers. Call this first to orient before managing sites or domains.
    ConnectorNo auth
  • Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B). query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap. Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess. Args: branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes everything within `depth` hops, or an anchor plus an explicit relation path using '>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the frontier. '*' matches any relation. Mix both forms freely. depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths. direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default). mode: 'AND' (default) intersects branches; 'OR' unions them. limit: Max concepts listed, 1-200 (default 40). The true count is always shown. Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
    ConnectorNo auth
  • Prove content existed at a point in time WITHOUT revealing it: send only its SHA-256. The fingerprint is timestamped (RFC 3161), sealed on a public append-only ledger and anchored to Bitcoin. Ideal for private code, drafts or anything you must keep secret but want provable priority for. Free, no account. Proves existence and time — not authorship. Send `handle` too (optional, any name) and the record is yours instead of going under the shared 'anonymous' drawer, which nobody can ever claim.
    ConnectorNo auth
  • The RELATIONS between the platform's teaching objects — which Academy module teaches which concept, which study covers which module, what a concept relates to. THIS IS THE ONLY TOOL ON THIS SERVER THAT SERVES EDGES; the others serve rows. Ask it what connects to what, not what exists. SCOPE, AND IT IS NARROWER THAN 'the knowledge graph': it carries four node types — `concept`, `module`, `study`, `vendor` — and every edge whose BOTH endpoints are one of them. The whole graph holds twelve node types; the eight it does not carry are each either served by their own tool or named as not served at all, and `_meta.excluded_node_types` says which per type (consultant data is served at NO tier), so a missing type is a documented boundary and never a silent gap. Call it with `node_id` (e.g. `module:M178`, `concept:C001`, `study:ai-impact-2026-EN`) to walk one node's neighbourhood; with `node_type` and/or `query` to find a node id first. `edge_type` and `direction` narrow a walk. Read `_meta.available_edge_types` — computed from the served projection on every call — before assuming an edge type exists.
    ConnectorNo auth

Matching MCP Servers

  • A
    license
    B
    quality
    C
    maintenance
    Enables searching products, browsing weekly offers and recipes, and comparing a shopping list across nemlig.com and BilkaToGo, including fees and delivery slots. It can fill the online basket in the cheaper store, but cannot place orders or make payments.
    9
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables LLMs to perform conceptual search over local PDF/EPUB documents using a RAG pipeline with corpus-driven concept extraction and WordNet enrichment.
    3
    MIT

Matching MCP Connectors

  • Identify what an X (formerly Twitter) URL points at before fetching it. Give any x.com or twitter.com URL (mobile links, query params, /i/web/status forms are fine); get back {type: profile|tweet, id, handle, canonical_url}. Tweet URLs yield the numeric id for x_get_tweet; profile URLs yield the handle for x_get_profile or x_get_tweets. Costs 2 credits and parses offline without fetching the page. t.co short links cannot be expanded offline and return INVALID_INPUT telling you so; expand them in your own browser step first. Skip this tool when you already have a handle or tweet id: the other X tools accept those directly.
    ConnectorOAuth
  • Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B). query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap. Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess. Args: branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes everything within `depth` hops, or an anchor plus an explicit relation path using '>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the frontier. '*' matches any relation. Mix both forms freely. depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths. direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default). mode: 'AND' (default) intersects branches; 'OR' unions them. limit: Max concepts listed, 1-200 (default 40). The true count is always shown. Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
    ConnectorNo auth
  • Coach only: mark a managed athlete's completed workout or race as viewed and, with `comment`, post a message the athlete is notified of on that workout. `id`: the trn_… (workout) or cmp_… (race) handle from get_calendar(mode='real'). A comment goes on workouts only. Show the athlete's name and the exact comment, and get the coach's go-ahead before posting: a sent message cannot be taken back here.
    Connector
    Destructive
    OAuth
  • Rename a library folder, move it under another root folder, or collapse it. A change cannot be undone: say what will change and get the go-ahead first. `id`: its cat_… handle from list_library_categories. Nolio's own folders cannot be changed. `parent`: the cat_… handle of another root folder of the same owner and type. `is_visible`: false collapses the folder in the library sidebar; it stays listed. Deleting a folder is done in the Nolio app only: it also deletes every template inside.
    Connector
    Destructive
    OAuth
  • Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B). query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap. Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess. Args: branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes everything within `depth` hops, or an anchor plus an explicit relation path using '>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the frontier. '*' matches any relation. Mix both forms freely. domain: Domain name from list_domains(). depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths. direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default). mode: 'AND' (default) intersects branches; 'OR' unions them. limit: Max concepts listed, 1-200 (default 40). The true count is always shown. Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
    ConnectorNo auth
  • Exhaustively survey the WHOLE Tipiṭaka for a term — guaranteed complete. Use this (not `search_by_keyword`) when the question is about **coverage or counting** rather than "show me the best passages": - "How many times does Kusinārā appear in the canon?" - "Every place ānāpānassati is mentioned — don't miss any" - "Which pitakas/how many suttas mention this term?" Unlike `search_by_keyword` (ranked, capped at 50, no total), this returns an **exact count**, a **per-pitaka breakdown**, the **distinct surface forms** that matched (so you can audit and discard over-matches), and a paginated enumeration. The `lexical` result carries `complete: true` — a hard guarantee that nothing was dropped for the chosen `match_scope`. Two layers, two different promises: - **lexical** — the word and its forms. Deterministic + EXHAUSTIVE. - **semantic** (`mode="thorough"`, hosted only) — passages teaching the same concept with DIFFERENT vocabulary (e.g. ānāpānassati via `assasati`/`passasati`). Approximate, **NOT exhaustive** — it never claims completeness, it only boosts recall.
    ConnectorNo auth
  • Hybrid search — combines keyword + semantic search via RRF. Uses Reciprocal Rank Fusion (RRF) to merge exact-word results with meaning-based results. **This is the recommended tool for "discourses about X" / concept queries**, because the semantic side catches suttas that discuss a concept using different vocabulary (e.g. some mindfulness-of-breathing suttas use `assasati/passasati/dīghaṁ` instead of `ānāpānassati`). ⚠️ **Send the question and nothing else. Do not pad the query.** The whole string becomes one vector, so every word you add moves it. Appending your own candidate terms — synonyms, Pāli equivalents, a keyword list — searches for the blend, not for the question. Measured on `Buddha flies in the sky`: asking it plainly put the right passage at **rank 1** (3 relevant suttas). Appending three guessed Pāli terms (`buddha, agga, sagga`) pushed it down to **rank 5** and left only 1 — because `agga` (supreme) and `sagga` (heaven) drag the vector toward their own meanings. Have candidate terms worth searching? Give them their own `search_by_keyword` call and merge the two result lists. One tool asks what a passage means, the other asks where a word occurs; combined into a single string they cancel out. Rewriting the question to sound more canonical does not help either — the same query phrased as `rose into the air and flew like a bird` scored **zero** relevant hits. 💡 **Hints for the AI client:** - English queries usually work best (e.g. `mindfulness of breathing`) because the embedding model is multilingual but EN-primary. - Thai stop-word handling is weak. If a Thai query underperforms, the AI client should translate to Pāli/English first (see server instructions). - The default `limit=5` is often too small for a topic survey — use `limit=15-20` (max 20) for good coverage. - `language` only chooses what comes back; it does not change what matches or how results are ranked. - Looking for a concrete thing rather than a concept (an animal, an object, a place)? `search_by_keyword` over `language="english"` is often better. The translations are segment-aligned to the Pāli, so one search for `turtle` finds every turtle passage whatever the Pāli underneath says (`kacchapa`, `kumma`, `maṇḍūkakacchapa`), and each hit still carries its segment id. - Ranking is by similarity, NOT canonical importance — locus classicus suttas (e.g. MN118, DN22) may rank below smaller suttas that happen to use the exact vocabulary. Treat results as a starting point, then call `get_sutta` for the canonical references.
    ConnectorNo auth
  • Predict a gene's expression from the sequence around its TSS. Expression is cell-type-specific, so `description` (cell type / assay context, e.g. 'K562 cell line') is REQUIRED — the API rejects requests without it. The input rule is the same for every expression model: at least 9,198 bp, with the TSS at least 4,599 bp from each end, up to 500,000 bp. Longer TSS-centred sequence gives better predictions: each model's bio_spec.recommended_flank_bp (see list_models) says how many bp it reads on each side of the TSS, and flank beyond that is ignored. Less flank, down to 4,599 bp, is accepted and scored, but the model then reads less than it was trained on. Omit `model` for the server's default. - A 9,198 bp sequence with the TSS at offset 4,599 (the midpoint) needs no `tss_index`. - Any longer sequence needs `tss_index`: the 0-based offset of the TSS into it (a fetch_gene_for_expression handle carries its own). The API cuts what the model reads around that offset and never scans for a TSS itself. Under 9,198 bp, or a TSS closer than 4,599 bp to either end, is rejected here and by the API (422). A locus with no offset is rejected too, because it is indistinguishable from a mis-centred window. A very N-rich or low-complexity window can also be refused by the API (422). An offset that is merely WRONG (e.g. counted over a wrapped FASTA's characters, or against a chromosome coordinate instead of an offset into THIS sequence) still succeeds and scores the wrong window — verify meta.task_specific_counts.scored_window in the response. Easiest paths: fetch_gene_for_expression(gene) already fetches a long TSS-centred handle (as much flank as the listed models recommend) and records its `tss_index`, which is sent for you when you pass that handle without one; find_genes_and_predict_expression takes a raw region and finds each TSS for you.
    ConnectorNo auth
  • Read a connected X/Twitter account's private surfaces: bookmarks and bookmark folders, notifications, and DM history. Billed per item returned; readable only for handles this wallet connected. Guidance: PREREQUISITE: connect an X account (see /api/x-accounts/start). Reads act AS that account, so you can only read the inbox of a handle THIS wallet connected. action=bookmarks (optional folderId) | bookmark_folders | notifications (optional type) | dm_history (target_user_id required). bookmarks/notifications/dm_history are billed per item — set resultsLimit (1–10000). account (the connected handle) is required.
    ConnectorNo auth
  • Get Venture Insights' live service catalogue: the FREE Concept Diagnostic (a research-backed viability study of one venture concept, delivered to the founder's inbox) and the paid study tiers with live SAR prices. Call this first when your user asks what Venture Insights offers, what it costs, or whether the free diagnostic is worth requesting.
    ConnectorNo auth
  • Locks in the CURRENT terms of the negotiation exactly as they stand and creates a permanent, immutable Contract between the two agents. Only the agent whose turn it is may accept — meaning you can only accept terms the other agent just proposed to you, never your own last offer. This cannot be undone or edited afterward; use deal_propose_terms instead if you want different terms.
    ConnectorNo auth
  • Browse, filter, and paginate the Tenjin article directory. Full-text search over title/excerpt/tags plus the whole body of every piece, a paid body included — a match on gated prose only decides WHICH public row is listed (also matches a creator handle); returns preview-only listing items (never a paid body, snippet, match offset, or score), cursor-paginated — newest-first when browsing (or a chosen sort: oldest, most-read, least-read, cheapest, dearest). q alone is relevance-ranked; q + sort filters by the query and orders the matches by the sort. The content match ORs your plain words (`or` and `-` are operators; stopwords drop) and the handle arm matches outside it, so extra terms widen the set and relevance orders it: q is still for SHORT terms (a topic word, a name, a handle), and for a whole QUESTION use the `search` tool, which matches meaning as well as wording.
    ConnectorNo auth
  • Change the quantity of an existing line in a droplinked cart. Identifies the line by skuId (the variant id used when the line was added). Returns `{ status, cartId, skuId, updatedQuantity }`. Use cart.removeLine to remove a line entirely instead of setting quantity=0. Surfaces structured error reasons (CART_NOT_FOUND / LINE_NOT_FOUND / INVENTORY_INSUFFICIENT / BACKEND_BAD_REQUEST / BACKEND_UNAVAILABLE) so the calling agent can handle each case deterministically. AUTH: not on the public read tier — calling this without a valid X-MCP-API-Key returns JSON-RPC error -32001 with data.code=MCP_API_KEY_REQUIRED and never reaches the tool. Request a key from ops@droplinked.com. Discovery, catalogue and trust-fabric reads need no credential.
    ConnectorNo auth
  • Genereert een volledig opgemaakt, RvO-conformant concept voor één van de zeven raadsstuk­typen. Geen DB, geen netwerk, <10ms — puur structurele kennis. Gebruik deze tool wanneer: - Het raadslid een stuk wil indienen en een correct gestructureerd concept nodig heeft. - Je `adviseer_raadsinstrument` hebt gebruikt (welk instrument) en nu het daadwerkelijke stuk wilt renderen in het juiste format met RvO-verwijzingen. - Een concept al bestaat maar opnieuw in correct format moet worden gezet. Gebruik deze tool NIET wanneer: - Je het juiste instrument nog moet kiezen → gebruik eerst `adviseer_raadsinstrument`. - Je een bestaand concept wilt beoordelen op inhoud → `beoordeel_tekst`. - Je een format-validatie wil uitvoeren op een bestaand concept → `beoordeel_tekst` met `soort` gelijk aan het doc_type. ``doc_type`` keuzes: 'motie', 'motie_vreemd', 'amendement', 'schriftelijke_vragen', 'mondelinge_vragen', 'initiatiefvoorstel', 'interpellatieverzoek'. ``velden`` zijn optioneel — ontbrekende velden worden vervangen door invul-placeholders [zoals dit] zodat het concept altijd een compleet, geldig skelet is. ``gemeente`` bepaalt welk lokaal RvO-overlay (artikel­nummers, termijnen, indienings­route) wordt gebruikt. Default 'rotterdam'. Degradeert netjes naar het canonieke basis­format + disclaimer als er geen overlay beschikbaar is. Retourneert: markdown-concept in de juiste RvO-structuur, met RvO-artikel­citaat en disclaimer. **Volgende stap in de drafting-keten:** valideer het gegenereerde concept met `beoordeel_tekst(tekst=<concept>, soort=<doc_type>)` voordat je het presenteert of opslaat; sla daarna op met `sla_fractie_artifact_op(artifact_type=<doc_type>)`.
    ConnectorNo auth
  • Find TCLP content (clauses, glossary terms, guides) associated with a named concept. Unlike `search`, this performs a deterministic name match against Entity nodes in the knowledge graph rather than a relevance-ranked semantic search. Use it when you have a specific term or concept (e.g. "scope 3 emissions", "net zero") and want to retrieve every clause or glossary entry that explicitly references it. Args: name: The entity or concept name to look up (exact match, case-insensitive). limit: Maximum number of results to return (1–50). include_full_text: Include each hit's full body text (Markdown). Off by default — bodies are large; request only when you need the content, and prefer a small `limit` when you do. Returns: JSON with "meta" and "results" where each hit includes the source content node, its plain-text `summary` (null when it has none) and the entity names that matched. Each hit's "references" lists the instruments it cites: pass a reference's `work_id` to `get_legal_resource` for details. A reference's `edge` (governs, references, describes) says how the content relates to the instrument; it is not a statement of the instrument's legal effect. An empty list means the hit cites no instruments. null with "lrsf" in meta.degraded means references could not be loaded: do not conclude that the hit cites no instruments.
    ConnectorNo auth