{"id":"https://openalex.org/W7160928247","doi":"https://doi.org/10.48550/arxiv.2605.08996","title":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","display_name":"Machine Learning-Based Graph Simplification for Symbolic Accelerators","publication_year":2026,"publication_date":"2026-05-09","ids":{"openalex":"https://openalex.org/W7160928247","doi":"https://doi.org/10.48550/arxiv.2605.08996"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.08996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.08996","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135911689","display_name":"Tiffany Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Tiffany","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120057128","display_name":"Rye Stahle-Smith","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stahle-Smith, Rye","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130189804","display_name":"Darssan Eswaramoorthi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eswaramoorthi, Darssan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086678276","display_name":"Rasha Karakchi","orcid":"https://orcid.org/0009-0004-1391-0166"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karakchi, Rasha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.7124999761581421,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.7124999761581421,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.08980000019073486,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.021400000900030136,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.5720999836921692},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5266000032424927},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5051000118255615},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4921000003814697},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.4781999886035919},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4519999921321869},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43950000405311584},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4124000072479248}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8338000178337097},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.5720999836921692},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5187000036239624},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5051000118255615},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4921000003814697},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4519999921321869},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43950000405311584},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.412200003862381},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.34139999747276306},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.321399986743927},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C58013763","wikidata":"https://www.wikidata.org/wiki/Q5754574","display_name":"High-level synthesis","level":3,"score":0.28360000252723694},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.27559998631477356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2676999866962433},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.2660999894142151},{"id":"https://openalex.org/C55526617","wikidata":"https://www.wikidata.org/wiki/Q719375","display_name":"Operand","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C7366592","wikidata":"https://www.wikidata.org/wiki/Q1255620","display_name":"Dram","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.08996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.08996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph-based":[0],"accelerators":[1],"have":[2],"been":[3],"widely":[4],"adopted":[5],"in":[6,94],"symbolic":[7],"data":[8],"processing":[9],"applications":[10],"such":[11],"as":[12],"genomics,":[13],"cybersecurity,":[14],"and":[15,27,59,66,70,96,111,119],"artificial":[16],"intelligence.":[17],"However,":[18],"these":[19],"systems":[20],"often":[21],"suffer":[22],"from":[23,30,55],"excessive":[24],"memory":[25],"usage":[26,86],"inefficiencies":[28],"stemming":[29],"redundant":[31],"graph":[32,57],"structures.":[33],"We":[34],"present":[35],"AutoSlim,":[36],"a":[37,60,75,102],"machine":[38],"learning-based":[39],"framework":[40,100],"that":[41],"leverages":[42],"data-driven":[43],"methods":[44],"to":[45,74,89,105],"prune":[46],"automata":[47],"graphs":[48],"for":[49,115],"hardware":[50,117],"accelerators.":[51],"Using":[52],"features":[53],"extracted":[54],"prior":[56],"executions":[58],"Random":[61],"Forest":[62],"classifier,":[63],"AutoSlim":[64,82],"identifies":[65],"removes":[67],"low-impact":[68],"nodes":[69],"edges.":[71],"When":[72],"applied":[73],"Non-deterministic":[76],"Finite":[77],"Automata":[78],"overlay":[79],"architecture":[80],"(NAPOLY+),":[81],"reduces":[83],"FPGA":[84],"resource":[85],"by":[87],"up":[88],"40%,":[90],"with":[91],"corresponding":[92],"improvements":[93],"throughput":[95],"power":[97],"efficiency.":[98],"The":[99],"includes":[101],"verification":[103],"step":[104],"ensure":[106],"functional":[107],"equivalence":[108],"after":[109],"pruning":[110],"suggests":[112],"promising":[113],"directions":[114],"both":[116],"optimization":[118],"security.":[120]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}