datapulse_agb_search
Find the passages of the ICANN 2026 Round Applicant Guidebook (AGB V2-2026.04.24) that answer a question, by meaning.
Description
Find the passages of the ICANN 2026 Round Applicant Guidebook (AGB V2-2026.04.24) that answer a question, by meaning.
Every chapter of the Guidebook is split into passages of at most 1,000 characters (footnotes left out) and embedded with BGE-M3 (1024-dim), the same model behind datapulse_disputedb_search. The query is embedded the same way and passages are ranked by cosine similarity.
Each result carries the chapter name, the section number, the PDF page (absent for the bundled 2012 string reference, which has none), a ready-made citation (“AGB V2-2026.04.24 §7.2.1 Blocked Names (p. 191)”) and the passage text. A passage’s surrounding context is in datapulse_agb(chapter=…). The answering passage and its neighbours (an exception, a waiver, a related fee) often score within 0.03 of each other, so a raised min_score can drop one; score bands are in the agb topic.
Covers the 2026 Round rules only; 2012 Round string outcomes are in datapulse_agb(chapter=“round2012_strings”), and the 2026 Round’s applications in datapulse_gtld_applications.
Reference: datapulse_help(topic="agb")
Parameters
| Parameter | Type | Description |
|---|---|---|
queryrequired | string | What you want the Guidebook to answer, in natural language: “can a string applied for in 2012 that is still in process be applied for again”, “fee for community priority evaluation”, “who has standing for a legal rights objection”. Min length: 1Max length: 1000 |
chapter | string | Restrict the search to one chapter (a datapulse_agb chapter name). Omit to search the whole Guidebook. Max length: 64appendix10_termsappendix11_12_support_rspappendix1_questionsappendix2_geographicappendix3_objectionsappendix4_registry_agreementappendix5_financialappendix6_predictabilityappendix7_8_coiappendix9_privacyglossarymodule1_applicant_journeymodule2_general_informationmodule3_application_submissionmodule4_community_objectionsmodule5_contentionmodule6_applicant_evaluationmodule7_string_evaluationoverviewround2012_stringssubpro_topic_index |
limit | integer | Number of passages to return (1-20). Omit or pass 0 for the default of 10; values above 20 are capped. Default: 10 |
min_score | number | Minimum cosine similarity, 0 to 1; default 0.55; 0 disables the filter; a value outside 0-1 is refused. Why a higher floor can drop the answer: the agb topic. Default: 0.55 |
Input schema (JSON)
{
"additionalProperties": false,
"properties": {
"chapter": {
"description": "Restrict the search to one chapter (a datapulse_agb chapter name). Omit to search the whole Guidebook.",
"enum": [
"appendix10_terms",
"appendix11_12_support_rsp",
"appendix1_questions",
"appendix2_geographic",
"appendix3_objections",
"appendix4_registry_agreement",
"appendix5_financial",
"appendix6_predictability",
"appendix7_8_coi",
"appendix9_privacy",
"glossary",
"module1_applicant_journey",
"module2_general_information",
"module3_application_submission",
"module4_community_objections",
"module5_contention",
"module6_applicant_evaluation",
"module7_string_evaluation",
"overview",
"round2012_strings",
"subpro_topic_index"
],
"maxLength": 64,
"type": "string"
},
"limit": {
"default": 10,
"description": "Number of passages to return (1-20). Omit or pass 0 for the default of 10; values above 20 are capped.",
"type": "integer"
},
"min_score": {
"default": 0.55,
"description": "Minimum cosine similarity, 0 to 1; default 0.55; 0 disables the filter; a value outside 0-1 is refused. Why a higher floor can drop the answer: the agb topic.",
"type": "number"
},
"query": {
"description": "What you want the Guidebook to answer, in natural language: \"can a string applied for in 2012 that is still in process be applied for again\", \"fee for community priority evaluation\", \"who has standing for a legal rights objection\".",
"maxLength": 1000,
"minLength": 1,
"type": "string"
}
},
"required": [
"query"
],
"type": "object"
}Generated from the live server (DataPulse MCP v0.9-341-g27163c2) on October 20, 2026.