{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:32:12Z","timestamp":1726101132229},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_31","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"387-395","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Running Experiments with Confidence and Sanity"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7212-6476","authenticated-orcid":false,"given":"Martin","family":"Aum\u00fcller","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2783-0218","authenticated-orcid":false,"given":"Matteo","family":"Ceccarello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"31_CR1","unstructured":"Arango, C., Dernat, R., Sanabria, J.: Performance evaluation of container-based virtualization for high performance computing environments. arXiv:1709.10140 (2017)"},{"key":"31_CR2","unstructured":"Aum\u00fcller, M., Christiani, T., Pagh, R., Vesterli, M.: PUFFINN: parameterless and universally fast finding of nearest neighbors. In: ESA 2019 (2019)"},{"volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","year":"2010","key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.): Experimental Methods for the Analysis of Optimization Algorithms. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9","DOI":"10.1007\/978-3-642-02538-9"},{"key":"31_CR4","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-33206-7_10","volume-title":"Theory and Principled Methods for the Design of Metaheuristics","author":"T Bartz-Beielstein","year":"2014","unstructured":"Bartz-Beielstein, T., Preuss, M.: Experimental analysis of optimization algorithms: tuning and beyond. In: Borenstein, Y., Moraglio, A. (eds.) Theory and Principled Methods for the Design of Metaheuristics. NCS, pp. 205\u2013245. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-33206-7_10"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2723872.2723882","volume":"49","author":"C Boettiger","year":"2015","unstructured":"Boettiger, C.: An introduction to docker for reproducible research. Oper. Syst. Rev. 49(1), 71\u201379 (2015)","journal-title":"Oper. Syst. Rev."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44503-X_20","volume-title":"Database Theory \u2014 ICDT 2001","author":"P Buneman","year":"2001","unstructured":"Buneman, P., Khanna, S., Wang-Chiew, T.: Why and where: a characterization of data provenance. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 316\u2013330. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44503-X_20"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Callahan, S.P., Freire, J., Santos, E., Scheidegger, C.E., Silva, C.T., Vo, H.T.: VisTrails: visualization meets data management. In: SIGMOD 2006 (2006)","DOI":"10.1145\/1142473.1142574"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2812803","volume":"59","author":"CS Collberg","year":"2016","unstructured":"Collberg, C.S., Proebsting, T.A.: Repeatability in computer systems research. Commun. ACM 59, 62\u201369 (2016)","journal-title":"Commun. ACM"},{"key":"31_CR9","unstructured":"Davison, A.P., Mattioni, M., Samarkanov, D., Telenczuk, B.: Sumatra: a toolkit for reproducible research. In: Implementing Reproducible Research. CRC Press (2014)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36383-1","volume-title":"Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software","year":"2002","unstructured":"Fleischer, R., Moret, B., Schmidt, E.M. (eds.): Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software. LNCS, vol. 2547. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36383-1"},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MCSE.2012.36","volume":"14","author":"PJ Guo","year":"2012","unstructured":"Guo, P.J.: CDE: a tool for creating portable experimental software packages. Comput. Sci. Eng. 14(4), 32\u201335 (2012)","journal-title":"Comput. Sci. Eng."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Hutson, M.: Artificial intelligence faces reproducibility crisis. 359(6377) (2018)","DOI":"10.1126\/science.359.6377.725"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Kitzes, J., Turek, D., Deniz, F.: The Practice of Reproducible Research: Case Studies and Lessons from the Data-Intensive Sciences. Univ of California Press (2017)","DOI":"10.1525\/9780520967779"},{"issue":"5","key":"31_CR14","doi-asserted-by":"publisher","first-page":"e0177459","DOI":"10.1371\/journal.pone.0177459","volume":"12","author":"GM Kurtzer","year":"2017","unstructured":"Kurtzer, G.M., Sochat, V., Bauer, M.W.: Singularity: scientific containers for mobility of compute. PLoS One 12(5), e0177459 (2017)","journal-title":"PLoS One"},{"issue":"11","key":"31_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1297797.1297818","volume":"50","author":"CC McGeoch","year":"2007","unstructured":"McGeoch, C.C.: Experimental algorithmics. Commun. ACM 50(11), 27\u201331 (2007)","journal-title":"Commun. ACM"},{"key":"31_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_135","volume-title":"Encyclopedia of Algorithms","author":"C McGeoch","year":"2008","unstructured":"McGeoch, C.: Experimental methods for algorithm analysis. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-30162-4_135"},{"issue":"5","key":"31_CR17","first-page":"434","volume":"7","author":"BME Moret","year":"2001","unstructured":"Moret, B.M.E., Shapiro, H.D.: Algorithms and experiments: the new (and old) methodology. J. UCS 7(5), 434\u2013446 (2001)","journal-title":"J. UCS"},{"issue":"8","key":"31_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.21105\/joss.00107","volume":"1","author":"R Rampin","year":"2016","unstructured":"Rampin, R., Chirigati, F., Shasha, D.E., Freire, J., Steeves, V.: ReproZip: the reproducibility packer. J. Open Source Softw. 1(8), 107 (2016)","journal-title":"J. Open Source Softw."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Stodden, V., Leisch, F., Peng, R.D.: Implementing Reproducible Research. CRC Press (2014)","DOI":"10.1201\/b16868"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:46:25Z","timestamp":1710251185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-030-60936-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}
