rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes.: papers linking to it

Zenodo · Software · 2020 · archives github.com/rileyjmurray/sageopt · doi.org/10.5281/zenodo.4017991

← Code and data repositories cited in research papers

Research papers in the 480 tracked journals that link to rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes. (https://doi.org/10.5281/zenodo.4017991), read from their Crossref records: by year, category and journal, the family tree of papers building on one another, and the linked repositories derived from it or that it derives from.

Key findings#

3 papers in the tracked journals link to the Zenodo dataset rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes. in their Crossref records, the first in 2020; most of them (1) in 2022.
By category: Operations Research (3); the journals with the most are Mathematical Programming Computation (2) and Mathematical Programming (1).
2 of the papers build on one another: a later paper cites an earlier one that also links rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes..

By year#

20202022

Papers linking to rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes. by publication year
Year	Papers
2020	1
2021	1
2022	1

Journals#

Journals whose papers link to rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes. most
Journal	Papers
Mathematical Programming Computation	2
Mathematical Programming	1

Family tree#

Each paper sits under the earlier paper it builds on; papers that cite no other paper here start a branch of their own.

Signomial and polynomial optimization via relative entropy and partial dualization Mathematical Programming Computation, 2020
- Sublinear circuits and the constrained signomial nonnegativity problem Mathematical Programming, 2022 — cites the paper above

Papers linking to rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes., most cited first
Published	Title	Journal	Authors	Citations	Link
2020-10-14	Signomial and polynomial optimization via relative entropy and partial dualization	Mathematical Programming Computation	Riley Murray, Venkat Chandrasekaran, Adam Wierman	34	cites it
2022-02-09	Sublinear circuits and the constrained signomial nonnegativity problem	Mathematical Programming	Riley Murray, Helen Naumann, Thorsten Theobald	8	cites it
2021-02-09	Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization	Mathematical Programming Computation	Riley Murray, Venkat Chandrasekaran, Adam Wierman	1	cites it

How this is measured#

Links are read from each paper's Crossref record as its publisher deposited it: the URLs and repository DOIs in its reference list (the software and data it cites) and its supplementary links (“is-supplemented-by”: its own code or data). A paper that gives its code only in the text, a footnote or a data availability statement is not counted, and some publishers deposit reference lists without their URLs, so every count here is a lower bound. Repository details come from the GitHub REST API (stars, forks, and the repository a fork was made from), the Hugging Face Hub API (likes, downloads, and the base model a model was derived from) and DataCite (Zenodo and other data DOIs, and the GitHub release a Zenodo record archives), read again every month.

Cite this page

Scholar4AI. (2026). rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes.: papers linking to it. Journal and Conference Research Rankings. Retrieved November 3, 2026, from https://scholar4ai.com/code/zenodo-4017991

@misc{scholar4ai-code-zenodo-4017991,
  author = {{Scholar4AI}},
  title = {rileyjmurray/sageopt: automatic dualization, options for ordinary sage, bugfixes.: papers linking to it},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/code/zenodo-4017991}},
  urldate = {2026-11-03},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).