{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:06:03Z","timestamp":1742983563979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_22","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"300-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Anti-stochastic Properties of\u00a0Unlabeled Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0103-3093","authenticated-orcid":false,"given":"Sergei","family":"Kiselev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8313-9598","authenticated-orcid":false,"given":"Andrey","family":"Kupavskii","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-1901","authenticated-orcid":false,"given":"Oleg","family":"Verbitsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8763-9533","authenticated-orcid":false,"given":"Maksim","family":"Zhukovskii","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L Babai","year":"1980","unstructured":"Babai, L., Erd\u0151s, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628\u2013635 (1980). https:\/\/doi.org\/10.1137\/0209047","journal-title":"SIAM J. Comput."},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press (2001). https:\/\/doi.org\/10.1017\/CBO9780511814068","DOI":"10.1017\/CBO9780511814068"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/15427951.2004.10129084","volume":"1","author":"B Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Riordan, O.: Coupling scale-free and classical random graphs. Internet Math. 1(2), 215\u2013225 (2003). https:\/\/doi.org\/10.1080\/15427951.2004.10129084","journal-title":"Internet Math."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2004.10129080","volume":"1","author":"B Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Math. 1(1), 1\u201335 (2003). https:\/\/doi.org\/10.1080\/15427951.2004.10129080","journal-title":"Internet Math."},{"key":"22_CR5","unstructured":"Cohen, G.D., Honkala, I.S., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland Mathematical Library, vol. 54. North-Holland (2005)"},{"key":"22_CR6","unstructured":"Firer, M.: Alternative metrics. In: Concise Encyclopedia of Coding Theory, pp. 555\u2013574. CRC Press (2021)"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0963548306007681","volume":"16","author":"AD Flaxman","year":"2007","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: Adversarial deletion in a scale-free random graph process. Comb. Probab. Comput. 16(2), 261\u2013270 (2007). https:\/\/doi.org\/10.1017\/S0963548306007681","journal-title":"Comb. Probab. Comput."},{"key":"22_CR8","volume-title":"Graphical Enumeration","author":"F Harary","year":"1973","unstructured":"Harary, F., Palmer, E.M.: Graphical Enumeration. Academic Press, New York-London (1973)"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S0269964800004058","volume":"9","author":"SJ Herschkorn","year":"1995","unstructured":"Herschkorn, S.J.: On the modular value and fractional part of a random variable. Probab. Eng. Inf. Sci. 9(4), 551\u2013562 (1995). https:\/\/doi.org\/10.1017\/S0269964800004058","journal-title":"Probab. Eng. Inf. Sci."},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, Hoboken (2000)"},{"issue":"4","key":"22_CR11","first-page":"261","volume":"24","author":"GA Kabatyanski\u012d","year":"1988","unstructured":"Kabatyanski\u012d, G.A., Panchenko, V.I.: Packings and coverings of the Hamming space by balls of unit radius. Problems Inform. Transm. 24(4), 261\u2013272 (1988)","journal-title":"Problems Inform. Transm."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Kiselev, S., Kupavskii, A., Verbitsky, O., Zhukovskii, M.: On anti-stochastic properties of unlabeled graphs. arXiv:2112.04395 (2021)","DOI":"10.1007\/978-3-031-15914-5_22"},{"key":"22_CR13","unstructured":"Liebenau, A., Wormald, N.: Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph. arXiv:1702.08373 (2018)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<97::AID-RSA1>3.0.CO;2-O","volume":"11","author":"BD McKay","year":"1997","unstructured":"McKay, B.D., Wormald, N.C.: The degree sequence of a random graph I. The models. Random Struct. Algorithms 11(2), 97\u2013117 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Schaeffer, S., Vald\u00e9s, V., Figols, J., Bachmann, I., Morales, F., Bustos-Jim\u00e9nez, J.: Characterization of robustness and resilience in graphs: a mini-review. J. Complex Netw. 9(2) (2021). https:\/\/doi.org\/10.1093\/comnet\/cnab018","DOI":"10.1093\/comnet\/cnab018"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:40:11Z","timestamp":1676968811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"0","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":"33% - 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","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":"12","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)"}}]}}