Tootfinder

To make the solution to my Git problem searchable, I’ve dusted off the TIL section of my homepage:
TIL: How to Push and Pull from GitHub Pull Request Branches
https://hynek.me/til/github-pull-request-git-push-pull/

How to Push and Pull from GitHub Pull Request Branches
GitHub has the cool feature where while opening a pull request one can allow the maintainers to push changes to that branch. This is a lot more ergonomic than suggesting larger-scale edits in the insufferably slow GitHub web UI. But it does require setting up remotes and upstream branches correctly.

Great thread about #Git self-hosting options:
https://jawns.club/@skyfaller/114989129643625908

Altered Histories in Version Control System Repositories: Evidence from the Trenches
Solal Rapaport (IP Paris, LTCI, ACES, INFRES), Laurent Pautet (INFRES, LTCI, ACES, IP Paris), Samuel Tardieu (INFRES, ACES, IP Paris, LTCI), Stefano Zacchiroli (IP Paris, LTCI, ACES, INFRES)
https://arxiv.org/abs/2509.09294…

Altered Histories in Version Control System Repositories: Evidence from the Trenches
Version Control Systems (VCS) like Git allow developers to locally rewrite recorded history, e.g., to reorder and suppress commits or specific data in them. These alterations have legitimate use cases, but become problematic when performed on public branches that have downstream users: they break push/pull workflows, challenge the integrity and reproducibility of repositories, and create opportunities for supply chain attackers to sneak into them nefarious changes. We conduct the first large-sc…

Average Consensus with Dynamic Compression in Bandwidth-Limited Directed Networks
Evagoras Makridis, Gabriele Oliva, Apostolos I. Rikos, Themistoklis Charalambous
https://arxiv.org/abs/2508.06893

Average Consensus with Dynamic Compression in Bandwidth-Limited Directed Networks
In this paper, the average consensus problem has been considered for directed unbalanced networks under finite bit-rate communication. We propose the Push-Pull Average Consensus algorithm with Dynamic Compression (PP-ACDC) algorithm, a distributed consensus algorithm that deploys an adaptive quantization scheme and achieves convergence to the exact average without the need of global information. A preliminary numerical convergence analysis and simulation results corroborate the performance of P…

Push and Pull: Elastic Interaction Between Pressurized Spherical Cavities in Nonlinear Elastic Media
Ali Saeedi, Mrityunjay Kothari
https://arxiv.org/abs/2508.04855 https://

Push and Pull: Elastic Interaction Between Pressurized Spherical Cavities in Nonlinear Elastic Media
Elastic interaction of pressurized spherical cavities embedded in a three-dimensional hyperelastic medium is computationally analyzed. Using finite element analysis across several positive and negative pressure scenarios, we calculate the system's potential energy and configurational driving force for neo-Hookean, Mooney-Rivlin, and Arruda-Boyce material models. Our results show that while the interaction is always attractive for negative pressures, a non-monotonic energy landscape emerges for …

Dual-Mode Wireless Devices for Adaptive Pull and Push-Based Communication
Sara Cavallero, Fabio Saggese, Junya Shiraishi, Israel Leyva-Mayorga, Shashi Raj Pandey, Chiara Buratti, Petar Popovski
https://arxiv.org/abs/2507.23421

Dual-Mode Wireless Devices for Adaptive Pull and Push-Based Communication
This paper introduces a dual-mode communication framework for wireless devices that integrates query-driven (pull) and event-driven (push) transmissions within a unified time-frame structure. Devices typically respond to information requests in pull mode, but if an anomaly is detected, they preempt the regular response to report the critical condition. Additionally, push-based communication is used to proactively send critical data without waiting for a request. This adaptive approach ensures t…

On the construction of Calabi-Yau operators
Stefan Reiter
https://arxiv.org/abs/2508.03299 https://arxiv.org/pdf/2508.03299

On the construction of Calabi-Yau operators
Given a differential operator of geometric origin there exists a list of operations that preserve this property, e.g., tensor products, pull-backs, push-forwards and the middle convolution. We apply certain sequences of these operations to construct known and new examples of Calabi-Yau operators.

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
Liyuan Liang, Gan Luo, Kun Yuan
https://arxiv.org/abs/2506.18075

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
The linear speedup property is essential for demonstrating the advantage of distributed algorithms over their single-node counterparts. In this paper, we study the stochastic Push-Pull method, a widely adopted decentralized optimization algorithm over directed graphs (digraphs). Unlike methods that rely solely on row-stochastic or column-stochastic mixing matrices, Push-Pull avoids nonlinear correction and has shown superior empirical performance across a variety of settings. However, its theor…

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
Emilio Cruciani, Sebastian Forster, Tijn de Vos
https://arxiv.org/abs/2508.18017 https://

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
We study a multi-call variant of the classic PUSH&PULL rumor spreading process where nodes can contact $k$ of their neighbors instead of a single one during both PUSH and PULL operations. We show that rumor spreading can be made faster at the cost of an increased amount of communication between the nodes. As a motivating example, consider the process on a complete graph of $n$ nodes: while the standard PUSH&PULL protocol takes $Θ(\log n)$ rounds, we prove that our $k$-PUSH&PULL variant complet…

Design, fabrication and control of a cable-driven parallel robot
Dhruv Sorathiya, Sarthak Sahoo, Vivek Natarajan
https://arxiv.org/abs/2506.18526 https://

Design, fabrication and control of a cable-driven parallel robot
In cable driven parallel robots (CDPRs), the payload is suspended using a network of cables whose length can be controlled to maneuver the payload within the workspace. Compared to rigid link robots, CDPRs provide better maneuverability due to the flexibility of the cables and consume lesser power due to the high strength-to-weight ratio of the cables. However, amongst other things, the flexibility of the cables and the fact that they can only pull (and not push) render the dynamics of CDPRs co…

A Combined Push-Pull Access Framework for Digital Twin Alignment and Anomaly Reporting
Federico Chiariotti, Fabio Saggese, Andrea Munari, Leonardo Badia, Petar Popovski
https://arxiv.org/abs/2508.21516

A Combined Push-Pull Access Framework for Digital Twin Alignment and Anomaly Reporting
A digital twin (DT) contains a set of virtual models of real systems and processes that are synchronized to their physical counterparts. This enables experimentation and examination of counterfactuals, simulating the consequences of decisions in real time. However, the DT accuracy relies on timely updates that maintain alignment with the real system. We can distinguish between: (i) pull-updates, which follow a request from the DT to the sensors, to decrease its drift from the physical state; (i…

The Dolbeault geometric Langlands conjecture via limit categories
Tudor P\u{a}durariu, Yukinobu Toda
https://arxiv.org/abs/2508.19624 https://arxiv.org/pdf…

The Dolbeault geometric Langlands conjecture via limit categories
We introduce limit categories for cotangent stacks of smooth stacks as an effective version of classical limits of categories of D-modules on them. We develop their general theory and pursue their relation with categories of D-modules. In particular, we establish the functorial properties of limit categories such as the smooth pull-back and projective push-forward. Using the notion of limit categories, we propose a precise formulation of the Dolbeault geometric Langlands conjecture, proposed by…