Most automated program repair methods rely on test cases to determine the correctness of the generated patches. However, due to the incompleteness of available test suites, some patches that pass all the test cases may still be incorrect. This issue is known as the patch overfitting problem. Overfitting problem is a longstanding problem in automated program repair. Due to overfitting patches, the patches obtained by automated program repair tools require further validation to determine their correctness. Researchers have proposed many methods to automatically assess the correctness of patches, but no systematic review provides a detailed introduction to this problem, the existing solutions, and the challenges. To address this deficiency, we systematically review the existing approaches to patch correctness assessment. We first offer a few examples of overfitting patches to acquire a more detailed understanding of this problem. We then propose a comprehensive categorization of publicly available techniques and datasets, examine the commonly used evaluation metrics, and perform an in-depth analysis of the effectiveness of the existing models in addressing the challenge of overfitting. Based on our analysis, we provided the difficulties encountered by current methodologies, alongside the possible avenues for future research exploration.

The CLEO II detector at the $e^{+}{e}^{-}$ storage ring CESR has been used to search for two-photon production of the $f_J\left(2220\right)$ decaying into ${\pi }^{+}{\pi }^{-}$. No evidence for a signal is found in $4.77{\mathrm{fb}}^{-1\mathrm{}}$ of data and a 95% C.L. upper limit on $[{\Gamma }_{\gamma \gamma }{B}_{{\pi }^{+}{\pi }^{-}}{]}_{f_J\left(2220\right)}$ of 2.5 eV is set. If this result is combined with the BES Collaboration's measurement of $f_J\left(2220\right)\to {\pi }^{+}{\pi }^{-}$ in radiative $J/\psi$ decay and the recent CLEO result for $[{\Gamma }_{\gamma \gamma }{B}_{K_S^0{K}_S^0}{]}_{f_J\left(2220\right)}$, a $95\%$ C.L. lower limit on the stickiness of 102 is obtained. This result for the stickiness provides further support for a substantial neutral parton content in the $f_J\left(2220\right)$.

In recent years, pre-trained language models have seen significant success in natural language processing and have been increasingly applied to code-related tasks. Code intelligence tasks have shown promising performance with the support of code pre-trained language models. Pre-processing code simplification methods have been introduced to prune code tokens from the model’s input while maintaining task effectiveness. These methods improve the efficiency of code intelligence tasks while reducing computational costs. Post-prediction code simplification methods provide explanations for code intelligence task outcomes, enhancing the reliability and interpretability of model predictions. However, comprehensive evaluations of these methods across diverse code pre-trained model architectures and code intelligence tasks are lacking. To assess the effectiveness of code simplification methods, we conduct an empirical study integrating these code simplification methods with various pre-trained code models across multiple code intelligence tasks. Our empirical findings suggest that developing task-specific code simplification methods would be beneficial. Then, we recommend leveraging post-prediction methods to summarize prior knowledge, which can pre-process code simplification strategies. Moreover, establishing more evaluation mechanisms for code simplification is crucial. Finally, we propose incorporating code simplification methods into the pre-training phase of code pre-trained models to enhance their program comprehension and code representation capabilities.

Automated Program Repair (APR) has made substantial advancements in fixing real-world defects. However, the overfitting problem, namely the phenomenon where APR-generated patches pass the given test suite but fail to correctly fix the underlying defects, remains a major challenge. To mitigate this problem, numerous Automated Patch Correctness Assessment (APCA) methods have been proposed. Among them, learning-based APCA methods currently represent the state-of-the-art (SOTA). However, these methods require training on large, high-quality patch datasets. Moreover, their lack of interpretability, as they often produce only simple binary predictions, provides little support for subsequent manual review. Finally, existing APCA methods often fail to fully leverage the rich contextual information both within and beyond the patched program, and they struggle to incorporate expert knowledge about patch correctness assessment. Large Language Models (LLMs) offer a promising path to address these limitations. Trained on vast corpora, they demonstrate strong generalization across tasks and an ability to learn from experience, allowing them to provide interpretable explanations in a manner analogous to human reasoning. In this paper, we propose a multi-agent framework FURINA, which formulates APCA as a reasoning task. The framework employs a pre-trained retriever and four specialized agents to analyze a candidate patch from multiple perspectives: a Profiler to analyze developer intent from failing tests and bug reports; an Interpreter to analyze code semantics according to the function-level patch; a Critic to analyze potential degradations from the patch context; and a final Judge to synthesize the patches, failing tests, bug reports, intermediate reasoning reports generated by other agents, the retrieved similar patches, along with instructive empirical tips derived from prior APCA studies to determine patch correctness. Evaluation results on the public benchmark CACHE-small demonstrate that FURINA, when equipped with popular LLMs, outperforms SOTA APCA baselines, achieving improvements of at least 5.58% in \(Accuracy\) and 5.93% in \(F1\) . To further assess its reasoning quality, we design a new evaluation scheme that considers three dimensions: factual consistency, logical clarity, and readability. The results show that FURINA achieves a score of at least 4.8 out of 5, demonstrating superior reasoning quality compared with SOTA baselines. Finally, based on our constructed dataset, FURINA still achieves competitive performance, indicating strong generalization ability.

We report a measurement of the magnitude of the ${\nu }_{\tau }$ helicity from $\tau$-pair events taken with the CLEO detector at the CESR electron-positron storage ring. Events in which each $\tau$ undergoes the decay $\tau \to h\nu$, with $h$ a charged pion or kaon, are analyzed for energy correlations between the daughter hadrons, yielding $|{\xi }_h|$ = $1.03\pm 0.06\pm 0.04$, with the first error statistical and the second systematic.