activity
20132026
most citedThe Chromatic Polynomials of Signed Petersen Graphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CL2026

Muse Glimmer 30B: An On-Device Agentic Model

Arash Ebrahim Abtahizadeh, Muna Aghamelu, Adil Ahmed +327

We introduce Muse Glimmer, an open-source 30B parameter causal language model with perception encoder, purpose-built for autonomous agentic tasks on consumer hardware. Muse Glimmer…

cs.CY2026

Muse Spark Safety & Preparedness Report

Cristina Menghini, Peter Ney, Hamza Kwisaba +117

Muse Spark is the latest large language model developed by Meta. In this report, we first present evaluations for catastrophic risk domains under Meta's Advanced AI Scaling Framewo…

cs.SE2026★ 1 cited

The Llama 4 Herd: Architecture, Training, Evaluation, and Deployment Notes

Redacted by arXiv

This document consolidates publicly reported technical details about Metas Llama 4 model family. It summarizes (i) released variants (Scout and Maverick) and the broader herd conte…

cs.LG2023

Matched Pair Calibration for Ranking Fairness

Hannah Korevaar, Chris McConnell, Edmund Tong +6

We propose a test of fairness in score-based ranking systems called matched pair calibration. Our approach constructs a set of matched item pairs with minimal confounding differenc…

cs.CG2015

Line-of-Sight Pursuit in Monotone and Scallop Polygons

Lindsay Berry, Andrew Beveridge, Jane Butterfield +4

We study a turn-based game in a simply connected polygonal environment between a pursuer and an adversarial evader . Both players can move in a straight line to any poin…

math.CO2013★ 2 cited

The Chromatic Polynomials of Signed Petersen Graphs

Matthias Beck, Erika Meza, Bryan Nevarez +2

Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by show…