Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–50 of 785 results for author: <span class="mathjax">Lu, Q</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/" aria-role="search"> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Lu, Q"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Lu%2C+Q&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Lu, Q"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=100" class="pagination-link " aria-label="Page 3" aria-current="page">3 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=150" class="pagination-link " aria-label="Page 4" aria-current="page">4 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=200" class="pagination-link " aria-label="Page 5" aria-current="page">5 </a> </li> <li><span class="pagination-ellipsis">…</span></li> </ul> </nav> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2503.07365">arXiv:2503.07365</a> <span> [<a href="https://arxiv.org/pdf/2503.07365">pdf</a>, <a href="https://arxiv.org/format/2503.07365">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> MM-Eureka: Exploring Visual Aha Moment with Rule-based Large-scale Reinforcement Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Meng%2C+F">Fanqing Meng</a>, <a href="/search/?searchtype=author&query=Du%2C+L">Lingxiao Du</a>, <a href="/search/?searchtype=author&query=Liu%2C+Z">Zongkai Liu</a>, <a href="/search/?searchtype=author&query=Zhou%2C+Z">Zhixiang Zhou</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanfeng Lu</a>, <a href="/search/?searchtype=author&query=Fu%2C+D">Daocheng Fu</a>, <a href="/search/?searchtype=author&query=Shi%2C+B">Botian Shi</a>, <a href="/search/?searchtype=author&query=Wang%2C+W">Wenhai Wang</a>, <a href="/search/?searchtype=author&query=He%2C+J">Junjun He</a>, <a href="/search/?searchtype=author&query=Zhang%2C+K">Kaipeng Zhang</a>, <a href="/search/?searchtype=author&query=Luo%2C+P">Ping Luo</a>, <a href="/search/?searchtype=author&query=Qiao%2C+Y">Yu Qiao</a>, <a href="/search/?searchtype=author&query=Zhang%2C+Q">Qiaosheng Zhang</a>, <a href="/search/?searchtype=author&query=Shao%2C+W">Wenqi Shao</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2503.07365v1-abstract-short" style="display: inline;"> We present MM-Eureka, a multimodal reasoning model that successfully extends large-scale rule-based reinforcement learning (RL) to multimodal reasoning. While rule-based RL has shown remarkable success in improving LLMs' reasoning abilities in text domains, its application to multimodal settings has remained challenging. Our work reproduces key characteristics of text-based RL systems like DeepSee… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.07365v1-abstract-full').style.display = 'inline'; document.getElementById('2503.07365v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2503.07365v1-abstract-full" style="display: none;"> We present MM-Eureka, a multimodal reasoning model that successfully extends large-scale rule-based reinforcement learning (RL) to multimodal reasoning. While rule-based RL has shown remarkable success in improving LLMs' reasoning abilities in text domains, its application to multimodal settings has remained challenging. Our work reproduces key characteristics of text-based RL systems like DeepSeek-R1 in the multimodal space, including steady increases in accuracy reward and response length, and the emergence of reflection behaviors. We demonstrate that both instruction-tuned and pre-trained models can develop strong multimodal reasoning capabilities through rule-based RL without supervised fine-tuning, showing superior data efficiency compared to alternative approaches. We open-source our complete pipeline to foster further research in this area. We release all our codes, models, data, etc. at https://github.com/ModalMinds/MM-EUREKA <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.07365v1-abstract-full').style.display = 'none'; document.getElementById('2503.07365v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2503.06636">arXiv:2503.06636</a> <span> [<a href="https://arxiv.org/pdf/2503.06636">pdf</a>, <a href="https://arxiv.org/ps/2503.06636">ps</a>, <a href="https://arxiv.org/format/2503.06636">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Analysis of PDEs">math.AP</span> </div> </div> <p class="title is-5 mathjax"> Remainder terms, profile decomposition and sharp quantitative stability in the fractional nonlocal Sobolev-type inequality with $n>2s$ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qikai Lu</a>, <a href="/search/?searchtype=author&query=Yang%2C+M">Minbo Yang</a>, <a href="/search/?searchtype=author&query=Zhao%2C+S">Shunneng Zhao</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2503.06636v1-abstract-short" style="display: inline;"> In this paper, we study the following fractional nonlocal Sobolev-type inequality \begin{equation*} C_{HLS}\bigg(\int_{\mathbb{R}^n}\big(|x|^{-渭} \ast |u|^{p_s}\big)|u|^{p_s} dx\bigg)^{\frac{1}{p_s}}\leq\|u\|_{\dot{H}^s(\mathbb{R}^n)}^2\quad \mbox{for all}~~u\in \dot{H}^s(\mathbb{R}^n), \end{equation*} induced by the classical fractional Sobolev inequality and Hardy-Littlewood-Sobolev ineq… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.06636v1-abstract-full').style.display = 'inline'; document.getElementById('2503.06636v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2503.06636v1-abstract-full" style="display: none;"> In this paper, we study the following fractional nonlocal Sobolev-type inequality \begin{equation*} C_{HLS}\bigg(\int_{\mathbb{R}^n}\big(|x|^{-渭} \ast |u|^{p_s}\big)|u|^{p_s} dx\bigg)^{\frac{1}{p_s}}\leq\|u\|_{\dot{H}^s(\mathbb{R}^n)}^2\quad \mbox{for all}~~u\in \dot{H}^s(\mathbb{R}^n), \end{equation*} induced by the classical fractional Sobolev inequality and Hardy-Littlewood-Sobolev inequality for $s\in(0,\frac{n}{2})$, $渭\in(0,n)$ and where $p_{s}=\frac{2n-渭}{n-2s}\geq2$ is energy-critical exponent. The $C_{HLS}>0$ is a constant depending on the dimension $n$, parameters $s$ and $渭$, which can be achieved by $W(x)$, and up to translation and scaling, $W(x)$ is the unique positive and radially symmetric extremal function of the nonlocal Sobolev-type inequality. It is well-known that, up to a suitable scaling, \begin{equation*} (-螖)^{s}u=(|x|^{-渭}\ast |u|^{p_s})|u|^{p_s-2}u\quad \mbox{for all}~~u\in\dot{H}^s(\mathbb{R}^n), \end{equation*} is the Euler-Lagrange equation corresponding to the associated minimization problem. In this paper, we first prove the non-degeneracy of positive solutions to the critical Hartree equation for all $s\in(0,\frac{n}{2})$, $渭\in(0,n)$ with $0<渭\leq4s$. Furthermore, we show the existence of a gradient type remainder term and, as a corollary, derive the existence of a remainder term in the weak $L^{\frac{n}{n-2s}}$-norm for functions supported in domains of finite measure, under the condition $s\in(0,\frac{n}{2})$. Finally, we establish a Struwe-type profile decomposition and quantitative stability estimates for critical points of the above inequality in the parameter region $s\in(0,\frac{n}{2})$ with the number of bubbles $魏\geq1$, and for $渭\in(0,n)$ with $0<渭\leq4s$. In particular, we provide an example to illustrate the sharpness of our result for $n=6s$ and $渭=4s$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.06636v1-abstract-full').style.display = 'none'; document.getElementById('2503.06636v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> Primary 35A23; 35R11; Secondly 35B35; 35J08 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2503.06381">arXiv:2503.06381</a> <span> [<a href="https://arxiv.org/pdf/2503.06381">pdf</a>, <a href="https://arxiv.org/format/2503.06381">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">stat.ML</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Methodology">stat.ME</span> </div> </div> <p class="title is-5 mathjax"> Bayesian Optimization for Robust Identification of Ornstein-Uhlenbeck Model </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Xu%2C+J">Jinwen Xu</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qin Lu</a>, <a href="/search/?searchtype=author&query=Bar-Shalom%2C+Y">Yaakov Bar-Shalom</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2503.06381v1-abstract-short" style="display: inline;"> This paper deals with the identification of the stochastic Ornstein-Uhlenbeck (OU) process error model, which is characterized by an inverse time constant, and the unknown variances of the process and observation noises. Although the availability of the explicit expression of the log-likelihood function allows one to obtain the maximum likelihood estimator (MLE), this entails evaluating the nontri… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.06381v1-abstract-full').style.display = 'inline'; document.getElementById('2503.06381v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2503.06381v1-abstract-full" style="display: none;"> This paper deals with the identification of the stochastic Ornstein-Uhlenbeck (OU) process error model, which is characterized by an inverse time constant, and the unknown variances of the process and observation noises. Although the availability of the explicit expression of the log-likelihood function allows one to obtain the maximum likelihood estimator (MLE), this entails evaluating the nontrivial gradient and also often struggles with local optima. To address these limitations, we put forth a sample-efficient global optimization approach based on the Bayesian optimization (BO) framework, which relies on a Gaussian process (GP) surrogate model for the objective function that effectively balances exploration and exploitation to select the query points. Specifically, each evaluation of the objective is implemented efficiently through the Kalman filter (KF) recursion. Comprehensive experiments on various parameter settings and sampling intervals corroborate that BO-based estimator consistently outperforms MLE implemented by the steady-state KF approximation and the expectation-maximization algorithm (whose derivation is a side contribution) in terms of root mean-square error (RMSE) and statistical consistency, confirming the effectiveness and robustness of the BO for identification of the stochastic OU process. Notably, the RMSE values produced by the BO-based estimator are smaller than the classical Cram茅r-Rao lower bound, especially for the inverse time constant, estimating which has been a long-standing challenge. This seemingly counterintuitive result can be explained by the data-driven prior for the learning parameters indirectly injected by BO through the GP prior over the objective function. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.06381v1-abstract-full').style.display = 'none'; document.getElementById('2503.06381v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2503.02711">arXiv:2503.02711</a> <span> [<a href="https://arxiv.org/pdf/2503.02711">pdf</a>, <a href="https://arxiv.org/format/2503.02711">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Branching fraction measurement of the decay $B^+ \to 蠄(2S) 蠁(1020) K^+$ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1128 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2503.02711v1-abstract-short" style="display: inline;"> The branching fraction of the decay $B^+\to 蠄(2S)蠁(1020)K^+$, relative to the topologically similar decay $B^+\to J/蠄蠁(1020) K^+$, is measured using proton-proton collision data collected by the LHCb experiment at center-of-mass energies of 7, 8, and 13 TeV, corresponding to an integrated luminosity of $9\,\mathrm{fb}^{-1}$. The ratio is found to be $0.061 \pm 0.004 \pm 0.009$, where the first unc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.02711v1-abstract-full').style.display = 'inline'; document.getElementById('2503.02711v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2503.02711v1-abstract-full" style="display: none;"> The branching fraction of the decay $B^+\to 蠄(2S)蠁(1020)K^+$, relative to the topologically similar decay $B^+\to J/蠄蠁(1020) K^+$, is measured using proton-proton collision data collected by the LHCb experiment at center-of-mass energies of 7, 8, and 13 TeV, corresponding to an integrated luminosity of $9\,\mathrm{fb}^{-1}$. The ratio is found to be $0.061 \pm 0.004 \pm 0.009$, where the first uncertainty is statistical and the second systematic. Using the world-average branching fraction for $B^+ \to J/蠄蠁(1020) K^+$, the branching fraction for the decay $B^+\to 蠄(2S) 蠁(1020) K^+$ is found to be $ (3.0 \pm 0.2 \pm 0.5 \pm 0.2) \times 10^{-6}$, where the first uncertainty is statistical, the second systematic, and the third is due to the branching fraction of the normalization channel. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.02711v1-abstract-full').style.display = 'none'; document.getElementById('2503.02711v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3320/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-039, CERN-EP-2025-011 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.18987">arXiv:2502.18987</a> <span> [<a href="https://arxiv.org/pdf/2502.18987">pdf</a>, <a href="https://arxiv.org/format/2502.18987">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Observation of a new charmed baryon decaying to $螢_c^+ 蟺^- 蟺^+$ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1135 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.18987v1-abstract-short" style="display: inline;"> The $螢_c^+ 蟺^- 蟺^+$ spectrum is investigated using proton-proton collisions at a center-of-mass energy of 13TeV, corresponding to an integrated luminosity of 5.4fb$^{-1}$, collected by the LHCb experiment during 2016--2018. Four states are observed with high significance, and their masses and widths are measured to be \begin{align*} m[螢_c(2815)^{+}] &= 2816.65 \pm 0.03 \pm 0.03 \pm 0.23 ~\text{M… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.18987v1-abstract-full').style.display = 'inline'; document.getElementById('2502.18987v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.18987v1-abstract-full" style="display: none;"> The $螢_c^+ 蟺^- 蟺^+$ spectrum is investigated using proton-proton collisions at a center-of-mass energy of 13TeV, corresponding to an integrated luminosity of 5.4fb$^{-1}$, collected by the LHCb experiment during 2016--2018. Four states are observed with high significance, and their masses and widths are measured to be \begin{align*} m[螢_c(2815)^{+}] &= 2816.65 \pm 0.03 \pm 0.03 \pm 0.23 ~\text{MeV}, 螕[螢_c(2815)^{+}] &= 2.07 \pm 0.08 \pm 0.12~\text{MeV},\\[5pt] m[螢_c(2923)^{+}] &= 2922.8 \pm 0.3 \pm 0.5 \pm 0.2~\text{MeV}, 螕[螢_c(2923)^{+}] &= 5.3 \pm 0.9 \pm 1.4~\text{MeV},\\[5pt] m[螢_c(2970)^{+}] &= 2968.6 \pm 0.5 \pm 0.5 \pm 0.2~\text{MeV}, 螕[螢_c(2970)^{+}] &= 31.7 \pm 1.7 \pm 1.9~\text{MeV},\\[5pt] m[螢_c(3080)^{+}] &= 3076.8 \pm 0.7 \pm 1.3 \pm 0.2~\text{MeV}, 螕[螢_c(3080)^{+}] &= 6.8 \pm 2.3 \pm 0.9~\text{MeV}, \end{align*} where the uncertainties are statistical, systematic, and due to the limited precision on the $螢_c^+$ mass, respectively. The $螢_c(2923)^{+}$ baryon is observed for the first time, and is consistent with being the isospin partner of the previously observed $螢_c(2923)^{0}$ state. Most of the measured parameters are more precise than existing world averages. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.18987v1-abstract-full').style.display = 'none'; document.getElementById('2502.18987v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3080/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-055, CERN-EP-2025-019 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.17909">arXiv:2502.17909</a> <span> [<a href="https://arxiv.org/pdf/2502.17909">pdf</a>, <a href="https://arxiv.org/format/2502.17909">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> FactFlow: Automatic Fact Sheet Generation and Customization from Tabular Dataset via AI Chain Design & Implementation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Vu%2C+M+D">Minh Duc Vu</a>, <a href="/search/?searchtype=author&query=Chen%2C+J">Jieshan Chen</a>, <a href="/search/?searchtype=author&query=Xing%2C+Z">Zhenchang Xing</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Xu%2C+X">Xiwei Xu</a>, <a href="/search/?searchtype=author&query=Fu%2C+Q">Qian Fu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.17909v1-abstract-short" style="display: inline;"> With the proliferation of data across various domains, there is a critical demand for tools that enable non-experts to derive meaningful insights without deep data analysis skills. To address this need, existing automatic fact sheet generation tools offer heuristic-based solutions to extract facts and generate stories. However, they inadequately grasp the semantics of data and struggle to generate… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.17909v1-abstract-full').style.display = 'inline'; document.getElementById('2502.17909v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.17909v1-abstract-full" style="display: none;"> With the proliferation of data across various domains, there is a critical demand for tools that enable non-experts to derive meaningful insights without deep data analysis skills. To address this need, existing automatic fact sheet generation tools offer heuristic-based solutions to extract facts and generate stories. However, they inadequately grasp the semantics of data and struggle to generate narratives that fully capture the semantics of the dataset or align the fact sheet with specific user needs. Addressing these shortcomings, this paper introduces \tool, a novel tool designed for the automatic generation and customisation of fact sheets. \tool applies the concept of collaborative AI workers to transform raw tabular dataset into comprehensive, visually compelling fact sheets. We define effective taxonomy to profile AI worker for specialised tasks. Furthermore, \tool empowers users to refine these fact sheets through intuitive natural language commands, ensuring the final outputs align closely with individual preferences and requirements. Our user evaluation with 18 participants confirms that \tool not only surpasses state-of-the-art baselines in automated fact sheet production but also provides a positive user experience during customization tasks. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.17909v1-abstract-full').style.display = 'none'; document.getElementById('2502.17909v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">11 pages, 6 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> I.2; H.4 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.16017">arXiv:2502.16017</a> <span> [<a href="https://arxiv.org/pdf/2502.16017">pdf</a>, <a href="https://arxiv.org/format/2502.16017">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> An Extended Pattern Collection for Blockchain-based Applications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Xu%2C+X">Xiwei Xu</a>, <a href="/search/?searchtype=author&query=Pautasso%2C+C">Cesare Pautasso</a>, <a href="/search/?searchtype=author&query=Lo%2C+S+K">Sin Kuang Lo</a>, <a href="/search/?searchtype=author&query=Zhu%2C+L">Liming Zhu</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Weber%2C+I">Ingo Weber</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.16017v1-abstract-short" style="display: inline;"> Blockchain is an emerging technology that enables new forms of decentralized software architectures, where distributed components can reach agreements on shared system states without trusting a central integration point. Blockchain provides a shared infrastructure to execute programs, called smart contracts, and to store data. Since blockchain technologies are at an early stage, there is a lack of… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.16017v1-abstract-full').style.display = 'inline'; document.getElementById('2502.16017v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.16017v1-abstract-full" style="display: none;"> Blockchain is an emerging technology that enables new forms of decentralized software architectures, where distributed components can reach agreements on shared system states without trusting a central integration point. Blockchain provides a shared infrastructure to execute programs, called smart contracts, and to store data. Since blockchain technologies are at an early stage, there is a lack of a systematically organized knowledge providing a holistic view on designing software systems that use blockchain. We view blockchain as a component of a bigger software system, which requires patterns for using blockchain in the design of the software architecture. In this paper, we collect a list of patterns for blockchain-based applications. The pattern collection is categorized into five categories, including interaction with external world patterns, data management patterns, security patterns, structural patterns of contracts, and user interaction patterns. Some patterns are designed considering the nature of blockchain and how blockchains can be specifically introduced within real-world applications. Others are variants of existing design patterns applied in the context of blockchain-based applications and smart contracts. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.16017v1-abstract-full').style.display = 'none'; document.getElementById('2502.16017v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted by Transactions on Pattern Languages of Programming (https://www.springer.com/series/8677?srsltid=AfmBOoomdUEOPa-9tSOF-DDhmUxUOwk1Vfj_0dkhwjrptiERHvxb-yfX)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.10291">arXiv:2502.10291</a> <span> [<a href="https://arxiv.org/pdf/2502.10291">pdf</a>, <a href="https://arxiv.org/format/2502.10291">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Angular analysis of $B^0\rightarrow K^{*0}e^{+}e^{-}$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1115 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.10291v1-abstract-short" style="display: inline;"> An angular analysis of $B^0\rightarrow K^{*0}e^{+}e^{-}$ decays is presented using proton-proton collision data collected by the LHCb experiment at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of 9 fb$^{-1}$. The analysis is performed in the region of the dilepton invariant mass squared of 1.1-6.0 GeV$^{2}/c^{4}$. In addition, a test of lepton flavour unive… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.10291v1-abstract-full').style.display = 'inline'; document.getElementById('2502.10291v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.10291v1-abstract-full" style="display: none;"> An angular analysis of $B^0\rightarrow K^{*0}e^{+}e^{-}$ decays is presented using proton-proton collision data collected by the LHCb experiment at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of 9 fb$^{-1}$. The analysis is performed in the region of the dilepton invariant mass squared of 1.1-6.0 GeV$^{2}/c^{4}$. In addition, a test of lepton flavour universality is performed by comparing the obtained angular observables with those measured in $B^0\rightarrow K^{*0}渭^{+}渭^{-}$ decays. In general, the angular observables are found to be consistent with the Standard Model expectations as well as with global analyses of other $b \rightarrow s \ell^{+} \ell^{-}$ processes, where $\ell$ is either a muon or an electron. No sign of lepton-flavour-violating effects is observed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.10291v1-abstract-full').style.display = 'none'; document.getElementById('2502.10291v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1628/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-022, CERN-EP-2025-001 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.05421">arXiv:2502.05421</a> <span> [<a href="https://arxiv.org/pdf/2502.05421">pdf</a>, <a href="https://arxiv.org/ps/2502.05421">ps</a>, <a href="https://arxiv.org/format/2502.05421">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Algebraic Geometry">math.AG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Number Theory">math.NT</span> </div> </div> <p class="title is-5 mathjax"> Slopes and weights of $\ell$-adic cohomology of rigid spaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qing Lu</a>, <a href="/search/?searchtype=author&query=Zheng%2C+W">Weizhe Zheng</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.05421v1-abstract-short" style="display: inline;"> We prove that Frobenius eigenvalues of $\ell$-adic cohomology and $\ell$-adic intersection cohomology of rigid spaces over $p$-adic local fields are algebraic integers and we give bounds for their $p$-adic valuations. As an application, we deduce bounds for their weights, proving conjectures of Bhatt, Hansen, and Zavyalov. We also give examples of monodromy-pure perverse sheaves on projective curv… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.05421v1-abstract-full').style.display = 'inline'; document.getElementById('2502.05421v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.05421v1-abstract-full" style="display: none;"> We prove that Frobenius eigenvalues of $\ell$-adic cohomology and $\ell$-adic intersection cohomology of rigid spaces over $p$-adic local fields are algebraic integers and we give bounds for their $p$-adic valuations. As an application, we deduce bounds for their weights, proving conjectures of Bhatt, Hansen, and Zavyalov. We also give examples of monodromy-pure perverse sheaves on projective curves with non monodromy-pure cohomology, answering a question of Hansen and Zavyalov. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.05421v1-abstract-full').style.display = 'none'; document.getElementById('2502.05421v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 14F20; 14G22 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.04060">arXiv:2502.04060</a> <span> [<a href="https://arxiv.org/pdf/2502.04060">pdf</a>, <a href="https://arxiv.org/format/2502.04060">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Phenomenology">hep-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1140/epjc/s10052-025-13906-7">10.1140/epjc/s10052-025-13906-7 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> New axion contribution to the two-photon decays of neutral pions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Z">Zhen-Yan Lu</a>, <a href="/search/?searchtype=author&query=Huang%2C+Y">Yang Huang</a>, <a href="/search/?searchtype=author&query=Cheng%2C+J">Ji-Gui Cheng</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qi Lu</a>, <a href="/search/?searchtype=author&query=Wang%2C+S">Shu-Peng Wang</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.04060v2-abstract-short" style="display: inline;"> The presence of axions introduces new diagrams at one-loop order to the two-photon decays of the neutral pion through axion-pion mixing. In this work, we calculate this correction, missing in all current calculations, in the framework of SU(2) chiral perturbation theory. We show that the correction is proportional to the axion-photon coupling and the square of axion mass, which in turn is strongly… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.04060v2-abstract-full').style.display = 'inline'; document.getElementById('2502.04060v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.04060v2-abstract-full" style="display: none;"> The presence of axions introduces new diagrams at one-loop order to the two-photon decays of the neutral pion through axion-pion mixing. In this work, we calculate this correction, missing in all current calculations, in the framework of SU(2) chiral perturbation theory. We show that the correction is proportional to the axion-photon coupling and the square of axion mass, which in turn is strongly suppressed by the axion decay constant for the classical space window but may not be negligible for the QCD axion in the MeV or even larger mass range. On the other hand, in combination with the experimental measurement of the decay width of $蟺^0\rightarrow纬纬$ process, this result rules out the standard QCD axion as an explanation for the possible discrepancy between the chiral perturbation theory prediction and the experimental data. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.04060v2-abstract-full').style.display = 'none'; document.getElementById('2502.04060v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 6 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 2 figures. V2: matches published paper in EPJC</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Eur. Phys. J. C (2025) 85:207 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.04013">arXiv:2502.04013</a> <span> [<a href="https://arxiv.org/pdf/2502.04013">pdf</a>, <a href="https://arxiv.org/format/2502.04013">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Search for resonance-enhanced $CP$ and angular asymmetries in the $螞^+_{c}\to p渭^+渭^-$ decay at LHCb </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.04013v1-abstract-short" style="display: inline;"> The first measurement of the $CP$ asymmetry of the decay rate ($A_{CP}$) and the $CP$ average ($危A_{\text{FB}}$) and $CP$ asymmetry ($螖A_{\text{FB}}$) of the forward-backward asymmetry in the muon system of $\mathit螞^+_c\to p渭^+渭^-$ decays is reported. The measurement is performed using a data sample of proton-proton collisions, recorded by the LHCb experiment from 2016 to 2018 at a center-of-mass… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.04013v1-abstract-full').style.display = 'inline'; document.getElementById('2502.04013v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.04013v1-abstract-full" style="display: none;"> The first measurement of the $CP$ asymmetry of the decay rate ($A_{CP}$) and the $CP$ average ($危A_{\text{FB}}$) and $CP$ asymmetry ($螖A_{\text{FB}}$) of the forward-backward asymmetry in the muon system of $\mathit螞^+_c\to p渭^+渭^-$ decays is reported. The measurement is performed using a data sample of proton-proton collisions, recorded by the LHCb experiment from 2016 to 2018 at a center-of-mass energy of 13$\text{ TeV}$, which corresponds to an integrated luminosity of 5.4$\text{ fb}^{-1}$. The asymmetries are measured in two regions of dimuon mass near the $蠁$-meson mass peak. The dimuon-mass integrated results are \begin{align*} A_{CP} &= (-1.1 \pm 4.0 \pm 0.5)\%,\\ 危A_{\text{FB}} &= (\phantom{-}3.9 \pm 4.0 \pm 0.6)\%,\\ 螖A_{\text{FB}} &= (\phantom{-}3.1 \pm 4.0 \pm 0.4)\%, \end{align*} where the first uncertainty is statistical and the second systematic. The results are consistent with the conservation of $CP$ symmetry and the Standard Model expectations. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.04013v1-abstract-full').style.display = 'none'; document.getElementById('2502.04013v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3473/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-051, CERN-EP-2024-340 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.03813">arXiv:2502.03813</a> <span> [<a href="https://arxiv.org/pdf/2502.03813">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Optimized Unet with Attention Mechanism for Multi-Scale Semantic Segmentation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Li%2C+X">Xuan Li</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanchao Lu</a>, <a href="/search/?searchtype=author&query=Li%2C+Y">Yankaiqi Li</a>, <a href="/search/?searchtype=author&query=Li%2C+M">Muqing Li</a>, <a href="/search/?searchtype=author&query=Qi%2C+Y">Yijiashun Qi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.03813v1-abstract-short" style="display: inline;"> Semantic segmentation is one of the core tasks in the field of computer vision, and its goal is to accurately classify each pixel in an image. The traditional Unet model achieves efficient feature extraction and fusion through an encoder-decoder structure, but it still has certain limitations when dealing with complex backgrounds, long-distance dependencies, and multi-scale targets. To this end, t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.03813v1-abstract-full').style.display = 'inline'; document.getElementById('2502.03813v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.03813v1-abstract-full" style="display: none;"> Semantic segmentation is one of the core tasks in the field of computer vision, and its goal is to accurately classify each pixel in an image. The traditional Unet model achieves efficient feature extraction and fusion through an encoder-decoder structure, but it still has certain limitations when dealing with complex backgrounds, long-distance dependencies, and multi-scale targets. To this end, this paper proposes an improved Unet model combined with an attention mechanism, introduces channel attention and spatial attention modules, enhances the model's ability to focus on important features, and optimizes skip connections through a multi-scale feature fusion strategy, thereby improving the combination of global semantic information and fine-grained features. The experiment is based on the Cityscapes dataset and compared with classic models such as FCN, SegNet, DeepLabv3+, and PSPNet. The improved model performs well in terms of mIoU and pixel accuracy (PA), reaching 76.5% and 95.3% respectively. The experimental results verify the superiority of this method in dealing with complex scenes and blurred target boundaries. In addition, this paper discusses the potential of the improved model in practical applications and future expansion directions, indicating that it has broad application value in fields such as autonomous driving, remote sensing image analysis, and medical image processing. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.03813v1-abstract-full').style.display = 'none'; document.getElementById('2502.03813v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.03803">arXiv:2502.03803</a> <span> [<a href="https://arxiv.org/pdf/2502.03803">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Graph Neural Network-Driven Hierarchical Mining for Complex Imbalanced Data </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Qi%2C+Y">Yijiashun Qi</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanchao Lu</a>, <a href="/search/?searchtype=author&query=Dou%2C+S">Shiyu Dou</a>, <a href="/search/?searchtype=author&query=Sun%2C+X">Xiaoxuan Sun</a>, <a href="/search/?searchtype=author&query=Li%2C+M">Muqing Li</a>, <a href="/search/?searchtype=author&query=Li%2C+Y">Yankaiqi Li</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.03803v1-abstract-short" style="display: inline;"> This study presents a hierarchical mining framework for high-dimensional imbalanced data, leveraging a depth graph model to address the inherent performance limitations of conventional approaches in handling complex, high-dimensional data distributions with imbalanced sample representations. By constructing a structured graph representation of the dataset and integrating graph neural network (GNN)… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.03803v1-abstract-full').style.display = 'inline'; document.getElementById('2502.03803v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.03803v1-abstract-full" style="display: none;"> This study presents a hierarchical mining framework for high-dimensional imbalanced data, leveraging a depth graph model to address the inherent performance limitations of conventional approaches in handling complex, high-dimensional data distributions with imbalanced sample representations. By constructing a structured graph representation of the dataset and integrating graph neural network (GNN) embeddings, the proposed method effectively captures global interdependencies among samples. Furthermore, a hierarchical strategy is employed to enhance the characterization and extraction of minority class feature patterns, thereby facilitating precise and robust imbalanced data mining. Empirical evaluations across multiple experimental scenarios validate the efficacy of the proposed approach, demonstrating substantial improvements over traditional methods in key performance metrics, including pattern discovery count, average support, and minority class coverage. Notably, the method exhibits superior capabilities in minority-class feature extraction and pattern correlation analysis. These findings underscore the potential of depth graph models, in conjunction with hierarchical mining strategies, to significantly enhance the efficiency and accuracy of imbalanced data analysis. This research contributes a novel computational framework for high-dimensional complex data processing and lays the foundation for future extensions to dynamically evolving imbalanced data and multi-modal data applications, thereby expanding the applicability of advanced data mining methodologies to more intricate analytical domains. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.03803v1-abstract-full').style.display = 'none'; document.getElementById('2502.03803v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.16155">arXiv:2501.16155</a> <span> [<a href="https://arxiv.org/pdf/2501.16155">pdf</a>, <a href="https://arxiv.org/format/2501.16155">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> CITYWALK: Enhancing LLM-Based C++ Unit Test Generation via Project-Dependency Awareness and Language-Specific Knowledge </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Zhang%2C+Y">Yuwei Zhang</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qingyuan Lu</a>, <a href="/search/?searchtype=author&query=Liu%2C+K">Kai Liu</a>, <a href="/search/?searchtype=author&query=Dou%2C+W">Wensheng Dou</a>, <a href="/search/?searchtype=author&query=Zhu%2C+J">Jiaxin Zhu</a>, <a href="/search/?searchtype=author&query=Qian%2C+L">Li Qian</a>, <a href="/search/?searchtype=author&query=Zhang%2C+C">Chunxi Zhang</a>, <a href="/search/?searchtype=author&query=Lin%2C+Z">Zheng Lin</a>, <a href="/search/?searchtype=author&query=Wei%2C+J">Jun Wei</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.16155v1-abstract-short" style="display: inline;"> Unit testing plays a pivotal role in the software development lifecycle, as it ensures code quality. However, writing high-quality unit tests remains a time-consuming task for developers in practice. More recently, the application of large language models (LLMs) in automated unit test generation has demonstrated promising results. Existing approaches primarily focus on interpreted programming lang… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.16155v1-abstract-full').style.display = 'inline'; document.getElementById('2501.16155v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.16155v1-abstract-full" style="display: none;"> Unit testing plays a pivotal role in the software development lifecycle, as it ensures code quality. However, writing high-quality unit tests remains a time-consuming task for developers in practice. More recently, the application of large language models (LLMs) in automated unit test generation has demonstrated promising results. Existing approaches primarily focus on interpreted programming languages (e.g., Java), while mature solutions tailored to compiled programming languages like C++ are yet to be explored. The intricate language features of C++, such as pointers, templates, and virtual functions, pose particular challenges for LLMs in generating both executable and high-coverage unit tests. To tackle the aforementioned problems, this paper introduces CITYWALK, a novel LLM-based framework for C++ unit test generation. CITYWALK enhances LLMs by providing a comprehensive understanding of the dependency relationships within the project under test via program analysis. Furthermore, CITYWALK incorporates language-specific knowledge about C++ derived from project documentation and empirical observations, significantly improving the correctness of the LLM-generated unit tests. We implement CITYWALK by employing the widely popular LLM GPT-4o. The experimental results show that CITYWALK outperforms current state-of-the-art approaches on a collection of eight popular C++ projects. Our findings demonstrate the effectiveness of CITYWALK in generating high-quality C++ unit tests. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.16155v1-abstract-full').style.display = 'none'; document.getElementById('2501.16155v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 tables, 12 figures. Under Review</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.15127">arXiv:2501.15127</a> <span> [<a href="https://arxiv.org/pdf/2501.15127">pdf</a>, <a href="https://arxiv.org/format/2501.15127">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Methodology">stat.ME</span> </div> </div> <p class="title is-5 mathjax"> Versatile Differentially Private Learning for General Loss Functions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qilong Lu</a>, <a href="/search/?searchtype=author&query=Chen%2C+S">Songxi Chen</a>, <a href="/search/?searchtype=author&query=Qiu%2C+Y">Yumou Qiu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.15127v1-abstract-short" style="display: inline;"> This paper aims to provide a versatile privacy-preserving release mechanism along with a unified approach for subsequent parameter estimation and statistical inference. We propose the ZIL privacy mechanism based on zero-inflated symmetric multivariate Laplace noise, which requires no prior specification of subsequent analysis tasks, allows for general loss functions under minimal conditions, impos… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.15127v1-abstract-full').style.display = 'inline'; document.getElementById('2501.15127v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.15127v1-abstract-full" style="display: none;"> This paper aims to provide a versatile privacy-preserving release mechanism along with a unified approach for subsequent parameter estimation and statistical inference. We propose the ZIL privacy mechanism based on zero-inflated symmetric multivariate Laplace noise, which requires no prior specification of subsequent analysis tasks, allows for general loss functions under minimal conditions, imposes no limit on the number of analyses, and is adaptable to the increasing data volume in online scenarios. We derive the trade-off function for the proposed ZIL mechanism that characterizes its privacy protection level. Within the M-estimation framework, we propose a novel doubly random corrected loss (DRCL) for the ZIL mechanism, which provides consistent and asymptotic normal M-estimates for the parameters of the target population under differential privacy constraints. The proposed approach is easy to compute without numerical integration and differentiation for noisy data. It is applicable for a general class of loss functions, including non-smooth loss functions like check loss and hinge loss. Simulation studies, including logistic regression and quantile regression, are conducted to evaluate the performance of the proposed method. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.15127v1-abstract-full').style.display = 'none'; document.getElementById('2501.15127v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.14943">arXiv:2501.14943</a> <span> [<a href="https://arxiv.org/pdf/2501.14943">pdf</a>, <a href="https://arxiv.org/format/2501.14943">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Evidence for $B^-\rightarrow D^{**0}蟿^-\overline{谓_蟿}$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.14943v1-abstract-short" style="display: inline;"> The first evidence for the decay $B^-\rightarrow D^{**0}蟿^-\overline{谓_蟿}$ is obtained using proton-proton collision data collected by the LHCb experiment, corresponding to an integrated luminosity of 9 fb$^{-1}$ , at centre-of-mass energies of 7, 8 and 13 Tev. Here, the $D^{**0}$ meson represents any of the three excited charm mesons $D_{1}(2420)^{0}$, $D_{2}^{*}(2460)^{0}$, and… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.14943v1-abstract-full').style.display = 'inline'; document.getElementById('2501.14943v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.14943v1-abstract-full" style="display: none;"> The first evidence for the decay $B^-\rightarrow D^{**0}蟿^-\overline{谓_蟿}$ is obtained using proton-proton collision data collected by the LHCb experiment, corresponding to an integrated luminosity of 9 fb$^{-1}$ , at centre-of-mass energies of 7, 8 and 13 Tev. Here, the $D^{**0}$ meson represents any of the three excited charm mesons $D_{1}(2420)^{0}$, $D_{2}^{*}(2460)^{0}$, and $D_{1}^{'}(2400)^{0}$. The $B^-\rightarrow D^{**0}蟿^-\overline{谓_蟿}$ signal is measured with a significance of 3.5 $蟽$, including systematic uncertainties. The combined branching fraction $BR(B^-\rightarrow D^{**0}_{1,2}蟿^-\overline{谓_蟿})\times BR(D^{**0}_{1,2}\rightarrow D^{*+}蟺^-)$, where $D^{**0}_{1,2}$ denotes both $D_{1}(2420)^{0}$ and $D_{2}^{*}(2460)^{0}$ contributions, is measured to be $(0.051\pm0.013(stat)\pm 0.006(syst)\pm 0.009(\rm{ext}) )\%$, where the last uncertainty reflects that of the branching fraction of the normalisation channel $B^-\rightarrow D^{**0}_{1,2}D_s^{(*)-}$. The ratio between the tauonic and muonic semileptonic $B$ decays, with the latter taken from world average values, is also determined and found to be ${\cal R}(D^{**0}_{1,2})=0.13\pm0.03(stat)\pm0.01(syst)\pm0.02\,(\rm{ext})$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.14943v1-abstract-full').style.display = 'none'; document.getElementById('2501.14943v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3300/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-037, CERN-EP-2024-341 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.12779">arXiv:2501.12779</a> <span> [<a href="https://arxiv.org/pdf/2501.12779">pdf</a>, <a href="https://arxiv.org/format/2501.12779">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Observation of the $螞_b^0 \to J/蠄螢^- K^+$ and $螢_b^0 \to J/蠄螢^- 蟺^+$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1126 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.12779v1-abstract-short" style="display: inline;"> The first observation of the $螢_b^0 \to J/蠄螢^- 蟺^+$ decay and the most precise measurement of the branching fraction of the $螞_b^0 \to J/蠄螢^- K^+$ decay are reported, using proton-proton collision data from the LHCb experiment collected in 2016--2018 at a centre-of-mass energy of 13~TeV, corresponding to an integrated luminosity of 5.4~fb$^{-1}$. Using the $螞_b^0 \to J/蠄螞$ and $螢_b^0 \to J/蠄螢^-$ d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12779v1-abstract-full').style.display = 'inline'; document.getElementById('2501.12779v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.12779v1-abstract-full" style="display: none;"> The first observation of the $螢_b^0 \to J/蠄螢^- 蟺^+$ decay and the most precise measurement of the branching fraction of the $螞_b^0 \to J/蠄螢^- K^+$ decay are reported, using proton-proton collision data from the LHCb experiment collected in 2016--2018 at a centre-of-mass energy of 13~TeV, corresponding to an integrated luminosity of 5.4~fb$^{-1}$. Using the $螞_b^0 \to J/蠄螞$ and $螢_b^0 \to J/蠄螢^-$ decays as normalisation channels, the ratios of branching fractions are measured to be: \[ \frac{\mathcal{B}(螞_b^0 \to J/蠄螢^- K^+)}{\mathcal{B}(螞_b^0 \to J/蠄螞)} = (1.17 \pm 0.14 \pm 0.08)\times 10^{-2} \, , \] \[ \frac{\mathcal{B}(螢_b^0 \to J/蠄螢^- 蟺^+)}{\mathcal{B}(螢_b^0 \to J/蠄螢^-)} = (11.9 \pm 1.4 \pm 0.6)\times 10^{-2}\, , \] where the first uncertainty is statistical and the second systematic. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12779v1-abstract-full').style.display = 'none'; document.getElementById('2501.12779v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3479/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> CERN-EP-2024-337 LHCb-PAPER-2024-049 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.12611">arXiv:2501.12611</a> <span> [<a href="https://arxiv.org/pdf/2501.12611">pdf</a>, <a href="https://arxiv.org/format/2501.12611">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Nuclear Experiment">nucl-ex</span> </div> </div> <p class="title is-5 mathjax"> Measurement of the multiplicity dependence of $\mit违$ production ratios in $pp$ collisions at $\sqrt{s}=13$ TeV </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.12611v2-abstract-short" style="display: inline;"> The $\mit违(\mathrm{2}S)$ and $\mit违(\mathrm{3}S)$ production cross-sections are measured relative to that of the $\mit违(\mathrm{1}S)$ meson, as a function of charged-particle multiplicity in proton-proton collisions at a centre-of-mass energy of $13$ TeV. The measurement uses data collected by the LHCb experiment in 2018 corresponding to an integrated luminosity of 2 $\text{fb}^{-1}$. Both the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12611v2-abstract-full').style.display = 'inline'; document.getElementById('2501.12611v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.12611v2-abstract-full" style="display: none;"> The $\mit违(\mathrm{2}S)$ and $\mit违(\mathrm{3}S)$ production cross-sections are measured relative to that of the $\mit违(\mathrm{1}S)$ meson, as a function of charged-particle multiplicity in proton-proton collisions at a centre-of-mass energy of $13$ TeV. The measurement uses data collected by the LHCb experiment in 2018 corresponding to an integrated luminosity of 2 $\text{fb}^{-1}$. Both the $\mit违(\mathrm{2}S)$-to-$\mit违(\mathrm{1}S)$ and $\mit违(\mathrm{3}S)$-to-$\mit违(\mathrm{1}S)$ cross-section ratios are found to decrease significantly as a function of event multiplicity, with the $\mit违(\mathrm{3}S)$-to-$\mit违(\mathrm{1}S)$ ratio showing a steeper decline towards high multiplicity. This hierarchy is qualitatively consistent with the comover model predictions, indicating that final-state interactions play an important role in bottomonia production in high-multiplicity events. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12611v2-abstract-full').style.display = 'none'; document.getElementById('2501.12611v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 21 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1782/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-038, CERN-EP-2024-318 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.12469">arXiv:2501.12469</a> <span> [<a href="https://arxiv.org/pdf/2501.12469">pdf</a>, <a href="https://arxiv.org/format/2501.12469">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> </div> <p class="title is-5 mathjax"> An Empirical Characterization of Outages and Incidents in Public Services for Large Language Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Chu%2C+X">Xiaoyu Chu</a>, <a href="/search/?searchtype=author&query=Talluri%2C+S">Sacheendra Talluri</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qingxian Lu</a>, <a href="/search/?searchtype=author&query=Iosup%2C+A">Alexandru Iosup</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.12469v1-abstract-short" style="display: inline;"> People and businesses increasingly rely on public LLM services, such as ChatGPT, DALLE, and Claude. Understanding their outages, and particularly measuring their failure-recovery processes, is becoming a stringent problem. However, only limited studies exist in this emerging area. Addressing this problem, in this work we conduct an empirical characterization of outages and failure-recovery in publ… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12469v1-abstract-full').style.display = 'inline'; document.getElementById('2501.12469v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.12469v1-abstract-full" style="display: none;"> People and businesses increasingly rely on public LLM services, such as ChatGPT, DALLE, and Claude. Understanding their outages, and particularly measuring their failure-recovery processes, is becoming a stringent problem. However, only limited studies exist in this emerging area. Addressing this problem, in this work we conduct an empirical characterization of outages and failure-recovery in public LLM services. We collect and prepare datasets for 8 commonly used LLM services across 3 major LLM providers, including market-leads OpenAI and Anthropic. We conduct a detailed analysis of failure recovery statistical properties, temporal patterns, co-occurrence, and the impact range of outage-causing incidents. We make over 10 observations, among which: (1) Failures in OpenAI's ChatGPT take longer to resolve but occur less frequently than those in Anthropic's Claude;(2) OpenAI and Anthropic service failures exhibit strong weekly and monthly periodicity; and (3) OpenAI services offer better failure-isolation than Anthropic services. Our research explains LLM failure characteristics and thus enables optimization in building and using LLM systems. FAIR data and code are publicly available on https://zenodo.org/records/14018219 and https://github.com/atlarge-research/llm-service-analysis. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.12469v1-abstract-full').style.display = 'none'; document.getElementById('2501.12469v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> 16th ACM/SPEC International Conference on Performance Engineering (ICPE 2025) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.11635">arXiv:2501.11635</a> <span> [<a href="https://arxiv.org/pdf/2501.11635">pdf</a>, <a href="https://arxiv.org/format/2501.11635">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Search for charge-parity violation in semileptonically tagged $D^{0} \to K^{+} 蟺^{-}$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.11635v1-abstract-short" style="display: inline;"> An analysis of the flavour oscillations of the charmed neutral meson is presented. The ratio of $D^{0} \to K^{+} 蟺^{-}$ and $D^{0} \to K^{-} 蟺^{+}$ decay rates is measured as a function of the decay time of the $D^{0}$ meson and compared with the charge-conjugated system to search for charge-parity violation. The meson flavour at production is double-tagged by the charges of the muon and pion in t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.11635v1-abstract-full').style.display = 'inline'; document.getElementById('2501.11635v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.11635v1-abstract-full" style="display: none;"> An analysis of the flavour oscillations of the charmed neutral meson is presented. The ratio of $D^{0} \to K^{+} 蟺^{-}$ and $D^{0} \to K^{-} 蟺^{+}$ decay rates is measured as a function of the decay time of the $D^{0}$ meson and compared with the charge-conjugated system to search for charge-parity violation. The meson flavour at production is double-tagged by the charges of the muon and pion in the preceding $\overline{B} \to D^{*}(2010)^{+} 渭^{-} X$ and ${{D^{*}(2010)^{+}} \to D^{0}蟺^{+}}$ decays, respectively. These decays are selected from proton-proton collision data collected by the LHCb experiment at a centre-of-mass energy of ${13\,\text{TeV}}$ and corresponding to an integrated luminosity of ${5.4\,\text{fb}^{-1}}$. The flavour oscillation parameters, relating to the differences in mass and width of the mass eigenstates, are found to be ${y^\prime=(5.8\pm1.6)\times10^{-3}}$ and ${(x^\prime)^2=(0.0\pm1.2)\times10^{-4}}$. No evidence for charge-parity violation is seen either in the flavour oscillations or in the decay, where the direct charge-parity asymmetry is measured to be ${A_{D}=(2.3\pm1.7)\,{\%}}$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.11635v1-abstract-full').style.display = 'none'; document.getElementById('2501.11635v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3260/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-044, CERN-EP-2024-319 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.11354">arXiv:2501.11354</a> <span> [<a href="https://arxiv.org/pdf/2501.11354">pdf</a>, <a href="https://arxiv.org/format/2501.11354">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Towards Advancing Code Generation with Large Language Models: A Research Roadmap </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Jin%2C+H">Haolin Jin</a>, <a href="/search/?searchtype=author&query=Chen%2C+H">Huaming Chen</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+L">Liming Zhu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.11354v1-abstract-short" style="display: inline;"> Recently, we have witnessed the rapid development of large language models, which have demonstrated excellent capabilities in the downstream task of code generation. However, despite their potential, LLM-based code generation still faces numerous technical and evaluation challenges, particularly when embedded in real-world development. In this paper, we present our vision for current research dire… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.11354v1-abstract-full').style.display = 'inline'; document.getElementById('2501.11354v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.11354v1-abstract-full" style="display: none;"> Recently, we have witnessed the rapid development of large language models, which have demonstrated excellent capabilities in the downstream task of code generation. However, despite their potential, LLM-based code generation still faces numerous technical and evaluation challenges, particularly when embedded in real-world development. In this paper, we present our vision for current research directions, and provide an in-depth analysis of existing studies on this task. We propose a six-layer vision framework that categorizes code generation process into distinct phases, namely Input Phase, Orchestration Phase, Development Phase, and Validation Phase. Additionally, we outline our vision workflow, which reflects on the currently prevalent frameworks. We systematically analyse the challenges faced by large language models, including those LLM-based agent frameworks, in code generation tasks. With these, we offer various perspectives and actionable recommendations in this area. Our aim is to provide guidelines for improving the reliability, robustness and usability of LLM-based code generation systems. Ultimately, this work seeks to address persistent challenges and to provide practical suggestions for a more pragmatic LLM-based solution for future code generation endeavors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.11354v1-abstract-full').style.display = 'none'; document.getElementById('2501.11354v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.06483">arXiv:2501.06483</a> <span> [<a href="https://arxiv.org/pdf/2501.06483">pdf</a>, <a href="https://arxiv.org/format/2501.06483">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Study of light-meson resonances decaying to $K^0_{\rm S} K 蟺$ in the $B \to (K^0_{\rm S} K 蟺) K$ channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.06483v1-abstract-short" style="display: inline;"> A study is presented of $B^+ \to K^0_{\rm S} K^- 蟺^+ K^-$ and $B^+ \to K^0_{\rm S} K^+ 蟺^- K^+$ decays based on the analysis of proton-proton collision data collected with the LHCb detector at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of $9 fb^{-1}$. The $K^0_{\rm S} K 蟺$ invariant-mass distributions of both $B^+$ decay modes show, in the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.06483v1-abstract-full').style.display = 'inline'; document.getElementById('2501.06483v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.06483v1-abstract-full" style="display: none;"> A study is presented of $B^+ \to K^0_{\rm S} K^- 蟺^+ K^-$ and $B^+ \to K^0_{\rm S} K^+ 蟺^- K^+$ decays based on the analysis of proton-proton collision data collected with the LHCb detector at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of $9 fb^{-1}$. The $K^0_{\rm S} K 蟺$ invariant-mass distributions of both $B^+$ decay modes show, in the $m(K^0_{\rm S} K 蟺)<1.85$ GeV mass region, a rich spectrum of light-meson resonances, resolved using an amplitude analysis. A complex mixture of $J^{PC}=0^{-+}, 1^{++}$ and $1^{+-}$ resonances is observed, dominated by $畏(1405)$, $畏(1470)$, $畏(1760)$, $f_1(1285)$, $f_1(1420)$ and $h_1(1405)$ resonances. The $K^0_{\rm S} K 蟺$ Dalitz plots are dominated by asymmetric crossing $K^* \bar K$ bands which are different for the two $B^+$ decay modes. This is due to a different interference pattern between the $1^{++}$ and $1^{+-}$ amplitudes in the two channels. Branching fractions are measured for each resonant contribution. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.06483v1-abstract-full').style.display = 'none'; document.getElementById('2501.06483v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with any supplementary material and additional information, are available at https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2024-045.html (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-045,CERN-EP-2024-329 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.02384">arXiv:2501.02384</a> <span> [<a href="https://arxiv.org/pdf/2501.02384">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Atmospheric and Oceanic Physics">physics.ao-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Geophysics">physics.geo-ph</span> </div> </div> <p class="title is-5 mathjax"> Observations and Theoretical Calculations of 11-Year Cyclic Variations in Lower-Stratospheric Ozone Depletion and Cooling </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qing-Bin Lu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.02384v1-abstract-short" style="display: inline;"> Observations and quantitative understanding of spatio-temporary variations in lower-stratospheric ozone and temperature can provide fingerprints for the mechanisms of ozone depletion and play an important role in testing the impact of non-halogen greenhouse gases on the ozone layer in climate models. Here we report from ground-based ozonesonde and satellite-based measurements since the 1960s and 1… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.02384v1-abstract-full').style.display = 'inline'; document.getElementById('2501.02384v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.02384v1-abstract-full" style="display: none;"> Observations and quantitative understanding of spatio-temporary variations in lower-stratospheric ozone and temperature can provide fingerprints for the mechanisms of ozone depletion and play an important role in testing the impact of non-halogen greenhouse gases on the ozone layer in climate models. Here we report from ground-based ozonesonde and satellite-based measurements since the 1960s and 1979 respectively that both lower-stratospheric ozone and temperature display pronounced 11-year cyclic variations over Antarctica and mid-latitudes, while no apparent cyclic variations over the tropics. These observations were unexpected from the chemistry-climate models (CCMs) but predicted by the cosmic-ray-driven electron-induced-reaction (CRE) model of ozone depletion. Remarkably, no-parameter CRE theoretical calculations give the ozone loss vertical profile in perfect agreement with observations at the Antarctic Syowa station and excellently reproduce time-series variations of both lower-stratospheric ozone and temperature in all global regions. Furthermore, the large lower-stratospheric ozone depletion over the tropics in the 1980s and 1990s is also reproduced by CRE calculations. Moreover, CRE calculations exhibit complex phenomena in future trends of lower-stratospheric ozone and temperature, which are strongly affected by the future trends of cosmic-ray fluxes. The latter might even lead to almost no recovery of the ozone hole over Antarctica and no returning to the 1980 level over the tropics by 2100. The results also strikingly demonstrate that both lower-stratospheric ozone and temperature are controlled by cosmic rays and ozone-depleting substances only. This study greatly improves quantitative understanding of ozone depletion and climate in the global lower stratosphere and offers new predictions on future trends. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.02384v1-abstract-full').style.display = 'none'; document.getElementById('2501.02384v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">22 pages, 8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.01077">arXiv:2501.01077</a> <span> [<a href="https://arxiv.org/pdf/2501.01077">pdf</a>, <a href="https://arxiv.org/ps/2501.01077">ps</a>, <a href="https://arxiv.org/format/2501.01077">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Phenomenology">hep-ph</span> </div> </div> <p class="title is-5 mathjax"> A coupled-channel perspective analysis on bottom-strange molecular pentaquarks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Song%2C+Q">Qing-Fu Song</a>, <a href="/search/?searchtype=author&query=L%C3%BC%2C+Q">Qi-Fang L眉</a>, <a href="/search/?searchtype=author&query=Xiong%2C+X">Xiaonu Xiong</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.01077v1-abstract-short" style="display: inline;"> At present work, we systematically study various bottom-strange molecular pentaquarks to search for possible bound states and resonances by adopting one-boson-exchange model within complex scaling method. According to our calculations, we predict several bound and resonant states for bottom baryon $Y_{b}(螞_b,危_b) \bar K^{(*)}$ and $Y_{b} K^{(*)}$ systems. In particular, a bound state in the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.01077v1-abstract-full').style.display = 'inline'; document.getElementById('2501.01077v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.01077v1-abstract-full" style="display: none;"> At present work, we systematically study various bottom-strange molecular pentaquarks to search for possible bound states and resonances by adopting one-boson-exchange model within complex scaling method. According to our calculations, we predict several bound and resonant states for bottom baryon $Y_{b}(螞_b,危_b) \bar K^{(*)}$ and $Y_{b} K^{(*)}$ systems. In particular, a bound state in the $I(J^P)=1/2(1/2^-)$ $危_{b}\bar{K}/螞_{b}\bar{K}^*/危_{b}\bar{K}^*$ system may correspond to the particle $螢_{b}(6227)$. Meanwhile, the predicted bound state with $6303\sim6269~\rm{MeV}$ in the $I(J^P)=1/2(1/2^-)危_bK/螞_bK^*/危_bK^*$ system is flavor exotic and does not appear in the spectroscopy of conventional baryons, which provides a practical way to clarify the nature of particle $螢_b(6227)$. We highly hope that our proposals can offer helpful information for the future experimental searches. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.01077v1-abstract-full').style.display = 'none'; document.getElementById('2501.01077v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.00746">arXiv:2501.00746</a> <span> [<a href="https://arxiv.org/pdf/2501.00746">pdf</a>, <a href="https://arxiv.org/format/2501.00746">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Nuclear Experiment">nucl-ex</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Comprehensive Measurement of the Reactor Antineutrino Spectrum and Flux at Daya Bay </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=An%2C+F+P">F. P. An</a>, <a href="/search/?searchtype=author&query=Bai%2C+W+D">W. D. Bai</a>, <a href="/search/?searchtype=author&query=Balantekin%2C+A+B">A. B. Balantekin</a>, <a href="/search/?searchtype=author&query=Bishai%2C+M">M. Bishai</a>, <a href="/search/?searchtype=author&query=Blyth%2C+S">S. Blyth</a>, <a href="/search/?searchtype=author&query=Cao%2C+G+F">G. F. Cao</a>, <a href="/search/?searchtype=author&query=Cao%2C+J">J. Cao</a>, <a href="/search/?searchtype=author&query=Chang%2C+J+F">J. F. Chang</a>, <a href="/search/?searchtype=author&query=Chang%2C+Y">Y. Chang</a>, <a href="/search/?searchtype=author&query=Chen%2C+H+S">H. S. Chen</a>, <a href="/search/?searchtype=author&query=Chen%2C+H+Y">H. Y. Chen</a>, <a href="/search/?searchtype=author&query=Chen%2C+S+M">S. M. Chen</a>, <a href="/search/?searchtype=author&query=Chen%2C+Y">Y. Chen</a>, <a href="/search/?searchtype=author&query=Chen%2C+Y+X">Y. X. Chen</a>, <a href="/search/?searchtype=author&query=Chen%2C+Z+Y">Z. Y. Chen</a>, <a href="/search/?searchtype=author&query=Cheng%2C+J">J. Cheng</a>, <a href="/search/?searchtype=author&query=Cheng%2C+J">J. Cheng</a>, <a href="/search/?searchtype=author&query=Cheng%2C+Y+-">Y. -C. Cheng</a>, <a href="/search/?searchtype=author&query=Cheng%2C+Z+K">Z. K. Cheng</a>, <a href="/search/?searchtype=author&query=Cherwinka%2C+J+J">J. J. Cherwinka</a>, <a href="/search/?searchtype=author&query=Chu%2C+M+C">M. C. Chu</a>, <a href="/search/?searchtype=author&query=Cummings%2C+J+P">J. P. Cummings</a>, <a href="/search/?searchtype=author&query=Dalager%2C+O">O. Dalager</a>, <a href="/search/?searchtype=author&query=Deng%2C+F+S">F. S. Deng</a>, <a href="/search/?searchtype=author&query=Ding%2C+X+Y">X. Y. Ding</a> , et al. (177 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.00746v1-abstract-short" style="display: inline;"> This Letter reports the precise measurement of reactor antineutrino spectrum and flux based on the full data set of 4.7 million inverse-beta-decay (IBD) candidates collected at Daya Bay near detectors. Expressed in terms of the IBD yield per fission, the antineutrino spectra from all reactor fissile isotopes and the specific $\mathrm{^{235}U}$ and $\mathrm{^{239}Pu}$ isotopes are measured with 1.3… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.00746v1-abstract-full').style.display = 'inline'; document.getElementById('2501.00746v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.00746v1-abstract-full" style="display: none;"> This Letter reports the precise measurement of reactor antineutrino spectrum and flux based on the full data set of 4.7 million inverse-beta-decay (IBD) candidates collected at Daya Bay near detectors. Expressed in terms of the IBD yield per fission, the antineutrino spectra from all reactor fissile isotopes and the specific $\mathrm{^{235}U}$ and $\mathrm{^{239}Pu}$ isotopes are measured with 1.3$\%$, 3$\%$ and 8$\%$ uncertainties respectively near the 3 MeV spectrum peak in reconstructed energy, reaching the best precision in the world. The total antineutrino flux and isotopic $\mathrm{^{235}U}$ and $\mathrm{^{239}Pu}$ fluxes are precisely measured to be $5.84\pm0.07$, $6.16\pm0.12$ and $4.16\pm0.21$ in units of $10^{-43} \mathrm{cm^2/fission}$. These measurements are compared with the Huber-Mueller (HM) model, the reevaluated conversion model based on the Kurchatov Institute (KI) measurement and the latest Summation Model (SM2023). The Daya Bay flux shows good consistency with KI and SM2023 models, but disagrees with HM model. The Daya Bay spectrum, however, disagrees with all model predictions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.00746v1-abstract-full').style.display = 'none'; document.getElementById('2501.00746v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.19420">arXiv:2412.19420</a> <span> [<a href="https://arxiv.org/pdf/2412.19420">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Data Structures and Algorithms">cs.DS</span> </div> </div> <p class="title is-5 mathjax"> A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Li%2C+X">Xuan Li</a>, <a href="/search/?searchtype=author&query=Ruan%2C+T">Tingyi Ruan</a>, <a href="/search/?searchtype=author&query=Li%2C+Y">Yankaiqi Li</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanchao Lu</a>, <a href="/search/?searchtype=author&query=Sun%2C+X">Xiaoxuan Sun</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.19420v1-abstract-short" style="display: inline;"> This paper proposes a frequent itemset mining algorithm based on the Boolean matrix method, aiming to solve the storage and computational bottlenecks of traditional frequent pattern mining algorithms in high-dimensional and large-scale transaction databases. By representing the itemsets in the transaction database as Boolean matrices, the algorithm uses Boolean logic operations such as AND and OR… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.19420v1-abstract-full').style.display = 'inline'; document.getElementById('2412.19420v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.19420v1-abstract-full" style="display: none;"> This paper proposes a frequent itemset mining algorithm based on the Boolean matrix method, aiming to solve the storage and computational bottlenecks of traditional frequent pattern mining algorithms in high-dimensional and large-scale transaction databases. By representing the itemsets in the transaction database as Boolean matrices, the algorithm uses Boolean logic operations such as AND and OR to efficiently calculate the support of the itemsets, avoiding the generation and storage of a large number of candidates itemsets in traditional algorithms. The algorithm recursively mines frequent itemsets through matrix operations and can flexibly adapt to different data scales and support thresholds. In the experiment, the public Groceries dataset was selected, and the running efficiency test and frequent itemset mining effect test were designed to evaluate the algorithm's performance indicators such as running time, memory usage, and number of frequent itemsets under different transaction numbers and support thresholds. The experimental results show that the algorithm can efficiently mine a large number of frequent itemsets when the support threshold is low, and focus on strong association rules with high support when the threshold is high. In addition, the changing trends of running time and memory usage show that the Boolean matrix method can still maintain good running efficiency when the number of transactions increases significantly and has high scalability and robustness. Future research can improve memory optimization and matrix block operations, and combine distributed computing and deep learning models to further enhance the algorithm's applicability and real-time processing capabilities in ultra-large-scale data environments. The algorithm has broad application potential and development prospects in the fields of market analysis, recommendation systems, and network security. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.19420v1-abstract-full').style.display = 'none'; document.getElementById('2412.19420v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.18715">arXiv:2412.18715</a> <span> [<a href="https://arxiv.org/pdf/2412.18715">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> Optimization and Scalability of Collaborative Filtering Algorithms in Large Language Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Yang%2C+H">Haowei Yang</a>, <a href="/search/?searchtype=author&query=Yun%2C+L">Longfei Yun</a>, <a href="/search/?searchtype=author&query=Cao%2C+J">Jinghan Cao</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qingyi Lu</a>, <a href="/search/?searchtype=author&query=Tu%2C+Y">Yuming Tu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.18715v1-abstract-short" style="display: inline;"> With the rapid development of large language models (LLMs) and the growing demand for personalized content, recommendation systems have become critical in enhancing user experience and driving engagement. Collaborative filtering algorithms, being core to many recommendation systems, have garnered significant attention for their efficiency and interpretability. However, traditional collaborative fi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.18715v1-abstract-full').style.display = 'inline'; document.getElementById('2412.18715v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.18715v1-abstract-full" style="display: none;"> With the rapid development of large language models (LLMs) and the growing demand for personalized content, recommendation systems have become critical in enhancing user experience and driving engagement. Collaborative filtering algorithms, being core to many recommendation systems, have garnered significant attention for their efficiency and interpretability. However, traditional collaborative filtering approaches face numerous challenges when integrated into large-scale LLM-based systems, including high computational costs, severe data sparsity, cold start problems, and lack of scalability. This paper investigates the optimization and scalability of collaborative filtering algorithms in large language models, addressing these limitations through advanced optimization strategies. Firstly, we analyze the fundamental principles of collaborative filtering algorithms and their limitations when applied in LLM-based contexts. Next, several optimization techniques such as matrix factorization, approximate nearest neighbor search, and parallel computing are proposed to enhance computational efficiency and model accuracy. Additionally, strategies such as distributed architecture and model compression are explored to facilitate dynamic updates and scalability in data-intensive environments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.18715v1-abstract-full').style.display = 'none'; document.getElementById('2412.18715v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.18713">arXiv:2412.18713</a> <span> [<a href="https://arxiv.org/pdf/2412.18713">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> Enhanced Recommendation Combining Collaborative Filtering and Large Language Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lin%2C+X">Xueting Lin</a>, <a href="/search/?searchtype=author&query=Cheng%2C+Z">Zhan Cheng</a>, <a href="/search/?searchtype=author&query=Yun%2C+L">Longfei Yun</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qingyi Lu</a>, <a href="/search/?searchtype=author&query=Luo%2C+Y">Yuanshuai Luo</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.18713v1-abstract-short" style="display: inline;"> With the advent of the information explosion era, the importance of recommendation systems in various applications is increasingly significant. Traditional collaborative filtering algorithms are widely used due to their effectiveness in capturing user behavior patterns, but they encounter limitations when dealing with cold start problems and data sparsity. Large Language Models (LLMs), with their… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.18713v1-abstract-full').style.display = 'inline'; document.getElementById('2412.18713v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.18713v1-abstract-full" style="display: none;"> With the advent of the information explosion era, the importance of recommendation systems in various applications is increasingly significant. Traditional collaborative filtering algorithms are widely used due to their effectiveness in capturing user behavior patterns, but they encounter limitations when dealing with cold start problems and data sparsity. Large Language Models (LLMs), with their strong natural language understanding and generation capabilities, provide a new breakthrough for recommendation systems. This study proposes an enhanced recommendation method that combines collaborative filtering and LLMs, aiming to leverage collaborative filtering's advantage in modeling user preferences while enhancing the understanding of textual information about users and items through LLMs to improve recommendation accuracy and diversity. This paper first introduces the fundamental theories of collaborative filtering and LLMs, then designs a recommendation system architecture that integrates both, and validates the system's effectiveness through experiments. The results show that the hybrid model based on collaborative filtering and LLMs significantly improves precision, recall, and user satisfaction, demonstrating its potential in complex recommendation scenarios. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.18713v1-abstract-full').style.display = 'none'; document.getElementById('2412.18713v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.14535">arXiv:2412.14535</a> <span> [<a href="https://arxiv.org/pdf/2412.14535">pdf</a>, <a href="https://arxiv.org/format/2412.14535">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Huang%2C+X">Xiaofei Huang</a>, <a href="/search/?searchtype=author&query=Chen%2C+W">Wenting Chen</a>, <a href="/search/?searchtype=author&query=Liu%2C+J">Jie Liu</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qisheng Lu</a>, <a href="/search/?searchtype=author&query=Luo%2C+X">Xiaoling Luo</a>, <a href="/search/?searchtype=author&query=Shen%2C+L">Linlin Shen</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.14535v2-abstract-short" style="display: inline;"> Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relati… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.14535v2-abstract-full').style.display = 'inline'; document.getElementById('2412.14535v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.14535v2-abstract-full" style="display: none;"> Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.14535v2-abstract-full').style.display = 'none'; document.getElementById('2412.14535v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> AAAI 2025 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.14074">arXiv:2412.14074</a> <span> [<a href="https://arxiv.org/pdf/2412.14074">pdf</a>, <a href="https://arxiv.org/format/2412.14074">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Measurement of $CP$ asymmetry in $B_s^0 \to D_s^{\mp} K^{\pm}$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1116 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.14074v2-abstract-short" style="display: inline;"> A measurement of the $CP$-violating parameters in $B_s^0 \to D_s^{\mp} K^{\pm}$ decays is reported, based on the analysis of proton-proton collision data collected by the LHCb experiment corresponding to an integrated luminosity of $6\,\mathrm{fb}^{-1}$ at a centre-of-mass energy of $13 \,\mathrm{TeV}$. The measured parameters are $C_f = 0.791 \pm 0.061 \pm 0.022$,… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.14074v2-abstract-full').style.display = 'inline'; document.getElementById('2412.14074v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.14074v2-abstract-full" style="display: none;"> A measurement of the $CP$-violating parameters in $B_s^0 \to D_s^{\mp} K^{\pm}$ decays is reported, based on the analysis of proton-proton collision data collected by the LHCb experiment corresponding to an integrated luminosity of $6\,\mathrm{fb}^{-1}$ at a centre-of-mass energy of $13 \,\mathrm{TeV}$. The measured parameters are $C_f = 0.791 \pm 0.061 \pm 0.022$, $A_f^{螖螕} = -0.051 \pm 0.134 \pm 0.058$, $A_{\overline{f}}^{螖螕} = -0.303 \pm 0.125 \pm 0.055$, $S_f = -0.571 \pm 0.084 \pm 0.023$ and $S_{\overline{f}} = -0.503 \pm 0.084 \pm 0.025$, where the first uncertainty is statistical and the second systematic. Together with the value of the Bs mixing phase $-2尾_s$, these parameters are used to obtain a measurement of the CKM angle $纬$ equal to $ (74\pm12)^\circ$ modulo $180^{\circ}$, where the uncertainty contains both statistical and systematic contributions. This result is combined with the previous LHCb measurement in this channel using $3\,\mathrm{fb}^{-1}$ resulting in a determination of $纬= (81^{+12}_{-11})^\circ$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.14074v2-abstract-full').style.display = 'none'; document.getElementById('2412.14074v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 18 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3575/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-020, CERN-EP-2024-219 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.13958">arXiv:2412.13958</a> <span> [<a href="https://arxiv.org/pdf/2412.13958">pdf</a>, <a href="https://arxiv.org/format/2412.13958">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Measurement of $CP$ asymmetries in $螞_b^0\to ph^{-}$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1125 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.13958v1-abstract-short" style="display: inline;"> A search for $CP$ violation in $螞_b^0\rightarrow pK^-$ and $螞_b^0\rightarrow p蟺^-$ decays is presented using the full Run 1 and Run 2 data samples of $pp$ collisions collected with the LHCb detector, corresponding to an integrated luminosity of 9 $\mathrm{fb}^{-1}$ at center-of-mass energies of 7, 8, and 13 TeV. For the Run 2 data sample, the $CP$-violating asymmetries are measured to be… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.13958v1-abstract-full').style.display = 'inline'; document.getElementById('2412.13958v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.13958v1-abstract-full" style="display: none;"> A search for $CP$ violation in $螞_b^0\rightarrow pK^-$ and $螞_b^0\rightarrow p蟺^-$ decays is presented using the full Run 1 and Run 2 data samples of $pp$ collisions collected with the LHCb detector, corresponding to an integrated luminosity of 9 $\mathrm{fb}^{-1}$ at center-of-mass energies of 7, 8, and 13 TeV. For the Run 2 data sample, the $CP$-violating asymmetries are measured to be $A_{CP}^{pK^-} = (-1.4 \pm 0.7 \pm 0.4)\%$ and $A_{CP}^{p蟺^-} = (0.4 \pm 0.9 \pm 0.4)\%$, where the first uncertainty is statistical and the second is systematic. Following significant improvements in the evaluation of systematic uncertainties compared to the previous LHCb measurement, the Run 1 dataset is reanalyzed to update the corresponding results. When combining the Run 2 and updated Run 1 measurements, the final results are found to be $A_{CP}^{pK^-} = (-1.1 \pm 0.7 \pm 0.4)\%$ and $A_{CP}^{p蟺^-} = (0.2 \pm 0.8 \pm 0.4)\%$, constituting the most precise measurements of these asymmetries to date. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.13958v1-abstract-full').style.display = 'none'; document.getElementById('2412.13958v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3533/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-048, CERN-EP-2024-330 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.13420">arXiv:2412.13420</a> <span> [<a href="https://arxiv.org/pdf/2412.13420">pdf</a>, <a href="https://arxiv.org/format/2412.13420">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Social and Information Networks">cs.SI</span> </div> </div> <p class="title is-5 mathjax"> BotSim: LLM-Powered Malicious Social Botnet Simulation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Qiao%2C+B">Boyu Qiao</a>, <a href="/search/?searchtype=author&query=Li%2C+K">Kun Li</a>, <a href="/search/?searchtype=author&query=Zhou%2C+W">Wei Zhou</a>, <a href="/search/?searchtype=author&query=Li%2C+S">Shilong Li</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qianqian Lu</a>, <a href="/search/?searchtype=author&query=Hu%2C+S">Songlin Hu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.13420v1-abstract-short" style="display: inline;"> Social media platforms like X(Twitter) and Reddit are vital to global communication. However, advancements in Large Language Model (LLM) technology give rise to social media bots with unprecedented intelligence. These bots adeptly simulate human profiles, conversations, and interactions, disseminating large amounts of false information and posing significant challenges to platform regulation. To b… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.13420v1-abstract-full').style.display = 'inline'; document.getElementById('2412.13420v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.13420v1-abstract-full" style="display: none;"> Social media platforms like X(Twitter) and Reddit are vital to global communication. However, advancements in Large Language Model (LLM) technology give rise to social media bots with unprecedented intelligence. These bots adeptly simulate human profiles, conversations, and interactions, disseminating large amounts of false information and posing significant challenges to platform regulation. To better understand and counter these threats, we innovatively design BotSim, a malicious social botnet simulation powered by LLM. BotSim mimics the information dissemination patterns of real-world social networks, creating a virtual environment composed of intelligent agent bots and real human users. In the temporal simulation constructed by BotSim, these advanced agent bots autonomously engage in social interactions such as posting and commenting, effectively modeling scenarios of information flow and user interaction. Building on the BotSim framework, we construct a highly human-like, LLM-driven bot dataset called BotSim-24 and benchmark multiple bot detection strategies against it. The experimental results indicate that detection methods effective on traditional bot datasets perform worse on BotSim-24, highlighting the urgent need for new detection strategies to address the cybersecurity threats posed by these advanced bots. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.13420v1-abstract-full').style.display = 'none'; document.getElementById('2412.13420v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.12579">arXiv:2412.12579</a> <span> [<a href="https://arxiv.org/pdf/2412.12579">pdf</a>, <a href="https://arxiv.org/format/2412.12579">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Programming Languages">cs.PL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Operating Systems">cs.OS</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Scaling Inter-procedural Dataflow Analysis on the Cloud </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Sun%2C+Z">Zewen Sun</a>, <a href="/search/?searchtype=author&query=Zhang%2C+Y">Yujin Zhang</a>, <a href="/search/?searchtype=author&query=Xu%2C+D">Duanchen Xu</a>, <a href="/search/?searchtype=author&query=Zhang%2C+Y">Yiyu Zhang</a>, <a href="/search/?searchtype=author&query=Qi%2C+Y">Yun Qi</a>, <a href="/search/?searchtype=author&query=Wang%2C+Y">Yueyang Wang</a>, <a href="/search/?searchtype=author&query=Li%2C+Y">Yi Li</a>, <a href="/search/?searchtype=author&query=Wang%2C+Z">Zhaokang Wang</a>, <a href="/search/?searchtype=author&query=Li%2C+Y">Yue Li</a>, <a href="/search/?searchtype=author&query=Li%2C+X">Xuandong Li</a>, <a href="/search/?searchtype=author&query=Zuo%2C+Z">Zhiqiang Zuo</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qingda Lu</a>, <a href="/search/?searchtype=author&query=Peng%2C+W">Wenwen Peng</a>, <a href="/search/?searchtype=author&query=Guo%2C+S">Shengjian Guo</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.12579v1-abstract-short" style="display: inline;"> Apart from forming the backbone of compiler optimization, static dataflow analysis has been widely applied in a vast variety of applications, such as bug detection, privacy analysis, program comprehension, etc. Despite its importance, performing interprocedural dataflow analysis on large-scale programs is well known to be challenging. In this paper, we propose a novel distributed analysis framewor… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.12579v1-abstract-full').style.display = 'inline'; document.getElementById('2412.12579v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.12579v1-abstract-full" style="display: none;"> Apart from forming the backbone of compiler optimization, static dataflow analysis has been widely applied in a vast variety of applications, such as bug detection, privacy analysis, program comprehension, etc. Despite its importance, performing interprocedural dataflow analysis on large-scale programs is well known to be challenging. In this paper, we propose a novel distributed analysis framework supporting the general interprocedural dataflow analysis. Inspired by large-scale graph processing, we devise dedicated distributed worklist algorithms for both whole-program analysis and incremental analysis. We implement these algorithms and develop a distributed framework called BigDataflow running on a large-scale cluster. The experimental results validate the promising performance of BigDataflow -- BigDataflow can finish analyzing the program of millions lines of code in minutes. Compared with the state-of-the-art, BigDataflow achieves much more analysis efficiency. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.12579v1-abstract-full').style.display = 'none'; document.getElementById('2412.12579v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.11645">arXiv:2412.11645</a> <span> [<a href="https://arxiv.org/pdf/2412.11645">pdf</a>, <a href="https://arxiv.org/format/2412.11645">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Test of lepton flavour universality with $B^+ \to K^+蟺^+蟺^-\ell^+\ell^-$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.11645v1-abstract-short" style="display: inline;"> The first test of lepton flavour universality between muons and electrons using $B^+ \to K^+蟺^+蟺^-\ell^+\ell^-$ ($\ell=e,渭$) decays is presented. The measurement is performed with data from proton-proton collisions collected by the LHCb experiment at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of $9\mathrm{fb}^{-1}$. The ratio of branching fractions betwee… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.11645v1-abstract-full').style.display = 'inline'; document.getElementById('2412.11645v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.11645v1-abstract-full" style="display: none;"> The first test of lepton flavour universality between muons and electrons using $B^+ \to K^+蟺^+蟺^-\ell^+\ell^-$ ($\ell=e,渭$) decays is presented. The measurement is performed with data from proton-proton collisions collected by the LHCb experiment at centre-of-mass energies of 7, 8 and 13 TeV, corresponding to an integrated luminosity of $9\mathrm{fb}^{-1}$. The ratio of branching fractions between $B^+ \to K^+蟺^+蟺^-e^+e^-$ and $B^+ \to K^+蟺^+蟺^-渭^+渭^-$decays is measured in the dilepton invariant-mass-squared range $1.1 < q^2 < 7.0~\mathrm{GeV}^2/c^4$ and is found to be $R_{K蟺蟺}^{-1} = 1.31^{+0.18}_{-0.17} \;(\mathrm{stat})\;^{+0.12}_{-0.09} \;(\mathrm{syst})$, in agreement with the Standard Model prediction. The first observation of the $B^+ \to K^+蟺^+蟺^-e^+e^-$ decay is also reported. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.11645v1-abstract-full').style.display = 'none'; document.getElementById('2412.11645v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1606/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-046, CERN-EP-2024-312 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.11496">arXiv:2412.11496</a> <span> [<a href="https://arxiv.org/pdf/2412.11496">pdf</a>, <a href="https://arxiv.org/format/2412.11496">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinyi Lu</a>, <a href="/search/?searchtype=author&query=Cheng%2C+J">Jiale Cheng</a>, <a href="/search/?searchtype=author&query=Kang%2C+W">Wei Kang</a>, <a href="/search/?searchtype=author&query=Liu%2C+N">Nan Liu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.11496v1-abstract-short" style="display: inline;"> The growing privacy concerns in distributed learning have led to the widespread adoption of secure aggregation techniques in distributed machine learning systems, such as federated learning. Motivated by a coded gradient aggregation problem in a user-helper-master hierarchical network setting with straggling communication links, we formulate a new secure hierarchical coded gradient aggregation pro… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.11496v1-abstract-full').style.display = 'inline'; document.getElementById('2412.11496v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.11496v1-abstract-full" style="display: none;"> The growing privacy concerns in distributed learning have led to the widespread adoption of secure aggregation techniques in distributed machine learning systems, such as federated learning. Motivated by a coded gradient aggregation problem in a user-helper-master hierarchical network setting with straggling communication links, we formulate a new secure hierarchical coded gradient aggregation problem. In our setting, $ K $ users communicate with the master through an intermediate layer of $ N $ helpers, who can communicate with each other. With a resiliency threshold of $ N_r $ for straggling communication links, and at most $ T $ colluding helpers and any number of colluding users, the master aims to recover the sum of all users' gradients while remaining unaware of any individual gradient that exceeds the expected sum. In addition, helpers cannot infer more about users' gradients than what is already known by the colluding users. We propose an achievable scheme where users' upload messages are based on a globally known Vandermonde matrix, and helper communication is facilitated using an extended Vandermonde matrix with special structural properties. A matching converse bound is also derived, establishing the optimal result for this hierarchical coded gradient aggregation problem. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.11496v1-abstract-full').style.display = 'none'; document.getElementById('2412.11496v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.09414">arXiv:2412.09414</a> <span> [<a href="https://arxiv.org/pdf/2412.09414">pdf</a>, <a href="https://arxiv.org/format/2412.09414">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Search for $D^0$ meson decays to $蟺^+ 蟺^- e^+ e^-$ and $K^+ K^- e^+ e^-$ final states </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1125 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.09414v2-abstract-short" style="display: inline;"> A search for $D^0$ meson decays to the $蟺^+蟺^-e^+e^-$ and $K^+K^-e^+e^-$ final states is reported using a sample of proton-proton collisions collected by the LHCb experiment at a center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of 6 fb$^{-1}$. The decay $D^0 \rightarrow 蟺^+蟺^-e^+e^-$ is observed for the first time when requiring that the two electrons are consistent with… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.09414v2-abstract-full').style.display = 'inline'; document.getElementById('2412.09414v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.09414v2-abstract-full" style="display: none;"> A search for $D^0$ meson decays to the $蟺^+蟺^-e^+e^-$ and $K^+K^-e^+e^-$ final states is reported using a sample of proton-proton collisions collected by the LHCb experiment at a center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of 6 fb$^{-1}$. The decay $D^0 \rightarrow 蟺^+蟺^-e^+e^-$ is observed for the first time when requiring that the two electrons are consistent with coming from the decay of a $蠁$ or $蟻^0/蠅$ meson. The corresponding branching fractions are measured relative to the $D^0 \rightarrow K^-蟺^-[e^+e^-]_{蟻^0/蠅}$ decay, where the two electrons are consistent with coming from the decay of a $蟻^0$ or $蠅$ meson. No evidence is found for the $D^0 \rightarrow K^+K^-e^+e^-$ decay and world-best limits are set on its branching fraction. The results are compared to, and found to be consistent with, the branching fractions of the $D^0 \rightarrow 蟺^+蟺^-渭^+渭^-$ and $D^0 \rightarrow K^+K^-渭^+渭^-$ decays recently measured by LHCb and confirm lepton universality at the current precision. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.09414v2-abstract-full').style.display = 'none'; document.getElementById('2412.09414v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1611/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-047, CERN-EP-2024-307 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.08581">arXiv:2412.08581</a> <span> [<a href="https://arxiv.org/pdf/2412.08581">pdf</a>, <a href="https://arxiv.org/format/2412.08581">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Automated Soap Opera Testing Directed by LLMs and Scenario Knowledge: Feasibility, Challenges, and Road Ahead </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Su%2C+Y">Yanqi Su</a>, <a href="/search/?searchtype=author&query=Xing%2C+Z">Zhenchang Xing</a>, <a href="/search/?searchtype=author&query=Wang%2C+C">Chong Wang</a>, <a href="/search/?searchtype=author&query=Chen%2C+C">Chunyang Chen</a>, <a href="/search/?searchtype=author&query=Xu%2C+X">Xiwei Xu</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+L">Liming Zhu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.08581v1-abstract-short" style="display: inline;"> Exploratory testing (ET) harnesses tester's knowledge, creativity, and experience to create varying tests that uncover unexpected bugs from the end-user's perspective. Although ET has proven effective in system-level testing of interactive systems, the need for manual execution has hindered large-scale adoption. In this work, we explore the feasibility, challenges and road ahead of automated scena… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.08581v1-abstract-full').style.display = 'inline'; document.getElementById('2412.08581v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.08581v1-abstract-full" style="display: none;"> Exploratory testing (ET) harnesses tester's knowledge, creativity, and experience to create varying tests that uncover unexpected bugs from the end-user's perspective. Although ET has proven effective in system-level testing of interactive systems, the need for manual execution has hindered large-scale adoption. In this work, we explore the feasibility, challenges and road ahead of automated scenario-based ET (a.k.a soap opera testing). We conduct a formative study, identifying key insights for effective manual soap opera testing and challenges in automating the process. We then develop a multi-agent system leveraging LLMs and a Scenario Knowledge Graph (SKG) to automate soap opera testing. The system consists of three multi-modal agents, Planner, Player, and Detector that collaborate to execute tests and identify potential bugs. Experimental results demonstrate the potential of automated soap opera testing, but there remains a significant gap compared to manual execution, especially under-explored scenario boundaries and incorrectly identified bugs. Based on the observation, we envision road ahead for the future of automated soap opera testing, focusing on three key aspects: the synergy of neural and symbolic approaches, human-AI co-learning, and the integration of soap opera testing with broader software engineering practices. These insights aim to guide and inspire the future research. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.08581v1-abstract-full').style.display = 'none'; document.getElementById('2412.08581v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">20 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.08483">arXiv:2412.08483</a> <span> [<a href="https://arxiv.org/pdf/2412.08483">pdf</a>, <a href="https://arxiv.org/ps/2412.08483">ps</a>, <a href="https://arxiv.org/format/2412.08483">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Analysis of PDEs">math.AP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Optimization and Control">math.OC</span> </div> </div> <p class="title is-5 mathjax"> On Inverse Problems for Mean Field Games with Common Noise via Carleman Estimate </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=L%C3%BC%2C+Q">Qi L眉</a>, <a href="/search/?searchtype=author&query=Liao%2C+Z">Zhonghua Liao</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.08483v1-abstract-short" style="display: inline;"> In this paper, we study two kinds of inverse problems for Mean Field Games (MFGs) with common noise. Our focus is on MFGs described by a coupled system of stochastic Hamilton-Jacobi-Bellman and Fokker-Planck equations. Firstly, we establish the Lipschitz and H枚lder stability for determining the solutions of a coupled system of stochastic Hamilton-Jacobi-Bellman and Fokker-Planck equations based on… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.08483v1-abstract-full').style.display = 'inline'; document.getElementById('2412.08483v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.08483v1-abstract-full" style="display: none;"> In this paper, we study two kinds of inverse problems for Mean Field Games (MFGs) with common noise. Our focus is on MFGs described by a coupled system of stochastic Hamilton-Jacobi-Bellman and Fokker-Planck equations. Firstly, we establish the Lipschitz and H枚lder stability for determining the solutions of a coupled system of stochastic Hamilton-Jacobi-Bellman and Fokker-Planck equations based on terminal observation of the density function. Secondly, we derive a uniqueness theorem for an inverse source problem related to the system under consideration. The main tools to establish those results are two new Carleman estimates. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.08483v1-abstract-full').style.display = 'none'; document.getElementById('2412.08483v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.03603">arXiv:2412.03603</a> <span> [<a href="https://arxiv.org/pdf/2412.03603">pdf</a>, <a href="https://arxiv.org/format/2412.03603">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> HunyuanVideo: A Systematic Framework For Large Video Generative Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Kong%2C+W">Weijie Kong</a>, <a href="/search/?searchtype=author&query=Tian%2C+Q">Qi Tian</a>, <a href="/search/?searchtype=author&query=Zhang%2C+Z">Zijian Zhang</a>, <a href="/search/?searchtype=author&query=Min%2C+R">Rox Min</a>, <a href="/search/?searchtype=author&query=Dai%2C+Z">Zuozhuo Dai</a>, <a href="/search/?searchtype=author&query=Zhou%2C+J">Jin Zhou</a>, <a href="/search/?searchtype=author&query=Xiong%2C+J">Jiangfeng Xiong</a>, <a href="/search/?searchtype=author&query=Li%2C+X">Xin Li</a>, <a href="/search/?searchtype=author&query=Wu%2C+B">Bo Wu</a>, <a href="/search/?searchtype=author&query=Zhang%2C+J">Jianwei Zhang</a>, <a href="/search/?searchtype=author&query=Wu%2C+K">Kathrina Wu</a>, <a href="/search/?searchtype=author&query=Lin%2C+Q">Qin Lin</a>, <a href="/search/?searchtype=author&query=Yuan%2C+J">Junkun Yuan</a>, <a href="/search/?searchtype=author&query=Long%2C+Y">Yanxin Long</a>, <a href="/search/?searchtype=author&query=Wang%2C+A">Aladdin Wang</a>, <a href="/search/?searchtype=author&query=Wang%2C+A">Andong Wang</a>, <a href="/search/?searchtype=author&query=Li%2C+C">Changlin Li</a>, <a href="/search/?searchtype=author&query=Huang%2C+D">Duojun Huang</a>, <a href="/search/?searchtype=author&query=Yang%2C+F">Fang Yang</a>, <a href="/search/?searchtype=author&query=Tan%2C+H">Hao Tan</a>, <a href="/search/?searchtype=author&query=Wang%2C+H">Hongmei Wang</a>, <a href="/search/?searchtype=author&query=Song%2C+J">Jacob Song</a>, <a href="/search/?searchtype=author&query=Bai%2C+J">Jiawang Bai</a>, <a href="/search/?searchtype=author&query=Wu%2C+J">Jianbing Wu</a>, <a href="/search/?searchtype=author&query=Xue%2C+J">Jinbao Xue</a> , et al. (27 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.03603v6-abstract-short" style="display: inline;"> Recent advancements in video generation have significantly impacted daily life for both individuals and industries. However, the leading video generation models remain closed-source, resulting in a notable performance gap between industry capabilities and those available to the public. In this report, we introduce HunyuanVideo, an innovative open-source video foundation model that demonstrates per… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.03603v6-abstract-full').style.display = 'inline'; document.getElementById('2412.03603v6-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.03603v6-abstract-full" style="display: none;"> Recent advancements in video generation have significantly impacted daily life for both individuals and industries. However, the leading video generation models remain closed-source, resulting in a notable performance gap between industry capabilities and those available to the public. In this report, we introduce HunyuanVideo, an innovative open-source video foundation model that demonstrates performance in video generation comparable to, or even surpassing, that of leading closed-source models. HunyuanVideo encompasses a comprehensive framework that integrates several key elements, including data curation, advanced architectural design, progressive model scaling and training, and an efficient infrastructure tailored for large-scale model training and inference. As a result, we successfully trained a video generative model with over 13 billion parameters, making it the largest among all open-source models. We conducted extensive experiments and implemented a series of targeted designs to ensure high visual quality, motion dynamics, text-video alignment, and advanced filming techniques. According to evaluations by professionals, HunyuanVideo outperforms previous state-of-the-art models, including Runway Gen-3, Luma 1.6, and three top-performing Chinese video generative models. By releasing the code for the foundation model and its applications, we aim to bridge the gap between closed-source and open-source communities. This initiative will empower individuals within the community to experiment with their ideas, fostering a more dynamic and vibrant video generation ecosystem. The code is publicly available at https://github.com/Tencent/HunyuanVideo. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.03603v6-abstract-full').style.display = 'none'; document.getElementById('2412.03603v6-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.00243">arXiv:2412.00243</a> <span> [<a href="https://arxiv.org/pdf/2412.00243">pdf</a>, <a href="https://arxiv.org/ps/2412.00243">ps</a>, <a href="https://arxiv.org/format/2412.00243">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Robotics">cs.RO</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Realistic Corner Case Generation for Autonomous Vehicles with Multimodal Large Language Model </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qiujing Lu</a>, <a href="/search/?searchtype=author&query=Ma%2C+M">Meng Ma</a>, <a href="/search/?searchtype=author&query=Dai%2C+X">Ximiao Dai</a>, <a href="/search/?searchtype=author&query=Wang%2C+X">Xuanhan Wang</a>, <a href="/search/?searchtype=author&query=Feng%2C+S">Shuo Feng</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.00243v1-abstract-short" style="display: inline;"> To guarantee the safety and reliability of autonomous vehicle (AV) systems, corner cases play a crucial role in exploring the system's behavior under rare and challenging conditions within simulation environments. However, current approaches often fall short in meeting diverse testing needs and struggle to generalize to novel, high-risk scenarios that closely mirror real-world conditions. To tackl… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.00243v1-abstract-full').style.display = 'inline'; document.getElementById('2412.00243v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.00243v1-abstract-full" style="display: none;"> To guarantee the safety and reliability of autonomous vehicle (AV) systems, corner cases play a crucial role in exploring the system's behavior under rare and challenging conditions within simulation environments. However, current approaches often fall short in meeting diverse testing needs and struggle to generalize to novel, high-risk scenarios that closely mirror real-world conditions. To tackle this challenge, we present AutoScenario, a multimodal Large Language Model (LLM)-based framework for realistic corner case generation. It converts safety-critical real-world data from multiple sources into textual representations, enabling the generalization of key risk factors while leveraging the extensive world knowledge and advanced reasoning capabilities of LLMs.Furthermore, it integrates tools from the Simulation of Urban Mobility (SUMO) and CARLA simulators to simplify and execute the code generated by LLMs. Our experiments demonstrate that AutoScenario can generate realistic and challenging test scenarios, precisely tailored to specific testing requirements or textual descriptions. Additionally, we validated its ability to produce diverse and novel scenarios derived from multimodal real-world data involving risky situations, harnessing the powerful generalization capabilities of LLMs to effectively simulate a wide range of corner cases. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.00243v1-abstract-full').style.display = 'none'; document.getElementById('2412.00243v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.19781">arXiv:2411.19781</a> <span> [<a href="https://arxiv.org/pdf/2411.19781">pdf</a>, <a href="https://arxiv.org/format/2411.19781">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Observation of the open-charm tetraquark state $T_{cs 0}^{*}(2870)^0$ in the $B^- \rightarrow D^- D^0 K_\mathrm{S}^0$ decay </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1128 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.19781v2-abstract-short" style="display: inline;"> An amplitude analysis of $B^-\rightarrow D^- D^0 K_\mathrm{S}^0$ decays is performed using proton-proton collision data, corresponding to an integrated luminosity of $9\,\text{fb}^{-1}$, collected with the LHCb detector at center-of-mass energies of 7, 8, and 13$\mathrm{\,Te\kern -0.1em V}$. A resonant structure of spin-parity $0^+$ is observed in the $D^0 K_\mathrm{S}^0$ invariant-mass spectrum w… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.19781v2-abstract-full').style.display = 'inline'; document.getElementById('2411.19781v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.19781v2-abstract-full" style="display: none;"> An amplitude analysis of $B^-\rightarrow D^- D^0 K_\mathrm{S}^0$ decays is performed using proton-proton collision data, corresponding to an integrated luminosity of $9\,\text{fb}^{-1}$, collected with the LHCb detector at center-of-mass energies of 7, 8, and 13$\mathrm{\,Te\kern -0.1em V}$. A resonant structure of spin-parity $0^+$ is observed in the $D^0 K_\mathrm{S}^0$ invariant-mass spectrum with a significance of $5.3\,蟽$. The mass and width of the state, modeled with a Breit$-$Wigner lineshape, are determined to be $2883\pm11\pm8\mathrm{\,Me\kern -0.1em V\!/}c^2$ and $87_{-47}^{+22}\pm17\mathrm{\,Me\kern -0.1em V}$ respectively, where the first uncertainties are statistical and the second systematic. These properties and the quark content are consistent with those of the open-charm tetraquark state $T_{cs 0}^{*}(2870)^0$ observed previously in the $D^+ K^-$ final state of the $B^-\rightarrow D^- D^+ K^-$ decay. This result confirms the existence of the $T_{cs 0}^{*}(2870)^0$ state in a new decay mode. The $T_{cs1}^{*}(2900)^0$ state, reported in the $B^-\rightarrow D^- D^+ K^-$ decay, is also searched for in the $D^0 K_\mathrm{S}^0$ invariant-mass spectrum of the $B^- \rightarrow D^- D^0 K_\mathrm{S}^0$ decay, without finding evidence for it. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.19781v2-abstract-full').style.display = 'none'; document.getElementById('2411.19781v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 29 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with machine-readable versions and any supplementary material and information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3162/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-040, CERN-EP-2024-287 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.18084">arXiv:2411.18084</a> <span> [<a href="https://arxiv.org/pdf/2411.18084">pdf</a>, <a href="https://arxiv.org/format/2411.18084">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> </div> </div> <p class="title is-5 mathjax"> From Exploration to Revelation: Detecting Dark Patterns in Mobile Apps </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Chen%2C+J">Jieshan Chen</a>, <a href="/search/?searchtype=author&query=Wang%2C+Z">Zhen Wang</a>, <a href="/search/?searchtype=author&query=Sun%2C+J">Jiamou Sun</a>, <a href="/search/?searchtype=author&query=Zou%2C+W">Wenbo Zou</a>, <a href="/search/?searchtype=author&query=Xing%2C+Z">Zhenchang Xing</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Huang%2C+Q">Qing Huang</a>, <a href="/search/?searchtype=author&query=Xu%2C+X">Xiwei Xu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.18084v1-abstract-short" style="display: inline;"> Mobile apps are essential in daily life, yet they often employ dark patterns, such as visual tricks to highlight certain options or linguistic tactics to nag users into making purchases, to manipulate user behavior. Current research mainly uses manual methods to detect dark patterns, a process that is time-consuming and struggles to keep pace with continually updating and emerging apps. While some… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.18084v1-abstract-full').style.display = 'inline'; document.getElementById('2411.18084v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.18084v1-abstract-full" style="display: none;"> Mobile apps are essential in daily life, yet they often employ dark patterns, such as visual tricks to highlight certain options or linguistic tactics to nag users into making purchases, to manipulate user behavior. Current research mainly uses manual methods to detect dark patterns, a process that is time-consuming and struggles to keep pace with continually updating and emerging apps. While some studies targeted at automated detection, they are constrained to static patterns and still necessitate manual app exploration. To bridge these gaps, we present AppRay, an innovative system that seamlessly blends task-oriented app exploration with automated dark pattern detection, reducing manual efforts. Our approach consists of two steps: First, we harness the commonsense knowledge of large language models for targeted app exploration, supplemented by traditional random exploration to capture a broader range of UI states. Second, we developed a static and dynamic dark pattern detector powered by a contrastive learning-based multi-label classifier and a rule-based refiner to perform detection. We contributed two datasets, AppRay-Dark and AppRay-Light, with 2,185 unique deceptive patterns (including 149 dynamic instances) across 18 types from 876 UIs and 871 benign UIs. These datasets cover both static and dynamic dark patterns while preserving UI relationships. Experimental results confirm that AppRay can efficiently explore the app and identify a wide range of dark patterns with great performance. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.18084v1-abstract-full').style.display = 'none'; document.getElementById('2411.18084v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12 pages, 4 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> D.2; I.2; H.5 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.16331">arXiv:2411.16331</a> <span> [<a href="https://arxiv.org/pdf/2411.16331">pdf</a>, <a href="https://arxiv.org/format/2411.16331">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Graphics">cs.GR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Sound">cs.SD</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Audio and Speech Processing">eess.AS</span> </div> </div> <p class="title is-5 mathjax"> Sonic: Shifting Focus to Global Audio Perception in Portrait Animation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Ji%2C+X">Xiaozhong Ji</a>, <a href="/search/?searchtype=author&query=Hu%2C+X">Xiaobin Hu</a>, <a href="/search/?searchtype=author&query=Xu%2C+Z">Zhihong Xu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+J">Junwei Zhu</a>, <a href="/search/?searchtype=author&query=Lin%2C+C">Chuming Lin</a>, <a href="/search/?searchtype=author&query=He%2C+Q">Qingdong He</a>, <a href="/search/?searchtype=author&query=Zhang%2C+J">Jiangning Zhang</a>, <a href="/search/?searchtype=author&query=Luo%2C+D">Donghao Luo</a>, <a href="/search/?searchtype=author&query=Chen%2C+Y">Yi Chen</a>, <a href="/search/?searchtype=author&query=Lin%2C+Q">Qin Lin</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinglin Lu</a>, <a href="/search/?searchtype=author&query=Wang%2C+C">Chengjie Wang</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.16331v1-abstract-short" style="display: inline;"> The study of talking face generation mainly explores the intricacies of synchronizing facial movements and crafting visually appealing, temporally-coherent animations. However, due to the limited exploration of global audio perception, current approaches predominantly employ auxiliary visual and spatial knowledge to stabilize the movements, which often results in the deterioration of the naturalne… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.16331v1-abstract-full').style.display = 'inline'; document.getElementById('2411.16331v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.16331v1-abstract-full" style="display: none;"> The study of talking face generation mainly explores the intricacies of synchronizing facial movements and crafting visually appealing, temporally-coherent animations. However, due to the limited exploration of global audio perception, current approaches predominantly employ auxiliary visual and spatial knowledge to stabilize the movements, which often results in the deterioration of the naturalness and temporal inconsistencies.Considering the essence of audio-driven animation, the audio signal serves as the ideal and unique priors to adjust facial expressions and lip movements, without resorting to interference of any visual signals. Based on this motivation, we propose a novel paradigm, dubbed as Sonic, to {s}hift f{o}cus on the exploration of global audio per{c}ept{i}o{n}.To effectively leverage global audio knowledge, we disentangle it into intra- and inter-clip audio perception and collaborate with both aspects to enhance overall perception.For the intra-clip audio perception, 1). \textbf{Context-enhanced audio learning}, in which long-range intra-clip temporal audio knowledge is extracted to provide facial expression and lip motion priors implicitly expressed as the tone and speed of speech. 2). \textbf{Motion-decoupled controller}, in which the motion of the head and expression movement are disentangled and independently controlled by intra-audio clips. Most importantly, for inter-clip audio perception, as a bridge to connect the intra-clips to achieve the global perception, \textbf{Time-aware position shift fusion}, in which the global inter-clip audio information is considered and fused for long-audio inference via through consecutively time-aware shifted windows. Extensive experiments demonstrate that the novel audio-driven paradigm outperform existing SOTA methodologies in terms of video quality, temporally consistency, lip synchronization precision, and motion diversity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.16331v1-abstract-full').style.display = 'none'; document.getElementById('2411.16331v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">refer to our main-page \url{https://jixiaozhong.github.io/Sonic/}</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.15441">arXiv:2411.15441</a> <span> [<a href="https://arxiv.org/pdf/2411.15441">pdf</a>, <a href="https://arxiv.org/format/2411.15441">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> Study of $\it螞_{\it{b}}^\rm{0}$ and $\it螢_{\it{b}}^\rm{0}$ decays to $\it螞 h^+h^{'-}$ and evidence for $CP$ violation in $\it螞_{\it{b}}^\rm{0}\to\it螞 K^+K^-$ decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1129 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.15441v1-abstract-short" style="display: inline;"> A study of $\it螞_{\it{b}}^\rm{0}$ and $\it螢_{\it{b}}^\rm{0}$ decays to $\it螞 h^{+} h^{\prime -}$ $(h^{(\prime)}=蟺, K)$ is performed using $pp$ collision data collected by the LHCb experiment during LHC Runs 1$-$2, corresponding to an integrated luminosity of $9~\rm{fb}^{-1}$. The branching fractions for these decays are measured using the $\it螞_{\it{b}}^\rm{0}\to\it螞_{\it{c}}^+(\to\it螞蟺^+)蟺^-$ dec… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.15441v1-abstract-full').style.display = 'inline'; document.getElementById('2411.15441v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.15441v1-abstract-full" style="display: none;"> A study of $\it螞_{\it{b}}^\rm{0}$ and $\it螢_{\it{b}}^\rm{0}$ decays to $\it螞 h^{+} h^{\prime -}$ $(h^{(\prime)}=蟺, K)$ is performed using $pp$ collision data collected by the LHCb experiment during LHC Runs 1$-$2, corresponding to an integrated luminosity of $9~\rm{fb}^{-1}$. The branching fractions for these decays are measured using the $\it螞_{\it{b}}^\rm{0}\to\it螞_{\it{c}}^+(\to\it螞蟺^+)蟺^-$ decay as control channel. The decays $\it螞_{\it{b}}^\rm{0}\to\it螞蟺^+蟺^-$ and $\it螢_{\it{b}}^\rm{0}\to\it螞K^-蟺^+$ are observed for the first time. For decay modes with sufficient signal yields, $CP$ asymmetries are measured in the full and localized regions of the final-state phase space. Evidence is found for $CP$ violation in the $\it螞_{\it{b}}^\rm{0}\to\it螞K^+K^-$ decay, interpreted as originating primarily from an asymmetric $\it螞_{\it{b}}^\rm{0} \to \it{N}^{*+} \it{K}^-$ decay amplitude. The measured $CP$ asymmetries for the other decays are compatible with zero. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.15441v1-abstract-full').style.display = 'none'; document.getElementById('2411.15441v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">All figures and tables, along with any supplementary material and additional information, are available at https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2024-043.html (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-043, CERN-EP-2024-281 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.13768">arXiv:2411.13768</a> <span> [<a href="https://arxiv.org/pdf/2411.13768">pdf</a>, <a href="https://arxiv.org/format/2411.13768">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> An Evaluation-Driven Approach to Designing LLM Agents: Process and Architecture </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Xia%2C+B">Boming Xia</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+L">Liming Zhu</a>, <a href="/search/?searchtype=author&query=Xing%2C+Z">Zhenchang Xing</a>, <a href="/search/?searchtype=author&query=Zhao%2C+D">Dehai Zhao</a>, <a href="/search/?searchtype=author&query=Zhang%2C+H">Hao Zhang</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.13768v1-abstract-short" style="display: inline;"> The advent of Large Language Models (LLMs) has enabled the development of LLM agents capable of autonomously achieving under-specified goals and continuously evolving through post-deployment improvement, sometimes without requiring code or model updates. Conventional approaches, such as pre-defined test cases and code/model redevelopment pipelines, are inadequate for addressing the unique challeng… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13768v1-abstract-full').style.display = 'inline'; document.getElementById('2411.13768v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.13768v1-abstract-full" style="display: none;"> The advent of Large Language Models (LLMs) has enabled the development of LLM agents capable of autonomously achieving under-specified goals and continuously evolving through post-deployment improvement, sometimes without requiring code or model updates. Conventional approaches, such as pre-defined test cases and code/model redevelopment pipelines, are inadequate for addressing the unique challenges of LLM agent development, particularly in terms of quality and risk control. This paper introduces an evaluation-driven design approach, inspired by test-driven development, to address these challenges. Through a multivocal literature review (MLR), we synthesize existing LLM evaluation methods and propose a novel process model and reference architecture specifically designed for LLM agents. The proposed approach integrates online and offline evaluations to support adaptive runtime adjustments and systematic offline redevelopment, improving runtime pipelines, artifacts, system architecture, and LLMs by continuously incorporating evaluation results, including fine-grained feedback from human and AI evaluators. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13768v1-abstract-full').style.display = 'none'; document.getElementById('2411.13768v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.13352">arXiv:2411.13352</a> <span> [<a href="https://arxiv.org/pdf/2411.13352">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Plasma Physics">physics.plasm-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Space Physics">physics.space-ph</span> </div> </div> <p class="title is-5 mathjax"> New Insights on the High Reconnection Rate and the Diminishment of Ion Outflow </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Fan%2C+C">Cheng-Yu Fan</a>, <a href="/search/?searchtype=author&query=Wang%2C+S">Shan Wang</a>, <a href="/search/?searchtype=author&query=Zhou%2C+X">Xu-Zhi Zhou</a>, <a href="/search/?searchtype=author&query=Lu%2C+S">San Lu</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanming Lu</a>, <a href="/search/?searchtype=author&query=Pyakurel%2C+P+S">Prayash Sharma Pyakurel</a>, <a href="/search/?searchtype=author&query=Zong%2C+Q">Qiugang Zong</a>, <a href="/search/?searchtype=author&query=Liu%2C+Z">Zhi-Yang Liu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.13352v2-abstract-short" style="display: inline;"> The recently discovered electron-only reconnection has drawn great interests due to abnormal features like lack of ion outflows and high reconnection rates. Using particle-in-cell simulations, we investigate their physical mechanisms. The reconnection rate, when normalized by ion parameters ($R_i$), may appear anomalously high, whereas that normalized by electron parameters ($R_e$) remains ~0.1. W… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13352v2-abstract-full').style.display = 'inline'; document.getElementById('2411.13352v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.13352v2-abstract-full" style="display: none;"> The recently discovered electron-only reconnection has drawn great interests due to abnormal features like lack of ion outflows and high reconnection rates. Using particle-in-cell simulations, we investigate their physical mechanisms. The reconnection rate, when normalized by ion parameters ($R_i$), may appear anomalously high, whereas that normalized by electron parameters ($R_e$) remains ~0.1. We propose that the essence of high $R_i$ is insufficient field line bending outside the electron diffusion region, indicating an incomplete development of the ion diffusion region. It may result from bursty reconnection in thin current sheets, or small system sizes. The ion outflow diminishes at high $尾_i$ when the gyroradius ($蟻_i$) exceeds the system size. Low-velocity ions still experience notable acceleration from Hall fields. However, a local distribution includes many high-velocity ions that experience random accelerations from different electric fields across $蟻_i$, resulting in near-zero bulk velocities. Our study helps understand reconnection structures and the underlying physics for transitions between different regimes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13352v2-abstract-full').style.display = 'none'; document.getElementById('2411.13352v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.13056">arXiv:2411.13056</a> <span> [<a href="https://arxiv.org/pdf/2411.13056">pdf</a>, <a href="https://arxiv.org/format/2411.13056">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Efficient Masked AutoEncoder for Video Object Counting and A Large-Scale Benchmark </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Cao%2C+B">Bing Cao</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Quanhao Lu</a>, <a href="/search/?searchtype=author&query=Feng%2C+J">Jiekang Feng</a>, <a href="/search/?searchtype=author&query=Wang%2C+Q">Qilong Wang</a>, <a href="/search/?searchtype=author&query=Hu%2C+Q">Qinghua Hu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+P">Pengfei Zhu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.13056v2-abstract-short" style="display: inline;"> The dynamic imbalance of the fore-background is a major challenge in video object counting, which is usually caused by the sparsity of target objects. This remains understudied in existing works and often leads to severe under-/over-prediction errors. To tackle this issue in video object counting, we propose a density-embedded Efficient Masked Autoencoder Counting (E-MAC) framework in this paper.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13056v2-abstract-full').style.display = 'inline'; document.getElementById('2411.13056v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.13056v2-abstract-full" style="display: none;"> The dynamic imbalance of the fore-background is a major challenge in video object counting, which is usually caused by the sparsity of target objects. This remains understudied in existing works and often leads to severe under-/over-prediction errors. To tackle this issue in video object counting, we propose a density-embedded Efficient Masked Autoencoder Counting (E-MAC) framework in this paper. To empower the model's representation ability on density regression, we develop a new $\mathtt{D}$ensity-$\mathtt{E}$mbedded $\mathtt{M}$asked m$\mathtt{O}$deling ($\mathtt{DEMO}$) method, which first takes the density map as an auxiliary modality to perform multimodal self-representation learning for image and density map. Although $\mathtt{DEMO}$ contributes to effective cross-modal regression guidance, it also brings in redundant background information, making it difficult to focus on the foreground regions. To handle this dilemma, we propose an efficient spatial adaptive masking derived from density maps to boost efficiency. Meanwhile, we employ an optical flow-based temporal collaborative fusion strategy to effectively capture the dynamic variations across frames, aligning features to derive multi-frame density residuals. The counting accuracy of the current frame is boosted by harnessing the information from adjacent frames. In addition, considering that most existing datasets are limited to human-centric scenarios, we first propose a large video bird counting dataset, DroneBird, in natural scenarios for migratory bird protection. Extensive experiments on three crowd datasets and our \textit{DroneBird} validate our superiority against the counterparts. The code and dataset are available. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13056v2-abstract-full').style.display = 'none'; document.getElementById('2411.13056v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">ICLR25</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.12178">arXiv:2411.12178</a> <span> [<a href="https://arxiv.org/pdf/2411.12178">pdf</a>, <a href="https://arxiv.org/format/2411.12178">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="High Energy Physics - Experiment">hep-ex</span> </div> </div> <p class="title is-5 mathjax"> First evidence for direct CP violation in beauty to charmonium decays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=LHCb+collaboration"> LHCb collaboration</a>, <a href="/search/?searchtype=author&query=Aaij%2C+R">R. Aaij</a>, <a href="/search/?searchtype=author&query=Abdelmotteleb%2C+A+S+W">A. S. W. Abdelmotteleb</a>, <a href="/search/?searchtype=author&query=Beteta%2C+C+A">C. Abellan Beteta</a>, <a href="/search/?searchtype=author&query=Abudin%C3%A9n%2C+F">F. Abudin茅n</a>, <a href="/search/?searchtype=author&query=Ackernley%2C+T">T. Ackernley</a>, <a href="/search/?searchtype=author&query=Adefisoye%2C+A+A">A. A. Adefisoye</a>, <a href="/search/?searchtype=author&query=Adeva%2C+B">B. Adeva</a>, <a href="/search/?searchtype=author&query=Adinolfi%2C+M">M. Adinolfi</a>, <a href="/search/?searchtype=author&query=Adlarson%2C+P">P. Adlarson</a>, <a href="/search/?searchtype=author&query=Agapopoulou%2C+C">C. Agapopoulou</a>, <a href="/search/?searchtype=author&query=Aidala%2C+C+A">C. A. Aidala</a>, <a href="/search/?searchtype=author&query=Ajaltouni%2C+Z">Z. Ajaltouni</a>, <a href="/search/?searchtype=author&query=Akar%2C+S">S. Akar</a>, <a href="/search/?searchtype=author&query=Akiba%2C+K">K. Akiba</a>, <a href="/search/?searchtype=author&query=Albicocco%2C+P">P. Albicocco</a>, <a href="/search/?searchtype=author&query=Albrecht%2C+J">J. Albrecht</a>, <a href="/search/?searchtype=author&query=Alessio%2C+F">F. Alessio</a>, <a href="/search/?searchtype=author&query=Alexander%2C+M">M. Alexander</a>, <a href="/search/?searchtype=author&query=Aliouche%2C+Z">Z. Aliouche</a>, <a href="/search/?searchtype=author&query=Cartelle%2C+P+A">P. Alvarez Cartelle</a>, <a href="/search/?searchtype=author&query=Amalric%2C+R">R. Amalric</a>, <a href="/search/?searchtype=author&query=Amato%2C+S">S. Amato</a>, <a href="/search/?searchtype=author&query=Amey%2C+J+L">J. L. Amey</a>, <a href="/search/?searchtype=author&query=Amhis%2C+Y">Y. Amhis</a> , et al. (1127 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.12178v2-abstract-short" style="display: inline;"> The $C\!P$ asymmetry and branching fraction of the CKM-suppressed decay $B^+\!\to J\mskip -3mu/\mskip -2mu蠄\,蟺^+$ are precisely measured relative to the favoured decay $B^+\!\to J\mskip -3mu/\mskip -2mu蠄\,K^+$, using a sample of proton-proton collision data corresponding to an integrated luminosity of $5.4~\mathrm{fb}^{-1}$ recorded at center-of-mass energy of $13~\mathrm{TeV}$ during 2016--2018.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.12178v2-abstract-full').style.display = 'inline'; document.getElementById('2411.12178v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.12178v2-abstract-full" style="display: none;"> The $C\!P$ asymmetry and branching fraction of the CKM-suppressed decay $B^+\!\to J\mskip -3mu/\mskip -2mu蠄\,蟺^+$ are precisely measured relative to the favoured decay $B^+\!\to J\mskip -3mu/\mskip -2mu蠄\,K^+$, using a sample of proton-proton collision data corresponding to an integrated luminosity of $5.4~\mathrm{fb}^{-1}$ recorded at center-of-mass energy of $13~\mathrm{TeV}$ during 2016--2018. The results of the $C\!P$ asymmetry difference and branching fraction ratio are \begin{align*} 螖\mathcal{A}^{C\!P} &\equiv \mathcal{A}^{C\!P}(B^+ \to J\mskip -3mu/\mskip -2mu蠄\,蟺^+) - \mathcal{A}^{C\!P}(B^+ \to J\mskip -3mu/\mskip -2mu蠄\,K^+) = (1.29 \pm 0.49 \pm 0.08) \times 10^{-2}, \end{align*} \begin{equation*} \mathcal{R}_{蟺/K} \equiv \frac{\mathcal{B}(B^+ \!\to J\mskip -3mu/\mskip -2mu蠄\,蟺^+)}{\mathcal{B}(B^+ \!\to J\mskip -3mu/\mskip -2mu蠄\,K^+)} = (3.852 \pm 0.022 \pm 0.018) \times 10^{-2}. \end{equation*} where the first uncertainties are statistical and the second systematic. A combination with previous LHCb results based on data collected at $7$ and $8~\mathrm{TeV}$ in 2011 and 2012 yields $螖\mathcal{A}^{C\!P} = (1.42 \pm 0.43 \pm 0.08) \times 10^{-2}$ and $\mathcal{R}_{蟺/K} = (3.846 \pm 0.018 \pm 0.018) \times 10^{-2}$. The combined $螖\mathcal{A}^{C\!P}$ value deviates from zero by 3.2 standard deviations, providing the first evidence for direct $C\!P$ violation in the amplitudes of beauty decays to charmonium final states. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.12178v2-abstract-full').style.display = 'none'; document.getElementById('2411.12178v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 18 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 2 figures, no conference or journal information All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/1623/ (LHCb public pages)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LHCb-PAPER-2024-031 CERN-EP-2024-286 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.11231">arXiv:2411.11231</a> <span> [<a href="https://arxiv.org/pdf/2411.11231">pdf</a>, <a href="https://arxiv.org/format/2411.11231">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> BeautyBank: Encoding Facial Makeup in Latent Space </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lu%2C+Q">Qianwen Lu</a>, <a href="/search/?searchtype=author&query=Yang%2C+X">Xingchao Yang</a>, <a href="/search/?searchtype=author&query=Taketomi%2C+T">Takafumi Taketomi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.11231v2-abstract-short" style="display: inline;"> The advancement of makeup transfer, editing, and image encoding has demonstrated their effectiveness and superior quality. However, existing makeup works primarily focus on low-dimensional features such as color distributions and patterns, limiting their versatillity across a wide range of makeup applications. Futhermore, existing high-dimensional latent encoding methods mainly target global featu… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.11231v2-abstract-full').style.display = 'inline'; document.getElementById('2411.11231v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.11231v2-abstract-full" style="display: none;"> The advancement of makeup transfer, editing, and image encoding has demonstrated their effectiveness and superior quality. However, existing makeup works primarily focus on low-dimensional features such as color distributions and patterns, limiting their versatillity across a wide range of makeup applications. Futhermore, existing high-dimensional latent encoding methods mainly target global features such as structure and style, and are less effective for tasks that require detailed attention to local color and pattern features of makeup. To overcome these limitations, we propose BeautyBank, a novel makeup encoder that disentangles pattern features of bare and makeup faces. Our method encodes makeup features into a high-dimensional space, preserving essential details necessary for makeup reconstruction and broadening the scope of potential makeup research applications. We also propose a Progressive Makeup Tuning (PMT) strategy, specifically designed to enhance the preservation of detailed makeup features while preventing the inclusion of irrelevant attributes. We further explore novel makeup applications, including facial image generation with makeup injection and makeup similarity measure. Extensive empirical experiments validate that our method offers superior task adaptability and holds significant potential for widespread application in various makeup-related fields. Furthermore, to address the lack of large-scale, high-quality paired makeup datasets in the field, we constructed the Bare-Makeup Synthesis Dataset (BMS), comprising 324,000 pairs of 512x512 pixel images of bare and makeup-enhanced faces. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.11231v2-abstract-full').style.display = 'none'; document.getElementById('2411.11231v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.10487">arXiv:2411.10487</a> <span> [<a href="https://arxiv.org/pdf/2411.10487">pdf</a>, <a href="https://arxiv.org/format/2411.10487">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Architectural Patterns for Designing Quantum Artificial Intelligence Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Klymenko%2C+M">Mykhailo Klymenko</a>, <a href="/search/?searchtype=author&query=Hoang%2C+T">Thong Hoang</a>, <a href="/search/?searchtype=author&query=Xu%2C+X">Xiwei Xu</a>, <a href="/search/?searchtype=author&query=Xing%2C+Z">Zhenchang Xing</a>, <a href="/search/?searchtype=author&query=Usman%2C+M">Muhammad Usman</a>, <a href="/search/?searchtype=author&query=Lu%2C+Q">Qinghua Lu</a>, <a href="/search/?searchtype=author&query=Zhu%2C+L">Liming Zhu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.10487v3-abstract-short" style="display: inline;"> Utilising quantum computing technology to enhance artificial intelligence systems is expected to improve training and inference times, increase robustness against noise and adversarial attacks, and reduce the number of parameters without compromising accuracy. However, moving beyond proof-of-concept or simulations to develop practical applications of these systems while ensuring high software qual… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.10487v3-abstract-full').style.display = 'inline'; document.getElementById('2411.10487v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.10487v3-abstract-full" style="display: none;"> Utilising quantum computing technology to enhance artificial intelligence systems is expected to improve training and inference times, increase robustness against noise and adversarial attacks, and reduce the number of parameters without compromising accuracy. However, moving beyond proof-of-concept or simulations to develop practical applications of these systems while ensuring high software quality faces significant challenges due to the limitations of quantum hardware and the underdeveloped knowledge base in software engineering for such systems. In this work, we have conducted a systematic mapping study to identify the challenges and solutions associated with the software architecture of quantum-enhanced artificial intelligence systems. The results of the systematic mapping study reveal several architectural patterns that describe how quantum components can be integrated into inference engines, as well as middleware patterns that facilitate communication between classical and quantum components. Each pattern realises a trade-off between various software quality attributes, such as efficiency, scalability, trainability, simplicity, portability, and deployability. The outcomes of this work have been compiled into a catalogue of architectural patterns. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.10487v3-abstract-full').style.display = 'none'; document.getElementById('2411.10487v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> D.2.11; D.2.m; I.2.m </p> </li> </ol> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=100" class="pagination-link " aria-label="Page 3" aria-current="page">3 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=150" class="pagination-link " aria-label="Page 4" aria-current="page">4 </a> </li> <li> <a href="/search/?searchtype=author&query=Lu%2C+Q&start=200" class="pagination-link " aria-label="Page 5" aria-current="page">5 </a> </li> <li><span class="pagination-ellipsis">…</span></li> </ul> </nav> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository