Hello everyone,
Original pages didn't seem to change and when running the doWeb() function manually from the Scaffold's Browser tab, it works ok. Only the Tests tab-run ones fail. Details and repro instructions below. This is both on Z6 and the latest release of Z7. I haven't found any issues with "mathjax" in the main Zotero repo, or the connector one, so putting it up here to clarify.
Any ideas why this is happening and what could be done to fix it?
To reproduce:
1) Start Scaffold, open the "ePrint IACR" translator.
3) Observe a test failure with a diff posted below for the abstractNote field.
4) Open the same URL in the Browser tab and run the doWeb() function manually. Observe that the abstractNote text now matches the one the test expects, i.e., the extraction works as expected (or at least the same way it did previously).
Test result diff:
- "abstractNote": "We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorphic encryption (FHE) schemes that for security parameter \\secparam can evaluate any width-Ω(\\secparam) circuit with t gates in time t⋅polylog(\\secparam).\n\nTo get low overhead, we use the recent batch homomorphic evaluation techniques of Smart-Vercauteren and Brakerski-Gentry-Vaikuntanathan, who showed that homomorphic operations can be applied to \"packed\" ciphertexts that encrypt vectors of plaintext elements. In this work, we introduce permuting/routing techniques to move plaintext elements across\nthese vectors efficiently. Hence, we are able to implement general arithmetic circuit in a batched fashion without ever needing to \"unpack\" the plaintext vectors.\n\nWe also introduce some other optimizations that can speed up homomorphic evaluation in certain cases. For example, we show how to use the Frobenius map to raise plaintext elements to powers of~p at the \"cost\" of a linear operation."
+ "abstractNote": "We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorphic encryption (FHE) schemes that for security parameter can evaluate any width- circuit with gates in time .\n\nTo get low overhead, we use the recent batch homomorphic evaluation techniques of Smart-Vercauteren and Brakerski-Gentry-Vaikuntanathan, who showed that homomorphic operations can be applied to \"packed\" ciphertexts that encrypt vectors of plaintext elements. In this work, we introduce permuting/routing techniques to move plaintext elements across\nthese vectors efficiently. Hence, we are able to implement general arithmetic circuit in a batched fashion without ever needing to \"unpack\" the plaintext vectors.\n\nWe also introduce some other optimizations that can speed up homomorphic evaluation in certain cases. For example, we show how to use the Frobenius map to raise plaintext elements to powers of~ at the \"cost\" of a linear operation."
regards,
Alex