{ "_id": "6ac362b5d743750d376db3cb", "Package": "SEMID", "Type": "Package", "Title": "Identifiability of Linear Structural Equation Models", "Version": "0.5.1", "Date": "2026-03-26", "Authors@R": "c(person(\"Rina\", \"Foygel Barber\", role=c(\"aut\"), \nemail=\"rina@uchicago.edu\"),\nperson(\"Mathias\", \"Drton\", role=c(\"aut\"),\nemail=\"mathias.drton@tum.de\"),\nperson(\"Miriam\", \"Kranzlmüller\", role=c(\"aut\"),\nemail=\"miriam.kranzlmueller@math.lmu.de\"),\nperson(\"Nils\", \"Sturma\", role=c(\"cre\", \"aut\"),\nemail=\"nils.sturma@epfl.ch\"),\nperson(\"Luca\", \"Weihs\", role=c(\"aut\"),\nemail=\"lucaw@allenai.org\"))", "Maintainer": "Nils Sturma ", "Description": "Provides routines to check identifiability of linear\nstructural equation models and factor analysis models. The\nroutines are based on the graphical representation of\nstructural equation models.", "License": "GPL (>= 2)", "Encoding": "UTF-8", "URL": "https://github.com/Lucaweihs/SEMID", "BugReports": "https://github.com/Lucaweihs/SEMID/issues", "NeedsCompilation": "no", "RoxygenNote": "7.3.3", "Config/pak/sysreqs": "libglpk-dev libxml2-dev", "Repository": "https://lucaweihs.r-universe.dev", "Date/Publication": "2026-03-26 11:57:19 UTC", "RemoteUrl": "https://github.com/lucaweihs/semid", "RemoteRef": "HEAD", "RemoteSha": "a9589282637497f1eb0706d25536851a371db027", "Packaged": { "Date": "2026-10-05 08:36:16 UTC", "User": "root" }, "Author": "Rina Foygel Barber [aut],\nMathias Drton [aut],\nMiriam Kranzlmüller [aut],\nNils Sturma [cre, aut],\nLuca Weihs [aut]", "_user": "lucaweihs", "_type": "src", "_file": "SEMID_0.5.1.tar.gz", "_fileid": "https://r2.ropensci.org/f69ad1a3190f891b3d53f3ea38f0dbb3549d2f4b608b10d514a5b3164112f368", "_filesize": 327071, "_sha256": "f69ad1a3190f891b3d53f3ea38f0dbb3549d2f4b608b10d514a5b3164112f368", "_expires": "2027-01-13T08:41:23.000Z", "_created": "2026-10-05T08:36:16.000Z", "_published": "2026-10-05T08:41:25.195Z", "_jobs": [ { "job": 111680705872, "time": 181, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "11334137590" }, { "job": 111680705753, "time": 173, "config": "linux-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "11333772142" }, { "job": 111680705667, "time": 254, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "OK", "artifact": "11333863474" }, { "job": 111680705856, "time": 257, "config": "macos-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "11334212328" }, { "job": 111679873390, "time": 145, "config": "source", "r": "4.6.1", "check": "OK", "artifact": "11333762893" }, { "job": 111680705656, "time": 94, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "11333229173" }, { "job": 111680705764, "time": 143, "config": "windows-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "11333623687" }, { "job": 111680705745, "time": 150, "config": "windows-oldrel-x86_64", "r": "4.5.3", "check": "OK", "artifact": "11333758284" }, { "job": 111680705786, "time": 162, "config": "windows-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "11333982988" } ], "_host": "GitHub-Actions", "_buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169", "_status": "success", "_upstream": "https://github.com/lucaweihs/semid", "_commit": { "id": "a9589282637497f1eb0706d25536851a371db027", "author": "NilsSturma ", "committer": "NilsSturma ", "message": "prepared version 0.5.1\n", "time": 1774526239 }, "_maintainer": { "name": "Nils Sturma", "email": "nils.sturma@epfl.ch" }, "_distro": "resolute", "_registered": true, "_dependencies": [ { "package": "R.oo", "version": ">= 1.20.0", "role": "Imports" }, { "package": "R.methodsS3", "role": "Imports" }, { "package": "igraph", "version": ">= 1.0.1", "role": "Imports" }, { "package": "R.utils", "version": ">= 2.3.0", "role": "Imports" }, { "package": "rje", "role": "Imports" }, { "package": "testthat", "role": "Suggests" } ], "_owner": "lucaweihs", "_selfowned": true, "_usedby": 0, "_updates": [ { "week": "2025-43", "n": 3 }, { "week": "2026-05", "n": 4 }, { "week": "2026-12", "n": 2 }, { "week": "2026-13", "n": 1 } ], "_tags": [ { "name": "v0.4.2", "date": "2025-10-21" }, { "name": "v0.5.0", "date": "2026-01-30" }, { "name": "v0.5.1", "date": "2026-03-26" } ], "_stars": 6, "_contributors": [ { "user": "lucaweihs", "count": 60, "uuid": 628838 }, { "user": "nilssturma", "count": 42, "uuid": 43231090 }, { "user": "schochastics", "count": 1, "uuid": 17147355 } ], "_userbio": { "uuid": 628838, "type": "user", "name": "Luca Weihs", "followers": 54 }, "_downloads": { "count": 455, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/SEMID" }, "_mentions": 2, "_devurl": "https://github.com/lucaweihs/semid", "_searchresults": 44, "_rbuild": "4.6.1", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/manual.pdf", "extra/NEWS.html", "extra/NEWS.txt", "extra/readme.html", "extra/readme.md", "extra/SEMID.html" ], "_homeurl": "https://github.com/lucaweihs/semid", "_realowner": "lucaweihs", "_cranurl": true, "_releases": [ { "version": "0.0", "date": "2013-05-16" }, { "version": "0.1", "date": "2013-08-16" }, { "version": "0.2", "date": "2015-12-18" }, { "version": "0.3.0", "date": "2017-07-15" }, { "version": "0.3.1", "date": "2017-10-14" }, { "version": "0.3.2", "date": "2019-05-21" }, { "version": "0.4.0", "date": "2022-01-13" }, { "version": "0.4.1", "date": "2023-07-19" }, { "version": "0.4.2", "date": "2025-10-21" }, { "version": "0.5.0", "date": "2026-01-30" }, { "version": "0.5.1", "date": "2026-03-26" } ], "_exports": [ "ancestors", "ancestralID", "ancestralIdentifyStep", "bidirectedComponents", "checkLocalBBCriterion", "checkMatchingCriterion", "children", "createLFHtcIdentifier", "createLFIdentifierBaseCase", "createTrekFlowGraph", "createTrGraph", "descendants", "edgewiseID", "edgewiseIdentifyStep", "edgewiseTSID", "extmID", "flowBetween", "FlowGraph", "generalGenericID", "getHalfTrekSystem", "getMixedGraph", "getTrekSystem", "globalID", "graphID", "graphID.ancestralID", "graphID.genericID", "graphID.htcID", "graphID.nonHtcID", "htcID", "htcIdentifyStep", "htrFrom", "inducedSubgraph", "isSibling", "L", "LatentDigraph", "LatentDigraphFixedOrder", "latentDigraphHasSimpleNumbering", "latentNodes", "lfhtcID", "lfhtcIdentifyStep", "mID", "MixedGraph", "nodes", "numLatents", "numNodes", "numObserved", "O", "observedNodes", "observedParents", "parents", "plotMixedGraph", "semID", "siblings", "stronglyConnectedComponent", "tianComponent", "tianDecompose", "tianSigmaForComponent", "toEx", "toIn", "trekSeparationIdentifyStep", "trFrom", "updateEdgeCapacities", "updateVertexCapacities", "validateLatentNodesAreSources", "ZUTA" ], "_help": [ { "page": "SEMID-package", "title": "SEMID package documentation.", "topics": [ "SEMID-package", "SEMID" ] }, { "page": "ancestors", "title": "All ancestors of a collection of nodes", "topics": [ "ancestors", "ancestors.LatentDigraph", "ancestors.LatentDigraphFixedOrder", "ancestors.MixedGraph" ] }, { "page": "ancestralID", "title": "Determines which edges in a mixed graph are ancestralID-identifiable", "topics": [ "ancestralID" ] }, { "page": "ancestralIdentifyStep", "title": "Perform one iteration of ancestral identification.", "topics": [ "ancestralIdentifyStep" ] }, { "page": "bidirectedComponents", "title": "Get bidirected components of a mixed graph", "topics": [ "bidirectedComponents" ] }, { "page": "checkLocalBBCriterion", "title": "Check Local BB-Criterion", "topics": [ "checkLocalBBCriterion" ] }, { "page": "checkMatchingCriterion", "title": "Check Matching Criterion", "topics": [ "checkMatchingCriterion" ] }, { "page": "children", "title": "All children of a collection of nodes.", "topics": [ "children", "children.LatentDigraph", "children.LatentDigraphFixedOrder", "children.MixedGraph" ] }, { "page": "createAncestralIdentifier", "title": "Create an ancestral identification function.", "topics": [ "createAncestralIdentifier" ] }, { "page": "createEdgewiseIdentifier", "title": "Create an edgewise identification function", "topics": [ "createEdgewiseIdentifier" ] }, { "page": "createHtcIdentifier", "title": "Create an htc identification function.", "topics": [ "createHtcIdentifier" ] }, { "page": "createIdentifierBaseCase", "title": "Create an identifier base case", "topics": [ "createIdentifierBaseCase" ] }, { "page": "createLFHtcIdentifier", "title": "Create a latent-factor half-trek critierion identification function.", "topics": [ "createLFHtcIdentifier" ] }, { "page": "createLFIdentifierBaseCase", "title": "Create an latent identifier base case", "topics": [ "createLFIdentifierBaseCase" ] }, { "page": "createSimpleBiDirIdentifier", "title": "Identify bidirected edges if all directed edges are identified", "topics": [ "createSimpleBiDirIdentifier" ] }, { "page": "createTrekFlowGraph", "title": "Helper function to create a flow graph.", "topics": [ "createTrekFlowGraph", "createTrekFlowGraph.LatentDigraphFixedOrder" ] }, { "page": "createTrekSeparationIdentifier", "title": "Create an trek separation identification function", "topics": [ "createTrekSeparationIdentifier" ] }, { "page": "createTrGraph", "title": "Helper function to create a graph encoding trek reachable relationships.", "topics": [ "createTrGraph", "createTrGraph.LatentDigraphFixedOrder" ] }, { "page": "descendants", "title": "Get descendants of a collection of observed nodes", "topics": [ "descendants", "descendants.LatentDigraph", "descendants.LatentDigraphFixedOrder", "descendants.MixedGraph" ] }, { "page": "edgewiseID", "title": "Determines which edges in a mixed graph are edgewiseID-identifiable", "topics": [ "edgewiseID" ] }, { "page": "edgewiseIdentifyStep", "title": "Perform one iteration of edgewise identification.", "topics": [ "edgewiseIdentifyStep" ] }, { "page": "edgewiseTSID", "title": "Determines which edges in a mixed graph are edgewiseID+TS identifiable", "topics": [ "edgewiseTSID" ] }, { "page": "extmID", "title": "Check Extended M-Identifiability", "topics": [ "extmID" ] }, { "page": "findColumnsWithSumOne", "title": "A Helper Function for Check ZUTA", "topics": [ "findColumnsWithSumOne" ] }, { "page": "flowBetween", "title": "Flow from one set of nodes to another.", "topics": [ "flowBetween", "flowBetween.FlowGraph" ] }, { "page": "FlowGraph", "title": "Construct FlowGraph object", "topics": [ "FlowGraph" ] }, { "page": "generalGenericID", "title": "A general generic identification algorithm template.", "topics": [ "generalGenericID" ] }, { "page": "getAncestors", "title": "Get getAncestors of nodes in a graph.", "topics": [ "getAncestors" ] }, { "page": "getDescendants", "title": "Get descendants of nodes in a graph.", "topics": [ "getDescendants" ] }, { "page": "getHalfTrekSystem", "title": "Determines if a half-trek system exists in the mixed graph.", "topics": [ "getHalfTrekSystem", "getHalfTrekSystem.MixedGraph", "getTrekSystem.MixedGraph" ] }, { "page": "getMaxFlow", "title": "Size of largest HT system Y satisfying the HTC for a node v except perhaps having |getParents(v)| < |Y|.", "topics": [ "getMaxFlow" ] }, { "page": "getMixedCompForNode", "title": "Get the mixed component of a node in a mixed subgraph.", "topics": [ "getMixedCompForNode" ] }, { "page": "getMixedGraph", "title": "Get the corresponding mixed graph", "topics": [ "getMixedGraph", "getMixedGraph.LatentDigraph" ] }, { "page": "getParents", "title": "Get getParents of nodes in a graph.", "topics": [ "getParents" ] }, { "page": "getSiblings", "title": "Get getSiblings of nodes in a graph.", "topics": [ "getSiblings" ] }, { "page": "getTrekSystem", "title": "Determines if a trek system exists in the mixed graph.", "topics": [ "getTrekSystem", "getTrekSystem.LatentDigraph", "getTrekSystem.LatentDigraphFixedOrder" ] }, { "page": "globalID", "title": "Determines whether a mixed graph is globally identifiable.", "topics": [ "globalID" ] }, { "page": "graphID", "title": "Identifiability of linear structural equation models.", "topics": [ "graphID" ] }, { "page": "graphID.ancestralID", "title": "Determine generic identifiability of an acyclic mixed graph using ancestral decomposition.", "topics": [ "graphID.ancestralID" ] }, { "page": "graphID.decompose", "title": "Determine generic identifiability by Tian Decomposition and HTC", "topics": [ "graphID.decompose" ] }, { "page": "graphID.genericID", "title": "Determine generic identifiability of a mixed graph.", "topics": [ "graphID.genericID" ] }, { "page": "graphID.htcID", "title": "Determines if a mixed graph is HTC-identifiable.", "topics": [ "graphID.htcID" ] }, { "page": "graphID.main", "title": "Helper function to handle a graph component.", "topics": [ "graphID.main" ] }, { "page": "graphID.nonHtcID", "title": "Check for generic infinite-to-one via the half-trek criterion.", "topics": [ "graphID.nonHtcID" ] }, { "page": "htcID", "title": "Determines which edges in a mixed graph are HTC-identifiable.", "topics": [ "htcID" ] }, { "page": "htcIdentifyStep", "title": "Perform one iteration of HTC identification.", "topics": [ "htcIdentifyStep" ] }, { "page": "htr", "title": "Get all HTR nodes from a set of nodes in a graph.", "topics": [ "htr" ] }, { "page": "htrFrom", "title": "Half trek reachable nodes.", "topics": [ "htrFrom", "htrFrom.MixedGraph" ] }, { "page": "inducedSubgraph", "title": "Get the induced subgraph on a collection of nodes", "topics": [ "inducedSubgraph", "inducedSubgraph.LatentDigraph", "inducedSubgraph.MixedGraph" ] }, { "page": "isSibling", "title": "Are two nodes siblings?", "topics": [ "isSibling", "isSibling.MixedGraph" ] }, { "page": "L", "title": "Get directed adjacency matrix.", "topics": [ "L", "L.LatentDigraph", "L.LatentDigraphFixedOrder", "L.MixedGraph" ] }, { "page": "LatentDigraph", "title": "Construct a LatentDigraph object", "topics": [ "LatentDigraph" ] }, { "page": "LatentDigraphFixedOrder", "title": "Construct LatentDigraphFixedOrder object", "topics": [ "LatentDigraphFixedOrder" ] }, { "page": "latentDigraphHasSimpleNumbering", "title": "Checks that a LatentDigraph has appropriate node numbering", "topics": [ "latentDigraphHasSimpleNumbering" ] }, { "page": "latentNodes", "title": "Get all latent nodes in the graph.", "topics": [ "latentNodes", "latentNodes.LatentDigraph" ] }, { "page": "lfhtcID", "title": "Determines which edges in a latent digraph are LF-HTC-identifiable.", "topics": [ "lfhtcID" ] }, { "page": "lfhtcIdentifyStep", "title": "Perform one iteration of latent-factor HTC identification.", "topics": [ "lfhtcIdentifyStep" ] }, { "page": "mID", "title": "Check M-Identifiability.", "topics": [ "mID" ] }, { "page": "MixedGraph", "title": "Construct MixedGraph object", "topics": [ "MixedGraph" ] }, { "page": "mixedGraphHasSimpleNumbering", "title": "Checks that a MixedGraph has appropriate node numbering", "topics": [ "mixedGraphHasSimpleNumbering" ] }, { "page": "nodes", "title": "Get all nodes in the graph.", "topics": [ "nodes", "nodes.MixedGraph" ] }, { "page": "numLatents", "title": "Number of latent nodes in the graph.", "topics": [ "numLatents", "numLatents.LatentDigraph", "numLatents.LatentDigraphFixedOrder" ] }, { "page": "numNodes", "title": "Number of nodes in the graph.", "topics": [ "numNodes", "numNodes.LatentDigraph", "numNodes.LatentDigraphFixedOrder", "numNodes.MixedGraph" ] }, { "page": "numObserved", "title": "Number of observed nodes in the graph.", "topics": [ "numObserved", "numObserved.LatentDigraph", "numObserved.LatentDigraphFixedOrder" ] }, { "page": "O", "title": "Get adjacency matrix for bidirected part.", "topics": [ "O", "O.MixedGraph" ] }, { "page": "observedNodes", "title": "Get all observed nodes in the graph.", "topics": [ "observedNodes", "observedNodes.LatentDigraph" ] }, { "page": "observedParents", "title": "Get the observed parents on a collection of nodes", "topics": [ "observedParents", "observedParents.LatentDigraph" ] }, { "page": "parents", "title": "All parents of a collection of nodes.", "topics": [ "parents", "parents.LatentDigraph", "parents.LatentDigraphFixedOrder", "parents.MixedGraph" ] }, { "page": "plot", "title": "Plots the latent digraph", "topics": [ "plot.LatentDigraph", "plot.MixedGraph" ] }, { "page": "plotLatentDigraph", "title": "Plot a latent factor graph", "topics": [ "plotLatentDigraph" ] }, { "page": "plotMixedGraph", "title": "Plot a mixed graph", "topics": [ "plotMixedGraph" ] }, { "page": "print.extmIDresult", "title": "Prints a extmIDresult object", "topics": [ "print.extmIDresult" ] }, { "page": "print.GenericIDResult", "title": "Prints a GenericIDResult object", "topics": [ "print.GenericIDResult" ] }, { "page": "print.LfhtcIDResult", "title": "Prints a LfhtcIDResult object", "topics": [ "print.LfhtcIDResult" ] }, { "page": "print.mIDresult", "title": "Prints a mIDresult object", "topics": [ "print.mIDresult" ] }, { "page": "print.SEMIDResult", "title": "Prints a SEMIDResult object", "topics": [ "print.SEMIDResult" ] }, { "page": "print.ZUTAresult", "title": "Prints a ZUTAresult object", "topics": [ "print.ZUTAresult" ] }, { "page": "semID", "title": "Identifiability of linear structural equation models.", "topics": [ "semID" ] }, { "page": "siblings", "title": "All siblings of a collection of nodes", "topics": [ "siblings", "siblings.MixedGraph" ] }, { "page": "stronglyConnectedComponent", "title": "Strongly connected component", "topics": [ "stronglyConnectedComponent", "stronglyConnectedComponent.LatentDigraph", "stronglyConnectedComponent.LatentDigraphFixedOrder", "stronglyConnectedComponent.MixedGraph" ] }, { "page": "subsetsOfSize", "title": "Returns all subsets of a certain size", "topics": [ "subsetsOfSize" ] }, { "page": "tianComponent", "title": "Returns the Tian c-component of a node", "topics": [ "tianComponent", "tianComponent.MixedGraph" ] }, { "page": "tianDecompose", "title": "Performs the tian decomposition on the mixed graph", "topics": [ "tianDecompose", "tianDecompose.MixedGraph" ] }, { "page": "tianIdentifier", "title": "Identifies components in a tian decomposition", "topics": [ "tianIdentifier" ] }, { "page": "tianSigmaForComponent", "title": "Globally identify the covariance matrix of a C-component", "topics": [ "tianSigmaForComponent" ] }, { "page": "toEx", "title": "Transforms a vector of node indices in the internal rep. into external numbering", "topics": [ "toEx", "toEx.LatentDigraph", "toEx.MixedGraph" ] }, { "page": "toIn", "title": "Transforms a vector of given node indices into their internal numbering", "topics": [ "toIn", "toIn.LatentDigraph", "toIn.MixedGraph" ] }, { "page": "trekSeparationIdentifyStep", "title": "Perform one iteration of trek separation identification.", "topics": [ "trekSeparationIdentifyStep" ] }, { "page": "trFrom", "title": "Trek reachable nodes.", "topics": [ "trFrom", "trFrom.LatentDigraph", "trFrom.LatentDigraphFixedOrder", "trFrom.MixedGraph" ] }, { "page": "updateEdgeCapacities", "title": "Update edge capacities.", "topics": [ "updateEdgeCapacities", "updateEdgeCapacities.FlowGraph" ] }, { "page": "updateVertexCapacities", "title": "Update vertex capacities.", "topics": [ "updateVertexCapacities", "updateVertexCapacities.FlowGraph" ] }, { "page": "validateLatentNodesAreSources", "title": "A helper function to validate that latent nodes in a LatentDigraph are sources.", "topics": [ "validateLatentNodesAreSources" ] }, { "page": "validateMatrices", "title": "A helper function to validate input matrices.", "topics": [ "validateMatrices" ] }, { "page": "validateMatrix", "title": "A helper function to validate an input matrix.", "topics": [ "validateMatrix" ] }, { "page": "validateNodes", "title": "A helper function to validate if input nodes are valid.", "topics": [ "validateNodes" ] }, { "page": "validateVarArgsEmpty", "title": "A helper function to validate that there are no variable arguments", "topics": [ "validateVarArgsEmpty" ] }, { "page": "ZUTA", "title": "Check the Zero Upper Triangular Assumption", "topics": [ "ZUTA" ] } ], "_readme": "https://github.com/lucaweihs/semid/raw/HEAD/README.md", "_rundeps": [ "cli", "cpp11", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "pkgconfig", "R.methodsS3", "R.oo", "R.utils", "rje", "rlang", "vctrs" ], "_score": 5.324693913861775, "_indexed": true, "_nocasepkg": "semid", "_universes": [ "lucaweihs" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "0.5.1", "date": "2026-10-05T08:38:10.000Z", "distro": "resolute", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/85532ab8c5b9aa2985915b4ec64cc1527a4c424fec90ed81c3123adefc41380a", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.6.1", "os": "linux", "version": "0.5.1", "date": "2026-10-05T08:38:20.000Z", "distro": "resolute", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/ff4bca414d5ad35c21f56cf8f24a8a79792fd7f62dc3c8a7bc58218c703de111", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.5.3", "os": "mac", "version": "0.5.1", "date": "2026-10-05T08:38:54.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/df993eb698ae5dddc1e6d3e0a5fdb0276410543e21561388d1ec6fc4a4f963ab", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.6.1", "os": "mac", "version": "0.5.1", "date": "2026-10-05T08:38:44.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/22724cefd253f46ffce2c9605f32d0b532689da0397aed35d072a3584bdc713e", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.6.0", "os": "wasm", "version": "0.5.1", "date": "2026-10-05T08:38:27.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/e2aab1a1b15bb4c1c6f127c5a0f142704013343de26dc98df9cb9b7e4d817c67", "status": "success", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.7.0", "os": "win", "version": "0.5.1", "date": "2026-10-05T08:37:15.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/ebacd22d28e921f15cb75078076c6a13a8673d2e5daeb567351c8d6ad094beb5", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.5.3", "os": "win", "version": "0.5.1", "date": "2026-10-05T08:37:22.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/672b8d1a1b71e980dc46e6157cd70d2edf6312590d4d5d11881816eca2c9219f", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" }, { "r": "4.6.1", "os": "win", "version": "0.5.1", "date": "2026-10-05T08:37:29.000Z", "commit": "a9589282637497f1eb0706d25536851a371db027", "fileid": "https://r2.ropensci.org/03bf9d895a1e3908d22c1efaeab4ccc58cbae373d5be98ce411599ce4bfebea2", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/lucaweihs/actions/runs/37284410169" } ] }