Server definition
- Hash
- sha256:2a50ac284a6a65ddcd381a3df6e9dc880d91e274ace0cdf017ffc05f0734ccc6
- What it is
- What a remote MCP server returned when asked what it offers: 14 tools
The blob, as servednamed by its sha256
{
"instructions": "Call tools over this JSON-RPC endpoint. Priced agents require X-API-KEY (master, partner, or RapidAPI proxy secret); without one, tools/call returns a payment-required error pointing at the REST endpoint for x402 payment.",
"tools": [
{
"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": {
"additionalProperties": false,
"properties": {
"biologicalTargetOrCondition": {
"description": "Disease, condition or biological target (e.g. \"amyotrophic lateral sclerosis\", \"BACE1\"). Mines stopped and completed-without-follow-up clinical trials.",
"maxLength": 200,
"minLength": 2,
"type": "string"
},
"compound": {
"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.",
"maxLength": 200,
"minLength": 2,
"type": "string"
},
"includeCompletedNoFollowUp": {
"description": "Include completed Phase 1/2 non-industry trials with no later industry Phase 2/3/4 trial of the same intervention. Default true.",
"type": "boolean"
},
"materialProperty": {
"description": "Desired material property (e.g. \"high ionic conductivity solid electrolyte\"). Mines the literature indexes; no trials are involved.",
"maxLength": 200,
"minLength": 2,
"type": "string"
},
"maxCandidates": {
"description": "Dossiers to produce (default 4, max 8). Model cost is at most one fast call per candidate.",
"maximum": 8,
"minimum": 1,
"type": "integer"
},
"nctId": {
"description": "A ClinicalTrials.gov trial id (e.g. \"NCT01257048\"). The compound it tested is reviewed as with `compound`.",
"pattern": "^(?:NCT|nct)\\d{8}$",
"type": "string"
}
},
"type": "object"
},
"name": "abandoned-compound-miner",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"arxivId": {
"description": "arXiv id or URL, e.g. 1706.03762 or https://arxiv.org/abs/1706.03762.",
"maxLength": 120,
"type": "string"
},
"searchQuery": {
"description": "Title or keywords; the top arXiv hit is used. Provide exactly one of arxivId or searchQuery.",
"maxLength": 300,
"type": "string"
},
"targetLanguage": {
"enum": [
"typescript",
"python"
],
"type": "string"
}
},
"required": [
"targetLanguage"
],
"type": "object"
},
"name": "arxiv-to-code",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"genre": {
"description": "Context for the editorial pass only.",
"enum": [
"fiction",
"memoir",
"essay",
"journalism",
"academic",
"business",
"other"
],
"type": "string"
},
"revisionHistory": {
"description": "Earlier drafts of the same text with ISO-8601 timestamps; adds a revision trajectory as process evidence.",
"items": {
"additionalProperties": false,
"properties": {
"text": {
"maxLength": 200000,
"type": "string"
},
"timestamp": {
"description": "ISO-8601 date-time.",
"maxLength": 40,
"minLength": 4,
"type": "string"
}
},
"required": [
"timestamp",
"text"
],
"type": "object"
},
"maxItems": 50,
"type": "array"
},
"text": {
"description": "Plain-text prose to audit (English).",
"maxLength": 300000,
"minLength": 1,
"type": "string"
}
},
"required": [
"text"
],
"type": "object"
},
"name": "audit-prose-forensics",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"alpha": {
"description": "Significance level for the permutation test and the (1-alpha) bootstrap interval, default 0.05.",
"maximum": 0.2,
"minimum": 0.001,
"type": "number"
},
"bins": {
"description": "Quantile bins for numeric covariates, default 4.",
"maximum": 10,
"minimum": 2,
"type": "integer"
},
"bootstrapReps": {
"maximum": 2000,
"minimum": 100,
"type": "integer"
},
"claim": {
"description": "The causal claim being refereed, in plain language.",
"maxLength": 2000,
"minLength": 3,
"type": "string"
},
"claimDirection": {
"description": "Direction of the claimed effect of treated vs control; default nonzero.",
"enum": [
"positive",
"negative",
"nonzero"
],
"type": "string"
},
"countColumn": {
"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).",
"maxLength": 100,
"minLength": 1,
"type": "string"
},
"covariates": {
"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.",
"items": {
"maxLength": 100,
"minLength": 1,
"type": "string"
},
"maxItems": 12,
"type": "array"
},
"csv": {
"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.",
"maxLength": 3000000,
"minLength": 10,
"type": "string"
},
"dag": {
"additionalProperties": 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.",
"properties": {
"edges": {
"description": "Directed edges from cause to effect between the treatment, outcome, covariates and unobserved nodes.",
"items": {
"additionalProperties": false,
"properties": {
"from": {
"maxLength": 100,
"type": "string"
},
"to": {
"maxLength": 100,
"type": "string"
}
},
"required": [
"from",
"to"
],
"type": "object"
},
"maxItems": 200,
"type": "array"
},
"unobserved": {
"description": "Latent variables that appear in edges (for example an unmeasured confounder).",
"items": {
"maxLength": 100,
"minLength": 1,
"type": "string"
},
"maxItems": 10,
"type": "array"
}
},
"required": [
"edges"
],
"type": "object"
},
"data": {
"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.",
"items": {
"type": "object"
},
"maxItems": 20000,
"minItems": 2,
"type": "array"
},
"descriptions": {
"description": "Optional one-line description per variable, used only to propose the DAG.",
"type": "object"
},
"llmReport": {
"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.",
"type": "boolean"
},
"outcome": {
"description": "Binary column (risk difference, risk ratio, odds ratio) or numeric column (mean difference).",
"maxLength": 100,
"minLength": 1,
"type": "string"
},
"outcomeType": {
"description": "Force the outcome type; inferred from the number of distinct values otherwise.",
"enum": [
"binary",
"continuous"
],
"type": "string"
},
"permutationSamples": {
"description": "Used only when the exact enumeration would exceed 1000000 label assignments.",
"maximum": 200000,
"minimum": 1000,
"type": "integer"
},
"seed": {
"description": "Seed for bootstrap and Monte Carlo; default derived from the input hash.",
"maximum": 4294967295,
"minimum": 0,
"type": "integer"
},
"successValue": {
"anyOf": [
{
"type": "string"
},
{
"type": "number"
},
{
"type": "boolean"
}
],
"description": "Outcome value that counts as success for a binary outcome; same default rule."
},
"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)."
},
"treatment": {
"description": "Column with exactly two distinct values.",
"maxLength": 100,
"minLength": 1,
"type": "string"
}
},
"required": [
"treatment",
"outcome",
"covariates",
"claim"
],
"type": "object"
},
"name": "causalReferee",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"arxivId": {
"description": "arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF.",
"maxLength": 80,
"minLength": 4,
"type": "string"
},
"bibtex": {
"description": "BibTeX/BibLaTeX text (the contents of a .bib file).",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"claim": {
"description": "The claim the bibliography supports; used for the replication and contradiction checks instead of the citing sentence.",
"maxLength": 2000,
"minLength": 10,
"type": "string"
},
"identifiers": {
"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.",
"items": {
"maxLength": 300,
"minLength": 3,
"type": "string"
},
"maxItems": 150,
"minItems": 1,
"type": "array"
},
"latex": {
"description": "LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries.",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"manuscript": {
"description": "Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations.",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"pdfUrl": {
"description": "Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best).",
"maxLength": 2000,
"minLength": 8,
"type": "string"
},
"references": {
"description": "Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago).",
"maxLength": 200000,
"minLength": 10,
"type": "string"
},
"topK": {
"description": "References to audit for replication (default 2).",
"maximum": 2,
"minimum": 1,
"type": "integer"
}
},
"type": "object"
},
"name": "citation-audit",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"minChars": {
"description": "Minimum characters per candidate span (default 18).",
"maximum": 400,
"minimum": 8,
"type": "integer"
},
"mode": {
"description": "sentence (default) scores at sentence boundaries; ngram scores every sliding window of ngramSize words.",
"enum": [
"sentence",
"ngram"
],
"type": "string"
},
"ngramSize": {
"description": "Words per window when mode is ngram (default 5).",
"maximum": 7,
"minimum": 3,
"type": "integer"
},
"reference": {
"description": "Optional reference corpus to prepend before compression. When absent, the built-in 50 KB generic-prose corpus is used unless useBuiltInReference is false.",
"maxLength": 200000,
"type": "string"
},
"text": {
"description": "The chapter or passage to score.",
"maxLength": 200000,
"minLength": 20,
"type": "string"
},
"topN": {
"description": "How many lowest-score spans to return (default 10).",
"maximum": 50,
"minimum": 1,
"type": "integer"
},
"useBuiltInReference": {
"description": "Pass false to score with no reference corpus (local redundancy only). Default true.",
"type": "boolean"
}
},
"required": [
"text"
],
"type": "object"
},
"name": "compressibility-rank",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"context": {
"description": "Optional background, constraints, data or prior attempts.",
"maxLength": 8000,
"type": "string"
},
"maxHypotheses": {
"description": "Independent hypotheses to generate and attack (default 3).",
"maximum": 3,
"minimum": 1,
"type": "integer"
},
"papers": {
"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.",
"items": {
"maxLength": 200,
"minLength": 4,
"type": "string"
},
"maxItems": 5,
"type": "array"
},
"question": {
"description": "The question or claim to deliberate.",
"maxLength": 4000,
"minLength": 3,
"type": "string"
}
},
"required": [
"question"
],
"type": "object"
},
"name": "crosstalk-deliberate",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"fromDate": {
"description": "Earliest publication date. Default: 10 years before the call.",
"pattern": "^\\d{4}-\\d{2}-\\d{2}$",
"type": "string"
},
"maxResults": {
"description": "Discoveries to return (default 5, max 8).",
"maximum": 8,
"minimum": 1,
"type": "integer"
},
"researchTopic": {
"description": "English research topic, e.g. \"sulfide solid electrolytes for all-solid-state lithium batteries\".",
"maxLength": 500,
"minLength": 3,
"type": "string"
},
"seedPaper": {
"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.",
"maxLength": 300,
"minLength": 5,
"type": "string"
},
"targetLanguages": {
"description": "ISO 639-1 codes of non-English languages to mine (max 6). Default zh, ja, de, fr, ko.",
"items": {
"pattern": "^[A-Za-z]{2}$",
"type": "string"
},
"maxItems": 6,
"type": "array"
},
"technicalBottleneck": {
"description": "English description of an unsolved technical bottleneck. Provide this, researchTopic or seedPaper (or several).",
"maxLength": 1000,
"minLength": 3,
"type": "string"
},
"toDate": {
"description": "Latest publication date (inclusive).",
"pattern": "^\\d{4}-\\d{2}-\\d{2}$",
"type": "string"
}
},
"type": "object"
},
"name": "foreignResearchScout",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"field": {
"description": "Field or discipline keyword added to the topic search, e.g. \"machine learning\".",
"maxLength": 80,
"minLength": 2,
"type": "string"
},
"fromDate": {
"description": "Only topic-search papers published on or after this date (YYYY-MM-DD).",
"maxLength": 10,
"minLength": 10,
"pattern": "^\\d{4}-\\d{2}-\\d{2}$",
"type": "string"
},
"maxPapers": {
"description": "Papers to analyse, at most 25 (default 10); seeds count toward it.",
"maximum": 25,
"minimum": 1,
"type": "integer"
},
"mode": {
"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.",
"enum": [
"fast",
"full"
],
"type": "string"
},
"query": {
"description": "Research topic, e.g. \"parameter-efficient fine-tuning of language models\".",
"maxLength": 300,
"minLength": 3,
"type": "string"
},
"seeds": {
"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.",
"items": {
"maxLength": 200,
"minLength": 5,
"type": "string"
},
"maxItems": 25,
"type": "array"
},
"toDate": {
"description": "Only topic-search papers published on or before this date (YYYY-MM-DD).",
"maxLength": 10,
"minLength": 10,
"pattern": "^\\d{4}-\\d{2}-\\d{2}$",
"type": "string"
}
},
"type": "object"
},
"name": "future-work-miner",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"bibtex": {
"description": "BibTeX/BibLaTeX text (the contents of a .bib file).",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"genre": {
"description": "Context for the editorial pass only.",
"enum": [
"fiction",
"memoir",
"essay",
"journalism",
"academic",
"business",
"other"
],
"type": "string"
},
"manuscript": {
"description": "Full manuscript text including its reference list.",
"maxLength": 300000,
"minLength": 1,
"type": "string"
},
"references": {
"description": "Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago).",
"maxLength": 200000,
"minLength": 10,
"type": "string"
}
},
"required": [
"manuscript"
],
"type": "object"
},
"name": "manuscript-check",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"claim": {
"description": "Optional claim or question to focus on; claims about it are paired first.",
"maxLength": 2000,
"minLength": 3,
"type": "string"
},
"mode": {
"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.",
"enum": [
"full",
"fast"
],
"type": "string"
},
"papers": {
"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).",
"items": {
"maxLength": 300,
"minLength": 3,
"type": "string"
},
"maxItems": 4,
"minItems": 2,
"type": "array"
}
},
"required": [
"papers"
],
"type": "object"
},
"name": "paperContradictions",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"arxivId": {
"description": "arXiv id or URL; references are read from the ar5iv HTML (.ltx_bibitem), falling back to the PDF.",
"maxLength": 80,
"minLength": 4,
"type": "string"
},
"bibtex": {
"description": "BibTeX/BibLaTeX text (the contents of a .bib file).",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"checkSupport": {
"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).",
"type": "boolean"
},
"identifiers": {
"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.",
"items": {
"maxLength": 300,
"minLength": 3,
"type": "string"
},
"maxItems": 150,
"minItems": 1,
"type": "array"
},
"latex": {
"description": "LaTeX source with a thebibliography environment (\\bibitem) or embedded filecontents .bib; \\cite commands supply citation contexts and are checked against the entries.",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"manuscript": {
"description": "Optional manuscript text (LaTeX or plain) that supplies citation contexts: \\cite keys, [n] numbers or Author (year) citations.",
"maxLength": 400000,
"minLength": 10,
"type": "string"
},
"pdfUrl": {
"description": "Public PDF URL. Text extraction is best-effort (Word and Google Docs exports work best).",
"maxLength": 2000,
"minLength": 8,
"type": "string"
},
"references": {
"description": "Plain-text reference list (numbered, blank-line separated, or one per line; APA, IEEE, Vancouver, Chicago).",
"maxLength": 200000,
"minLength": 10,
"type": "string"
}
},
"type": "object"
},
"name": "reference-verifier",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"arxivId": {
"description": "arXiv id or arxiv.org URL (2106.09685, arXiv:1706.03762, hep-th/9901001). Resolved through Semantic Scholar and OpenAlex.",
"maxLength": 80,
"minLength": 4,
"type": "string"
},
"doi": {
"description": "DOI of the paper to audit (bare, doi: or doi.org URL). Takes precedence over paperTitleOrDoi.",
"maxLength": 300,
"minLength": 7,
"type": "string"
},
"paperTitleOrDoi": {
"description": "DOI (10.xxxx/..., bare or doi.org URL), arXiv or PubMed URL, or title of the paper to audit.",
"maxLength": 500,
"minLength": 3,
"type": "string"
},
"pmid": {
"description": "PubMed id (digits) or pubmed.ncbi.nlm.nih.gov URL. Mapped to the DOI through Europe PMC.",
"maxLength": 60,
"minLength": 1,
"type": "string"
},
"scientificClaim": {
"description": "Free-text claim; the originating and closely related works are located by search. Used as context when a paper is also given.",
"maxLength": 2000,
"minLength": 10,
"type": "string"
},
"url": {
"description": "A doi.org, arxiv.org or pubmed.ncbi.nlm.nih.gov URL for the paper.",
"maxLength": 500,
"minLength": 8,
"type": "string"
}
},
"type": "object"
},
"name": "replication-auditor",
"outputSchema": 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": {
"additionalProperties": false,
"properties": {
"aNumber": {
"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.",
"maxLength": 120,
"minLength": 1,
"type": "string"
},
"count": {
"description": "How many terms to expand from the formula; default 20.",
"maximum": 60,
"minimum": 4,
"type": "integer"
},
"description": {
"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.",
"maxLength": 500,
"minLength": 3,
"type": "string"
},
"explain": {
"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.",
"type": "boolean"
},
"formula": {
"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.",
"maxLength": 300,
"minLength": 1,
"type": "string"
},
"initialTerms": {
"description": "Seed values a(start), a(start+1), ... for a recurrence formula.",
"items": {
"anyOf": [
{
"type": "integer"
},
{
"pattern": "^[+-]?[0-9]{1,40}$",
"type": "string"
}
]
},
"maxItems": 20,
"type": "array"
},
"start": {
"description": "Index n of the first expanded term; default 0.",
"maximum": 1000,
"minimum": -100,
"type": "integer"
},
"terms": {
"description": "Integer terms, 4 to 60, each at most 40 digits. Pass values beyond 2^53 as decimal strings.",
"items": {
"anyOf": [
{
"type": "integer"
},
{
"pattern": "^[+-]?[0-9]{1,40}$",
"type": "string"
}
]
},
"maxItems": 60,
"minItems": 4,
"type": "array"
},
"termsText": {
"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).",
"maxLength": 4000,
"minLength": 4,
"type": "string"
}
},
"type": "object"
},
"name": "sequence-identifier",
"outputSchema": null
}
]
}Verify it yourself
curl -s https://api.teppi.xyz/v1/evidence/sha256:2a50ac284a6a65ddcd381a3df6e9dc880d91e274ace0cdf017ffc05f0734ccc6 | sha256sum