betaFeedback

WorksComputer Science

nnAEU: a Simple and Efficient CNN-Autoencoder for Hyperspectral Unmixing

Abstract

Deep learning-based hyperspectral unmixing (HSU) has followed a trajectory of increasing architectural complexity, from simple autoencoders to transformers and, most recently, Mamba-based models, each claiming to advance the state of the art. Contrary to this trend, we propose a lightweight CNN-based autoencoder, coined "Not New Autoencoder Unmixing" (nnAEU). It is derived from the backbone of UNMamba (2025) through a pruning study that removes the Mamba component entirely. nnAEU uses less than 10 times fewer parameters than UNMamba, and far fewer than other transformer- and GAN-based methods, while outperforming them in accuracy. We provide a complete, minimal, reproducible code, available at https://gitlab.telecom-paris.fr/ring/nnAEU.git.

Introduction

Context

Hyperspectral images (HSIs) capture multiple narrow, adjacent spectral bands, enabling material analysis in remote sensing with applications in agriculture, mineral mapping, and space exploration [1]. However, due to physical limitations, HSIs often have low spatial resolution: each pixel covers a large area (e.g., ∼30\sim30 meters for satellite images) and may contain mixed material spectra. This mixing limits direct interpretation, motivating hyperspectral unmixing (HSU), which decomposes pixels into pure material spectra (endmembers) and their relative abundances. Specifically, this article focuses on blind HSU, aiming to estimate both endmembers and abundances. Despite its limitations [2], the Linear Mixture Model (LMM) is widely used for its simplicity. It assumes pixels to be linear combinations of endmembers [1]. Mathematically, for an HSI Y∈RB,NY \in\mathbb{R}^{B,N} (with N=H×WN = H \times W pixels and BB bands), endmember matrix E∈RB,CE \in\mathbb{R}^{B,C}, and abundance maps A∈RC,NA \in\mathbb{R}^{C,N}, the model is:

Y=EA+ε,(1)Y = EA + \varepsilon, \tag*{(1)}

where ε∈RB,N\varepsilon\in\mathbb{R}^{B,N} is additive noise. The LMM is typically constrained by non-negativity (ANC) and sum-to-one (ASC) conditions for endmembers and abundances.

Related work

Due to their simplicity, pure pixel retrieval algorithms such as VCA [3] or N-FINDR [4] gained popularity in HSU. However, their reliance on the pure-pixel assumption—rarely satisfied in practice—led, during the last decade, to the dominance of optimisation-based methods with priors such as sparsity [5] or minimum volume [6], or even learned priors [7].

More recently, the application of deep learning to HSU has followed a trajectory of increasing architectural complexity. Early approaches used simple autoencoders for unsupervised endmember and abundance estimation [8], soon evolving into convolutional variants like CNNAEU [9] and UnDIP [10] to better exploit spatial context. Attention mechanisms and transformers, such as DeepTrans [11] and A2SAN [12], were later introduced to model long-range spectral-spatial dependencies, while adversarial schemes like SSST-GAN [13] enabled blind HSU by learning data distributions. There have also been attempts at using Hyperspectral Foundation Models for HSU [14]. Recently, state-space models (SSMs) such as Mamba have emerged as efficient alternatives, employed in ProMUN [15], MBU-Net [16], and UNMamba [17]. At each stage, new architectures grow progressively larger and more intricate. Currently, UNMamba seems to lead the field by outperforming all state-of-the-art models.

Motivation and Contributions

This trajectory of increasing complexity raises a natural question: is each added layer of complexity actually responsible for the reported gains? In principle, this question should be straightforward to answer by looking at the results presented in the methods’ articles. In practice, it rarely is, because HSU research is affected by a broader reproducibility issue in machine learning [18]: code accompanying published methods is frequently unavailable, incomplete, or dependent on undocumented hyperparameters, preprocessing steps, or initialisation schemes, making independent verification of reported gains difficult or, in many cases, impossible.

In this context, the contributions of this work are the following:

  • We introduce a light CNN architecture derived from an ablation study we conducted on UNMamba, a neural network matching SOTA. This new architecture, coined nnAEU, sets a new SOTA, while being an order of magnitude lighter than UNMamba.

  • We provide a complete, easy-to-implement and reproducible code, tested on several datasets.

UNMamba: context and presentation of the ablation study

UNMamba Description

UNMamba employs a cascaded spatial–spectral Mamba model tailored for blind HSU. By leveraging state-space models (SSMs), it captures long-range spatial and spectral dependencies with linear computational complexity, ensuring scalability. As illustrated in the top part of Figure 1, the model operates in two stages: abundance estimation and endmember estimation. The abundance module first uses 3 UNMamba blocks that extract long-range spatial dependencies with a spatial block, then global spectral features using a spectral block. This forms a unified spatial–spectral representation that is mapped into abundance estimates. Meanwhile, the endmember module incorporates weighted averages of trainable random sequences. Finally, both abundances and endmembers are combined in the LMM module to reconstruct the input HSI. The authors experimentally show that their method obtains highly accurate results.

Figure 1. Comparison of UNMamba and proposed nnAEU unmixing networks. nnAEU is derived from UNMamba by pruning the UNMamba blocks and simplifying the endmember module. YY is the input HSI, A^,E^\hat{A}, \hat{E} are the abundance and endmember estimations, Y^\hat{Y} is the reconstructed HSI and SS is the trainable endmember sequence randomly initialized. Weight are trainable multiplicative factors and Avg. represents the averaging operation.

Pruning Procedure

To evaluate the role of these complex modules in UNMamba’s performance, we perform a simple pruning of the UNMamba blocks used in the abundance module. This leaves the embedding layer, followed by the abundance head. In detail, the embedding module is composed of a 2D convolutional layer reducing the spectral dimension of the input HSI from BB to a hidden dimension of 64, a group norm and a SiLU nonlinearity. As for the abundance head, it consists of a 2D convolutional layer augmenting the spectral dimension to 128, a group norm, a SiLU, another 2D convolution reducing the spectral dimension to CC to reach the abundance size, a batch norm and finally a softmax with scale 3.5. In addition, it uses a dropout layer with probability 5e−25\mathrm{e}^{-2} after the softmax during training. We keep the endmember and LMM modules untouched, so the pruning procedure only affects the abundance module. As shown in subsection 4.3, the pruned architecture outperforms UNMamba, leading to our new proposed method described in the next section.

Proposed Architecture

The proposed architecture consists of 1) a convolutional network estimating the abundance maps, corresponding to the architecture used in UNMamba but removing the Mamba modules; 2) a linear layer producing the endmembers, simplifying the UNMamba endmember module and further improving its performance. The input HSI is then reconstructed in the LMM module by multiplying both estimated endmembers and abundances. We name this model nnAEU, which stands for Not New Autoencoder Unmixing, as the proposed architecture can be viewed as an autoencoder with the abundance module being the encoder and the endmember estimation as the weights of a decoder. The bottom part of Figure 1 illustrates the proposed architecture.

In detail, the encoder uses an alternation of 2D convolutional layers, group norms and SiLU nonlinearities, with the spectral dimension going from BB to 48, 128 and finally CC. It then uses a 2D batch norm, a softmax to enforce both the ANC and ASC and dropout with probability 5e−25\mathrm{e}^{-2}.

In practice, the input HSI is normalised to have values between 0 and 1. Additionally, we use a typical strategy in HSU by initialising the decoder’s weights using a first guess of the endmember, using a Simplex Volume Maximisation algorithm [6].

Training loss

nnAEU is trained end-to-end in an unsupervised manner by minimising a mixture of losses, taken from the UNMamba article:

SAD⁡(Y^,Y)+λ1MSE⁡(Y^,Y)+λ2L12(A^)+λ3∑i=0CMSE⁡(E^i,Y‾),(2)\operatorname{SAD}(\widehat{Y},Y)+\lambda_{1}\operatorname{MSE}(\widehat{Y},Y)+\lambda_{2}\mathcal{L}_{\frac{1}{2}}(\widehat{A})+\lambda_{3}\sum_{i=0}^{C}\operatorname{MSE}(\widehat{E}_{i},\overline{Y}), \tag*{(2)}

where SAD is the Spectral Angular Distance (3), and MSE is the Mean Squared Error (4), assessing the quality of the reconstruction. In addition, a 12\frac{1}{2}-norm regularisation term encourages sparsity in the abundance estimation (5), and an MSE between the predicted endmembers E^\widehat{E} and the average spectrum Y‾\overline{Y} assists the convergence of the endmembers towards the data distribution, with Y‾=1N∑i=0NY:,i\overline{Y}=\frac{1}{N}\sum_{i=0}^{N}Y_{:,i}.

Mathematically, for any dumb variable matrices X,X^∈RD1,D2X,\widehat{X}\in\mathbb{R}^{D_{1},D_{2}}, we denote:

SAD⁡=1D1∑i=1D1arccos⁡(∑j=1D2Xj,i∥X:,i∥2X^j,i∥X^:,i∥2),(3)\operatorname{SAD}=\frac{1}{D_{1}}\sum_{i=1}^{D_{1}}\arccos\left(\sum_{j=1}^{D_{2}}\frac{X_{j,i}}{\lVert X_{:,i}\rVert_{2}}\frac{\widehat{X}_{j,i}}{\lVert\widehat{X}_{:,i}\rVert_{2}}\right), \tag*{(3)}
MSE⁡=1D1∑i=1D1(X^:,i−X:,i)2,(4)\operatorname{MSE}=\frac{1}{D_{1}}\sum_{i=1}^{D_{1}}(\widehat{X}_{:,i}-X_{:,i})^{2}, \tag*{(4)}
L12(A^)=1CN∑i=0C∑j=0NA^i,j.(5)\mathcal{L}_{\frac{1}{2}}(\widehat{A})=\frac{1}{CN}\sum_{i=0}^{C}\sum_{j=0}^{N}\sqrt{\widehat{A}_{i,j}}. \tag*{(5)}

Experiments

Data Description

Experiments were conducted on several available labelled datasets, providing an in-depth comparison of the methods:

  • Samson: the smallest dataset, relatively simple, with a spatial size of 95×9595 \times95, 156 spectral bands, and 3 endmembers.

  • Jasper Ridge: it has 100×100100 \times100 pixels, 198 spectral bands and 4 endmembers.

  • Apex: has 110×110110 \times110 pixels, 285 spectral bands and contains 4 endmembers.

  • Urban: has a significantly larger spatial extent of 307 pixels, 162 spectral bands and 6 endmembers

Experimental Setup

The estimated endmember quality is assessed through the SAD (3) and the abundance through the NMSE (6). Both are averaged over all endmembers.

NMSE⁡=∑i=1C∑j=1N(AGT⁡i,j−A^i,j)2∑i=1C∑j=1N(AGT⁡i,j)2.(6)\operatorname{NMSE}=\frac{\sum_{i=1}^{C}\sum_{j=1}^{N}(\operatorname{AGT}_{i,j}-\widehat{A}_{i,j})^{2}}{\sum_{i=1}^{C}\sum_{j=1}^{N}(\operatorname{AGT}_{i,j})^{2}}. \tag*{(6)}

We also compare the execution time in seconds (Time), measured on an NVIDIA V100 GPU, as well as the number of parameters (Size) for all methods. Additionally, we compute a score sis_i for each method ii, aggregating over all the datasets j∈{1...J}j\in\{1...J\} (here we consider J=4J=4 datasets) the SAD and NMSE after a per-dataset normalisation.

Experimental Setup

and NMSE after a per-dataset normalisation. We average this score to obtain a global ranking of the methods (Rank), for easier readability. The score is obtained with:

si=12J∑j=1J(SAD⁡i,jmax⁡j(SAD⁡i,j)+NMSE⁡i,jmax⁡j(NMSE⁡i,j)),(7)s_i=\frac{1}{2J}\sum_{j=1}^{J}\left(\frac{\operatorname{SAD}_{i,j}}{\max_j(\operatorname{SAD}_{i,j})}+\frac{\operatorname{NMSE}_{i,j}}{\max_j(\operatorname{NMSE}_{i,j})}\right), \tag*{(7)}

where SAD⁡i,j\operatorname{SAD}_{i,j} and NMSE⁡i,j\operatorname{NMSE}_{i,j} are the metrics of method ii on dataset jj. We also include a reproducibility item (Repr.) to highlight methods for which announced performance could or couldn’t be reproduced. The training and loss hyperparameters are chosen to be the same across all the datasets. They were obtained using the Optuna Bayesian optimisation framework [19]: 300 training epochs, with the AdamW optimiser, a weight decay of 3e−33\mathrm{e}^{-3}, a learning rate of 7e−37\mathrm{e}^{-3} and λ1=0.8\lambda_{1}=0.8, λ2=3e−2\lambda_{2}=3\mathrm{e}^{-2} and λ3=1\lambda_{3}=1.

UNMamba Pruning

Table 1 shows results obtained with the ablation described in subsection 2.2, where UNMamba-p denotes the pruning of Mamba blocks. This shows that this ablation doesn’t affect the performance of the model; in fact, it can even improve unmixing capacity while significantly reducing model size (by a factor of 3 to 5). This size reduction speeds up training and shrinks the memory footprint, making it better suited for embedded systems.

SamsonJasperApexUrbanScore
SAD ↓NMSE ↓TimeSizeSAD ↓NMSE ↓TimeSizeSAD ↓NMSE ↓TimeSizeSAD ↓NMSE ↓TimeSize
UNMamba [17]0.025±0.010.014±032194k0.095±0.030.033±0.0440242k0.139±0.060.116±0.0538260k0.165±0.050.215±0.132023.8M1.23
UNMamba-p0.024±00.016±0943k0.065±0.010.019±0.011262k0.122±0.020.096±0.02985k0.148±0.040.217±0.098369k0.81

Table 1. Comparison of the performance of UNMamba and UNMamba-p, without the UNMamba blocks. Time is in seconds, Score is detailed in subsection 4.2, and Size is the number of trainable parameters. Best results in bold, second best underlined

Results

To evaluate our proposed framework, we compare averaged scores from 10 independent training runs against 9 state-of-the-art methods. These methods span a diverse range of approaches, from classic optimisation method using SiVM and FCLS [6, 20], to CNNs with CNNAEU [9] and UnDIP [10], ViTs with DeepTrans [10], A2S2AN [12], GAN with SSST-GAN [13], and Mamba with ProMU [15], MBU-Net [16]2, and UNMamba [17]. Qualitative results about the estimation of abundances and endmembers on the Apex dataset are shown in Figure 2 and Figure 3. In addition, Table 2 displays the results obtained using the proposed unmixing autoencoder. Moreover, as mentioned in subsection 1.3, it is important to note that some methods’ results may differ from their original paper due to reproducibility issues with the available code.

Figure 2. Comparison of all method’s estimated A^\hat{A} on the Apex dataset, our proposed method is in bold.

Figure 3. Comparison of all method’s estimated E^\hat{E} on the Apex dataset, our proposed method is in bold.

SamsonJasperApexUrbanRepr.Rank
MethodSAD ↓\downarrowNMSE ↓\downarrowTimeSizeSAD ↓\downarrowNMSE ↓\downarrowTimeSizeSAD ↓\downarrowNMSE ↓\downarrowTimeSizeSAD ↓\downarrowNMSE ↓\downarrowTimeSize
SiVM + FCLS [20]0.056±00.056_{\pm0}0.438±00.438_{\pm0}000.261±00.261_{\pm0}0.187±00.187_{\pm0}000.244±00.244_{\pm0}0.943±00.943_{\pm0}0.100.436±00.436_{\pm0}1.293±01.293_{\pm0}0.10✔7
CNNAEU [9]0.058±0.080.058_{\pm0.08}0.112±0.110.112_{\pm0.11}1.4124k0.253±0.170.253_{\pm0.17}0.328±0.160.328_{\pm0.16}1.4182k0.362±0.240.362_{\pm0.24}0.263±0.120.263_{\pm0.12}1.5261k0.238±0.070.238_{\pm0.07}0.712±0.240.712_{\pm0.24}5.4188k✗5
UnDIP [10]0.056±00.056_{\pm0}0.453±00.453_{\pm0}571.6M0.261±00.261_{\pm0}0.191±00.191_{\pm0}721.7M0.244±00.244_{\pm0}1.003±01.003_{\pm0}1081.9M0.436±00.436_{\pm0}1.242±0.011.242_{\pm0.01}2691.6M✗8
DeepTrans [11]0.198±0.010.198_{\pm0.01}0.346±00.346_{\pm0}3.25M0.282±0.010.282_{\pm0.01}0.255±0.010.255_{\pm0.01}3.27.5M0.289±00.289_{\pm0}0.445±0.010.445_{\pm0.01}38M0.369±0.030.369_{\pm0.03}0.786±0.110.786_{\pm0.11}934M✗10
SSST-GAN [13]0.136±0.010.136_{\pm0.01}0.078±0.030.078_{\pm0.03}173175M0.304±0.060.304_{\pm0.06}0.259±0.040.259_{\pm0.04}172175M0.380±0.090.380_{\pm0.09}0.808±0.030.808_{\pm0.03}179175M0.334±0.090.334_{\pm0.09}0.617±0.170.617_{\pm0.17}175175M✔9
A2SAN [12]0.060±0.010.060_{\pm0.01}0.014±00.014_{\pm0}1437k0.136±0.030.136_{\pm0.03}0.089±0.050.089_{\pm0.05}1443k0.080±0.010.080_{\pm0.01}0.117±0.010.117_{\pm0.01}1456k0.221±0.060.221_{\pm0.06}0.409±0.170.409_{\pm0.17}1638k✔3
ProMU [15]0.106±00.106_{\pm0}0.018±00.018_{\pm0}43152k0.278±00.278_{\pm0}0.364±00.364_{\pm0}25217k0.146±0.050.146_{\pm0.05}0.188±0.100.188_{\pm0.10}58218k////////✗6
MBU-Net [16]0.028±00.028_{\pm0}0.052±00.052_{\pm0}144199k0.144±0.040.144_{\pm0.04}0.045±0.010.045_{\pm0.01}101144k0.293±0.040.293_{\pm0.04}0.941±0.260.941_{\pm0.26}145194k////////✗4
UNMamba [17]0.025±0.010.025_{\pm0.01}0.014±00.014_{\pm0}32194k0.095±0.030.095_{\pm0.03}0.033±0.040.033_{\pm0.04}40242k0.139±0.060.139_{\pm0.06}0.116±0.050.116_{\pm0.05}38260k0.165±0.050.165_{\pm0.05}0.215±0.130.215_{\pm0.13}2023.8M✔2
nnAEU (ours)0.027±00.027_{\pm0}0.015±00.015_{\pm0}215k0.066±0.020.066_{\pm0.02}0.032±0.010.032_{\pm0.01}217k0.064±00.064_{\pm0}0.127±0.010.127_{\pm0.01}222k0.111±00.111_{\pm0}0.149±0.030.149_{\pm0.03}416k✔1

Table 2. Comparison of all HSU methods on the 4 datasets, averaged over 10 runs. We display results as Mean±std_{\pm\mathrm{std}}, TimeTime (in seconds), RankRank (as described in 4.2), SizeSize (number of trainable parameters), and Repr.Repr. indicates whether the method’s announced performance could be replicated or not.

We observe that, as mentioned in § 3, our proposed simplification of the endmember module further improves the performance compared to using UNMamba’s Table 1. This choice reduces the size of the already pruned UNMamba model, reaching up to 20 times fewer parameters than UNMamba, placing it among the smallest and fastest learning-based models of the state-of-the-art. In addition, this method sets a new state-of-the-art, beating all other approaches to unmixing, surpassing the pruned version of UNMamba.

Our findings should be read with two limitations in mind: our evaluation is restricted to standard benchmark scenes, it-self a consequence of HSU’s scarce, costly-to-obtain ground truth; and Mamba- or transformer-based components may still prove useful in other regimes — larger datasets, more endmembers, different sensors — where more data could justify their added capacity.

Conclusion

Why doesn’t added complexity improve results? A likely explanation lies in the single-image training framework, dominant in HSU: heavy, expressive models are trained on a single scene with little data, leaving limited room for their extra capacity to be exploited — the convolutional backbone alone may already capture what signal is available.

Within current benchmark conditions, our results support a clear message: complexity should not be treated as a proxy for progress. We demonstrated this through a controlled ablation of UNMamba, and proposed a light, fully reproducible CNN architecture matching SOTA at an order of magnitude fewer parameters, offered as a simple baseline for the field.

References

References

  1. [1]Longfei Ren, Zhu Han, et al., “Advances in hyperspectral image unmixing: From algorithmic frameworks to practical applications,” Information Geography, vol. 2, no. 1, pp. 100035, 2026.DOI
  2. [2]Christophe Kervazo, Nicolas Gillis, et al., “Provably robust blind source separation of linear-quadratic near-separable mixtures,” SIAM Journal on Imaging Sciences, vol. 14, no. 4, pp. 1848–1889, 2021.DOI
  3. [3]J.M.P. Nascimento and J.M.B. Dias, “Vertex component analysis: a fast algorithm to unmix hyperspectral data,” IEEE TGRS, vol. 43, no. 4, pp. 898–910, 2005.DOI
  4. [4]Michael E. Winter, “N-findr: an algorithm for fast autonomous spectral end-member determination in hyperspectral data,” in Imaging Spectrometry V. SPIE, 1999, vol. 3753, pp. 266 – 275.DOI
  5. [5]José M. Bioucas-Dias and Mario A. T. Figueiredo, “Alternating direction algorithms for constrained sparse regression: Application to hsu,” in WHISPERS, 2010, pp. 1–4.
  6. [6]Rob Heylen, Dževdet Burazerovic, et al., “Non-linear spectral unmixing by geodesic simplex volume maximization,” IEEE JSTSP, vol. 5, no. 3, pp. 534–542, 2011.DOI
  7. [7]Christophe Kervazo and Jérémy E Cohen, “Unrolled multiplicative updates for nonnegative matrix factorization applied to hyperspectral unmixing,” 2026.
  8. [8]Burkni Palsson, Jakob Sigurdsson, et al., “Hyperspectral unmixing using a neural network autoencoder,” IEEE Access, vol. 6, pp. 25646–25656, 2018.DOI
  9. [9]Burkni Palsson, Magnus O. Ulfarsson, et al., “Convolutional autoencoder for spectral–spatial hsu,” IEEE TGRS, vol. 59, no. 1, pp. 535–549, 2021.
  10. [10]Behnood Rasti, Bikram Koirala, et al., “Undip: Hsu using deep image prior,” IEEE TGRS, vol. 60, pp. 1–15, 2022.DOI
  11. [11]Preetam Ghosh, Swalpa Kumar Roy, et al., “Hsu using transformer network,” IEEE TGRS, vol. 60, pp. 1–16, 2022.
  12. [12]Xuanwen Tao, Mercedes E. Paoletti, et al., “An abundance-guided attention network for hsu,” IEEE TGRS, vol. 62, pp. 1–14, 2024.DOI
  13. [13]Yu Zhang, Jiageng Huang, et al., “Ssst-gan: A sampling-based spatial-spectral transformer and generative adversarial network for hsu,” IEEE J-STARS, vol. 19, pp. 5741–5757, 2026.DOI
  14. [14]Edgard Dabier, Christophe Kervazo, et al., “Benchmarking hyperspectral foundation models for hyperspectral unmixing,” arXiv, 2026.arxiv.org/abs/2609.28283
  15. [15]Yang Liu, Shujun Liu, et al., “Efficient progressive mamba model for hyperspectral sequence unmixing,” IEEE J-STARS, vol. 18, pp. 19511–19526, 2025.DOI
  16. [16]Mingle Zhang, Hongyu Xie, et al., “Mamba-enhanced spatial-spectral feature learning for hsu,” IEEE JSTARS, vol. 18, pp. 22798–22815, 2025.DOI
  17. [17]Dong Chen, Junping Zhang, et al., “Unmamba: Cascaded spatial-spectral mamba for blind hsu,” IEEE GRSL, vol. 22, pp. 1–5, 2025.DOI
  18. [18]J. Pineau, P. Vincent-Lamarre, et al., “Improving reproducibility in machine learning research(a report from the neurips 2019 reproducibility program),” JMLR, 2021.arxiv.org/abs/2003.12206
  19. [19]Takuya Akiba, Shotaro Sano, et al., “Optuna: A next-generation hyperparameter optimization framework,” in ACM SIGKDD, 2019.arxiv.org/abs/1907.10902
  20. [20]D. Heinz, C.-I. Chang, et al., “Fully constrained least-squares based linear unmixing [hyperspectral image classification],” in IEEE IGARSS (Cat. No.99CH36293), 1999, vol. 2, pp. 1401–1403 vol.2.

Paper details

vlnc:W_g4gzfxqs
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents