{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:59:57Z","timestamp":1777874397077,"version":"3.51.4"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (FWF)","doi-asserted-by":"publisher","award":["ESP666"],"award-info":[{"award-number":["ESP666"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,22]]},"DOI":"10.1109\/synasc69064.2025.00009","type":"proceedings-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T19:47:14Z","timestamp":1776800834000},"page":"11-12","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Arithmetic Circuits with (Linear) Polynomials"],"prefix":"10.1109","author":[{"given":"Daniela","family":"Kaufmann","sequence":"first","affiliation":[{"name":"TU Wien,Vienna,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.34727\/2024\/isbn.978-3-85448-065-5_32"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-90643-5_19"},{"key":"ref3","first-page":"14:1","article-title":"Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification","author":"Hofstadler","year":"2025","journal-title":"CP, ser. LIPIcs, vol. 340. Schloss Dagstuhl - LeibnizZentrum f\u00fcr Informatik"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116485"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.23919\/fmcad.2019.8894250"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.23919\/fmcad.2017.8102237"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240837"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/date.2018.8342263"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774587"},{"key":"ref10","volume-title":"Multiling - extracting linear relations from gr\u00f6bner bases for formal verification of and- inverter graphs (artifact)","author":"Kaufmann","year":"2025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465545"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1993.1051"},{"key":"ref13","volume-title":"Talisman - trusted algebraic linearization of sub-circuits with matrix-based algorithms using normalforms","author":"Daniela Kaufmann","year":"2025"}],"event":{"name":"2025 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","location":"Timisoara, Romania","start":{"date-parts":[[2025,9,22]]},"end":{"date-parts":[[2025,9,25]]}},"container-title":["2025 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11479419\/11479422\/11479508.pdf?arnumber=11479508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:45:27Z","timestamp":1777578327000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11479508\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/synasc69064.2025.00009","relation":{},"subject":[],"published":{"date-parts":[[2025,9,22]]}}}