C-inf soft sparsity engine maths and code from 1972

In 1972, I developed (and published!) an infinitely differentiable soft sparsity engine based on metrics and tensors that avoided basis collapse and generated an approximate MLE solution, which apparently (according to multiple AIs) is being independently rediscovered today in ML/AI. The paper became a “sleeping beauty”. I have posted some of the Fortran code on GitHub and Zenodo and will be posting the underlying mathematics in markdown on these sites as well. I would like to contribute this material to the community. The model can be extended to large NNs using metric fields through which the BP gradients can somehow be passed. Originally, I applied the mathematics to solving the oblique simple structure problem in factor analysis, but the math is general, and easily extended. I would like to hear from anyone interested in this.