Category: Computer Science & AI
-
Telegram users tend to match local chat toxicity norms
This research indicates that most Telegram users conform to the toxicity levels of the chats they participate in, and that heavier participation is associated with stronger conformity.
AI-assisted summary
-
Exact maximum diameter determined for 2-dimensional simplicial complexes
This research indicates that the exact largest possible diameter of a 2-dimensional simplicial complex on n vertices has been determined for every n using an explicit construction.
AI-assisted summary
-
Dependency-aware synthetic tabular data improves relationship preservation
This research indicates that a hierarchical framework can better preserve functional and logical dependencies in synthetic tabular data.
AI-assisted summary
-
Mamba-based BOA compressor matches or exceeds standard lossless tools
This research indicates that a new lossless neural compressor called BOA can achieve competitive compression ratios on several scientific datasets, sometimes outperforming standard algorithms, while still being slower than optimized compressors.
AI-assisted summary
-
Workflow decomposition expanded scheduling beyond native solver capacity
This research indicates that a workflow decomposition algorithm can help a hybrid quantum solver handle larger scheduling instances than its native capacity allows.
AI-assisted summary
-
LLMs showed low first-attempt deployability for IaC generation
This research indicates that large language models generated infrastructure-as-code templates that were often not deployable on the first attempt, while an iterative feedback framework and human guidance improved deployability.
AI-assisted summary
-
No study findings are provided in the available abstract
This research indicates that no specific findings, methods, or conclusions are stated in the provided abstract.
AI-assisted summary
-
Schur multiplier norm and its dual norm are characterized
This research indicates that the Schur multiplier norm of a complex self-adjoint matrix and its dual norm can be characterized by minimization formulas with diagonal matrices.
AI-assisted summary
-
Balanced quasi-clique model for signed graphs
This research indicates that a new maximal balanced quasi-clique model can be defined for signed graphs and enumerated with a branch-and-bound algorithm.
AI-assisted summary
-
Interval decompositions depend on free cokernels and field choice
This research indicates that certain persistence modules over a principal ideal domain have interval decompositions exactly when every structure map has a free cokernel, and that torsion-free integer persistent homology has an interval decomposition exactly when the persistence diagram does not change with the choice of coefficient field.
AI-assisted summary
