Pith. sign in

REVIEW 4 cited by

Generating and refining particle detector simulations using the Wasserstein distance in adversarial networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1802.03325 v1 pith:YXJTSW65 submitted 2018-02-09 astro-ph.IM hep-ex

classification astro-ph.IMhep-ex
keywords datadetectorparticlesignalsimulatedtracesadversarialdetectors
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We use adversarial network architectures together with the Wasserstein distance to generate or refine simulated detector data. The data reflect two-dimensional projections of spatially distributed signal patterns with a broad spectrum of applications. As an example, we use an observatory to detect cosmic ray-induced air showers with a ground-based array of particle detectors. First we investigate a method of generating detector patterns with variable signal strengths while constraining the primary particle energy. We then present a technique to refine simulated time traces of detectors to match corresponding data distributions. With this method we demonstrate that training a deep network with refined data-like signal traces leads to a more precise energy reconstruction of data events compared to training with the originally simulated traces.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Reweighting Adversarial Networks for Unbinned Unfolding

    hep-ph 2026-06 unverdicted novelty 7.0 of 10

    RANs generalize moment unfolding to full phase-space unbinned unfolding via detector-level Wasserstein critics without requiring support overlap or multiple iterations.

  2. SPADE: Split-and-Delay Embeddings for Autoregressive High-Granularity Calorimeter Simulation

    physics.ins-det 2026-06 unverdicted novelty 6.0 of 10

    SPADE is a split-and-delay embedding technique for multi-feature autoregressive transformers that achieves competitive performance on high-granularity calorimeter shower simulation.

  3. CaloTrilogy: Toward a Breakthrough in One-Step, End-to-End, Physics-Guided Shower Generation for Modern Calorimeters

    hep-ex 2026-06 unverdicted novelty 6.0 of 10

    Presents CaloTrilogy, a unified one-step generative model for high-granularity calorimeter showers that combines velocity field integration, learned priors, and physics losses to match SOTA quality.

  4. GPT-like transformer model for silicon tracking detector simulation

    physics.ins-det 2025-12 conditional novelty 6.0 of 10

    A decoder-only transformer trained on tokenized Geant4 hit sequences generates silicon tracker hits that reconstruct to near-Geant4-quality tracks for single muons.

Pith tools