Resultado da API MediaWiki

{
    "batchcomplete": "",
    "continue": {
        "gapcontinue": "Resson\u00e2ncia_Estoc\u00e1stica",
        "continue": "gapcontinue||"
    },
    "warnings": {
        "main": {
            "*": "Subscribe to the mediawiki-api-announce mailing list at <https://lists.wikimedia.org/postorius/lists/mediawiki-api-announce.lists.wikimedia.org/> for notice of API deprecations and breaking changes."
        },
        "revisions": {
            "*": "Because \"rvslots\" was not specified, a legacy format has been used for the output. This format is deprecated, and in the future the new format will always be used."
        }
    },
    "query": {
        "pages": {
            "30": {
                "pageid": 30,
                "ns": 0,
                "title": "Redes",
                "revisions": [
                    {
                        "contentformat": "text/x-wiki",
                        "contentmodel": "wikitext",
                        "*": "== Redes Aleat\u00f3rias ==\n\n\n<math>G_{n,m}</math>: conjunto dos grafos de <math>n</math> v\u00e9rtices e <math>m</math> arestas (se escolhe aleatoriamente um par de v\u00e9rtices e se conectam ate completar <math>m</math>)\nvers\u00e3o microcan\u00f4nica (sem flutua\u00e7\u00e3o). Existe probabilidade de mais de uma aresta entre v\u00e9rtices, porem probabilidade \u00e9 <math>m/n^2</math>\n \nO rela\u00e7\u00e3o de arestas/v\u00e9rtices \u00e9 <math>m/n</math> \n\n----\n\n<math>G_{n,p}</math>: conjunto dos grafos de <math>n</math> v\u00e9rtices onde cada aresta (das <math>n(n-1)/2</math> poss\u00edveis) \u00e9 estabelecida com probabilidade <math>p</math> - vers\u00e3o can\u00f4nica (com flutua\u00e7\u00e3o). Nesta vers\u00e3o n\u00e3o \u00e9 poss\u00edvel definir duas vezes a mesma aresta. \n\nO n\u00famero total esperado de arestas \u00e9 portanto <math>m \\approx pn(n-1)/2</math>, que para <math>n</math> grande resulta ser <math>m = pn^2/2</math>. Assim o a rela\u00e7\u00e3o arestas/v\u00e9rtices \u00e9 <math>m/n = pn/2</math>\n\nO n\u00famero de m\u00e9dio de arestas por v\u00e9rtice \u00e9  <math>z = <k> = pn</math>\n\n<math>G_{n,p}</math> tem distribui\u00e7\u00e3o de grau binomial: <math>p_k = \\frac{n}{k}p^k(1-p)^{n-k}</math>\n\nNo limite <math>n</math> grande \u00e9 a distribui\u00e7\u00e3o de Poisson:\n\n<math>p_k = \\frac{z^k e^{-z}}{k!}</math>\n\nO resultado mais not\u00e1vel dos trabalhos de Erd\u00f6s e R\u00e9nyi \u00e9 que quando <math>n \\rightarrow \\infty</math> para <math>z = 1</math> ha uma transi\u00e7\u00e3o onde aparece uma componente gigante. <math>z=1 \\Rightarrow pn=1 \\Rightarrow p = 1/n \\Rightarrow m=n/2\n</math>\n\n== Links ==\n[http://ccl.northwestern.edu/netlogo/ Netlog]\n\n--[[Usu\u00e1rio:Sebas|Sebas]] 15:38, 25 Maio 2008 (BRT)\n----\n\n[[FIP20706 T\u00f3picos em F\u00edsica Estat\u00edstica: redes e din\u00e2mica de epidemias|voltar]]"
                    }
                ]
            },
            "43": {
                "pageid": 43,
                "ns": 0,
                "title": "Reinstalando todos os pacotes de instala\u00e7\u00e3o antiga",
                "revisions": [
                    {
                        "contentformat": "text/x-wiki",
                        "contentmodel": "wikitext",
                        "*": "== Backup list of installed software ==\n\nDebian Linux\nIf you are using Debian Linux use dpkg command to list installed software:\n\n $ dpkg --get-selections\n\nStore list of installed software to a file called /backup/installed-software.log\n\n $ dpkg --get-selections > /backup/installed-software.log\n\nNow you have a list of installed software. After installing base system you can immediately install all software.\n\nDebian Linux\nDebian Linux makes your life easy. All you have to do is type following two commands:\n\n # dpkg --set-selections < /backup/installed-software.log\nNow your list is imported use dselect or other tools to install the package.\n\n # dselect\n\nSelect \u2018i\u2018 for install the software."
                    }
                ]
            }
        }
    }
}