{"id":"https://openalex.org/W7158996890","doi":"https://doi.org/10.48550/arxiv.2604.26311","title":"DreamProver: Evolving Transferable Lemma Libraries via a Wake-Sleep Theorem-Proving Agent","display_name":"DreamProver: Evolving Transferable Lemma Libraries via a Wake-Sleep Theorem-Proving Agent","publication_year":2026,"publication_date":"2026-04-29","ids":{"openalex":"https://openalex.org/W7158996890","doi":"https://doi.org/10.48550/arxiv.2604.26311"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.26311","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26311","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.26311","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049670343","display_name":"Youyuan Zhang","orcid":"https://orcid.org/0000-0001-8572-4910"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Youyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103325295","display_name":"Jialiang Sun","orcid":"https://orcid.org/0000-0002-3320-9068"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Jialiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113185077","display_name":"Hangrui Bi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bi, Hangrui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134895509","display_name":"Chuqin Geng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geng, Chuqin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101763103","display_name":"Wenjie Ma","orcid":"https://orcid.org/0000-0002-9134-1980"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Wenjie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134883914","display_name":"Zhaoyu Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Zhaoyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5059074509","display_name":"Xujie Si","orcid":"https://orcid.org/0000-0002-3739-2269"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Si, Xujie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10126","display_name":"Logic, programming, and type systems","score":0.8044000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.8044000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.02370000071823597,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T13523","display_name":"Mathematics, Computing, and Information Processing","score":0.015200000256299973,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.8808000087738037},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.746999979019165},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5863000154495239},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.46790000796318054},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.41839998960494995},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3253999948501587}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.8808000087738037},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.746999979019165},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5863000154495239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5030999779701233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4867999851703644},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.46790000796318054},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.41839998960494995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41690000891685486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3682999908924103},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31189998984336853},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.26311","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26311","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.26311","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26311","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":"Preprint"},"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":{"We":[0],"introduce":[1],"DreamProver,":[2],"an":[3,50],"agentic":[4],"framework":[5],"that":[6,108,123],"leverages":[7],"a":[8,64,101,131],"\"wake-sleep\"":[9],"program":[10],"induction":[11],"paradigm":[12],"to":[13,39,60,88,113],"discover":[14],"reusable":[15],"lemmas":[16,37,107],"for":[17],"formal":[18],"theorem":[19],"proving.":[20],"Existing":[21],"approaches":[22],"either":[23],"rely":[24],"on":[25],"fixed":[26],"lemma":[27,70],"libraries,":[28],"which":[29],"limit":[30],"adaptability,":[31],"or":[32],"synthesize":[33],"highly":[34],"specific":[35],"intermediate":[36],"tailored":[38],"individual":[40],"theorems,":[41],"thereby":[42],"lacking":[43],"generality.":[44],"DreamProver":[45,58,98,124],"addresses":[46],"this":[47,95],"gap":[48],"through":[49],"iterative":[51],"two-stage":[52],"process.":[53],"In":[54,77],"the":[55,68,78,92],"wake":[56],"stage,":[57,80],"attempts":[59],"prove":[61,114],"theorems":[62,116],"from":[63],"training":[65],"set":[66,103,133],"using":[67],"current":[69],"library":[71],"while":[72,137],"proposing":[73],"new":[74],"candidate":[75],"lemmas.":[76],"\"sleep\"":[79],"it":[81],"abstracts,":[82],"refines,":[83],"and":[84,90,143],"consolidates":[85],"these":[86],"candidates":[87],"compress":[89],"optimize":[91],"library.":[93],"Through":[94],"alternating":[96],"cycle,":[97],"progressively":[99],"evolves":[100],"compact":[102],"of":[104,134],"high-level,":[105],"transferable":[106],"can":[109],"be":[110],"effectively":[111],"used":[112],"unseen":[115],"in":[117],"related":[118],"domains.":[119],"Experimental":[120],"results":[121],"demonstrate":[122],"substantially":[125],"improves":[126],"proof":[127],"success":[128],"rates":[129],"across":[130],"diverse":[132],"mathematical":[135],"benchmarks,":[136],"also":[138],"producing":[139],"more":[140],"concise":[141],"proofs":[142],"reducing":[144],"computational":[145],"cost.":[146]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-01T00:00:00"}