Recoverable Identifier
advisory
doi_compliance
recoverable_identifier
DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611978322.19(cit.on) was visible in the surrounding text but could not be confirmed against doi.org as printed.
Paper page Integrity report arXiv Try DOI
Evidence text
Ed. by Yossi Azar and Debmalya Panigrahi. SIAM, 2025, pp. 616–640.doi: 10.1137/1.9781611978322.19(cit. on p. 3). [BO20] Leonid Barenboim and Gal Oren. “Distributed Backup Placement in One Round anditsApplicationstoMaximumMatchingApproximationandSelf-Stabilization”. In:3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. Ed. by Martin Farach-Colton and Inge Li Gørtz. SIAM, 2020, pp. 99–105.doi:10.1137/1.9781611976014.14(cit. on pp. 3, 4). [BR23] Étienne Bamas and Lars Rohwedder. “Better Trees for Santa Claus”. In:Proceed- ings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023. Ed. by Barna Saha and Rocco A. Servedio. ACM, 2023, pp. 1862–1875.doi:10.1145/3564246.3585174(cit. on p. 9). [BS06] Nikhil Bansal and Maxim Sviridenko. “The Santa Claus problem”. In:38th Annual ACM Symposium on Theory of Computing, (STOC 2006). ACM, 2006, pp. 31–40. doi:10.1145/1132516.1132522(cit. on pp. 3, 5, 6, 8, 17). [CCK09] Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna. “On Allocating Goods to Maximize Fairness”. In:50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, Atlanta, Georgia, USA, October 25-27, 2009. IEEE Computer Society, 2009, pp. 107–116.doi:10.1109/FOCS.2009.51(cit. on pp. 3, 9). [CG21] Yi-Jun Chang and Mohsen Ghaffari. “Strong-Diameter Network Decomposition”. In:PODC ’21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-
Evidence payload
{
"printed_excerpt": "Ed. by Yossi Azar and Debmalya Panigrahi. SIAM, 2025, pp. 616\u2013640.doi: 10.1137/1.9781611978322.19(cit. on p. 3). [BO20] Leonid Barenboim and Gal Oren. \u201cDistributed Backup Placement in One Round anditsApplicationstoMaximumMatchingApproximati",
"reconstructed_doi": "10.1137/1.9781611978322.19(cit.on",
"ref_index": 2,
"resolved_title": null,
"verdict_class": "incontrovertible"
}