{"$schema":"https://verifymcp.io/schemas/trust-report.json","schemaVersion":1,"license":{"name":"CC BY-NC 4.0","url":"https://creativecommons.org/licenses/by-nc/4.0/"},"generatedAt":"2026-11-21T23:24:28.897Z","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research","markdownUrl":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research.md","server":{"slug":"com-writerslogic-agents-writerslogic-research","name":"WritersLogic research agents","registryName":"com.writerslogic.agents/writerslogic-research","description":"ArXiv to code, replication audits, paper contradictions, citation audit, prose forensics.","registryStatus":"active","deletedAt":null,"statusMessage":null,"liveness":"live","publisher":{"class":"unknown","claimed":false}},"component":{"slug":"mcp-research","type":"remote","identifier":"https://agents.writerslogic.com/mcp/research","withdrawn":false,"url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research","version":"1.0.0","transport":null,"scoredAt":"2026-11-21T08:24:30.946Z"},"score":{"total":65,"tier":"medium","status":"scored","weekDelta":null,"history":[{"date":"2026-11-21","total":65},{"date":"2026-11-20","total":65},{"date":"2026-11-19","total":64},{"date":"2026-11-18","total":64},{"date":"2026-11-17","total":63},{"date":"2026-11-16","total":63},{"date":"2026-11-15","total":62}]},"categories":[{"name":"Endpoint Security","score":66,"verdict":"unverified","reasons":["The endpoint's TLS certificate is valid, in date, and uses a strong key.","Authorisation not fully verified: no authorisation is required to call this server, and 14 tool(s) never declared a destructiveHint. The MCP spec treats an absent hint as destructive by default, so we cannot call this surface safe.","HTTPS is enforced; there's no plaintext access path.","The HSTS (Strict-Transport-Security) header is present.","DNSSEC is configured correctly; the domain's records validate against the full chain to the root."],"codes":[{"code":"tls.valid","args":{}},{"code":"auth.none_undeclared","args":{"undeclared_tools":"14"}},{"code":"https.enforced","args":{}},{"code":"headers.hsts_present","args":{}},{"code":"dnssec.validated","args":{}}]},{"name":"Transport & Reachability","score":100,"verdict":"pass","reasons":["Verified streamable-http transport via a live MCP handshake."],"codes":[{"code":"transport.verified","args":{"transport":"streamable-http"}}]},{"name":"Schema Quality & AI Usability","score":53,"verdict":"fail","reasons":["AI-judged instruction clarity (good).","Context-footprint check failed: tool/resource definitions use about 4656 tokens (~332/item across 14 items; 14 tools + 0 resources), over budget; trim descriptions and params.","Usage-examples check failed: none of the tools include examples."],"codes":[{"code":"schema.ai_quality","args":{"band":"good"}},{"code":"schema.footprint_heavy","args":{"avg":"332","items":"14","tools":"14","tokens":"4656","resources":"0"}},{"code":"schema.examples_absent","args":{}}]},{"name":"Stability & Change Management","score":20,"verdict":"partial","reasons":["Stability observed for 6 of 30 days with no destabilising changes; credit accrues until the full window elapses."],"codes":[{"code":"stability.building_history","args":{"days":"6"}}]},{"name":"Tool Coverage","score":99,"verdict":"partial","reasons":["100% of tools have a non-trivial description (not blank, and not just the tool's name).","98% of tool parameters carry a description."],"codes":[{"code":"toolquality.descriptions","args":{"pct":"100"}},{"code":"toolquality.param_docs","args":{"pct":"98"}}]},{"name":"Tool Safety","score":100,"verdict":"pass","reasons":["No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.","We read all 14 captured tool definition(s), and no name or description among them implies an irreversible operation.","An AI judge read all 15 captured unit(s) of tool text and found none that tries to manipulate the model reading it."],"codes":[{"code":"toolsafety.injection_clean","args":{}},{"code":"toolsafety.destructive_none","args":{"tools":"14"}},{"code":"toolsafety.manipulation_clean","args":{"units":"15","judged":"15"}}]},{"name":"Capabilities","score":60,"verdict":"fail","reasons":["Spec-recency check failed: implements MCP spec 2025-06-18; the latest is 2026-07-28."],"codes":[{"code":"protocol.outdated","args":{"latest":"2026-07-28","version":"2025-06-18"}}]}],"inconclusive":["Authorisation not fully verified: no authorisation is required to call this server, and 14 tool(s) never declared a destructiveHint. The MCP spec treats an absent hint as destructive by default, so we cannot call this surface safe."],"malware":[],"components":[{"slug":"mcp-research","type":"remote","identifier":"https://agents.writerslogic.com/mcp/research","withdrawn":false,"score":65,"current":true,"url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research","markdownUrl":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research.md"}],"facts":[{"label":"Endpoint","value":"https://agents.writerslogic.com/mcp/research"},{"label":"Transports","value":"streamable-http"},{"label":"Auth","value":"none"},{"label":"Version","value":"1.0.0"}],"install":{"available":true,"bundleSha256":null},"tools":[{"name":"foreignResearchScout","title":null,"description":"Cross-Lingual Dark Science Arbitrage Scout — Finds scientific work that exists only in non-English literature. Give an English topic, a technical bottleneck, or a paper you know (seedPaper: DOI or arXiv id); the scout plans native-terminology searches in up to 6 languages (default zh, ja, de, fr, ko) across OpenAlex, Crossref, HAL, J-STAGE and Europe PMC, drops works that already have an English twin, and returns up to 8 ranked discoveries.","inputs":[{"name":"fromDate","type":"string","required":false,"description":"Earliest publication date. Default: 10 years before the call."},{"name":"maxResults","type":"integer","required":false,"description":"Discoveries to return (default 5, max 8)."},{"name":"researchTopic","type":"string","required":false,"description":"English research topic, e.g. \"sulfide solid electrolytes for all-solid-state lithium batteries\"."},{"name":"seedPaper","type":"string","required":false,"description":"An English-language paper you already know, as a DOI (bare or doi.org URL) or arXiv id/URL. Its title becomes the research topic (or is added to it) so the scout finds non-English work on the same pr…"},{"name":"targetLanguages","type":"array","required":false,"description":"ISO 639-1 codes of non-English languages to mine (max 6). Default zh, ja, de, fr, ko."},{"name":"technicalBottleneck","type":"string","required":false,"description":"English description of an unsolved technical bottleneck. Provide this, researchTopic or seedPaper (or several)."},{"name":"toDate","type":"string","required":false,"description":"Latest publication date (inclusive)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":323},{"name":"arxiv-to-code","title":null,"description":"arXiv-to-Production Code & Hyperparameter Compiler — Fetches an arXiv paper's full text (ar5iv), selects method, pseudocode, hyperparameter tables and ablations, and returns a core-algorithm summary, hyperparameters each with a source pointer and a verbatim quote verified against the text, ablation warnings with evidence sentences, and one self-contained TypeScript or Python file that is compile/syntax-checked and literal-checked against the extract","inputs":[{"name":"arxivId","type":"string","required":false,"description":"arXiv id or URL, e.g. 1706.03762 or https://arxiv.org/abs/1706.03762."},{"name":"searchQuery","type":"string","required":false,"description":"Title or keywords; the top arXiv hit is used. Provide exactly one of arxivId or searchQuery."},{"name":"targetLanguage","type":"string","required":true,"description":null}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":185},{"name":"replication-auditor","title":null,"description":"Scientific Consensus & Replication Failure Auditor — Give a DOI, arXiv id, PMID, URL, title or a free-text claim and get a verdict-first screen of whether the finding has been retracted, contradicted or failed to replicate: ROBUST / CONTESTED / UNREPLICABLE_HYPE / INSUFFICIENT_EVIDENCE with a 0-100 replicationRiskScore, confidence, a DO_NOT_RELY / VERIFY_BEFORE_RELYING / RELY_WITH_CAVEATS action, a one-line headline and a next step. Checks Crossref,","inputs":[{"name":"arxivId","type":"string","required":false,"description":"arXiv id or arxiv.org URL (2106.09685, arXiv:1706.03762, hep-th/9901001). Resolved through Semantic Scholar and OpenAlex."},{"name":"doi","type":"string","required":false,"description":"DOI of the paper to audit (bare, doi: or doi.org URL). Takes precedence over paperTitleOrDoi."},{"name":"paperTitleOrDoi","type":"string","required":false,"description":"DOI (10.xxxx/..., bare or doi.org URL), arXiv or PubMed URL, or title of the paper to audit."},{"name":"pmid","type":"string","required":false,"description":"PubMed id (digits) or pubmed.ncbi.nlm.nih.gov URL. Mapped to the DOI through Europe PMC."},{"name":"scientificClaim","type":"string","required":false,"description":"Free-text claim; the originating and closely related works are located by search. Used as context when a paper is also given."},{"name":"url","type":"string","required":false,"description":"A doi.org, arxiv.org or pubmed.ncbi.nlm.nih.gov URL for the paper."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":338},{"name":"abandoned-compound-miner","title":null,"description":"Abandoned Compound & Uncommercialized Trial Miner — Finds shelved drug and biologic candidates worth a second look. Give a disease or target (mines ClinicalTrials.gov for terminated, withdrawn and suspended trials and for completed Phase 1/2 non-industry trials with no later industry Phase 2/3/4 trial), a compound you already have in mind (drug name or ChEMBL id), a trial (NCT id), or a desired material property (literature mode, no trials). Every","inputs":[{"name":"biologicalTargetOrCondition","type":"string","required":false,"description":"Disease, condition or biological target (e.g. \"amyotrophic lateral sclerosis\", \"BACE1\"). Mines stopped and completed-without-follow-up clinical trials."},{"name":"compound","type":"string","required":false,"description":"A compound you already have in mind, as a drug name or ChEMBL id (e.g. \"edaravone\", \"CHEMBL290916\"). Returns whether it is an abandoned, safe-to-pursue candidate or why it was excluded (marketed, saf…"},{"name":"includeCompletedNoFollowUp","type":"boolean","required":false,"description":"Include completed Phase 1/2 non-industry trials with no later industry Phase 2/3/4 trial of the same intervention. Default true."},{"name":"materialProperty","type":"string","required":false,"description":"Desired material property (e.g. \"high ionic conductivity solid electrolyte\"). Mines the literature indexes; no trials are involved."},{"name":"maxCandidates","type":"integer","required":false,"description":"Dossiers to produce (default 4, max 8). Model cost is at most one fast call per candidate."},{"name":"nctId","type":"string","required":false,"description":"A ClinicalTrials.gov trial id (e.g. \"NCT01257048\"). The compound it tested is reviewed as with `compound`."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":369},{"name":"audit-prose-forensics","title":null,"description":"Forensic AI-trajectory & prose craft auditor — Deterministic prose forensics: word echoes within 50 words, repeated 3-6-grams, sentence-starter runs, hedge/filter/passive/nominalization density, burstiness, MATTR, Flesch-Kincaid, vocabulary fingerprints, AI syntactic tics (Not X. Y. pivots, verbless fragments, autonomous body parts), optional revision-history trajectory, and an editorial humanization map whose quotes are verified verbatim. Eve","inputs":[{"name":"genre","type":"string","required":false,"description":"Context for the editorial pass only."},{"name":"revisionHistory","type":"array","required":false,"description":"Earlier drafts of the same text with ISO-8601 timestamps; adds a revision trajectory as process evidence."},{"name":"text","type":"string","required":true,"description":"Plain-text prose to audit (English)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":171},{"name":"compressibility-rank","title":null,"description":"Rank the most compressible (cliched) phrases in a chapter — Finds the phrases in a passage that compress most against a reference corpus of generic prose, so a writer can target the low-entropy spans instead of guessing. For each sentence (default) or sliding n-gram, computes the marginal compressed-byte contribution per character with zlib level 9 and a built-in reference corpus of common narrative clichés; the lowest-scoring spans are the most predictabl","inputs":[{"name":"minChars","type":"integer","required":false,"description":"Minimum characters per candidate span (default 18)."},{"name":"mode","type":"string","required":false,"description":"sentence (default) scores at sentence boundaries; ngram scores every sliding window of ngramSize words."},{"name":"ngramSize","type":"integer","required":false,"description":"Words per window when mode is ngram (default 5)."},{"name":"reference","type":"string","required":false,"description":"Optional reference corpus to prepend before compression. When absent, the built-in 50 KB generic-prose corpus is used unless useBuiltInReference is false."},{"name":"text","type":"string","required":true,"description":"The chapter or passage to score."},{"name":"topN","type":"integer","required":false,"description":"How many lowest-score spans to return (default 10)."},{"name":"useBuiltInReference","type":"boolean","required":false,"description":"Pass false to score with no reference corpus (local redundancy only). Default true."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":262},{"name":"crosstalk-deliberate","title":null,"description":"Crosstalk epistemic swarm & falsification engine — Stress-tests a research question instead of answering it once. Classifies the domain, generates up to 3 independent hypotheses, attacks each with an adversarial falsification pass, checks live literature on arXiv and OpenAlex (plus any papers you supply by arXiv id or DOI; every record content-addressed by sha256), then synthesizes a calibrated answer. The output leads with a headline (status, ans","inputs":[{"name":"context","type":"string","required":false,"description":"Optional background, constraints, data or prior attempts."},{"name":"maxHypotheses","type":"integer","required":false,"description":"Independent hypotheses to generate and attack (default 3)."},{"name":"papers","type":"array","required":false,"description":"Up to 5 papers you already have, as arXiv ids or URLs (2201.11903, arxiv.org/abs/...) or DOIs (10.xxxx/..., doi.org URLs). They are fetched and become citable evidence records alongside the live lite…"},{"name":"question","type":"string","required":true,"description":"The question or claim to deliberate."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":222},{"name":"causalReferee","title":null,"description":"Causal Claim Referee — Referees a causal claim against an observational table (JSON rows, CSV text, or a published contingency table with counts) and leads with a verdict, confidence, whether the claim holds, the crude and adjusted effects with bootstrap intervals, and a concrete next step. Underneath: crude and stratified effects, Mantel-Haenszel pooling, Simpson's-paradox detection, d-separation and backdoor/front-doo","inputs":[{"name":"alpha","type":"number","required":false,"description":"Significance level for the permutation test and the (1-alpha) bootstrap interval, default 0.05."},{"name":"bins","type":"integer","required":false,"description":"Quantile bins for numeric covariates, default 4."},{"name":"bootstrapReps","type":"integer","required":false,"description":null},{"name":"claim","type":"string","required":true,"description":"The causal claim being refereed, in plain language."},{"name":"claimDirection","type":"string","required":false,"description":"Direction of the claimed effect of treated vs control; default nonzero."},{"name":"countColumn","type":"string","required":false,"description":"Name of a column holding how many times each row repeats, so a published contingency table can be sent as a few aggregate rows (counts must be non-negative integers; the expanded table is capped at t…"},{"name":"covariates","type":"array","required":true,"description":"Candidate adjustment variables (at most 12). Numeric ones with more than `bins` distinct values are cut at deterministic quantile edges; others must have at most 20 levels."},{"name":"csv","type":"string","required":false,"description":"Alternative to data: CSV text with a header line (comma, semicolon or tab separated; quoted fields allowed; at most 20000 data rows). Numeric cells become numbers."},{"name":"dag","type":"object","required":false,"description":"Your causal DAG (formal input: no LLM is called to build the graph or, by default, the report). Omit to have one proposed by two independent model samples, which is then an assumption."},{"name":"data","type":"array","required":false,"description":"Observational table as an array of row objects (at most 20000 rows). Cells are string, number, boolean or null; rows missing a used variable are dropped. Provide this or csv."},{"name":"descriptions","type":"object","required":false,"description":"Optional one-line description per variable, used only to propose the DAG."},{"name":"llmReport","type":"boolean","required":false,"description":"Ask a model to write the executive report in prose (numbers verified in code, template fallback). Default false: the report is a deterministic template over the computed results."},{"name":"outcome","type":"string","required":true,"description":"Binary column (risk difference, risk ratio, odds ratio) or numeric column (mean difference)."},{"name":"outcomeType","type":"string","required":false,"description":"Force the outcome type; inferred from the number of distinct values otherwise."},{"name":"permutationSamples","type":"integer","required":false,"description":"Used only when the exact enumeration would exceed 1000000 label assignments."},{"name":"seed","type":"integer","required":false,"description":"Seed for bootstrap and Monte Carlo; default derived from the input hash."},{"name":"successValue","type":null,"required":false,"description":"Outcome value that counts as success for a binary outcome; same default rule."},{"name":"treatedValue","type":null,"required":false,"description":"Treatment value that counts as treated; required unless the values are numeric or boolean (then the larger is treated)."},{"name":"treatment","type":"string","required":true,"description":"Column with exactly two distinct values."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":634},{"name":"sequence-identifier","title":null,"description":"Integer Sequence Identifier — Identifies an integer sequence from terms (a JSON array or pasted text), an OEIS A-number, a safe-parsed formula or recurrence, or a description, and leads with a verdict, confidence, A-number, formula, next terms and a next step. Searches the OEIS directly, then superseeker-style (differences, partial sums, gcd, ratios, binomial, Euler, leading terms, plus a search without the last two terms to f","inputs":[{"name":"aNumber","type":"string","required":false,"description":"Alternative to terms: an OEIS A-number (A000108) or oeis.org URL. The entry is fetched and its data searched for related sequences; returns its name, formulas and next terms."},{"name":"count","type":"integer","required":false,"description":"How many terms to expand from the formula; default 20."},{"name":"description","type":"string","required":false,"description":"Alternative to terms and formula: a plain-language description. A short description that names an entry (up to 4 content words, all in the entry name, e.g. Catalan numbers) is resolved by OEIS text s…"},{"name":"explain","type":"boolean","required":false,"description":"Ask a model for a one-sentence explanation drawn only from the matched OEIS entry; its quote is verified in code, otherwise the entry name is returned. Default false."},{"name":"formula","type":"string","required":false,"description":"Alternative to terms: a closed form in n such as \"binomial(2*n,n)/(n+1)\", or a recurrence such as \"a(n) = a(n-1) + a(n-2)\" (with initialTerms). Operators + - * / % ^, functions binomial fact abs gcd…"},{"name":"initialTerms","type":"array","required":false,"description":"Seed values a(start), a(start+1), ... for a recurrence formula."},{"name":"start","type":"integer","required":false,"description":"Index n of the first expanded term; default 0."},{"name":"terms","type":"array","required":false,"description":"Integer terms, 4 to 60, each at most 40 digits. Pass values beyond 2^53 as decimal strings."},{"name":"termsText","type":"string","required":false,"description":"Alternative to terms: the terms pasted as text, separated by commas, spaces or semicolons (for example copied from a spreadsheet, a paper or an OEIS data line)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":495},{"name":"future-work-miner","title":null,"description":"Open Research Opportunity Miner — Leads with a verdict (OPEN_GAPS_FOUND, NO_CLEAR_OPEN_GAPS or NO_GAPS_EXTRACTED), a confidence, a headline naming the top gap with its quoted evidence, and the next step. Collects papers for a topic or seed list (arXiv ids or URLs, DOIs, PMIDs; arXiv and OpenAlex search), reads full text from ar5iv or Europe PMC, and extracts future-work, limitation and open-question sentences in code with exact se","inputs":[{"name":"field","type":"string","required":false,"description":"Field or discipline keyword added to the topic search, e.g. \"machine learning\"."},{"name":"fromDate","type":"string","required":false,"description":"Only topic-search papers published on or after this date (YYYY-MM-DD)."},{"name":"maxPapers","type":"integer","required":false,"description":"Papers to analyse, at most 25 (default 10); seeds count toward it."},{"name":"mode","type":"string","required":false,"description":"fast: zero model calls (lexical clustering and lexical addressed-check). full (default): one clustering call and one judging call, bounded to one status level."},{"name":"query","type":"string","required":false,"description":"Research topic, e.g. \"parameter-efficient fine-tuning of language models\"."},{"name":"seeds","type":"array","required":false,"description":"Seed papers you already have: arXiv ids or URLs (2106.09685, arXiv:1706.03762, arxiv.org/abs/...), DOIs or doi.org URLs, or PMIDs (PMID:12345678 or a PubMed URL). Always analysed, not date-filtered."},{"name":"toDate","type":"string","required":false,"description":"Only topic-search papers published on or before this date (YYYY-MM-DD)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":341},{"name":"reference-verifier","title":null,"description":"Bibliography Reference Verifier — Checks every reference in a bibliography against Crossref, OpenAlex, arXiv and Europe PMC and leads with a verdict (FIX_REQUIRED, REVIEW_RECOMMENDED, INCOMPLETE or ALL_VERIFIED), a confidence, a one-line headline, the next step and a prioritized fix list. Input: BibTeX, LaTeX \\bibitem, a plain-text list (APA, IEEE, Vancouver), an arXiv id (read via ar5iv), a PDF URL, or just a list of DOIs, arXiv","inputs":[{"name":"arxivId","type":"string","required":false,"description":"arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF."},{"name":"bibtex","type":"string","required":false,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},{"name":"checkSupport","type":"boolean","required":false,"description":"Needs manuscript text (or latex, arxivId, pdfUrl). Spends one fast-tier model call to judge whether each cited abstract supports its citing sentence (at most 20 citations)."},{"name":"identifiers","type":"array","required":false,"description":"Bare identifiers instead of a bibliography: up to 150 DOIs (bare, doi: or doi.org URL), arXiv ids or URLs, or PMIDs (bare, PMID: or PubMed URL), mixed freely. Each is resolved and checked for retract…"},{"name":"latex","type":"string","required":false,"description":"LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries."},{"name":"manuscript","type":"string","required":false,"description":"Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations."},{"name":"pdfUrl","type":"string","required":false,"description":"Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best)."},{"name":"references","type":"string","required":false,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":434},{"name":"paperContradictions","title":null,"description":"Paper Contradiction Finder — Takes 2 to 4 papers (DOI, arXiv id, PMID or their URLs) on a shared question and answers whether their reported numbers conflict: a verdict (CONTRADICTION_FOUND / NO_CONTRADICTION_FOUND / INCONCLUSIVE) with confidence, a one-line headline, the decisive quotes side by side and a next step, then the full evidence. Fetches the best available text (ar5iv, Europe PMC full text, else abstract), extracts","inputs":[{"name":"claim","type":"string","required":false,"description":"Optional claim or question to focus on; claims about it are paired first."},{"name":"mode","type":"string","required":false,"description":"full (default): one model call judges whether candidate claim pairs measure the same quantity in comparable populations. fast: no model call; only pairs with identical normalized outcome phrases are…"},{"name":"papers","type":"array","required":true,"description":"2 to 4 papers on a shared question, each a DOI (bare, doi: or doi.org URL), an arXiv id or arxiv.org URL, or a PMID (bare, PMID:n, or a pubmed.ncbi.nlm.nih.gov or europepmc.org URL)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":244},{"name":"manuscript-check","title":null,"description":"Manuscript Pre-submission Check — Verifies every reference in a manuscript against Crossref, OpenAlex, arXiv and Europe PMC (fabricated, mis-cited, retracted) and runs deterministic prose forensics on the same text. Runs reference-verifier ($0.50) + audit-prose-forensics ($1.00) in one paid call for 20% less than buying them separately. Charged only when every member succeeds.","inputs":[{"name":"bibtex","type":"string","required":false,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},{"name":"genre","type":"string","required":false,"description":"Context for the editorial pass only."},{"name":"manuscript","type":"string","required":true,"description":"Full manuscript text including its reference list."},{"name":"references","type":"string","required":false,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":182},{"name":"citation-audit","title":null,"description":"Citation Audit — Bibliography in, evidence audit out: reference-verifier checks every reference (fabricated, mis-cited, retracted, corrected); the top DOI-bearing references (corrections first, then the most cited in the manuscript) get a replication-auditor pass on the sentence that cites them; when a target is contested, paper-contradictions compares it with the studies against it. The contradiction check is opt","inputs":[{"name":"arxivId","type":"string","required":false,"description":"arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF."},{"name":"bibtex","type":"string","required":false,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},{"name":"claim","type":"string","required":false,"description":"The claim the bibliography supports; used for the replication and contradiction checks instead of the citing sentence."},{"name":"identifiers","type":"array","required":false,"description":"Bare identifiers instead of a bibliography: up to 150 DOIs (bare, doi: or doi.org URL), arXiv ids or URLs, or PMIDs (bare, PMID: or PubMed URL), mixed freely. Each is resolved and checked for retract…"},{"name":"latex","type":"string","required":false,"description":"LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries."},{"name":"manuscript","type":"string","required":false,"description":"Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations."},{"name":"pdfUrl","type":"string","required":false,"description":"Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best)."},{"name":"references","type":"string","required":false,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."},{"name":"topK","type":"integer","required":false,"description":"References to audit for replication (default 2)."}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":403}],"toolsTruncatedAtCapture":false,"diagnostics":{"capturedAt":"2026-11-21T08:24:30.000Z","track":"remote","endpoint":"https://agents.writerslogic.com/mcp/research","declaredUrl":null,"truncated":false,"tls":{"outcome":"valid","label":"Valid","version":"TLS 1.3","cipherSuite":"TLS_AES_128_GCM_SHA256","chainError":null,"certificates":[{"subject":"CN=writerslogic.com","issuer":"CN=WE1,O=Google Trust Services,C=US","notBefore":"2026-11-04T09:02:49Z","notAfter":"2027-02-02T10:02:46Z","keyType":"ECDSA","keyBits":256,"isCa":false},{"subject":"CN=WE1,O=Google Trust Services,C=US","issuer":"CN=GTS Root R4,O=Google Trust Services LLC,C=US","notBefore":"2023-12-13T09:00:00Z","notAfter":"2029-02-20T14:00:00Z","keyType":"ECDSA","keyBits":256,"isCa":true},{"subject":"CN=GTS Root R4,O=Google Trust Services LLC,C=US","issuer":"CN=GlobalSign Root CA,OU=Root CA,O=GlobalSign nv-sa,C=BE","notBefore":"2023-11-15T03:43:21Z","notAfter":"2028-01-28T00:00:42Z","keyType":"ECDSA","keyBits":384,"isCa":true}]},"dnssec":{"result":"secure","label":"Secure","name":"agents.writerslogic.com.","steps":[{"zone":".","outcome":"verified","label":"Verified"},{"zone":"com.","outcome":"verified","label":"Verified"},{"zone":"writerslogic.com.","outcome":"verified","label":"Verified"},{"zone":"agents.writerslogic.com.","outcome":"verified","label":"Verified"}]},"auth":{"outcome":"none","label":"No authorisation required","gate":null,"gateLabel":null,"status":200,"authorizationServers":[]},"httpsRedirect":{"outcome":"https_enforced","label":"HTTPS enforced","status":301},"transports":[{"transport":"streamable-http","outcome":"verified","label":"Verified","status":200,"followed":false}],"provenance":null,"installScripts":[],"installScriptsTotal":null,"vulnerabilities":[],"vulnerabilitiesTotal":null,"dependencies":null},"mismatches":[],"changelog":{"trackingSince":"2026-11-15","recent":[{"id":"chg_01a1f81d-e4db-70d4-8269-1fe37a0b0601","kind":"score.total_changed","summary":"Trust score (64 → 65)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-20","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research#chg-chg_01a1f81d-e4db-70d4-8269-1fe37a0b0601"},{"id":"chg_01a1edc0-5f78-764d-b5a9-6b1dd11fd014","kind":"score.total_changed","summary":"Trust score (63 → 64)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-18","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research#chg-chg_01a1edc0-5f78-764d-b5a9-6b1dd11fd014"},{"id":"chg_01a1e371-042c-759b-bbb0-6e8f16c9c2d0","kind":"check.reverified","summary":"Stability (unverified → 0.03)","materiality":"functional","direction":"improvement","scoreDelta":null,"occurredOn":"2026-11-16","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research#chg-chg_01a1e371-042c-759b-bbb0-6e8f16c9c2d0"},{"id":"chg_01a1e371-042c-7d3d-8e5e-f74d009ad21a","kind":"score.total_changed","summary":"Trust score (62 → 63)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-16","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research#chg-chg_01a1e371-042c-7d3d-8e5e-f74d009ad21a"},{"id":"chg_01a1e05e-10ba-750f-9680-1c69dbc8aa0a","kind":"score.first_scored","summary":"First indexed and scored","materiality":"functional","direction":"neutral","scoreDelta":null,"occurredOn":"2026-11-15","url":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research#chg-chg_01a1e05e-10ba-750f-9680-1c69dbc8aa0a"}],"truncated":false,"feedUrl":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research/changelog.json"},"links":{"html":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research","markdown":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research.md","changelogJson":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research/changelog.json","changelogRss":"https://verifymcp.io/servers/com-writerslogic-agents-writerslogic-research/mcp-research.xml","external":[{"label":"Remote endpoint","href":"https://agents.writerslogic.com/mcp/research"},{"label":"Repository","href":"https://github.com/writerslogic/ai-agents"},{"label":"Website","href":"https://writerslogic.com/agents"}]}}