fix: fix zenodo

Author: DiogoRibeiro7

.zenodo.json

@@ -1,6 +1,6 @@
 {
   "title": "ssspx: Production-grade Single-Source Shortest Paths",
-  "description": "A deterministic single-source shortest paths solver with an optional transform, benchmarking tools, and documentation.",
+  "description": "Reference implementation of the deterministic BMSSP algorithm from \"Breaking the Sorting Barrier for Directed Single-Source Shortest Paths\" (Duan, Mao, Mao, Shu, Yin), with tests and benchmarks for directed graphs with non-negative weights.",
   "version": "v0.1.2",
   "upload_type": "software",
   "access_right": "open",
@@ -9,17 +9,31 @@
     {
       "name": "Ribeiro, Diogo",
       "orcid": "0009-0001-2022-7072",
-      "affiliation": "ESMAD - Instituto Politécnico do Porto"
+      "affiliation": "ESMAD - Instituto Politécnico do Porto; MySense"
     }
   ],
 
-  "keywords": ["graphs", "shortest paths", "Python", "algorithms", "benchmarking"],
+  "keywords": ["graphs", "shortest paths", "BMSSP", "SSSP", "Python", "algorithms", "benchmarking"],
 
   "related_identifiers": [
+    {
+      "identifier": "https://arxiv.org/abs/2504.17033",
+      "relation": "isDerivedFrom",
+      "resource_type": "publication-article",
+      "scheme": "url"
+    },
+    {
+      "identifier": "10.1145/3717823.3718179",
+      "relation": "isDerivedFrom",
+      "resource_type": "publication-article",
+      "scheme": "doi"
+    },
     {
       "identifier": "https://github.com/DiogoRibeiro7/bmssp",
       "relation": "isSupplementTo",
-      "resource_type": "software"
+      "resource_type": "software",
+      "scheme": "url"
     }
   ]
 }
+

CITATION.cff

@@ -10,9 +10,9 @@ authors:
     affiliation: ESMAD - Instituto Politécnico do Porto
 license: MIT
 version: "0.1.0"
-doi: 10.5281/zenodo.0000000
+doi: 10.5281/zenodo.17381998
 date-released: 2024-09-01
-repository-code: "https://github.com/DiogoRibeiro7/bmssp-backhup"
+repository-code: "https://github.com/DiogoRibeiro7/bmssp"
 keywords:
   - graphs
   - shortest paths
@@ -27,8 +27,8 @@ preferred-citation:
       orcid: "https://orcid.org/0009-0001-2022-7072"
   title: ssspx
   version: "0.1.0"
-  doi: 10.5281/zenodo.17381919
-  url: https://github.com/DiogoRibeiro7/bmssp-backhup
+  doi: 10.5281/zenodo.17381998
+  url: https://github.com/DiogoRibeiro7/bmssp
   publisher:
     name: Zenodo
   date-released: 2024-09-01

README.md

@@ -1,44 +1,49 @@
-# ssspx — Production‑grade Single‑Source Shortest Paths (Python)
+# ssspx — Production-grade Single-Source Shortest Paths (Python)
+
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.17381998.svg)](https://doi.org/10.5281/zenodo.17381998)
 
-[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.0000000.svg)](https://doi.org/10.5281/zenodo.0000000)
 <!-- GitHub stars/forks -->
-[![GitHub stars](https://img.shields.io/github/stars/diogoribeiro7/bmssp.svg?style=social)](https://github.com/diogoribeiro7/bmssp/stargazers)
-[![GitHub forks](https://img.shields.io/github/forks/diogoribeiro7/bmssp.svg?style=social)](https://github.com/diogoribeiro7/bmssp/network/members)
 
-`ssspx` is a clean, typed, and tested implementation of a deterministic **Single‑Source Shortest Paths** solver for directed graphs with non‑negative weights. It follows a BMSSP‑style divide‑and‑conquer design (levels, `FindPivots`, bounded base case) and includes a switchable frontier, an optional constant‑outdegree transform, a CLI, exports, and a small benchmark harness.
+[![GitHub stars](https://img.shields.io/github/stars/diogoribeiro7/bmssp.svg?style=social)](https://github.com/DiogoRibeiro7/bmssp/stargazers)
+[![GitHub forks](https://img.shields.io/github/forks/diogoribeiro7/bmssp.svg?style=social)](https://github.com/DiogoRibeiro7/bmssp/network/members)
+
+`ssspx` is a clean, typed, and tested implementation of a deterministic **Single-Source Shortest Paths** solver for directed graphs with non-negative weights.
+It follows a BMSSP-style divide-and-conquer design (levels, `FindPivots`, bounded base case) and includes a switchable frontier, an optional constant-outdegree transform, a CLI, exports, and a small benchmark harness.
 
-> For the advertised asymptotics, use the **block frontier** with the **constant‑outdegree transform** enabled. Distances are exact either way.
+> Research context: this is an implementation of the algorithmic approach from
+> **“Breaking the Sorting Barrier for Directed Single-Source Shortest Paths” (arXiv:2504.17033)** by Duan, Mao, Mao, Shu, and Yin.
+> Distances are exact. For the advertised asymptotics, use the **block frontier** with the **constant-outdegree transform** enabled.
 
 ---
 
 ## Features
 
-* Two frontiers: `block` (paper‑style) and `heap` (baseline)
-* Optional constant‑outdegree transform (cap configurable, default 4)
+* Two frontiers: `block` (paper-style) and `heap` (baseline)
+* Optional constant-outdegree transform (cap configurable, default 4)
 * Path reconstruction in original vertex IDs (works with or without transform)
-* Shortest‑path DAG export to **JSON** and **GraphML**
+* Shortest-path DAG export to **JSON** and **GraphML**
 * CLI with CSV/TSV/JSONL/MTX/GraphML input, random graphs, and optional cProfile
 * Benchmark harness vs. Dijkstra
 * Typed (mypy), linted (flake8/black/isort), tested (pytest + Hypothesis)
 
 ## Limitations
 
 * Edge weights must be **non-negative**. Supplying a negative weight raises a
-  ``GraphFormatError`` that points to the exact offending edge.
+  `GraphFormatError` that points to the exact offending edge.
 
 ## Documentation
 
 Full guides and the API reference live at the
 [project documentation site](https://DiogoRibeiro7.github.io/ssspx/).
 Algorithmic details are covered in the
-[BMSSP design notes](docs/design/ssspx.md), and key trade‑offs are tracked in
+[BMSSP design notes](docs/design/ssspx.md), and key trade-offs are tracked in
 [Architecture Decision Records](docs/decisions/).
 
 ## Stability policy
 
 Public modules and classes are listed in our
 [API stability policy](docs/policy/api.md). Deprecated names emit warnings and
-are removed after the stated ``remove_in`` release.
+are removed after the stated `remove_in` release.
 
 ## Contributing
 
@@ -63,11 +68,10 @@ Install with NumPy extras:
 poetry install -E numpy-backend
 ```
 
-The DOI above is a placeholder. After your first release, run `python tools/update_citation.py <doi>` to update this citation and CITATION.cff.
-
 ---
 
 ## Quick start (Python)
+
 ```python
 >>> from ssspx import Graph, SSSPSolver, SolverConfig
 >>> G = Graph.from_edges(4, [(0, 1, 1.0), (1, 2, 2.0), (0, 2, 4.0), (2, 3, 1.0)])
@@ -148,7 +152,7 @@ G_np = NumpyGraph.from_edges(3, edges)
 res = SSSPSolver(G_np, 0).solve()
 ```
 
-`NumpyGraph` is drop‑in because the solver only needs `G.n` and iteration over `G.adj[u] -> (v, w)`.
+`NumpyGraph` is drop-in because the solver only needs `G.n` and iteration over `G.adj[u] -> (v, w)`.
 
 ---
 
@@ -158,7 +162,7 @@ res = SSSPSolver(G_np, 0).solve()
 poetry run python -m ssspx.bench
 ```
 
-This uses a small default graph set; provide ``--sizes`` to benchmark custom
+This uses a small default graph set; provide `--sizes` to benchmark custom
 graphs. Treat results as sanity checks. For serious evaluations, pin seeds and
 sizes and run multiple trials.
 
@@ -200,39 +204,39 @@ track the upstream resolution.
 
 ---
 
-## Versioning, releases & archiving (optional)
-
-Configured for **semantic‑release** with Conventional Commits (Angular style). On pushes to `main`, it bumps the version, updates `CHANGELOG.md`, and creates a GitHub Release.
+## Versioning, releases & archiving
 
-To mint a DOI, enable the repository at [Zenodo](https://zenodo.org/account/settings/github/). After the first tagged release, Zenodo will archive it and assign a DOI. Replace the badge at the top of this README with the issued DOI.
+Configured for **semantic-release** with Conventional Commits (Angular style). On pushes to `main`, it bumps the version, updates `CHANGELOG.md`, and creates a GitHub Release.
 
-Guidance on publishing to PyPI and preparing a conda-forge feedstock lives in the [Publishing how-to](docs/howto/publish.md).
+Releases are archived on **Zenodo**. The latest release DOI is **[10.5281/zenodo.17381998](https://doi.org/10.5281/zenodo.17381998)** (badge at the top).
 
 Common prefixes: `feat:`, `fix:`, `perf:`, `refactor:`, `docs:`, `test:`, `chore:`.
 
 ---
 
 ## Cite this work
 
-If you use `ssspx` in academic work, please cite it using the metadata in
-[CITATION.cff](CITATION.cff) or the following BibTeX entry:
+If you use `ssspx` in academic work, please cite:
+
+**The algorithmic paper**
+
+> Duan, R., Mao, J., Mao, X., Shu, X., & Yin, L. (2025). *Breaking the Sorting Barrier for Directed Single-Source Shortest Paths.* arXiv:2504.17033.
+
+**This software**
 
 ```bibtex
 @software{ribeiro_ssspx_2025,
   author    = {Ribeiro, Diogo},
-  title     = {ssspx},
-  year      = {2024},
-  doi       = {10.5281/zenodo.0000000},
-  url       = {https://github.com/DiogoRibeiro7/ssspx},
+  title     = {ssspx — Production-grade Single-Source Shortest Paths (Python)},
+  year      = {2025},
+  doi       = {10.5281/zenodo.17381998},
+  url       = {https://github.com/DiogoRibeiro7/bmssp},
   publisher = {Zenodo}
 }
 ```
 
-The DOI above is a placeholder. After your first release, run `python tools/update_citation.py <doi>` to update this citation and CITATION.cff.
-
 ---
 
 ## License
 
 MIT — see `LICENSE`.
-

mkdocs.yml

@@ -1,5 +1,5 @@
 site_name: ssspx
-repo_url: https://github.com/DiogoRibeiro7/bmssp-backhup
+repo_url: https://github.com/DiogoRibeiro7/bmssp
 theme:
   name: material
 plugins:

pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "ssspx"
-version = "0.1.2"
+version = "0.1.3"
 description = "Deterministic SSSP (BMSSP-style) with optional constant-outdegree transform and switchable frontier"
 authors = ["Diogo Ribeiro <[email protected]>"]
 license = "MIT"