<?xml version="1.0" encoding="utf-8" ?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:r="https://r-universe.dev"><channel><title>yasminebriefs.r-universe.dev</title><link>https://yasminebriefs.r-universe.dev</link><description>Recent package updates in yasminebriefs</description><generator>R-universe</generator><image><url>https://github.com/yasminebriefs.png</url><title>R packages by yasminebriefs</title><link>https://yasminebriefs.r-universe.dev</link></image><lastBuildDate>Wed, 07 Jan 2026 11:55:36 GMT</lastBuildDate><item><title>[yasminebriefs] fasttreeid 1.0.1</title><author>ybriefs@mpi-inf.mpg.de (Yasmine Briefs)</author><description>Implements the algorithm by Briefs and Bläser (2025)
&lt;https://openreview.net/forum?id=8PHOPPH35D&gt;, based on the
approach of Gupta and Bläser (2024)
&lt;doi:10.1609/aaai.v38i18.30023&gt;. It determines, for a
structural causal model (SCM) whose directed edges form a tree,
whether each parameter is unidentifiable, 1-identifiable or
2-identifiable (other cases cannot occur), using a randomized
algorithm with provable running time O(n^3 log^2 n).</description><link>https://github.com/r-universe/yasminebriefs/actions/runs/27055569629</link><pubDate>Wed, 07 Jan 2026 11:55:36 GMT</pubDate><r:package>fasttreeid</r:package><r:version>1.0.1</r:version><r:status>success</r:status><r:repository>https://yasminebriefs.r-universe.dev</r:repository><r:upstream>https://github.com/yasminebriefs/fasttreeid</r:upstream></item></channel></rss>