epinions_trust: Epinions trust network (2003)
A who-trusts-whom online social network of the general consumer review site Epinions.com. Members can decide whether to "trust" each other. These trust relationships are combined with review ratings to determine which reviews are shown to the user.
This network has 75888 nodes and 508837 edges.
Tags: Social, Online, Unweighted
The launch of #Crew12 is planned for 10:15 UTC today: webcasts from NASA and ESA at https://www.youtube.com/watch?v=zCM-Kwq91cc and https://www.youtube.com/watch?v=V_5RWX-GsQo from 8:15 UTC plus the ESA Launch Kit at https://esamultimedia.esa.int/docs/HRE/EPSILON_LaunchKit_EN.pdf and updates on https://www.nasa.gov/blogs/commercialcrew/ and the latest timelines at https://www.esa.int/Science_Exploration/Human_and_Robotic_Exploration/Watch_live_Crew-12_launch_and_docking_updated and https://www.spacex.com/launches/crew12 and https://www.nasa.gov/news-release/nasa-sets-coverage-for-agencys-spacex-crew-12-launch-docking/
The US CBP signs a one-year Clearview AI deal, granting access to its facial recognition tool for "tactical targeting" and "strategic counter-network analysis" (Dell Cameron/Wired)
https://www.wired.com/story/cbp-signs-clea
Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
https://arxiv.org/abs/2411.09979 https://mastoxiv.page/@arXiv_csDS_bot/113502653187863544
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
William Kuszmaul
https://arxiv.org/abs/2501.03488 https://mastoxiv.page/@arXiv_csDS_bot/113791396712128907
- The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
https://arxiv.org/abs/2502.21240 https://mastoxiv.page/@arXiv_csDS_bot/114097340825270885
- Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
https://arxiv.org/abs/2504.06980 https://mastoxiv.page/@arXiv_csDS_bot/114312444050875805
- Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
https://arxiv.org/abs/2505.00296 https://mastoxiv.page/@arXiv_csDS_bot/114437013364446063
- Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
https://arxiv.org/abs/2505.12600 https://mastoxiv.page/@arXiv_csDS_bot/114538936921930134
- Compressing Suffix Trees by Path Decompositions
Becker, Cenzato, Gagie, Kim, Koerkamp, Manzini, Prezza
https://arxiv.org/abs/2506.14734 https://mastoxiv.page/@arXiv_csDS_bot/114703384646892523
- Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao, Chihao Zhang
https://arxiv.org/abs/2507.11236 https://mastoxiv.page/@arXiv_csDS_bot/114862112197588124
- Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 https://mastoxiv.page/@arXiv_csDS_bot/114862223634372292
- Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
Santhoshini Velusamy, Huacheng Yu
https://arxiv.org/abs/2509.07286 https://mastoxiv.page/@arXiv_csDS_bot/115178875220889588
- Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
https://arxiv.org/abs/2511.00254 https://mastoxiv.page/@arXiv_csDS_bot/115490402963680492
- Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
https://arxiv.org/abs/2511.15460 https://mastoxiv.page/@arXiv_csDS_bot/115580946319285096
- Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
https://arxiv.org/abs/2601.04756 https://mastoxiv.page/@arXiv_csDS_bot/115864074799755995
- CoinPress: Practical Private Mean and Covariance Estimation
Sourav Biswas, Yihe Dong, Gautam Kamath, Jonathan Ullman
https://arxiv.org/abs/2006.06618
- The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
https://arxiv.org/abs/2201.05218
- Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
Daksh Shami
https://arxiv.org/abs/2407.19575 https://mastoxiv.page/@arXiv_quantph_bot/112874282709517475
- Young domination on Hamming rectangles
Janko Gravner, Matja\v{z} Krnc, Martin Milani\v{c}, Jean-Florent Raymond
https://arxiv.org/abs/2501.03788 https://mastoxiv.page/@arXiv_mathCO_bot/113791421814248215
- On the Space Complexity of Online Convolution
Joel Daniel Andersson, Amir Yehudayoff
https://arxiv.org/abs/2505.00181 https://mastoxiv.page/@arXiv_csCC_bot/114437005955255553
- Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad, Ashlesha Hota, Sudeshna Kolay
https://arxiv.org/abs/2506.18755 https://mastoxiv.page/@arXiv_csCC_bot/114737342714568702
- Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.10467
- Learning fermionic linear optics with Heisenberg scaling and physical operations
Aria Christensen, Andrew Zhao
https://arxiv.org/abs/2602.05058
toXiv_bot_toot
Russia targets Kyiv, Ukrainian cities with ballistic missiles as Moscow stalls on peace talks: https://benborges.xyz/2026/02/12/russia-targets-kyiv-ukrainian-cities.html
Big hearing tomorrow on offensive cyber by House Homeland Security Committee’s cyber panel.
https://homeland.house.gov/hearing/defense-through-offense-examining-u-s-cyber-capabili…
bitcoin_trust: Bitcoin OTC trust network (2017)
A network of who-trusts-whom relationships among users of the Bitcoin OTC platform. Each directed edge (i,j,w) represents the rating of user j by user i, in which i assigns j a weight w on a scale of -10 (total distrust) to 10 (total trust) in steps of 1.
This network has 5881 nodes and 35592 edges.
Tags: Social, Online, Weighted, Signed, Timestamps
An interview with LastPass CEO Karim Toubba on the company-wide changes after the 2022 data breach, new services such as controls to curb shadow SaaS, and more (Charlie Osborne/ZDNET)
https://www.zdnet.com/article/lastpass-2026-rebuilding-trust-ceo-interview/
NASA’s #Carruthers Geocorona Observatory has also achieved its target orbit, positioning the spacecraft to capture the first repeated observations of the ultraviolet glow from Earth’s outer atmosphere, the geocorona: https://science.nasa.gov/blogs/carruthers-geocorona-observatory/2026/01/12/nasas-carruthers-geocorona-observatory-reaches-target-orbit/ - the achievement was confirmed following its third and final orbital maneuver, a 2-minute thruster fire, on Jan. 8; the spacecraft has now entered its intended halo orbit around the Sun-Earth L1 Lagrange point, a position of gravitational balance approximately 1 million miles from Earth.
Finally an RGB image of comet #3IATLAS from images taken by #GeminiNorth during the 26 November #shadowTheScientists session: https://noirlab.edu/public/news/noirlab2532/ - the coma has become bluer due to more gas emission. Also published today: an X-ray image by XMM-Newton at https://www.esa.int/ESA_Multimedia/Images/2025/12/XMM-Newton_sees_comet_3I_ATLAS_in_X-ray_light with explanations in http://www.cbat.eps.harvard.edu/iau/cbet/005600/CBET005646.txt which also contains more 3I news.
Meanwhile the paper https://iopscience.iop.org/article/10.3847/2515-5172/ae2915 claims an upper limit for 3I's nucleus diameter of only some 750 meters from the measured non-gravitational acceleration (NGA) parameters: that would be waaay more stringent than the 5.6 km upper limit from early Hubble observations reported in https://iopscience.iop.org/article/10.3847/2041-8213/adf8d8 (where also a lower limit of 440 meters is stated).