{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T11:58:36Z","timestamp":1709467116144},"reference-count":6,"publisher":"The Open Journal","issue":"81","license":[{"start":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T00:00:00Z","timestamp":1675036800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T00:00:00Z","timestamp":1675036800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T00:00:00Z","timestamp":1675036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JOSS"],"published-print":{"date-parts":[[2023,1,30]]},"DOI":"10.21105\/joss.04924","type":"journal-article","created":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T17:14:44Z","timestamp":1675098884000},"page":"4924","source":"Crossref","is-referenced-by-count":2,"title":["BellDiagonalQudits: A package for entanglement analyses\nof mixed maximally entangled qudits"],"prefix":"10.21105","volume":"8","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2352-3731","authenticated-orcid":false,"given":"Christopher","family":"Popp","sequence":"first","affiliation":[]}],"member":"8722","reference":[{"key":"PoppACS","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-16225-z","article-title":"Almost complete solution for the NP-hard\nseparability problem of bell diagonal qutrits","volume":"12","author":"Popp","year":"2022","unstructured":"Popp, C., & Hiesmayr, B. C.\n(2022). Almost complete solution for the NP-hard separability problem of\nbell diagonal qutrits. Scientific Reports, 12, 12472.\nhttps:\/\/doi.org\/10.1038\/s41598-022-16225-z","journal-title":"Scientific Reports"},{"key":"baumgartner","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/40\/28\/S03","article-title":"A special simplex in the state space for\nentangled qudits","volume":"40","author":"Baumgartner","year":"2007","unstructured":"Baumgartner, B., Hiesmayr, B. C.,\n& Narnhofer, H. (2007). A special simplex in the state space for\nentangled qudits. Journal of Physics A: Mathematical and Theoretical,\n40, 7919.\nhttps:\/\/doi.org\/10.1088\/1751-8113\/40\/28\/S03","journal-title":"Journal of Physics A: Mathematical and\nTheoretical"},{"key":"PoppBoundEntComparison","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2209.15267","article-title":"Bound entanglement of bell diagonal pairs of\nqutrits and ququarts: A comparison","author":"Popp","year":"2022","unstructured":"Popp, C., & Hiesmayr, B. C.\n(2022). Bound entanglement of bell diagonal pairs of qutrits and\nququarts: A comparison. arXiv.\nhttps:\/\/doi.org\/10.48550\/ARXIV.2209.15267"},{"issue":"24","key":"optim","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00615","article-title":"Optim: A mathematical optimization package\nfor Julia","volume":"3","author":"Mogensen","year":"2018","unstructured":"Mogensen, P. K., & Riseth, A. N.\n(2018). Optim: A mathematical optimization package for Julia. Journal of\nOpen Source Software, 3(24), 615.\nhttps:\/\/doi.org\/10.21105\/joss.00615","journal-title":"Journal of Open Source\nSoftware"},{"issue":"1","key":"lazysets","doi-asserted-by":"publisher","DOI":"10.21105\/jcon.00097","article-title":"LazySets.jl: Scalable symbolic-numeric set\ncomputations^*","volume":"1","author":"Forets","year":"2021","unstructured":"Forets, M., & Schilling, C.\n(2021). LazySets.jl: Scalable symbolic-numeric set computations^*.\nProceedings of the JuliaCon Conferences, 1(1), 97.\nhttps:\/\/doi.org\/10.21105\/jcon.00097","journal-title":"Proceedings of the JuliaCon\nConferences"},{"key":"hiesmayr","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-98523-6","article-title":"Free versus bound entanglement, a NP-hard\nproblem tackled by machine learning","volume":"11","author":"Hiesmayr","year":"2021","unstructured":"Hiesmayr, B. C. (2021). Free versus\nbound entanglement, a NP-hard problem tackled by machine learning.\nScientific Reports, 11.\nhttps:\/\/doi.org\/10.1038\/s41598-021-98523-6","journal-title":"Scientific Reports"}],"container-title":["Journal of Open Source Software"],"original-title":[],"link":[{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.04924.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T17:14:50Z","timestamp":1675098890000},"score":1,"resource":{"primary":{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.04924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,30]]},"references-count":6,"journal-issue":{"issue":"81","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["10.21105\/joss.04924"],"URL":"https:\/\/doi.org\/10.21105\/joss.04924","relation":{"has-review":[{"id-type":"uri","id":"https:\/\/github.com\/openjournals\/joss-reviews\/issues\/4924","asserted-by":"subject"}],"references":[{"id-type":"doi","id":"10.5281\/zenodo.7575767","asserted-by":"subject"}]},"ISSN":["2475-9066"],"issn-type":[{"value":"2475-9066","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,30]]}}}