{"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/getting-high-high-fidelity-simulation-of-high","title":"Getting High: High Fidelity Simulation of High Granularity Calorimeters with High Speed","arxiv_id":"2005.05334","date":"2020-05-11","proceeding":null,"authors":["Erik Buhmann","Sascha Diefenbacher","Engin Eren","Frank Gaede","Gregor Kasieczka","Anatolii Korol","Katja Krüger"],"abstract":"Accurate simulation of physical processes is crucial for the success of modern particle physics. However, simulating the development and interaction of particle showers with calorimeter detectors is a time consuming process and drives the computing needs of large experiments at the LHC and future colliders. Recently, generative machine learning models based on deep neural networks have shown promise in speeding up this task by several orders of magnitude. We investigate the use of a new architecture -- the Bounded Information Bottleneck Autoencoder -- for modelling electromagnetic showers in the central region of the Silicon-Tungsten calorimeter of the proposed International Large Detector. Combined with a novel second post-processing network, this approach achieves an accurate simulation of differential distributions including for the first time the shape of the minimum-ionizing-particle peak compared to a full GEANT4 simulation for a high-granularity calorimeter with 27k simulated channels. The results are validated by comparing to established architectures. Our results further strengthen the case of using generative networks for fast simulation and demonstrate that physically relevant differential distributions can be described with high accuracy.","url_abs":"https://arxiv.org/abs/2005.05334v3","url_pdf":"https://arxiv.org/pdf/2005.05334v3.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":"getting-high-high-fidelity-simulation-of-high","repo_url":"https://github.com/FLC-QU-hep/getting_high","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"getting-high-high-fidelity-simulation-of-high","repo_url":"https://gitlab.com/imahn/l2lflows","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2005.05334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05334"}},"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://gitlab.com/imahn/l2lflows","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/FLC-QU-hep/getting_high","reach":null}],"summary":{"ran_draft_wrong":2,"ran_fixture":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":3,"samples":[{"code_sha256_prefix":"0d068fa8024ead12","entry":"calc_gradient_penalty","repo":"FLC-QU-hep/getting_high","repo_kind":"official","path":"WGAN/wGAN.py","file_url":"https://github.com/FLC-QU-hep/getting_high/blob/HEAD/WGAN/wGAN.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0d068fa8024ead12"}},{"code_sha256_prefix":"16075a58df6d4ee4","entry":"mmd_hit_loss_cast_mean","repo":"FLC-QU-hep/getting_high","repo_kind":"official","path":"WGAN/wGAN.py","file_url":"https://github.com/FLC-QU-hep/getting_high/blob/HEAD/WGAN/wGAN.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"16075a58df6d4ee4"}},{"code_sha256_prefix":"8900daea31be2c22","entry":"mmd_hit_sortKernel","repo":"FLC-QU-hep/getting_high","repo_kind":"official","path":"WGAN/wGAN.py","file_url":"https://github.com/FLC-QU-hep/getting_high/blob/HEAD/WGAN/wGAN.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8900daea31be2c22"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}