{"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/curtains-for-your-sliding-window-constructing","title":"CURTAINs for your Sliding Window: Constructing Unobserved Regions by Transforming Adjacent Intervals","arxiv_id":"2203.09470","date":"2022-03-17","proceeding":null,"authors":["John Andrew Raine","Samuel Klein","Debajyoti Sengupta","Tobias Golling"],"abstract":"We propose a new model independent technique for constructing background data templates for use in searches for new physics processes at the LHC. This method, called CURTAINs, uses invertible neural networks to parametrise the distribution of side band data as a function of the resonant observable. The network learns a transformation to map any data point from its value of the resonant observable to another chosen value. Using CURTAINs, a template for the background data in the signal window is constructed by mapping the data from the side-bands into the signal region. We perform anomaly detection using the CURTAINs background template to enhance the sensitivity to new physics in a bump hunt. We demonstrate its performance in a sliding window search across a wide range of mass values. Using the LHC Olympics dataset, we demonstrate that CURTAINs matches the performance of other leading approaches which aim to improve the sensitivity of bump hunts, can be trained on a much smaller range of the invariant mass, and is fully data driven.","url_abs":"https://arxiv.org/abs/2203.09470v3","url_pdf":"https://arxiv.org/pdf/2203.09470v3.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":"curtains-for-your-sliding-window-constructing","repo_url":"https://github.com/sambklein/CURTAINS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.09470","atlas_url":"https://app.syntology.ai/?focus=2203.09470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09470"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/sambklein/CURTAINS","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"ran_honours":1},"by_repo_kind":{"official":{"samples":4,"ran":4,"repositories":1}},"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":"b71ded1550ff5634","entry":"get_CL_mask","repo":"sambklein/CURTAINS","repo_kind":"official","path":"models/cathode_flows.py","file_url":"https://github.com/sambklein/CURTAINS/blob/HEAD/models/cathode_flows.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b71ded1550ff5634"}},{"code_sha256_prefix":"39571ab4559a0cf7","entry":"get_average_distance","repo":"sambklein/CURTAINS","repo_kind":"official","path":"validate_distance_measure.py","file_url":"https://github.com/sambklein/CURTAINS/blob/HEAD/validate_distance_measure.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"39571ab4559a0cf7"}},{"code_sha256_prefix":"d580682a49233ab6","entry":"get_mask","repo":"sambklein/CURTAINS","repo_kind":"official","path":"models/cathode_flows.py","file_url":"https://github.com/sambklein/CURTAINS/blob/HEAD/models/cathode_flows.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d580682a49233ab6"}},{"code_sha256_prefix":"68419341a6380e20","entry":"sum_except_batch","repo":"sambklein/CURTAINS","repo_kind":"official","path":"models/cathode_flows.py","file_url":"https://github.com/sambklein/CURTAINS/blob/HEAD/models/cathode_flows.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"68419341a6380e20"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}