@inproceedings{18912,
  abstract     = {This paper presents a computational method for automatically creating fabricable 3D wire sculptures from various input modalities, including 3D models, images, and even text. There are several challenges to wire art creation. For example, artists must express the desired visual as a sparse wire representation. It is also difficult to manually bend wires in the air without guidance to fabricate the designed 3D curves. Our workflow solves these challenges by using two core techniques. First, we present an algorithm that automatically generates a fabricable 3D curve representation of the target based on a loss function that measures the semantic distance between the rendered curve and the target. The loss function can be defined using different pre-trained vision-language neural networks to generate wire art from different input types. The loss function is then optimized using differentiable rendering specifically targeting 3D parametric curves. Our method can incorporate various fabrication constraints on the wire as additional regularization terms in the optimization process. Second, we present an algorithm to generate a 3D printable jig structure that can be used to fabricate the generated wire path. The major challenge in the jig generation stems from the design of an intersection-free surface mesh for 3D printing, which we address with our inflation algorithm. The experimental results indicate that our method can handle a wider range of input types and can produce physically fabricable wire shapes compared to previous wire generation methods. Various wire arts have been fabricated using our 3D-printed jig to demonstrate its effectiveness in 3D wire bending.},
  author       = {Tojo, Kenji and Shamir, Ariel and Bickel, Bernd and Umetani, Nobuyuki},
  booktitle    = {SIGGRAPH '24: ACM SIGGRAPH 2024 Conference Papers},
  isbn         = {9798400705250},
  location     = {Denver, CO, United States},
  publisher    = {ACM},
  title        = {{Fabricable 3D wire art}},
  doi          = {10.1145/3641519.3657453},
  year         = {2024},
}

@inproceedings{18913,
  abstract     = {With the proliferation of blockchain technology in high-value sectors, consensus protocols are becoming critical infrastructures. The rapid innovation cycle in Byzantine fault tolerant (BFT) consensus protocols has culminated in HotStuff, which provides linear message complexity in the partially synchronous setting. To achieve this, HotStuff leverages a leader that collects, aggregates, and broadcasts the messages of other validators. This paper analyzes the security implications of such approaches in practice, from the perspective of liveness and availability.
By implementing attacks in a globally-distributed testbed, we show that state-of-the-art leader-based protocols are vulnerable to denial-of-service (DoS) attacks on the leader. Our attacks, demonstrated on committees of up to 64 validators, manage to disrupt liveness within seconds, using only a few tens of Mbps of attack bandwidth per validator. Crucially, the cost and effectiveness of the attacks are independent of the committee size. Based on the outcome of these experiments, we then propose and test effective mitigations. Our findings show that advancements in both protocol design and network-layer defenses can greatly improve the practical resilience of BFT consensus protocols.},
  author       = {Giuliari, Giacomo and Sonnino, Alberto and Frei, Marc and Streun, Fabio and Kokoris Kogias, Eleftherios and Perrig, Adrian},
  booktitle    = {Proceedings of the 19th ACM Asia Conference on Computer and Communications Security},
  isbn         = {9798400704826},
  location     = {Singapore, Singapore},
  pages        = {1345--1360},
  publisher    = {ACM},
  title        = {{An empirical study of consensus protocols’ DoS resilience}},
  doi          = {10.1145/3634737.3656997},
  year         = {2024},
}

@article{18919,
  abstract     = {The integration of theory and experiment makes possible tracking the slow evolution of a photodoped Mott insulator to a distinct non-equilibrium metallic phase under the influence of electron-lattice coupling.},
  author       = {Baykusheva, Denitsa Rangelova},
  issn         = {1745-2481},
  journal      = {Nature Physics},
  number       = {5},
  pages        = {684--685},
  publisher    = {Springer Nature},
  title        = {{Through the slopes of a light-induced phase transition}},
  doi          = {10.1038/s41567-024-02401-7},
  volume       = {20},
  year         = {2024},
}

@article{18920,
  abstract     = {The globally distributed marine alga Emiliania huxleyi has cooling effect on the Earth’s climate. The population density of E. huxleyi is restricted by Nucleocytoviricota viruses, including E. huxleyi virus 201 (EhV-201). Despite the impact of E. huxleyi viruses on the climate, there is limited information about their structure and replication. Here, we show that the dsDNA genome inside the EhV-201 virion is protected by an inner membrane, capsid, and outer membrane. EhV-201 virions infect E. huxleyi by using fivefold vertices to bind to and fuse the virus’ inner membrane with the cell plasma membrane. Progeny virions assemble in the cytoplasm at the surface of endoplasmic reticulum–derived membrane segments. Genome packaging initiates synchronously with the capsid assembly and completes through an aperture in the forming capsid. The genome-filled capsids acquire an outer membrane by budding into intracellular vesicles. EhV-201 infection induces a loss of surface protective layers from E. huxleyi cells, which enables the continuous release of virions by exocytosis.},
  author       = {Homola, Miroslav and Büttner, Renate Carina and Füzik, Tibor and Křepelka, Pavel and Holbová, Radka and Nováček, Jiří and Chaillet, Marten L. and Žák, Jakub and Grybchuk, Danyil and Förster, Friedrich and Wilson, William H. and Schroeder, Declan C. and Plevka, Pavel},
  issn         = {2375-2548},
  journal      = {Science Advances},
  number       = {15},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Structure and replication cycle of a virus infecting climate-modulating alga Emiliania huxleyi}},
  doi          = {10.1126/sciadv.adk1954},
  volume       = {10},
  year         = {2024},
}

@inproceedings{18922,
  abstract     = {Let G be a directed graph with m edges and n vertices. We present a deterministic linear-time algorithm for computing the 3-edge-connected components of G. This is a significant improvement over the previous best bound by Georgiadis et al. [SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel characterization of 2-edge cuts in directed graphs and on a new technique that exploits the concept of divergent spanning trees and 2-connectivity-light graphs, and requires a careful modification of the minset-poset technique of Gabow [TALG 2016]. As a side result, our new technique yields also an oracle for providing in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected. The oracle uses space O(n) and can be built in O(mlog n) time: given two query vertices, it determines in constant time whether they are 3-edge-connected, or provides a k-edge cut, with k≤ 2, that separates them.},
  author       = {Georgiadis, Loukas and Italiano, Giuseppe F. and Kosinas, Evangelos},
  booktitle    = {65th Annual Symposium on Foundations of Computer Science},
  isbn         = {9798331516741},
  location     = {Chicago, IL, United States},
  pages        = {62--85},
  publisher    = {IEEE},
  title        = {{Computing the 3-edge-connected components of directed graphs in linear time}},
  doi          = {10.1109/focs61266.2024.00015},
  year         = {2024},
}

@inproceedings{18925,
  abstract     = {Given the increasingly stringent requirements on the performance and efficiency of communication networks, over the last years, great efforts have been made to render networks more flexible and programmable. In particular, modern networks support a flexible rerouting of flows, e.g., depending on the dynamically changing traffic or network conditions. However, the underlying algorithmic problems are still not well-understood today.In this paper, we revisit the k-Network Flow Update problem that asks for a schedule to reroute k unsplittable flows from their current paths to the given new paths, in a congestion-free manner in a capacitated network. We show that the problem is already NP-hard for three acyclic flows on simple directed graphs. Our main contribution is an efficient algorithm for sparse networks; specifically the algorithm is fixed parameter tractable in the number of flows and the treewidth of a graph that is the union of all flows. Our results also settle the open complexity question in the literature.},
  author       = {Ceylan, Esra and Chatterjee, Krishnendu and Schmid, Stefan and Svoboda, Jakub},
  booktitle    = {NOMS 2024-2024 IEEE Network Operations and Management Symposium},
  isbn         = {9798350327946},
  issn         = {2374-9709},
  location     = {Seoul, Republic of Korea},
  publisher    = {IEEE},
  title        = {{Congestion-free rerouting of network flows: Hardness and an FPT algorithm}},
  doi          = {10.1109/noms59830.2024.10575579},
  year         = {2024},
}

@article{18926,
  abstract     = {We study weak solutions to mean curvature flow satisfying Young’s angle condition for general contact angles α ∈ (0, π). First, we construct BV solutions by using the Allen-Cahn approximation with boundary contact energy as proposed by Owen and Sternberg. Second, we prove the weak-strong uniqueness and stability for this solution concept. The main ingredient for both results is a relative energy, which can also be interpreted as a tilt excess. },
  author       = {Hensel, Sebastian and Laux, Tim},
  issn         = {0022-2518},
  journal      = {Indiana University Mathematics Journal},
  number       = {1},
  pages        = {111--148},
  publisher    = {Indiana University Mathematics Journal},
  title        = {{BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness}},
  doi          = {10.1512/iumj.2024.73.9701},
  volume       = {73},
  year         = {2024},
}

@inproceedings{18928,
  abstract     = {Algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike online algorithms, the goal in dynamic data structures is to maintain the solution efficiently with every update.
We investigate three natural models of prediction: (1) δ-accurate predictions where each predicted request matches the true request with probability δ, (2) list-accurate predictions where a true request comes from a list of possible requests, and (3) bounded delay predictions where the true requests are a permutation of the predicted requests. We give general reductions among the prediction models, showing that bounded delay is the strongest prediction model, followed by list-accurate, and δ-accurate.
Further, we identify two broad problem classes based on lower bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show that locally correctable dynamic problems have strong conditional lower bounds for list-accurate predictions that are equivalent to the non-prediction setting, unless list-accurate predictions are perfect. Moreover, we show that locally reducible dynamic problems have time complexity that degrades gracefully with the quality of bounded delay predictions. We categorize problems with known OMv lower bounds accordingly and give several upper bounds in the delay model that show that our lower bounds are almost tight.
We note that concurrent work by v.d.Brand et al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic graph algorithms with predictions, but their work is mostly focused on showing upper bounds.},
  author       = {Henzinger, Monika H and Saha, Barna and Seybold, Martin P. and Ye, Christopher},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference},
  isbn         = {9783959773096},
  issn         = {1868-8969},
  location     = {Berkeley, CA, United States},
  pages        = {62:1--62:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{On the complexity of algorithms with predictions for dynamic graph problems}},
  doi          = {10.4230/LIPIcs.ITCS.2024.62},
  volume       = {287},
  year         = {2024},
}

@article{18934,
  abstract     = {The assembly of biomolecular condensate in eukaryotic cells and the accumulation of amyloid deposits in neurons are processes involving the nucleation and growth (NAG) of new protein phases. To therapeutically target protein phase separation, drug candidates are tested in in vitro assays that monitor the increase in the mass or size of the new phase. Limited mechanistic insight is, however, provided if empirical or untestable kinetic models are fitted to these progress curves. Here we present the web server NAGPKin that quantifies NAG rates using mass-based or size-based progress curves as the input data. A report is generated containing the fitted NAG parameters and elucidating the phase separation mechanisms at play. The NAG parameters can be used to predict particle size distributions of, for example, protein droplets formed by liquid-liquid phase separation (LLPS) or amyloid fibrils formed by protein aggregation. Because minimal intervention is required from the user, NAGPKin is a good platform for standardized reporting of LLPS and protein self-assembly data. NAGPKin is useful for drug discovery as well as for fundamental studies on protein phase separation. NAGPKin is freely available (no login required) at https://nagpkin.i3s.up.pt .},
  author       = {Sárkány, Zsuzsa and Figueiredo, Francisco and Macedo-Ribeiro, Sandra and Martins, Pedro M.},
  issn         = {1939-4586},
  journal      = {Molecular Biology of the Cell},
  number       = {3},
  publisher    = {American Society for Cell Biology},
  title        = {{NAGPKin: Nucleation-and-growth parameters from the kinetics of protein phase separation}},
  doi          = {10.1091/mbc.e23-07-0289},
  volume       = {35},
  year         = {2024},
}

@article{18937,
  abstract     = {A detailed structural, magnetic as well as dielectric dynamics study is carried out to investigate the influence of Bi3+ on YCrO3. All the samples crystalize in orthorhombic structure with Pnma symmetry and the grains are mostly stretched with Bi. A coexisting tunable fraction of both antiferromagnetic (AFM) and weak ferromagnetic (WFM) phases is acquired by the system down to Low-T. An abnormal negative magnetization in zero field is correlated to the competition among AFM and WFM phases. Maximum magnetization decreases while the coercivity first increases and then decreases with Bi is correlated to the competing effect between the local deformation and Cr–O–Cr exchange interaction. The magnetodielectric coupling with improved permittivity might be associated with the 6s2 lone pair electron of Bi3+. Furthermore, ac-conductivity increases with a decrease in activation energy (0.27–0.11 eV), is explained in the framework of structural model and charge carrier hopping between Cr3+ and Cr4+ ions.},
  author       = {Ray, Sujata Kumari and Pati, Anupama and Sahoo, Payala and Sahoo, A.K. and Singh, Saurabh and Takeuchi, Tsunehiro and Dash, S.},
  issn         = {0921-4526},
  journal      = {Physica B: Condensed Matter},
  publisher    = {Elsevier},
  title        = {{Tunable magnetoelectronic properties in Bi3+ substituted YCrO3}},
  doi          = {10.1016/j.physb.2024.416018},
  volume       = {685},
  year         = {2024},
}

@article{18938,
  abstract     = {The synthesis of proteins as encoded in the genome depends critically on translational fidelity. Nevertheless, errors inevitably occur, and those that result in reading frame shifts are particularly consequential because the resulting polypeptides are typically nonfunctional. Despite the generally maladaptive impact of such errors, the proper decoding of certain mRNAs, including many viral mRNAs, depends on a process known as programmed ribosomal frameshifting. The fact that these programmed events, commonly involving a shift to the –1 frame, occur at specific evolutionarily optimized “slippery” sites has facilitated mechanistic investigation. By contrast, less is known about the scope and nature of error (i.e., nonprogrammed) frameshifting. Here, we examine error frameshifting by monitoring spontaneous frameshift events that suppress the effects of single base pair deletions affecting two unrelated test proteins. To map the precise sites of frameshifting, we developed a targeted mass spectrometry–based method called “translational tiling proteomics” for interrogating the full set of possible –1 slippage events that could produce the observed frameshift suppression. Surprisingly, such events occur at many sites along the transcripts, involving up to one half of the available codons. Only a subset of these resembled canonical “slippery” sites, implicating alternative mechanisms potentially involving noncognate mispairing events. Additionally, the aggregate frequency of these events (ranging from 1 to 10% in our test cases) was higher than we might have anticipated. Our findings point to an unexpected degree of mechanistic diversity among ribosomal frameshifting events and suggest that frameshifted products may contribute more significantly to the proteome than generally assumed.},
  author       = {Springstein, Benjamin L and Paulo, Joao A. and Park, Hankum and Henry, Kemardo and Fleming, Eleanor and Feder, Zoë and Harper, J. Wade and Hochschild, Ann},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {6},
  publisher    = {National Academy of Sciences},
  title        = {{Systematic analysis of nonprogrammed frameshift suppression in E.coli via translational tiling proteomics}},
  doi          = {10.1073/pnas.2317453121},
  volume       = {121},
  year         = {2024},
}

@article{18940,
  abstract     = {BMP signaling has a conserved function in patterning the dorsal-ventral body axis in Bilateria and the directive axis in anthozoan cnidarians. So far, cnidarian studies have focused on the role of different BMP signaling network components in regulating pSMAD1/5 gradient formation. Much less is known about the target genes downstream of BMP signaling. To address this, we generated a genome-wide list of direct pSMAD1/5 target genes in the anthozoan <jats:italic>Nematostella vectensis</jats:italic>, several of which were conserved in <jats:italic>Drosophila</jats:italic> and <jats:italic>Xenopus</jats:italic>. Our ChIP-seq analysis revealed that many of the regulatory molecules with documented bilaterally symmetric expression in <jats:italic>Nematostella</jats:italic> are directly controlled by BMP signaling. We identified several so far uncharacterized BMP-dependent transcription factors and signaling molecules, whose bilaterally symmetric expression may be indicative of their involvement in secondary axis patterning. One of these molecules is <jats:italic>zswim4-6</jats:italic>, which encodes a novel nuclear protein that can modulate the pSMAD1/5 gradient and potentially promote BMP-dependent gene repression.},
  author       = {Knabl, Paul and Schauer, Alexandra and Pomreinke, Autumn P and Zimmermann, Bob and Rogers, Katherine W and Čapek, Daniel and Müller, Patrick and Genikhovich, Grigory},
  issn         = {2050-084X},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Analysis of SMAD1/5 target genes in a sea anemone reveals ZSWIM4-6 as a novel BMP signaling modulator}},
  doi          = {10.7554/elife.80803},
  volume       = {13},
  year         = {2024},
}

@article{18944,
  abstract     = {Understanding connectivity patterns exhibited by endangered species living in fragmented habitats is fundamental to improving management and conservation actions. Such improvements can be particularly pressing at the trailing edges of these habitats, where populations are facing the greatest challenges from climate change, and appear even more crucial if the species is commercially harvested. Seascape genetics have been increasingly used to meet these needs. In this study, we examined connectivity patterns among 32 populations of the oarweed kelp <jats:italic>Lam</jats:italic><jats:italic>inaria digitata</jats:italic> located at the species’ southern range limit. The distance (or sampling gap) between neighboring populations ranged from a few km to a few 100s of km. By genotyping 11 microsatellite markers, we aimed to (1) refine analyses of population structure; (2) test whether on-shelf islands are genetically more differentiated than mainland populations; (3) evaluate the relative importance of various abiotic conditions in shaping the genetic structure; and (4) evaluate if the relative importance of each environmental factor varied according to sampling schemes. Our analyses revealed a positive relationship between connectivity links and genetic diversity: populations with high levels of connectivity were genetically enriched while isolated populations showed signs of genetic erosion. The genetically impoverished populations corresponded to the southernmost populations as well as populations along the northern coast of Brittany (Locquirec, Saint-Malo Bay) and the northernmost population in Pas-de-Calais. By performing distance-based redundancy analysis on various sampling schemes, geographic distance appeared as the dominant factor influencing connectivity between populations separated by great distances, while hydrodynamic processes were the main factor when analyzing at a final spatial resolution.},
  author       = {Fouqueau, Louise and Reynes, L and Tempera, F and Bajjouk, T and Blanfuné, A and Chevalier, C and Laurans, M and Mauger, S and Sourisseau, M and Assis, J and Lévêque, L and Valero, M},
  issn         = {1616-1599},
  journal      = {Marine Ecology Progress Series},
  pages        = {23--42},
  publisher    = {Inter-Research Science Center},
  title        = {{Seascape genetic study on Laminaria digitata underscores the critical role of sampling schemes}},
  doi          = {10.3354/meps14640},
  volume       = {740},
  year         = {2024},
}

@article{18945,
  abstract     = {Vaccinia-related kinase 1 (VRK1) and the δ and ε isoforms of casein kinase 1 (CK1) are linked to various disease-relevant pathways. However, the lack of tool compounds for these kinases has significantly hampered our understanding of their cellular functions and therapeutic potential. Here, we describe the structure-based development of potent inhibitors of VRK1, a kinase highly expressed in various tumor types and crucial for cell proliferation and genome integrity. Kinome-wide profiling revealed that our compounds also inhibit CK1δ and CK1ε. We demonstrate that dihydropteridinones 35 and 36 mimic the cellular outcomes of VRK1 depletion. Complementary studies with existing CK1δ and CK1ε inhibitors suggest that these kinases may play overlapping roles in cell proliferation and genome instability. Together, our findings highlight the potential of VRK1 inhibition in treating p53-deficient tumors and possibly enhancing the efficacy of existing cancer therapies that target DNA stability or cell division.},
  author       = {de Souza Gama, Fernando H. and Dutra, Luiz A. and Hawgood, Michael and dos Reis, Caio Vinícius and Serafim, Ricardo A. M. and Ferreira, Marcos A. and Teodoro, Bruno V. M. and Takarada, Jéssica Emi and Santiago, André S. and Balourdas, Dimitrios-Ilias and Nilsson, Ann-Sofie and Urien, Bruno and Almeida, Vitor M. and Gileadi, Carina and Ramos, Priscila Z. and Testa Salmazo, Anita P and Vasconcelos, Stanley N. S. and Cunha, Micael R. and Mueller, Susanne and Knapp, Stefan and Massirer, Katlin B. and Elkins, Jonathan M. and Gileadi, Opher and Mascarello, Alessandra and Lemmens, Bennie B. L. G. and Guimarães, Cristiano R. W. and Azevedo, Hatylas and Couñago, Rafael M.},
  issn         = {1520-4804},
  journal      = {Journal of Medicinal Chemistry},
  number       = {11},
  pages        = {8609--8629},
  publisher    = {American Chemical Society},
  title        = {{Novel dihydropteridinone derivatives as potent inhibitors of the understudied human kinases vaccinia-related kinase 1 and casein kinase 1δ/ε}},
  doi          = {10.1021/acs.jmedchem.3c02250},
  volume       = {67},
  year         = {2024},
}

@article{18949,
  abstract     = {Speciation research—the scientific field focused on understanding the origin and diversity of species—has a long and complex history. While relevant to one another, the specific goals and activities of speciation researchers are highly diverse, and scattered across a collection of different perspectives. Thus, our understanding of speciation will benefit from efforts to bridge scientific findings and the diverse people who do the work. In this paper, we outline two ways of integrating speciation research: (i) scientific integration, through the bringing together of ideas, data, and approaches; and (ii) social integration, by creating ways for a diversity of researchers to participate in the scientific process. We then discuss five challenges to integration: (i) the multidisciplinary nature of speciation research, (ii) the complex language of speciation; (iii) a bias toward certain study systems; (iv) the challenges of working across scales; and (v) inconsistent measures and reporting standards. We provide practical steps that individuals and groups can take to help overcome these challenges, and argue that integration is a team effort in which we all have a role to play.},
  author       = {Stankowski, Sean and Cutter, Asher D and Satokangas, Ina and Lerch, Brian A and Rolland, Jonathan and Smadja, Carole M and Segami Marzal, J Carolina and Cooney, Christopher R and Feulner, Philine G D and Domingos, Fabricius Maia Chaves Bicalho and North, Henry L and Yamaguchi, Ryo and Butlin, Roger K and Wolf, Jochen B W and Coughlan, Jenn and Heidbreder, Patrick and Hernández-Gutiérrez, Rebeca and Barnard-Kubow, Karen B and Peede, David and Rancilhac, Loïs and Salvador, Rodrigo Brincalepe and Thompson, Ken A and Stacy, Elizabeth A and Moyle, Leonie C and Garlovsky, Martin D and Maulana, Arif and Kantelinen, Annina and Cacho, N Ivalú and Schneemann, Hilde and Domínguez, Marisol and Dopman, Erik B and Lohse, Konrad and Rometsch, Sina J and Comeault, Aaron A and Merrill, Richard M and Scordato, Elizabeth S C and Singhal, Sonal and Pärssinen, Varpu and Lackey, Alycia C R and Kumar, Sanghamitra and Meier, Joana I and Barton, Nicholas H and Fraisse, Christelle and Ravinet, Mark and Kulmuni, Jonna},
  issn         = {2752-938X},
  journal      = {Evolutionary Journal of the Linnean Society},
  number       = {1},
  publisher    = {Oxford University Press},
  title        = {{Toward the integration of speciation research}},
  doi          = {10.1093/evolinnean/kzae001},
  volume       = {3},
  year         = {2024},
}

@inproceedings{18955,
  abstract     = {We give a simple proof that assuming the Exponential Time Hypothesis (ETH), determining the winner of a Rabin game cannot be done in time 2o(k log k) · nO(1), where k is the number of pairs of vertex subsets involved in the winning condition and n is the vertex count of the game graph. While this result follows from the lower bounds provided by Calude et al [SIAM J. Comp. 2022], our reduction is considerably simpler and arguably provides more insight into the complexity of the problem. In fact, the analogous lower bounds discussed by Calude et al, for solving Muller games and multidimensional parity games, follow as simple corollaries of our approach. Our reduction also highlights the usefulness of a certain pivot problem — Permutation SAT — which may be of independent interest.},
  author       = {Casares, Antonio and Pilipczuk, Marcin and Pilipczuk, Michał and Souza, Uéverton S. and Thejaswini, K. S.},
  booktitle    = {2024 Symposium on Simplicity in Algorithms},
  isbn         = {9781611977936},
  location     = {Alexandria, VA, United States},
  pages        = {160--167},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Simple and tight complexity lower bounds for solving Rabin games}},
  doi          = {10.1137/1.9781611977936.16},
  year         = {2024},
}

@inproceedings{18956,
  abstract     = {Group Activity Recognition (GAR) aims to detect the activity performed by multiple actors in a scene. Prior works model the spatio-temporal features based on the RGB, optical flow or keypoint data types. On the contrary, our hypothesis is that by only using the RGB data without temporality, the performance can be maintained with a negligible loss in accuracy. To that end, we propose a novel GAR technique for volleyball videos, DECOMPL, which consists of two complementary branches. In the visual branch, it extracts the features using attention pooling. In the coordinate branch, it considers the configuration of the players and extracts the spatial information from the box coordinates. Moreover, we analyzed the Volleyball dataset that the recent literature is mostly based on, and systematically reannotated it to emphasize the group concept. Experimental results demonstrated the effectiveness of the proposed model DECOMPL, which delivered the best/second best GAR performance with the reannotations/original annotations among the comparable state-of-the-art methods. Code and new annotations are available at GitHub: https://github.com/berkerdemirel/decompl},
  author       = {Demirel, Berker and Ozkan, Huseyin},
  booktitle    = {2024 IEEE International Conference on Image Processing},
  issn         = {2381-8549},
  location     = {Abu Dhabi, United Arab Emirates},
  pages        = {977--983},
  publisher    = {IEEE},
  title        = {{Decompl: Decompositional learning with attention pooling for group activity recognition from a single volleyball image}},
  doi          = {10.1109/icip51287.2024.10647499},
  year         = {2024},
}

@inproceedings{18957,
  abstract     = {Sui Lutris is the first smart-contract platform to sustainably achieve sub-second finality. It achieves this significant decrease by employing consensusless agreement not only for simple payments but for a large variety of transactions. Unlike prior work, Sui Lutris neither compromises expressiveness nor throughput and can run perpetually without restarts. Sui Lutris achieves this by safely integrating consensuless agreement with a high-throughput consensus protocol that is invoked out of the critical finality path but ensures that when a transaction is at risk of inconsistent concurrent accesses, its settlement is delayed until the total ordering is resolved. Building such a hybrid architecture is especially delicate during reconfiguration events, where the system needs to preserve the safety of the consensusless path without compromising the long-term liveness of potentially misconfigured clients. We thus develop a novel reconfiguration protocol, the first to provably show the safe and efficient reconfiguration of a consensusless blockchain. Sui Lutris is currently running in production and underpins the Sui smart-contract platform. Combined with the use of Objects instead of accounts it enables the safe execution of smart contracts that expose objects as a first-class resource. In our experiments Sui Lutris achieves latency lower than 0.5 seconds for throughput up to 5,000 certificates per second (150k ops/s with transaction blocks), compared to the state-of-the-art real-world consensus latencies of 3 seconds. Furthermore, it gracefully handles validators crash-recovery and does not suffer visible performance degradation during reconfiguration.},
  author       = {Blackshear, Sam and Chursin, Andrey and Danezis, George and Kichidis, Anastasios and Kokoris Kogias, Eleftherios and Li, Xun and Logan, Mark and Menon, Ashok and Nowacki, Todd and Sonnino, Alberto and Williams, Brandon and Zhang, Lu},
  booktitle    = {Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security},
  isbn         = {9798400706363},
  location     = {Salt Lake City, UT, United States},
  pages        = {2606--2620},
  publisher    = {ACM},
  title        = {{Sui Lutris: A blockchain combining broadcast and consensus}},
  doi          = {10.1145/3658644.3670286},
  year         = {2024},
}

@article{18961,
  abstract     = {Automated contact tracing (ACT) emerged as a promising measure to curb the spread of Covid-19. Users enable ACT on their smartphones to automatically record contacts with other users. If a user tests positive for the disease, they report their diagnosis to alert their contacts.
Designing effective ACT protocols is challenging since they need to be efficient and secure while also ensuring users' privacy. As ACT protocols necessarily leak some information by design, defining privacy is difficult. For example, a user cannot deny having met another user. Ideally, however, the user can plausibly deny everything else, in particular, when they met. We call this privacy property contact-time deniability.
While some early works discussed contact-time deniability informally, it has received little attention since then. We investigate deniability from a rigorous, theoretical point of view and arrive at the following impossibility result:
A decentralized protocol with unidirectional communication cannot be contact-time deniable and replay-secure. This holds even if malicious users treat smartphones as black-boxes.
 Unidirectional protocols are usually very efficient and many proposals are unidirectional, e.g., the widely-deployed Google-Apple Exposure Notifications. So the impossibility result considerably constrains the design space of efficient, secure, and private ACT protocols. However, it can also be used as a guide; we discuss several possibilities to achieve contact-time deniability in practice.},
  author       = {Günther, Christoph Ullrich and Pietrzak, Krzysztof Z},
  issn         = {2299-0984},
  journal      = {Proceedings on Privacy Enhancing Technologies},
  location     = {Bristol, UK/Virtual},
  number       = {4},
  pages        = {636--648},
  publisher    = {Privacy Enhancing Technologies Symposium Advisory Board},
  title        = {{Deniability in automated contact tracing: Impossibilities and possibilities}},
  doi          = {10.56553/popets-2024-0134},
  volume       = {2024},
  year         = {2024},
}

@inproceedings{18964,
  abstract     = {Object-centric learning (OCL) extracts the representation of objects with slots, offering an exceptional blend of flexibility and interpretability for abstracting low-level perceptual features. A widely adopted method within OCL is slot attention, which utilizes attention mechanisms to iteratively refine slot representations. However, a major draw-back of most object-centric models, including slot attention, is their reliance on predefining the number of slots. This not only necessitates prior knowledge of the dataset but also overlooks the inherent variability in the number of objects present in each instance. To overcome this fundamental limitation, we present a novel complexity-aware object auto-encoder framework. Within this framework, we introduce an adaptive slot attention (AdaSlot) mecha-nism that dynamically determines the optimal number of slots based on the content of the data. This is achieved by proposing a discrete slot sampling module that is responsible for selecting an appropriate number of slots from a candidate list. Furthermore, we introduce a masked slot decoder that suppresses unselected slots during the decoding process. Our framework, tested extensively on object discovery tasks with various datasets, shows performance matching or exceeding top fixed-slot models. Moreover, our analysis substantiates that our method exhibits the capability to dynamically adapt the slot number according to each instance's complexity, offering the potential for further exploration in slot attention research. Project will be available at https://kfan21.github.io/AdaSlot/},
  author       = {Fan, Ke and Bai, Zechen and Xiao, Tianjun and He, Tong and Horn, Max and Fu, Yanwei and Locatello, Francesco and Zhang, Zheng},
  booktitle    = {2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  location     = {Seattle, WA, United States},
  publisher    = {IEEE},
  title        = {{Adaptive slot attention: Object discovery with dynamic slot number}},
  doi          = {10.1109/cvpr52733.2024.02176},
  year         = {2024},
}