{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:59Z","timestamp":1750221359215,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,3]]},"DOI":"10.1145\/3297001.3297044","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:45:18Z","timestamp":1547847918000},"page":"293-296","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Prufer-Sequence Based Representation of Large Graphs for Structural Encoding of Logic Networks"],"prefix":"10.1145","author":[{"given":"Manjari","family":"Pradhan","sequence":"first","affiliation":[{"name":"Indian Statistical Institute, Kolkata"}]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata"}]}],"member":"320","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000006"},{"key":"e_1_3_2_1_2_1","volume-title":"Brandenburg","author":"Biedl Therese","year":"2007","unstructured":"Therese Biedl and Franz J . Brandenburg . 2007 . Partitions of Graphs into Trees. In Proc. Graph Drawing . 430--439. Therese Biedl and Franz J. Brandenburg. 2007. Partitions of Graphs into Trees. In Proc. Graph Drawing. 430--439."},{"volume-title":"Proc. ISCAS. 1929--1934","author":"Brglez F.","key":"e_1_3_2_1_3_1","unstructured":"F. Brglez , D. Bryan , and K. Kozminski . 1989. Combinational profiles of sequential benchmark circuits . In Proc. ISCAS. 1929--1934 . F. Brglez, D. Bryan, and K. Kozminski. 1989. Combinational profiles of sequential benchmark circuits. In Proc. ISCAS. 1929--1934."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/54.867894"},{"volume-title":"Proc. HOST. 162--162","author":"Dai Y.","key":"e_1_3_2_1_7_1","unstructured":"Y. Dai and R. K. Braytont . 2017. Circuit recognition with deep learning . In Proc. HOST. 162--162 . Y. Dai and R. K. Braytont. 2017. Circuit recognition with deep learning. In Proc. HOST. 162--162."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. GECCO. 343--350","author":"Gottlieb Jens","year":"2001","unstructured":"Jens Gottlieb , Bryant A. Julstrom , G\u00fcnther R. Raidl , and Franz Rothlauf . 2001 . Pr\u00fcFer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search . In Proc. GECCO. 343--350 . Jens Gottlieb, Bryant A. Julstrom, G\u00fcnther R. Raidl, and Franz Rothlauf. 2001. Pr\u00fcFer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search. In Proc. GECCO. 343--350."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"volume-title":"Proc ISCAS. 1--4.","author":"Haaswijk W.","key":"e_1_3_2_1_10_1","unstructured":"W. Haaswijk , E. Collins , B. Seguin , M. Soeken , F. Kaplan , S. S\u00c3ijsstrunk , and G. De Micheli . 2018. Deep Learning for Logic Optimization Algorithms . In Proc ISCAS. 1--4. W. Haaswijk, E. Collins, B. Seguin, M. Soeken, F. Kaplan, S. S\u00c3ijsstrunk, and G. De Micheli. 2018. Deep Learning for Logic Optimization Algorithms. In Proc ISCAS. 1--4."},{"key":"e_1_3_2_1_11_1","volume-title":"Representation Learning on Graphs: Methods and Applications. CoRR abs\/1709.05584","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017. Representation Learning on Graphs: Methods and Applications. CoRR abs\/1709.05584 ( 2017 ). William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. CoRR abs\/1709.05584 (2017)."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. ICML. 2014--2023","author":"Niepert Mathias","year":"2016","unstructured":"Mathias Niepert , Mohamed Ahmed , and Konstantin Kutzkov . 2016 . Learning Convolutional Neural Networks for Graphs . In Proc. ICML. 2014--2023 . Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016. Learning Convolutional Neural Networks for Graphs. In Proc. ICML. 2014--2023."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_14_1","unstructured":"M. Pradhan B. B. Bhattacharya K. Chakrabarty and B. B. Bhattacharya. 2018. Predicting X-Sensitivity of Circuit-Inputs on Test-Coverage: A Machine-Learning Approach. IEEE TCAD (2018) (Accepted).  M. Pradhan B. B. Bhattacharya K. Chakrabarty and B. B. Bhattacharya. 2018. Predicting X-Sensitivity of Circuit-Inputs on Test-Coverage: A Machine-Learning Approach. IEEE TCAD (2018) (Accepted)."},{"key":"e_1_3_2_1_15_1","first-page":"742","article-title":"Neuer beweis eines satzes uber permutationen","volume":"27","author":"Prufer H.","year":"1918","unstructured":"H. Prufer . 1918 . Neuer beweis eines satzes uber permutationen . Arch. Math. Phys. 27 (1918), 742 -- 744 . H. Prufer. 1918. Neuer beweis eines satzes uber permutationen. Arch. Math. Phys. 27 (1918), 742--744.","journal-title":"Arch. Math. Phys."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/EEEI.2012.6377134"},{"key":"e_1_3_2_1_17_1","volume-title":"A Novel Neural Network Model Specified for Representing Logical Relations. CoRR abs\/1708.00580","author":"Wang Gang","year":"2017","unstructured":"Gang Wang . 2017. A Novel Neural Network Model Specified for Representing Logical Relations. CoRR abs\/1708.00580 ( 2017 ). Gang Wang. 2017. A Novel Neural Network Model Specified for Representing Logical Relations. CoRR abs\/1708.00580 (2017)."},{"key":"e_1_3_2_1_18_1","volume-title":"An Optimal Algorithm for Prufer Codes. JSEA 2 (01","author":"Wang Xiaodong","year":"2009","unstructured":"Xiaodong Wang , Lei Wang , and Yingjie Wu. 2009. An Optimal Algorithm for Prufer Codes. JSEA 2 (01 2009 ), 111--115. Xiaodong Wang, Lei Wang, and Yingjie Wu. 2009. An Optimal Algorithm for Prufer Codes. JSEA 2 (01 2009), 111--115."}],"event":{"name":"CoDS-COMAD '19: 6th ACM IKDD CoDS and 24th COMAD","acronym":"CoDS-COMAD '19","location":"Kolkata India"},"container-title":["Proceedings of the ACM India Joint International Conference on Data Science and Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297044","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297001.3297044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:14Z","timestamp":1750213574000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":18,"alternative-id":["10.1145\/3297001.3297044","10.1145\/3297001"],"URL":"https:\/\/doi.org\/10.1145\/3297001.3297044","relation":{},"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"2019-01-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}