Suche
Ergebnisse
-
Halting the Solana Blockchain with Epsilon Stake
(2024)ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and NetworkingSolana is a blockchain protocol that has gained significant attention in the cryptocurrency community. This work examines Solana's consensus protocol and its reference implementation. In this paper we try to get an understanding of the Solana protocol. However, this is not so easy because the publicly available resources are insufficient to specify the details of the protocol. Moreover, the implementation has deviated in undocumented ways ...Conference Paper -
CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with GNNs
(2024)The Twelfth International Conference on Learning Representations (ICLR 2024)Graph Visualization, also known as Graph Drawing, aims to find geometric embeddings of graphs that optimize certain criteria. Stress is a widely used metric; stress is minimized when every pair of nodes is positioned at their shortest path distance. However, stress optimization presents computational challenges due to its inherent complexity and is usually solved using heuristics in practice. We introduce a scalable Graph Neural Network ...Conference Paper -
Provably Powerful Graph Neural Networks for Directed Multigraphs
(2024)Proceedings of the AAAI Conference on Artificial Intelligence ~ AAAI-24 Technical Tracks 10This paper analyses a set of simple adaptations that transform standard message-passing Graph Neural Networks (GNN) into provably powerful directed multigraph neural networks. The adaptations include multigraph port numbering, ego IDs, and reverse message passing. We prove that the combination of these theoretically enables the detection of any directed subgraph pattern. To validate the effectiveness of our proposed adaptations in practice, ...Conference Paper -
Fault-Tolerant Distributed Directories
(2024)Leibniz International Proceedings in Informatics (LIPIcs) ~ 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)Many fundamental distributed computing problems require coordinated access to a shared resource. A distributed directory is an overlay data structure on an asynchronous graph G that helps to access a shared token t. The directory supports three basic operations: publish, to initialize the directory, lookup, to read the contents of the token, and move, to get exclusive update access to the token. There are known directory schemes that ...Conference Paper -
Short Squeeze in DeFi Lending Market: Decentralization in Jeopardy?
(2024)Lecture Notes in Computer Science ~ Financial Cryptography and Data Security. FC 2023 International Workshops. FC 2023Anxiety levels in the Aave community spiked in November 2022 as Avi Eisenberg performed an attack on Aave. Eisenberg attempted to short the CRV token by using funds borrowed on the protocol to artificially deflate the value of CRV. While the attack was ultimately unsuccessful, it left the Aave community scared and even raised question marks regarding the feasibility of large lending platforms under decentralized governance. In this work, ...Conference Paper -
Randomized Algorithm for MPMD on Two Sources
(2024)Lecture Notes in Computer Science ~ Web and Internet Economics. WINE 2023A 3-competitive deterministic algorithm for the problem of min-cost perfect matching with delays on two sources (2-MPMD) was proposed years ago. However, whether randomness leads to a more competitive algorithm remains open. 2-MPMD is similar to the famous ski rental problem. Indeed, for both problems, we must choose between continuing to pay a repeating cost or a one-time fee. There is a memoryless randomized algorithm for ski rental ...Conference Paper -
Recovering Single-Crossing Preferences From Approval Ballots
(2024)Lecture Notes in Computer Science ~ Web and Internet Economics. WINE 2023An electorate with fully-ranked innate preferences casts approval votes over a finite set of alternatives. As a result, only partial information about the true preferences is revealed to the voting authorities. In an effort to understand the nature of the true preferences given only partial information, one might ask whether the unknown innate preferences could possibly be single-crossing. The existence of a polynomial time algorithm to ...Conference Paper -
Stable Dinner Party Seating Arrangements
(2024)Lecture Notes in Computer Science ~ Web and Internet Economics. WINE 2023A group of n agents with numerical preferences for each other are to be assigned to the n seats of a dining table. We study two natural topologies: circular (cycle) tables and panel (path) tables. For a given seating arrangement, an agent’s utility is the sum of their preference values towards their (at most two) direct neighbors. An arrangement is envy-free if no agent strictly prefers someone else’s seat, and it is stable if no two ...Conference Paper -
Breaking reCAPTCHAv2
(2024)Our work examines the efficacy of employing advanced machine learning methods to solve captchas from Google’s reCAPTCHAv2 system. We evaluate the effectiveness of automated systems in solving captchas by utilizing advanced YOLO models for image segmentation and classification. Our main result is that we can solve 100% of the captchas, while previous work only solved 68-71%. Furthermore, our findings suggest that there is no significant ...Conference Paper -
SURF: A Generalization Benchmark for GNNs Predicting Fluid Dynamics
(2024)Proceedings of Machine Learning Research ~ Proceedings of the Second Learning on Graphs Conference (LoG 2023)Simulating fluid dynamics is crucial for the design and development process, ranging from simple valves to complex turbomachinery. Accurately solving the underlying physical equations is computationally expensive. Therefore, learning-based solvers that model interactions on meshes have gained interest due to their promising speed-ups. However, it is unknown to what extent these models truly understand the underlying physical principles ...Conference Paper