Skip to content

Use publication year in bib keys when updating arXiv entries to DOI #1062

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pancetta merged 2 commits into from
Mar 16, 2026
Merged

Use publication year in bib keys when updating arXiv entries to DOI #1062

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0a5ce9a
Initial plan
Copilot Mar 16, 2026
cac5fcc
Update arxiv_to_publications_correct.py to use publication year in ke…
Copilot Mar 16, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
137 changes: 41 additions & 96 deletions _bibliography/pint.bib
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7012,6 +7012,19 @@ @article{EndtmayerEtAl2024
year = {2024},
}

@inproceedings{ErmonEtAl2024,
author = {Ermon, Stefano and Merchant, Amil and Selvam, Nikil},
booktitle = {Advances in Neural Information Processing Systems 37},
collection = {NeurIPS 2024},
doi = {10.52202/079017-0176},
pages = {5429–5453},
publisher = {Neural Information Processing Systems Foundation, Inc. (NeurIPS)},
series = {NeurIPS 2024},
title = {Self-Refining Diffusion Samplers: Enabling Parallelization via Parareal Iterations},
url = {http://dx.doi.org/10.52202/079017-0176},
year = {2024},
}

@article{FangEtAl2024,
author = {Fang, Rui and Tsai, Richard},
doi = {10.1007/s11075-024-01826-8},
Expand Down Expand Up @@ -7100,7 +7113,7 @@ @article{GanglEtAl2024
year = {2024},
}

@inproceedings{GattiglioEtAl2024b,
@inproceedings{GattiglioEtAl2024,
author = {Gattiglio, Guglielmo and Grigoryeva, Lyudmila and Tamborrino, Massimiliano},
booktitle = {Advances in Neural Information Processing Systems 37},
collection = {NeurIPS 2024},
Expand Down Expand Up @@ -7480,19 +7493,6 @@ @unpublished{SchnaubeltEtAl2024
year = {2024},
}

@inproceedings{SelvamEtAl2024,
author = {Ermon, Stefano and Merchant, Amil and Selvam, Nikil},
booktitle = {Advances in Neural Information Processing Systems 37},
collection = {NeurIPS 2024},
doi = {10.52202/079017-0176},
pages = {5429–5453},
publisher = {Neural Information Processing Systems Foundation, Inc. (NeurIPS)},
series = {NeurIPS 2024},
title = {Self-Refining Diffusion Samplers: Enabling Parallelization via Parareal Iterations},
url = {http://dx.doi.org/10.52202/079017-0176},
year = {2024},
}

@unpublished{SouzaEtAl2024,
abstract = {Simulation of the monodomain equation, crucial for modeling the heart's electrical activity, faces scalability limits when traditional numerical methods only parallelize in space. To optimize the use of large multi-processor computers by distributing the computational load more effectively, time parallelization is essential. We introduce a high-order parallel-in-time method addressing the substantial computational challenges posed by the stiff, multiscale, and nonlinear nature of cardiac dynamics. Our method combines the semi-implicit and exponential spectral deferred correction methods, yielding a hybrid method that is extended to parallel-in-time employing the PFASST framework. We thoroughly evaluate the stability, accuracy, and robustness of the proposed parallel-in-time method through extensive numerical experiments, using practical ionic models such as the ten-Tusscher-Panfilov. The results underscore the method's potential to significantly enhance real-time and high-fidelity simulations in biomedical research and clinical applications.},
author = {Giacomo Rosilho de Souza and Simone Pezzuto and Rolf Krause},
Expand Down Expand Up @@ -7608,7 +7608,16 @@ @article{AlesEtAl2025
year = {2025},
}

@article{AppelEtAl2024,
@article{AppelEtAl2025,
author = {Appel, Magnus and Alexandersen, Joe},
doi = {10.2139/ssrn.5256438},
publisher = {Elsevier BV},
title = {Space-Time Multigrid Methods Suitable for Topology Optimisation of Transient Heat Conduction},
url = {http://dx.doi.org/10.2139/ssrn.5256438},
year = {2025},
}

@article{AppelEtAl2025b,
author = {Appel, Magnus and Alexandersen, Joe},
doi = {10.1137/24m1696603},
issn = {1095-7197},
Expand All @@ -7623,15 +7632,6 @@ @article{AppelEtAl2024
year = {2025},
}

@article{AppelEtAl2025,
author = {Appel, Magnus and Alexandersen, Joe},
doi = {10.2139/ssrn.5256438},
publisher = {Elsevier BV},
title = {Space-Time Multigrid Methods Suitable for Topology Optimisation of Transient Heat Conduction},
url = {http://dx.doi.org/10.2139/ssrn.5256438},
year = {2025},
}

@unpublished{ArrarasEtAl2025,
abstract = {In view of the existing limitations of sequential computing, parallelization has emerged as an alternative in order to improve the speedup of numerical simulations. In the framework of evolutionary problems, space-time parallel methods offer the possibility to optimize parallelization. In the present paper, we propose a new family of these methods, built as a combination of the well-known parareal algorithm and suitable splitting techniques which permit us to parallelize in space. In particular, dimensional and domain decomposition splittings are considered for partitioning the elliptic operator, and first-order splitting time integrators are chosen as the propagators of the parareal algorithm to solve the resulting split problem. The major contribution of these methods is that, not only does the fine propagator perform in parallel, but also the coarse propagator. Unlike the classical version of the parareal algorithm, where all processors remain idle during the coarse propagator computations, the newly proposed schemes utilize the computational cores for both integrators. A convergence analysis of the methods is provided, and several numerical experiments are performed to test the solvers under consideration.},
author = {Andrés Arrarás and Francisco J. Gaspar and Iñigo Jimenez-Ciga and Laura Portero},
Expand Down Expand Up @@ -7696,7 +7696,7 @@ @article{BhattEtAl2025
year = {2025},
}

@article{BossuytEtAl2023,
@article{BossuytEtAl2025,
author = {Bossuyt, Ignace and Vandewalle, Stefan and Samaey, Giovanni},
doi = {10.1137/23m1609142},
issn = {1095-7197},
Expand Down Expand Up @@ -7752,7 +7752,7 @@ @unpublished{DaiEtAl2025
year = {2025},
}

@article{DanieliEtAl2023,
@article{DanieliEtAl2025,
author = {Danieli, Federico and Southworth, Ben S. and Schroder, Jacob B.},
doi = {10.1002/nla.70034},
issn = {1099-1506},
Expand Down Expand Up @@ -7824,7 +7824,7 @@ @article{FeketeEtAl2025
year = {2025},
}

@article{FreeseEtAl2024,
@article{FreeseEtAl2025,
author = {Freese, Philip and Götschel, Sebastian and Lunet, Thibaut and Ruprecht, Daniel and Schreiber, Martin},
doi = {10.1177/10943420251400406},
issn = {1741-2846},
Expand Down Expand Up @@ -7883,7 +7883,16 @@ @unpublished{GanderEtAl2025b
year = {2025},
}

@article{GattiglioEtAl2024,
@unpublished{GattiglioEtAl2025,
abstract = {We introduce Prob-GParareal, a probabilistic extension of the GParareal algorithm designed to provide uncertainty quantification for the Parallel-in-Time (PinT) solution of (ordinary and partial) differential equations (ODEs, PDEs). The method employs Gaussian processes (GPs) to model the Parareal correction function, as GParareal does, further enabling the propagation of numerical uncertainty across time and yielding probabilistic forecasts of system's evolution. Furthermore, Prob-GParareal accommodates probabilistic initial conditions and maintains compatibility with classical numerical solvers, ensuring its straightforward integration into existing Parareal frameworks. Here, we first conduct a theoretical analysis of the computational complexity and derive error bounds of Prob-GParareal. Then, we numerically demonstrate the accuracy and robustness of the proposed algorithm on five benchmark ODE systems, including chaotic, stiff, and bifurcation problems. To showcase the flexibility and potential scalability of the proposed algorithm, we also consider Prob-nnGParareal, a variant obtained by replacing the GPs in Parareal with the nearest-neighbors GPs, illustrating its increased performance on an additional PDE example. This work bridges a critical gap in the development of probabilistic counterparts to established PinT methods.},
author = {Guglielmo Gattiglio and Lyudmila Grigoryeva and Massimiliano Tamborrino},
howpublished = {arXiv:2509.03945v1 [stat.CO]},
title = {Prob-GParareal: A Probabilistic Numerical Parallel-in-Time Solver for Differential Equations},
url = {http://arxiv.org/abs/2509.03945v1},
year = {2025},
}

@article{GattiglioEtAl2025b,
author = {Gattiglio, Guglielmo and Grigoryeva, Lyudmila and Tamborrino, Massimiliano},
doi = {10.1137/24m1663648},
issn = {1095-7197},
Expand All @@ -7898,15 +7907,6 @@ @article{GattiglioEtAl2024
year = {2025},
}

@unpublished{GattiglioEtAl2025,
abstract = {We introduce Prob-GParareal, a probabilistic extension of the GParareal algorithm designed to provide uncertainty quantification for the Parallel-in-Time (PinT) solution of (ordinary and partial) differential equations (ODEs, PDEs). The method employs Gaussian processes (GPs) to model the Parareal correction function, as GParareal does, further enabling the propagation of numerical uncertainty across time and yielding probabilistic forecasts of system's evolution. Furthermore, Prob-GParareal accommodates probabilistic initial conditions and maintains compatibility with classical numerical solvers, ensuring its straightforward integration into existing Parareal frameworks. Here, we first conduct a theoretical analysis of the computational complexity and derive error bounds of Prob-GParareal. Then, we numerically demonstrate the accuracy and robustness of the proposed algorithm on five benchmark ODE systems, including chaotic, stiff, and bifurcation problems. To showcase the flexibility and potential scalability of the proposed algorithm, we also consider Prob-nnGParareal, a variant obtained by replacing the GPs in Parareal with the nearest-neighbors GPs, illustrating its increased performance on an additional PDE example. This work bridges a critical gap in the development of probabilistic counterparts to established PinT methods.},
author = {Guglielmo Gattiglio and Lyudmila Grigoryeva and Massimiliano Tamborrino},
howpublished = {arXiv:2509.03945v1 [stat.CO]},
title = {Prob-GParareal: A Probabilistic Numerical Parallel-in-Time Solver for Differential Equations},
url = {http://arxiv.org/abs/2509.03945v1},
year = {2025},
}

@unpublished{GengEtAl2025,
abstract = {While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned solution as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. To ensure such consistency, we propose to use the convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the traditional numerical scheme used as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen-Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNNs model is trained on trajectories-based on random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without re-training. This work demonstrates the potential of integrating neural network methods into the parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.},
author = {Yuwei Geng and Junqi Yin and Eric C. Cyr and Guannan Zhang and Lili Ju},
Expand Down Expand Up @@ -7945,18 +7945,6 @@ @inproceedings{HamdanEtAl2025
year = {2025},
}

@article{HeinzelreiterEtAl2024,
author = {Heinzelreiter, Bernhard and Pearson, John W},
doi = {10.1093/imanum/draf088},
issn = {1464-3642},
journal = {IMA Journal of Numerical Analysis},
month = {November},
publisher = {Oxford University Press (OUP)},
title = {Diagonalization-based parallel-in-time preconditioners for instationary fluid flow control problems},
url = {http://dx.doi.org/10.1093/imanum/draf088},
year = {2025},
}

@article{HeinzelreiterEtAl2025,
author = {Heinzelreiter, Bernhard and Pearson, John W},
doi = {10.1093/imanum/draf088},
Expand Down Expand Up @@ -8314,21 +8302,6 @@ @article{SperryEtAl2025
year = {2025},
}

@article{SterckEtAl2024,
author = {Krzysik, O. A. and De Sterck, H. and Falgout, R. D. and Schroder, J. B.},
doi = {10.1137/24m1630268},
issn = {1095-7197},
journal = {SIAM Journal on Scientific Computing},
month = {November},
number = {6},
pages = {A3134–A3160},
publisher = {Society for Industrial & Applied Mathematics (SIAM)},
title = {Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws},
url = {http://dx.doi.org/10.1137/24m1630268},
volume = {47},
year = {2025},
}

@article{StumpEtAl2025,
author = {Stump, Benjamin C. and Arndt, Daniel and Rolchigo, Matt and Reeve, Samuel Temple},
doi = {10.1016/j.commatsci.2025.113684},
Expand Down Expand Up @@ -8508,20 +8481,6 @@ @unpublished{ZoltowskiEtAl2025
year = {2025},
}

@article{AlexandersenEtAl2025,
author = {Alexandersen, Joe and Appel, Magnus},
doi = {10.1016/j.cma.2025.118605},
issn = {0045-7825},
journal = {Computer Methods in Applied Mechanics and Engineering},
month = {March},
pages = {118605},
publisher = {Elsevier BV},
title = {Large-scale topology optimisation of time-dependent thermal conduction using space-time finite elements and a parallel space-time multigrid preconditioner},
url = {http://dx.doi.org/10.1016/j.cma.2025.118605},
volume = {450},
year = {2026},
}

@article{AlexandersenEtAl2026,
author = {Alexandersen, Joe and Appel, Magnus},
doi = {10.1016/j.cma.2025.118605},
Expand Down Expand Up @@ -8550,7 +8509,7 @@ @article{AluthgeEtAl2026
year = {2026},
}

@article{BonteEtAl2024,
@article{BonteEtAl2026,
author = {Bonte, Corentin and Bouillon, Arne and Samaey, Giovanni and Meerbergen, Karl},
doi = {10.1016/j.cam.2026.117339},
issn = {0377-0427},
Expand All @@ -8573,20 +8532,6 @@ @unpublished{DaiEtAl2026
year = {2026},
}

@article{DurastanteEtAl2025,
author = {Durastante, Fabio and Mazza, Mariarosa},
doi = {10.1007/s10915-026-03185-z},
issn = {1573-7691},
journal = {Journal of Scientific Computing},
month = {February},
number = {1},
publisher = {Springer Science and Business Media LLC},
title = {Stage-Parallel Implicit Runge–Kutta Methods Via Low-Rank Matrix Equation Corrections},
url = {http://dx.doi.org/10.1007/s10915-026-03185-z},
volume = {107},
year = {2026},
}

@article{DurastanteEtAl2026,
author = {Durastante, Fabio and Mazza, Mariarosa},
doi = {10.1007/s10915-026-03185-z},
Expand All @@ -8601,7 +8546,7 @@ @article{DurastanteEtAl2026
year = {2026},
}

@article{EngwerEtAl2025,
@article{EngwerEtAl2026,
author = {Engwer, Christian and Schell, Alexander and Dreier, Nils-Arne},
doi = {10.1007/s13137-025-00283-2},
issn = {1869-2680},
Expand Down Expand Up @@ -8637,7 +8582,7 @@ @unpublished{GaraiEtAl2026b
year = {2026},
}

@article{HahnEtAl2025,
@article{HahnEtAl2026,
author = {Hahn, Robert and Schöps, Sebastian},
doi = {10.1109/tmag.2026.3651851},
issn = {1941-0069},
Expand Down Expand Up @@ -8699,7 +8644,7 @@ @unpublished{LuEtAl2026
year = {2026},
}

@article{MardalEtAl2024,
@article{MardalEtAl2026,
author = {Mardal, Kent-Andre and Sogn, Jarle and Takacs, Stefan},
doi = {10.1142/s0218202526500168},
issn = {1793-6314},
Expand Down
18 changes: 15 additions & 3 deletions bin/arxiv_to_publications_correct.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,16 +36,28 @@
id = data['author'][0]['family'] + 'EtAl' + str(data['issued']['date-parts'][0][0])
else:
id = data['author'][0]['family'] + str(data['issued']['date-parts'][0][0])
if id != id_db:
print(f'Note: ID generated with new DOI ({id}) differs from the original in database ({id_db}). Keeping original ID.')
id = id.replace(" ", "_")

entries = db.get_entry_dict()
assert entries[id_db]["ENTRYTYPE"] == 'unpublished', "original entry in bib file was NOT unpublished !"
db.entries.remove(entries[id_db])

# Check for duplicate keys in the remaining database and add letter suffixes if needed
remaining = db.get_entry_dict()
id_orig = id
letters = 'bcdefghijklmnopqrstuvwxyz'
i = 0
while id in remaining:
print(f'Key {id} already exists, augmenting with letter suffix.')
id = id_orig + letters[i]
i += 1

if id != id_db:
print(f'Note: ID updated from {id_db} to {id} to reflect the publication year.')

bType, *rest1 = bib.split("{")
oldID, *rest2 = rest1[0].split(",")
bib = "{".join([bType] + [','.join([id_db]+rest2)] + rest1[1:])
bib = "{".join([bType] + [','.join([id]+rest2)] + rest1[1:])
bib_db = bibtexparser.loads(bib)
db.entries.extend(bib_db.get_entry_list())

Expand Down