if you're interested in building next-gen sandboxing for agents, have a ton of passion/ambition for low-level systems software (OS/hypervisor), and are itching to rewrite their internals for security/performance/whatever, don't miss this: https://t.co/YKvkoSDVAC
The statement of Lemma A.1 (“For every finite simple graph, a minimum ordinary drawing can be chosen polygonal, straight near every vertex and crossing, and without crossings between edges having a common endpoint.”) is already hard to read, but I had to give up on the proof.
For example, I don't know what the author means by “On each edge choose pairwise disjoint relative parameter neighborhoods, with disjoint closures, of its marked parameters, one-sided at its endpoints.” I also find “Suppose two edges vu, vw cross” problematic, since there is no explanation of what u, v, and w represent. There are numerous other flaws and the list of issues goes on...
Am I the only one disappointed by the quality of the mathematical exposition in some of their preprints?