Collects raw coding-agent sessions—developer prompts, model replies, tool calls, and command output—donated from public repositories and anonymized locally. Organized by agent harness (raw session files + Parquet table), useful for studying agent behavior and tool use; anonymization is best-effort.
An agentic multimodal coding model for long-horizon software tasks: MoE architecture (1T params, 32B activated), 256K context, image/video input, native int4 quantization and preserved chain-of-thought (thinking) mode. Tuned for multi-step coding workflows and vLLM/SGLang deployment.
A 3B-parameter causal LLM tuned for verifiable multi-step reasoning in math, coding and STEM using a Spectrum-to-Signal post-training pipeline (SFT, RL, offline self-distillation); not recommended for tool-calling/agent tasks.
A JSON dataset of ~1.1M anonymized coding-assistant instruction→response interactions for training and evaluating code-generation and instruction-following models; packaged for use with pandas/polars and sized at ~459 MB.
Moves repository search into a dedicated exploration subagent that issues parallel read-only READ/GLOB/GREP calls and returns compact file:line citations. Trained (4B–30B) with SFT+RL, it reduces main-agent token use up to ~60% and raises end-to-end success by up to ~5.5%.
Curates ~1.1M instruction–response examples for 'vibe coding' scenarios where developers prompt LLMs to produce implementation plans, architecture choices, and deployment steps. Covers conversation memory, prompt templates, model routing, streaming responses, and scaling considerations; Apache-2.0.
Learns, maintains, and runs unified world models for Physical AI using a cross-embodiment pretraining curriculum and a hybrid linear temporal-attention architecture. Emphasizes long-horizon state persistence, theoretical bounds on error accumulation, and deployment-aware low-latency inference for real-world embodied agents.
Fine-tuned full checkpoint of the Qwen3.6-27B base that produces structured, trace-style assistant outputs for code, technical reasoning, and instruction-following. Packaged for local GGUF conversion and local inference; not a LoRA adapter and not validated for production use.
Uses Parallel Looped Transformers (PLT) to make loop count a practical knob for code models, finding two loops give the best test-time gains. Trains 7B models on 18T tokens and attributes saturation beyond two loops to a gain–cost tradeoff from positional mismatch.
Assesses whether coding agents can generate complete, playable games end-to-end inside the Godot engine. Implements an interaction-grounded evaluation (replayed demonstrations + rubric-guided multimodal judging) across 140 tasks and 15 game families; top agents score ~41%.
Contains 603 coding and math prompt–response pairs produced by Claude Fable‑5 (generated 2026-06-10), provided as a JSONL subset for fine-tuning, evaluation, and behavior analysis. Responses are 'non-thinking' (no chain-of-thought); small, anonymized, and lacking an explicit license.
Serves interactive, long-lived streaming video-generation sessions by jointly scheduling session placement and GPU autoscaling to meet tight per-chunk latency. Combines migration-aware placement, load-driven autoscaling, coalesced chunk processing, GPU–CPU offloading and NCCL GPU–GPU migration; reports ~37% reductions in worst-case per-chunk latency and GPU operating cost.