A Note on Diameter Certification in Trees

This is an arXiv CS feed (multiple new submissions) containing papers across distributed systems, ML serving/inference, HPC automation, and programming-language/runtime work. Key entries: a 1‑local diameter certification scheme for trees; "Trusted Floors Under Untrusted Learners", a runtime SLO guard that bounds damage from miscalibrated learned admitters (availability/SLO protection); agentic/descriptive execution of HPC workflows with LLM-driven agents and observed failure modes; a denotational view of consensus as evidence collapse; ATSInfer, tensor‑granularity CPU/GPU offloading for local/