MediaWiki API result

This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.

Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.

See the complete documentation, or the API help for more information.

{
    "batchcomplete": "",
    "continue": {
        "lecontinue": "20240315150641|1404",
        "continue": "-||"
    },
    "query": {
        "logevents": [
            {
                "logid": 1414,
                "ns": 0,
                "title": "Android Native Development",
                "pageid": 1263,
                "logpage": 1263,
                "revid": 7034,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-05-15T13:52:31Z",
                "comment": "Created page with \"The Android Native Development Kit (NDK) allows you to incorporate C and C++ code in your android app.  See https://developer.android.com/ndk/guides\""
            },
            {
                "logid": 1413,
                "ns": 0,
                "title": "GNU parallel",
                "pageid": 0,
                "logpage": 1127,
                "revid": 7026,
                "params": {
                    "target_ns": 0,
                    "target_title": "GNU Parallel",
                    "suppressredirect": ""
                },
                "type": "move",
                "action": "move",
                "user": "David",
                "timestamp": "2024-04-23T17:07:15Z",
                "comment": ""
            },
            {
                "logid": 1412,
                "ns": 0,
                "title": "Code Completion Tools",
                "pageid": 1262,
                "logpage": 1262,
                "revid": 7021,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-04-22T17:39:05Z",
                "comment": "Created page with \"List of code completion tools  * [https://github.com/features/copilot Github Copilot] - $10/mo for individuals, $19/mo for businesses, free for students * [https://aws.amazon.com/codewhisperer/ Amazon CodeWhisperer] - free for individuals, $19/mo for businesses * [https://codeium.com/ Codeium] - free for individuals, $12/mo for businesses\""
            },
            {
                "logid": 1411,
                "ns": 0,
                "title": "Point Tracking",
                "pageid": 1261,
                "logpage": 1261,
                "revid": 7010,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-04-16T20:47:50Z",
                "comment": "Created page with \" ==Traditional Methods== Kanade\u2013Lucas\u2013Tomasi feature tracker\""
            },
            {
                "logid": 1410,
                "ns": 0,
                "title": "Ranking",
                "pageid": 1260,
                "logpage": 1260,
                "revid": 6996,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-04-15T20:47:21Z",
                "comment": "Created page with \"Some notes on ranking techniques  ==Basics== [https://medium.com/@mayurbhangale/pointwise-pairwise-and-listwise-learning-to-rank-baf0ad76203e Pointwise, Pairwise and Listwise Learning to Rank]  ===Point-wise ranking=== In point-wise ranking, you have some scores for you document <math>y_i</math> so you can train your model <math>f</math> to predict such scores in a    ==Metrics==  ===Cumulative Gain=== Suppose you have a list of results <math>x_1,..., x_n</math> with rel...\""
            },
            {
                "logid": 1409,
                "ns": 3000,
                "title": "Private:Uncorrelated Processes",
                "pageid": 1259,
                "logpage": 1259,
                "revid": 6978,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-04-05T01:24:29Z",
                "comment": "Created page with \"<math> \\begin{align} && x(t) &= A \\cos(\\omega_0 t + \\varphi) \\\\ && y(t) &= B \\sin(n \\omega_0 t + n \\varphi + \\psi)\\\\  &\\implies & x(t)y(t) &= AB \\cos(\\omega_0 t + \\varphi) \\sin(n (\\omega_0 t + \\varphi) + \\psi) \\\\ &\\implies & x(t)y(t) &= AB \\cos(a) \\sin(na + \\psi) \\\\ &\\implies & x(t)y(t) &= AB \\frac{\\sin(a + \\psi + a) + \\sin(na + \\psi - a)}{2} \\\\ &\\implies & x(t)y(t) &= AB \\frac{\\sin((n+1)(\\omega_0 t + \\varphi) + \\psi) + \\sin((n-1)(\\omega_0 t + \\varphi) + \\psi )}{2} \\\\ &\\...\""
            },
            {
                "logid": 1408,
                "ns": 0,
                "title": "SYCL",
                "pageid": 1258,
                "logpage": 1258,
                "revid": 6970,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-04-03T14:09:33Z",
                "comment": "Created page with \"[https://www.khronos.org/sycl/ SYCL] is a Khronos standard which aims to abstract parallel computing across different standards (OpenCL, Cuda, Rocm).   ==AdaptiveCPP== [https://adaptivecpp.github.io/AdaptiveCpp/ AdaptiveCPP] is one implementation of SYCL which compiles to CPU, CUDA, ROCM, and OpenCL.\""
            },
            {
                "logid": 1407,
                "ns": 0,
                "title": "Logitech Keyboard Shortcuts",
                "pageid": 1257,
                "logpage": 1257,
                "revid": 6966,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-03-25T15:29:15Z",
                "comment": "Created page with \"https://defkey.com/logitech-pop-keys-shortcuts#105067\""
            },
            {
                "logid": 1406,
                "ns": 3000,
                "title": "Private:Fourier Transform of Neural Networks",
                "pageid": 1256,
                "logpage": 1256,
                "revid": 6965,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-03-25T15:26:24Z",
                "comment": "Created page with \" ===Fourier Transform of SiLU===  <math display=\"block\"> \\begin{align} F(SiLU(f(x))) &= F\\left(f(x)\\frac{1}{1 + e^{-f(x)}}\\right) \\\\ &= F(f(x)) * F\\left(\\frac{1}{1 + e^{-f(x)}}\\right) \\end{align} </math>  <math display=\"block\"> \\begin{align} F \\left(\\frac{1}{1 + e^{-f(x)}}\\right) &=  F\\left(\\sum_{k=0}^{\\infty} (-1)^ke^{-kf(x)}\\right) \\\\ &= \\sum_{k=0}^{\\infty} (-1)^k F(e^{-kf(x)}) \\end{align} </math>\""
            },
            {
                "logid": 1405,
                "ns": 3000,
                "title": "Private:Math Test",
                "pageid": 1255,
                "logpage": 1255,
                "revid": 6960,
                "params": {},
                "type": "create",
                "action": "create",
                "user": "David",
                "timestamp": "2024-03-15T16:01:46Z",
                "comment": "Created page with \"Private math scratch notes\""
            }
        ]
    }
}