{"id":"https://openalex.org/W7106230461","doi":"https://doi.org/10.1007/978-3-032-11176-0_12","title":"Efficient Interpolation Beyond Cut-Free Proofs: Admissible Cuts and\u00a0Optimized Extraction","display_name":"Efficient Interpolation Beyond Cut-Free Proofs: Admissible Cuts and\u00a0Optimized Extraction","publication_year":2025,"publication_date":"2025-11-22","ids":{"openalex":"https://openalex.org/W7106230461","doi":"https://doi.org/10.1007/978-3-032-11176-0_12"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-11176-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11176-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Simon Corbard","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Simon Corbard","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, ENS Paris-Saclay, Gif-sur-Yvette, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, ENS Paris-Saclay, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":null,"display_name":"Anela Loli\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Anela Loli\u0107","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5560668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6053000092506409,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6053000092506409,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2676999866962433,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.07540000230073929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.826200008392334},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6862000226974487},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5831999778747559},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5648000240325928},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5598000288009644},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5329999923706055},{"id":"https://openalex.org/keywords/nearest-neighbor-interpolation","display_name":"Nearest-neighbor interpolation","score":0.41269999742507935},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3953999876976013}],"concepts":[{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.826200008392334},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6862000226974487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.623199999332428},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5831999778747559},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5648000240325928},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5598000288009644},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5329999923706055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46939998865127563},{"id":"https://openalex.org/C207214200","wikidata":"https://www.wikidata.org/wiki/Q4202129","display_name":"Nearest-neighbor interpolation","level":4,"score":0.41269999742507935},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33809998631477356},{"id":"https://openalex.org/C188325010","wikidata":"https://www.wikidata.org/wiki/Q861176","display_name":"Trilinear interpolation","level":4,"score":0.3003999888896942},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29750001430511475},{"id":"https://openalex.org/C119768884","wikidata":"https://www.wikidata.org/wiki/Q7597108","display_name":"Stairstep interpolation","level":4,"score":0.28369998931884766},{"id":"https://openalex.org/C88080468","wikidata":"https://www.wikidata.org/wiki/Q637347","display_name":"Polynomial interpolation","level":4,"score":0.2802000045776367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2773999869823456},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27639999985694885},{"id":"https://openalex.org/C49608258","wikidata":"https://www.wikidata.org/wiki/Q611705","display_name":"Bicubic interpolation","level":4,"score":0.273499995470047},{"id":"https://openalex.org/C203332170","wikidata":"https://www.wikidata.org/wiki/Q6334079","display_name":"Multivariate interpolation","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C31447003","wikidata":"https://www.wikidata.org/wiki/Q545002","display_name":"Spline interpolation","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C143542097","wikidata":"https://www.wikidata.org/wiki/Q3153554","display_name":"Inverse quadratic interpolation","level":5,"score":0.25589999556541443},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-11176-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11176-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W619146373","https://openalex.org/W1995025865","https://openalex.org/W2044632231","https://openalex.org/W2077585224","https://openalex.org/W2100738443","https://openalex.org/W2114633883","https://openalex.org/W2158086914","https://openalex.org/W2794392750","https://openalex.org/W2955326061","https://openalex.org/W3046430348","https://openalex.org/W3107513461","https://openalex.org/W4238292764","https://openalex.org/W4399036745","https://openalex.org/W4399056071","https://openalex.org/W4407414087"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-23T00:00:00"}