{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T04:24:35Z","timestamp":1773030275349,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Strategic Instructional Innovations Program at the University of Illinois Urbana-Champaign"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,18]]},"DOI":"10.1145\/3641555.3705221","type":"proceedings-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T18:54:26Z","timestamp":1739904866000},"page":"1415-1416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Novice Difficulties in Graph Layering for Algorithm Design"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1606-0484","authenticated-orcid":false,"given":"Hongxuan","family":"Chen","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9838-8028","authenticated-orcid":false,"given":"Katherine","family":"Braught","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9501-2295","authenticated-orcid":false,"given":"Geoffrey L.","family":"Herman","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5253-2282","authenticated-orcid":false,"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Thematic analysis","author":"Braun Virginia","unstructured":"Virginia Braun and Victoria Clarke. 2012. Thematic analysis.American Psychological Association."},{"key":"e_1_3_2_1_2_1","first-page":"70","article-title":"Calculating the Shortest Path Using Dijkstra's Algorithm","volume":"8","author":"Cevizci Bekir","year":"2018","unstructured":"Bekir Cevizci. 2018. Calculating the Shortest Path Using Dijkstra's Algorithm. Journal of Inquiry Based Activities, Vol. 8, 2 (2018), 70--85.","journal-title":"Journal of Inquiry Based Activities"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.26522\/brocked.v12i2.38"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2325296.2325308"},{"key":"e_1_3_2_1_5_1","volume-title":"Computer Science Curricula","author":"Kumar Amruth N.","year":"2023","unstructured":"Amruth N. Kumar, Rajendra K. Raj, Sherif G. Aly, Monica D. Anderson, Brett A. Becker, Richard L. Blumenthal, Eric Eaton, Susan L. Epstein, Michael Goldweber, Pankaj Jalote, Douglas Lea, Michael Oudshoorn, Marcelo Pias, Susan Reiser, Christian Servin, Rahul Simha, Titus Winters, and Qiao Xiang. 2024. Computer Science Curricula 2023. Association for Computing Machinery, New York, NY, USA."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/math7070572"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1930464.1930473"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/08993408.2022.2079865"},{"key":"e_1_3_2_1_9_1","volume-title":"The algorithm design manual","author":"Skiena Steven S","unstructured":"Steven S Skiena. 1998. The algorithm design manual. Vol. 2. Springer."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632620.3671096"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159450.3159528"}],"event":{"name":"SIGCSE TS 2025: The 56th ACM Technical Symposium on Computer Science Education","location":"Pittsburgh PA USA","acronym":"SIGCSE TS 2025","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 56th ACM Technical Symposium on Computer Science Education V. 2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3641555.3705221","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3641555.3705221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T10:09:06Z","timestamp":1755770946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3641555.3705221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":11,"alternative-id":["10.1145\/3641555.3705221","10.1145\/3641555"],"URL":"https:\/\/doi.org\/10.1145\/3641555.3705221","relation":{},"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"2025-02-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}