{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-unified-approach-to-the-classical","title":"A Unified Approach to the Classical Statistical Analysis of Small Signals","arxiv_id":"physics/9711021","date":"1997-11-22","proceeding":null,"authors":["Gary J. Feldman","Robert D. Cousins"],"abstract":"We give a classical confidence belt construction which unifies the treatment of upper confidence limits for null results and two-sided confidence intervals for non-null results. The unified treatment solves a problem (apparently not previously recognized) that the choice of upper limit or two-sided intervals leads to intervals which are not confidence intervals if the choice is based on the data. We apply the construction to two related problems which have recently been a battle-ground between classical and Bayesian statistics: Poisson processes with background, and Gaussian errors with a bounded physical region. In contrast with the usual classical construction for upper limits, our construction avoids unphysical confidence intervals. In contrast with some popular Bayesian intervals, our intervals eliminate conservatism (frequentist coverage greater than the stated confidence) in the Gaussian case and reduce it to a level dictated by discreteness in the Poisson case. We generalize the method in order to apply it to analysis of experiments searching for neutrino oscillations. We show that this technique both gives correct coverage and is powerful, while other classical techniques that have been used by neutrino oscillation search experiments fail one or both of these criteria.","url_abs":"https://arxiv.org/abs/physics/9711021v2","url_pdf":"https://arxiv.org/pdf/physics/9711021v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-unified-approach-to-the-classical","repo_url":"https://github.com/Rabbitybunny/Stat_FeldmanCousins","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-unified-approach-to-the-classical","repo_url":"https://github.com/SphericalCowww/Stat_FeldmanCousins","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-unified-approach-to-the-classical","repo_url":"https://github.com/kimakan/FaintCOS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"paper_slug":"a-unified-approach-to-the-classical","repo_url":"https://github.com/marinang/lauztat","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"paper_slug":"a-unified-approach-to-the-classical","repo_url":"https://github.com/tboschi/fccl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=physics%2F9711021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"physics/9711021"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tboschi/fccl","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/SphericalCowww/Stat_FeldmanCousins","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/marinang/lauztat","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Rabbitybunny/Stat_FeldmanCousins","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kimakan/FaintCOS","reach":{"status":"ok","spdx":"BSD-2-Clause"}}],"summary":{"unverified":5},"by_repo_kind":{"listed":{"samples":5,"ran":0,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"7a24651a4ec900be","entry":"calc_conf_lim_feldman_cousins","repo":"kimakan/FaintCOS","repo_kind":"listed","path":"post_calcos.py","file_url":"https://github.com/kimakan/FaintCOS/blob/HEAD/post_calcos.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"7a24651a4ec900be"}},{"code_sha256_prefix":"2d538ac6a4dd2c47","entry":"calc_lya_scatter_model","repo":"kimakan/FaintCOS","repo_kind":"listed","path":"post_calcos.py","file_url":"https://github.com/kimakan/FaintCOS/blob/HEAD/post_calcos.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"2d538ac6a4dd2c47"}},{"code_sha256_prefix":"0e16d7a5f4c10f11","entry":"chiSquareGaus","repo":"Rabbitybunny/Stat_FeldmanCousins","repo_kind":"listed","path":"FeldmanCousinsGaus.py","file_url":"https://github.com/Rabbitybunny/Stat_FeldmanCousins/blob/HEAD/FeldmanCousinsGaus.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0e16d7a5f4c10f11"}},{"code_sha256_prefix":"aa735f7ef328acde","entry":"gaussian","repo":"Rabbitybunny/Stat_FeldmanCousins","repo_kind":"listed","path":"FeldmanCousinsGaus.py","file_url":"https://github.com/Rabbitybunny/Stat_FeldmanCousins/blob/HEAD/FeldmanCousinsGaus.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"aa735f7ef328acde"}},{"code_sha256_prefix":"cadac6d64efa89e3","entry":"squareResGaus","repo":"Rabbitybunny/Stat_FeldmanCousins","repo_kind":"listed","path":"FeldmanCousinsGaus.py","file_url":"https://github.com/Rabbitybunny/Stat_FeldmanCousins/blob/HEAD/FeldmanCousinsGaus.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cadac6d64efa89e3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}