{"data":{"name":"com.writerslogic.agents/writerslogic-research","title":"WritersLogic research agents","description":"ArXiv to code, replication audits, paper contradictions, citation audit, prose forensics.","version":"1.0.0","websiteUrl":"https://writerslogic.com/agents","repositoryUrl":"https://github.com/writerslogic/ai-agents","remotes":[{"type":"streamable-http","url":"https://agents.writerslogic.com/mcp/research"}],"packages":[],"status":"active","isLatest":true,"publishedAt":"2026-11-15T17:19:28.252Z","updatedAt":"2026-11-15T17:19:28.252Z","source":"official-registry","verification":"official","confidence":100,"stars":null,"sources":[{"source":"official-registry","sourceId":"com.writerslogic.agents/writerslogic-research","verification":"official","confidence":100,"stars":null,"updatedAt":"2026-11-15T17:19:28.252Z","title":"WritersLogic research agents","description":"ArXiv to code, replication audits, paper contradictions, citation audit, prose forensics.","websiteUrl":"https://writerslogic.com/agents","repositoryUrl":"https://github.com/writerslogic/ai-agents"}],"toolIndex":{"tools":[{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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 ","inputSchema":{"type":"object","properties":{"biologicalTargetOrCondition":{"type":"string","minLength":2,"maxLength":200,"description":"Disease, condition or biological target (e.g. \"amyotrophic lateral sclerosis\", \"BACE1\"). Mines stopped and completed-without-follow-up clinical trials."},"materialProperty":{"type":"string","minLength":2,"maxLength":200,"description":"Desired material property (e.g. \"high ionic conductivity solid electrolyte\"). Mines the literature indexes; no trials are involved."},"compound":{"type":"string","minLength":2,"maxLength":200,"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, safety signal, active development). Replaces the condition search."},"nctId":{"type":"string","pattern":"^(?:NCT|nct)\\d{8}$","description":"A ClinicalTrials.gov trial id (e.g. \"NCT01257048\"). The compound it tested is reviewed as with `compound`."},"includeCompletedNoFollowUp":{"type":"boolean","description":"Include completed Phase 1/2 non-industry trials with no later industry Phase 2/3/4 trial of the same intervention. Default true."},"maxCandidates":{"type":"integer","minimum":1,"maximum":8,"description":"Dossiers to produce (default 4, max 8). Model cost is at most one fast call per candidate."}},"additionalProperties":false},"annotations":null,"definitionHash":"d109f6f27924887fd35c0bedddba5bf59e627f239317b74f11e1944fc44b4ad9","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"arxivId":{"type":"string","maxLength":120,"description":"arXiv id or URL, e.g. 1706.03762 or https://arxiv.org/abs/1706.03762."},"searchQuery":{"type":"string","maxLength":300,"description":"Title or keywords; the top arXiv hit is used. Provide exactly one of arxivId or searchQuery."},"targetLanguage":{"type":"string","enum":["typescript","python"]}},"required":["targetLanguage"],"additionalProperties":false},"annotations":null,"definitionHash":"f0432f854068b124357b32edab387114ec3c1bbff57546dbc0d4baf844bf1044","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"text":{"type":"string","minLength":1,"maxLength":300000,"description":"Plain-text prose to audit (English)."},"revisionHistory":{"type":"array","maxItems":50,"description":"Earlier drafts of the same text with ISO-8601 timestamps; adds a revision trajectory as process evidence.","items":{"type":"object","additionalProperties":false,"required":["timestamp","text"],"properties":{"timestamp":{"type":"string","minLength":4,"maxLength":40,"description":"ISO-8601 date-time."},"text":{"type":"string","maxLength":200000}}}},"genre":{"type":"string","enum":["fiction","memoir","essay","journalism","academic","business","other"],"description":"Context for the editorial pass only."}},"required":["text"],"additionalProperties":false},"annotations":null,"definitionHash":"27f8c7b4da315b3cb2b8e979893fab0e59ac5a1aafbb4f538c709292975d730d","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"data":{"type":"array","minItems":2,"maxItems":20000,"items":{"type":"object"},"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."},"csv":{"type":"string","minLength":10,"maxLength":3000000,"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."},"countColumn":{"type":"string","minLength":1,"maxLength":100,"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 the row limit)."},"treatment":{"type":"string","minLength":1,"maxLength":100,"description":"Column with exactly two distinct values."},"outcome":{"type":"string","minLength":1,"maxLength":100,"description":"Binary column (risk difference, risk ratio, odds ratio) or numeric column (mean difference)."},"covariates":{"type":"array","maxItems":12,"items":{"type":"string","minLength":1,"maxLength":100},"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."},"claim":{"type":"string","minLength":3,"maxLength":2000,"description":"The causal claim being refereed, in plain language."},"dag":{"type":"object","additionalProperties":false,"required":["edges"],"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.","properties":{"edges":{"type":"array","maxItems":200,"items":{"type":"object","additionalProperties":false,"required":["from","to"],"properties":{"from":{"type":"string","maxLength":100},"to":{"type":"string","maxLength":100}}},"description":"Directed edges from cause to effect between the treatment, outcome, covariates and unobserved nodes."},"unobserved":{"type":"array","maxItems":10,"items":{"type":"string","minLength":1,"maxLength":100},"description":"Latent variables that appear in edges (for example an unmeasured confounder)."}}},"treatedValue":{"anyOf":[{"type":"string"},{"type":"number"},{"type":"boolean"}],"description":"Treatment value that counts as treated; required unless the values are numeric or boolean (then the larger is treated)."},"successValue":{"anyOf":[{"type":"string"},{"type":"number"},{"type":"boolean"}],"description":"Outcome value that counts as success for a binary outcome; same default rule."},"outcomeType":{"type":"string","enum":["binary","continuous"],"description":"Force the outcome type; inferred from the number of distinct values otherwise."},"claimDirection":{"type":"string","enum":["positive","negative","nonzero"],"description":"Direction of the claimed effect of treated vs control; default nonzero."},"bins":{"type":"integer","minimum":2,"maximum":10,"description":"Quantile bins for numeric covariates, default 4."},"alpha":{"type":"number","minimum":0.001,"maximum":0.2,"description":"Significance level for the permutation test and the (1-alpha) bootstrap interval, default 0.05."},"seed":{"type":"integer","minimum":0,"maximum":4294967295,"description":"Seed for bootstrap and Monte Carlo; default derived from the input hash."},"bootstrapReps":{"type":"integer","minimum":100,"maximum":2000},"permutationSamples":{"type":"integer","minimum":1000,"maximum":200000,"description":"Used only when the exact enumeration would exceed 1000000 label assignments."},"llmReport":{"type":"boolean","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."},"descriptions":{"type":"object","description":"Optional one-line description per variable, used only to propose the DAG."}},"required":["treatment","outcome","covariates","claim"],"additionalProperties":false},"annotations":null,"definitionHash":"0a62ab9c28846be6acbbb1859160541a332c442dd082c729e2235f1b65c59079","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"bibtex":{"type":"string","minLength":10,"maxLength":400000,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},"latex":{"type":"string","minLength":10,"maxLength":400000,"description":"LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries."},"references":{"type":"string","minLength":10,"maxLength":200000,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."},"arxivId":{"type":"string","minLength":4,"maxLength":80,"description":"arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF."},"pdfUrl":{"type":"string","minLength":8,"maxLength":2000,"description":"Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best)."},"identifiers":{"type":"array","minItems":1,"maxItems":150,"items":{"type":"string","minLength":3,"maxLength":300},"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 retraction, correction and a published version of record."},"manuscript":{"type":"string","minLength":10,"maxLength":400000,"description":"Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations."},"claim":{"type":"string","minLength":10,"maxLength":2000,"description":"The claim the bibliography supports; used for the replication and contradiction checks instead of the citing sentence."},"topK":{"type":"integer","minimum":1,"maximum":2,"description":"References to audit for replication (default 2)."}},"additionalProperties":false},"annotations":null,"definitionHash":"2326c73dd7b8e15b7204294ff3960c5d4e318e5f24490df8febb0765c4129c47","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"text":{"type":"string","minLength":20,"maxLength":200000,"description":"The chapter or passage to score."},"mode":{"type":"string","enum":["sentence","ngram"],"description":"sentence (default) scores at sentence boundaries; ngram scores every sliding window of ngramSize words."},"ngramSize":{"type":"integer","minimum":3,"maximum":7,"description":"Words per window when mode is ngram (default 5)."},"minChars":{"type":"integer","minimum":8,"maximum":400,"description":"Minimum characters per candidate span (default 18)."},"topN":{"type":"integer","minimum":1,"maximum":50,"description":"How many lowest-score spans to return (default 10)."},"reference":{"type":"string","maxLength":200000,"description":"Optional reference corpus to prepend before compression. When absent, the built-in 50 KB generic-prose corpus is used unless useBuiltInReference is false."},"useBuiltInReference":{"type":"boolean","description":"Pass false to score with no reference corpus (local redundancy only). Default true."}},"required":["text"],"additionalProperties":false},"annotations":null,"definitionHash":"4d8516b30125da66b3f70ee237ee67083707d79d1a0dcbba2375930c377f0296","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"question":{"type":"string","minLength":3,"maxLength":4000,"description":"The question or claim to deliberate."},"context":{"type":"string","maxLength":8000,"description":"Optional background, constraints, data or prior attempts."},"maxHypotheses":{"type":"integer","minimum":1,"maximum":3,"description":"Independent hypotheses to generate and attack (default 3)."},"papers":{"type":"array","maxItems":5,"items":{"type":"string","minLength":4,"maxLength":200},"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 literature search."}},"required":["question"],"additionalProperties":false},"annotations":null,"definitionHash":"df7cd191e744fca3b46cc79f5aa3cf953e34de666528b6825aaa7dbdf1453730","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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. ","inputSchema":{"type":"object","properties":{"researchTopic":{"type":"string","minLength":3,"maxLength":500,"description":"English research topic, e.g. \"sulfide solid electrolytes for all-solid-state lithium batteries\"."},"technicalBottleneck":{"type":"string","minLength":3,"maxLength":1000,"description":"English description of an unsolved technical bottleneck. Provide this, researchTopic or seedPaper (or several)."},"seedPaper":{"type":"string","minLength":5,"maxLength":300,"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 problem."},"targetLanguages":{"type":"array","maxItems":6,"items":{"type":"string","pattern":"^[A-Za-z]{2}$"},"description":"ISO 639-1 codes of non-English languages to mine (max 6). Default zh, ja, de, fr, ko."},"fromDate":{"type":"string","pattern":"^\\d{4}-\\d{2}-\\d{2}$","description":"Earliest publication date. Default: 10 years before the call."},"toDate":{"type":"string","pattern":"^\\d{4}-\\d{2}-\\d{2}$","description":"Latest publication date (inclusive)."},"maxResults":{"type":"integer","minimum":1,"maximum":8,"description":"Discoveries to return (default 5, max 8)."}},"additionalProperties":false},"annotations":null,"definitionHash":"a16065437318f6e8d14b5d6ff967f882e1116fb359d1628e797c4c2f329efce7","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"query":{"type":"string","minLength":3,"maxLength":300,"description":"Research topic, e.g. \"parameter-efficient fine-tuning of language models\"."},"seeds":{"type":"array","maxItems":25,"items":{"type":"string","minLength":5,"maxLength":200},"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."},"fromDate":{"type":"string","minLength":10,"maxLength":10,"pattern":"^\\d{4}-\\d{2}-\\d{2}$","description":"Only topic-search papers published on or after this date (YYYY-MM-DD)."},"toDate":{"type":"string","minLength":10,"maxLength":10,"pattern":"^\\d{4}-\\d{2}-\\d{2}$","description":"Only topic-search papers published on or before this date (YYYY-MM-DD)."},"maxPapers":{"type":"integer","minimum":1,"maximum":25,"description":"Papers to analyse, at most 25 (default 10); seeds count toward it."},"field":{"type":"string","minLength":2,"maxLength":80,"description":"Field or discipline keyword added to the topic search, e.g. \"machine learning\"."},"mode":{"type":"string","enum":["fast","full"],"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."}},"additionalProperties":false},"annotations":null,"definitionHash":"c124aa23ec4b450a457faed93c0a6594b35ba2d6703e8a44f0bbd2d94f4ce909","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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.","inputSchema":{"type":"object","properties":{"manuscript":{"type":"string","minLength":1,"maxLength":300000,"description":"Full manuscript text including its reference list."},"bibtex":{"type":"string","minLength":10,"maxLength":400000,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},"references":{"type":"string","minLength":10,"maxLength":200000,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."},"genre":{"type":"string","enum":["fiction","memoir","essay","journalism","academic","business","other"],"description":"Context for the editorial pass only."}},"required":["manuscript"],"additionalProperties":false},"annotations":null,"definitionHash":"3537564fdb89a84b5579180e87c431d50a8f7f0a901abab00883354cbb0127cb","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"papers":{"type":"array","minItems":2,"maxItems":4,"items":{"type":"string","minLength":3,"maxLength":300},"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)."},"claim":{"type":"string","minLength":3,"maxLength":2000,"description":"Optional claim or question to focus on; claims about it are paired first."},"mode":{"type":"string","enum":["full","fast"],"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 tested."}},"required":["papers"],"additionalProperties":false},"annotations":null,"definitionHash":"fddeb43c16b265e699a97f8e6dbc939664c633a26d7cebe90d0ad65ac6f96055","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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 ","inputSchema":{"type":"object","properties":{"bibtex":{"type":"string","minLength":10,"maxLength":400000,"description":"BibTeX/BibLaTeX text (the contents of a .bib file)."},"latex":{"type":"string","minLength":10,"maxLength":400000,"description":"LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries."},"references":{"type":"string","minLength":10,"maxLength":200000,"description":"Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago)."},"arxivId":{"type":"string","minLength":4,"maxLength":80,"description":"arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF."},"pdfUrl":{"type":"string","minLength":8,"maxLength":2000,"description":"Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best)."},"identifiers":{"type":"array","minItems":1,"maxItems":150,"items":{"type":"string","minLength":3,"maxLength":300},"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 retraction, correction and a published version of record."},"manuscript":{"type":"string","minLength":10,"maxLength":400000,"description":"Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations."},"checkSupport":{"type":"boolean","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)."}},"additionalProperties":false},"annotations":null,"definitionHash":"220d2dc033484789be949379d6d01b76886660b91add8eded432b0fd381debdb","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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,","inputSchema":{"type":"object","properties":{"paperTitleOrDoi":{"type":"string","minLength":3,"maxLength":500,"description":"DOI (10.xxxx/..., bare or doi.org URL), arXiv or PubMed URL, or title of the paper to audit."},"doi":{"type":"string","minLength":7,"maxLength":300,"description":"DOI of the paper to audit (bare, doi: or doi.org URL). Takes precedence over paperTitleOrDoi."},"arxivId":{"type":"string","minLength":4,"maxLength":80,"description":"arXiv id or arxiv.org URL (2106.09685, arXiv:1706.03762, hep-th/9901001). Resolved through Semantic Scholar and OpenAlex."},"pmid":{"type":"string","minLength":1,"maxLength":60,"description":"PubMed id (digits) or pubmed.ncbi.nlm.nih.gov URL. Mapped to the DOI through Europe PMC."},"url":{"type":"string","minLength":8,"maxLength":500,"description":"A doi.org, arxiv.org or pubmed.ncbi.nlm.nih.gov URL for the paper."},"scientificClaim":{"type":"string","minLength":10,"maxLength":2000,"description":"Free-text claim; the originating and closely related works are located by search. Used as context when a paper is also given."}},"additionalProperties":false},"annotations":null,"definitionHash":"00e0b490086d7977b72a2307f9d8e9f41502a8d8046e7b41531e6fbe1a0ae5df","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"},{"serverName":"com.writerslogic.agents/writerslogic-research","endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","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","inputSchema":{"type":"object","properties":{"terms":{"type":"array","minItems":4,"maxItems":60,"items":{"anyOf":[{"type":"integer"},{"type":"string","pattern":"^[+-]?[0-9]{1,40}$"}]},"description":"Integer terms, 4 to 60, each at most 40 digits. Pass values beyond 2^53 as decimal strings."},"termsText":{"type":"string","minLength":4,"maxLength":4000,"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)."},"aNumber":{"type":"string","minLength":1,"maxLength":120,"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."},"formula":{"type":"string","minLength":1,"maxLength":300,"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 min max floor mod. Evaluated by a safe parser, never eval; every term must be an integer."},"initialTerms":{"type":"array","maxItems":20,"items":{"anyOf":[{"type":"integer"},{"type":"string","pattern":"^[+-]?[0-9]{1,40}$"}]},"description":"Seed values a(start), a(start+1), ... for a recurrence formula."},"start":{"type":"integer","minimum":-100,"maximum":1000,"description":"Index n of the first expanded term; default 0."},"count":{"type":"integer","minimum":4,"maximum":60,"description":"How many terms to expand from the formula; default 20."},"description":{"type":"string","minLength":3,"maxLength":500,"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 search with no model; otherwise one fast model call proposes terms and keywords, which OEIS then confirms."},"explain":{"type":"boolean","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."}},"additionalProperties":false},"annotations":null,"definitionHash":"9050b950f8645664cb89ff3e6d889316ee9fbd1b6e06ae49cc74c6f6b7ccc621","schemaStatus":"valid","origin":"official-registry","observedAt":"2026-11-16T07:45:56.800Z","metadataTrust":"untrusted"}],"endpoints":[{"endpointFingerprint":"63553123ff9d295fe70056cf7145da72c0956f2b67a2f59fcbf2cab57dbbe8fa","protocol":"streamable-http","status":"indexed","toolCount":14,"observedAt":"2026-11-16T07:45:56.800Z"}],"authentication":"unknown"},"connectionConfigurations":{"status":"ready","authentication":"not embedded","clients":{"Claude Desktop":{"mcpServers":{"com.writerslogic.agents/writerslogic-research":{"url":"https://agents.writerslogic.com/mcp/research"}}},"Cursor":{"mcpServers":{"com.writerslogic.agents/writerslogic-research":{"url":"https://agents.writerslogic.com/mcp/research"}}},"VS Code":{"servers":{"com.writerslogic.agents/writerslogic-research":{"type":"http","url":"https://agents.writerslogic.com/mcp/research"}}}}},"resourceType":"mcp-server","callable":true,"runtime":{"callable":true,"protocols":["mcp"]},"interfaces":[{"protocol":"mcp","transport":"streamable-http","url":"https://agents.writerslogic.com/mcp/research"}],"profile":{"apiVersion":"1","schemaVersion":"1","id":"mcp-server:com.writerslogic.agents%2Fwriterslogic-research","resourceType":"mcp-server","canonicalUrl":"https://www.agentsjunction.com/api/v1/servers/com.writerslogic.agents%2Fwriterslogic-research","name":"com.writerslogic.agents/writerslogic-research","description":"ArXiv to code, replication audits, paper contradictions, citation audit, prose forensics.","interfaces":[{"protocol":"mcp","transport":"streamable-http","url":"https://agents.writerslogic.com/mcp/research"}],"capabilities":[],"identity":{"source":"official-registry","websiteUrl":"https://writerslogic.com/agents","repositoryUrl":"https://github.com/writerslogic/ai-agents","version":"1.0.0"},"verification":{"state":"official","confidence":100},"operations":{"resourceType":"mcp-server","name":"com.writerslogic.agents/writerslogic-research","status":"online","lastCheckedAt":"2026-11-20T09:17:10.429Z","lastSuccessfulCheck":"2026-11-20T09:17:10.429Z","latencyMs":43,"consecutiveFailures":0,"isStale":false,"checks":{"endpointReachable":true,"protocolValid":true,"agentCardValid":null,"mcpHandshakeValid":true},"lastSeen":null,"lastSuccessfulInteraction":null,"lastHealthCheck":"2026-11-20T09:17:10.429Z","source":{"type":"health-check","url":null},"observedAt":"2026-11-20T09:17:10.429Z"},"security":null,"timestamps":{"createdAt":"2026-11-15T17:19:28.252Z","updatedAt":"2026-11-15T17:19:28.252Z","observedAt":"2026-11-20T09:17:10.429Z"},"compatibility":{"serverVersion":"1.0.0","protocolVersions":[{"protocol":"mcp","version":null}]}}}}