Recoverable Identifier
advisory
doi_compliance
recoverable_identifier
DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/lipics.itcs.2023.80.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80) 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
LIPIcs. Schloss Dagstuhl– Leibniz-Zentrum f ¨ur Informatik, 2023, 80:1–80:15.DOI: 10.4230/LIPIcs.ITCS.2023.80.URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80. [KS09] Marek Karpinski and Warren Schudy. “Linear time approximation schemes for the Gale- Berlekamp game and related minimization problems”. In:Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009, pp. 313–322. [KSTW01] Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P Williamson. “The approximability of constraint satisfaction problems”. In:SIAM Journal on Computing30.6 (2001), pp. 1863–1920. [KSW97] Sanjeev Khanna, Madhu Sudan, and David P Williamson. “A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction”. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. 1997, pp. 11–20. [KTW14] Subhash Khot, Madhur Tulsiani, and Pratik Worah. “A characterization of strong approxima- tion resistance”. In:Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03,
Evidence payload
{
"printed_excerpt": "LIPIcs. Schloss Dagstuhl\u2013 Leibniz-Zentrum f \u00a8ur Informatik, 2023, 80:1\u201380:15.DOI: 10.4230/LIPIcs.ITCS.2023.80.URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80. [KS09] Marek Karpinski and Warren Schudy. \u201cLinear ti",
"reconstructed_doi": "10.4230/lipics.itcs.2023.80.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80",
"ref_index": 8,
"resolved_title": null,
"verdict_class": "incontrovertible"
}