{"id":59,"date":"2024-04-02T13:32:47","date_gmt":"2024-04-02T17:32:47","guid":{"rendered":"https:\/\/sites.nd.edu\/justus-hibshman\/?page_id=59"},"modified":"2024-04-02T13:32:47","modified_gmt":"2024-04-02T17:32:47","slug":"featured-software","status":"publish","type":"page","link":"https:\/\/sites.nd.edu\/justus-hibshman\/featured-software\/","title":{"rendered":"Featured Software"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\"><a href=\"https:\/\/sites.nd.edu\/justus-hibshman\" data-type=\"link\" data-id=\"https:\/\/sites.nd.edu\/justus-hibshman\">&lt;&#8220;home&#8221; page&gt;<\/a><br><br>SCHENO &#8212; the SCHema-NOise decomposition scorer:<br><a href=\"https:\/\/github.com\/schemanoise\/SCHENO\">https:\/\/github.com\/schemanoise\/SCHENO<\/a><br><br>Handy C++ Wrappers for the Nauty and Traces Isomorphism Algorithms:<br><a href=\"https:\/\/github.com\/schemanoise\/Nauty_and_Traces\">https:\/\/github.com\/schemanoise\/Nauty_and_Traces<\/a><br><br>Subgraph-to-Subgraph Transitions &#8212; An interpretable model for graph structure and growth:<br><a href=\"https:\/\/github.com\/SST-Author\/Subgraph-Subgraph-Transitions\">https:\/\/github.com\/SST-Author\/Subgraph-Subgraph-Transitions<\/a><br><br>More misc. projects, including my graph grammar project &#8220;BUGGE,&#8221; are available at my personal github:<br><a href=\"https:\/\/github.com\/SteveWillowby\">https:\/\/github.com\/SteveWillowby<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>&lt;&#8220;home&#8221; page&gt; SCHENO &#8212; the SCHema-NOise decomposition scorer:https:\/\/github.com\/schemanoise\/SCHENO Handy C++ Wrappers for the Nauty and Traces Isomorphism Algorithms:https:\/\/github.com\/schemanoise\/Nauty_and_Traces Subgraph-to-Subgraph Transitions &#8212; An interpretable model for graph structure and growth:https:\/\/github.com\/SST-Author\/Subgraph-Subgraph-Transitions More misc. projects, including my graph grammar project &#8220;BUGGE,&#8221; are available at my personal github:https:\/\/github.com\/SteveWillowby<\/p>\n","protected":false},"author":3639,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-59","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/pages\/59","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/users\/3639"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/comments?post=59"}],"version-history":[{"count":2,"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/pages\/59\/revisions"}],"predecessor-version":[{"id":63,"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/pages\/59\/revisions\/63"}],"wp:attachment":[{"href":"https:\/\/sites.nd.edu\/justus-hibshman\/wp-json\/wp\/v2\/media?parent=59"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}