{"id":"https://openalex.org/W7155197691","doi":"https://doi.org/10.48550/arxiv.2604.18587","title":"Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs","display_name":"Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7155197691","doi":"https://doi.org/10.48550/arxiv.2604.18587"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.18587","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18587","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.18587","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069358295","display_name":"G. Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Guchan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134216105","display_name":"Rui Tian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tian, Rui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134333714","display_name":"Hongning Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Hongning","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.6924999952316284,"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.6924999952316284,"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/T10142","display_name":"Formal Methods in Verification","score":0.04899999871850014,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.03530000150203705,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6927000284194946},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6861000061035156},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.5907999873161316},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5192999839782715},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.45820000767707825},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.44350001215934753},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42289999127388},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.41929998993873596}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7893000245094299},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6927000284194946},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6861000061035156},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.5907999873161316},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5536999702453613},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46939998865127563},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.45820000767707825},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.44350001215934753},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.41929998993873596},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.18587","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18587","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.18587","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18587","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":{"Large":[0],"language":[1],"models":[2,137],"(LLMs)":[3],"have":[4],"demonstrated":[5],"significant":[6],"potential":[7],"in":[8,40],"formal":[9,41],"theorem":[10],"proving,":[11],"yet":[12],"state-of-the-art":[13,126],"performance":[14,127],"often":[15],"necessitates":[16],"prohibitive":[17],"test-time":[18,140],"compute":[19],"via":[20],"massive":[21],"roll-outs":[22],"or":[23],"extended":[24],"context":[25],"windows.":[26],"In":[27],"this":[28,32,70],"work,":[29],"we":[30],"address":[31],"scalability":[33],"bottleneck":[34],"by":[35],"exploiting":[36],"an":[37],"informative":[38],"structure":[39],"verification:":[42],"the":[43,94,113],"observation":[44],"that":[45,68,83,108],"compilers":[46],"map":[47],"a":[48,56,65,99,143],"vast":[49],"space":[50],"of":[51,59,102,116],"diverse":[52],"proof":[53,77,103],"attempts":[54],"to":[55,72],"compact":[57],"set":[58],"structured":[60],"failure":[61],"modes.":[62],"We":[63,79],"introduce":[64],"learning-to-refine":[66],"framework":[67],"leverages":[69],"compression":[71],"perform":[73,80],"efficient":[74],"learning":[75],"and":[76,134],"exploration.":[78],"tree":[81],"search":[82],"corrects":[84],"errors":[85],"locally":[86],"conditioned":[87],"on":[88,128],"explicit":[89],"verifier":[90],"feedback,":[91],"thereby":[92],"circumventing":[93],"costs":[95],"associated":[96],"with":[97],"accumulating":[98],"long":[100],"history":[101],"attempts.":[104],"Extensive":[105],"evaluations":[106],"show":[107],"our":[109,123],"method":[110],"consistently":[111],"amplifies":[112],"reasoning":[114],"capabilities":[115],"base":[117],"provers":[118],"across":[119],"varying":[120],"scales.":[121],"Notably,":[122],"approach":[124],"achieves":[125],"PutnamBench":[129],"among":[130],"publicly":[131],"reported":[132],"$\\sim$8B":[133],"$\\sim$32B":[135],"parameter":[136],"under":[138],"comparable":[139],"budgets,":[141],"offering":[142],"scalable":[144],"paradigm":[145],"for":[146],"next-generation":[147],"verifier-guided":[148],"reasoning.":[149]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-23T00:00:00"}