Skip to content
  1. Kiz8
  2. Research
  3. Scientific research

Scientific research.

From city-scale simulation and investigative reasoning to long-horizon agents and context management. We publish the methods, measured findings, and limitations.

Paper 02 · arXiv:2611.04785 [cs.AI] · Submitted

Kierston & KierstonBench: Simulation of Allentown, PA and Evaluation of Language Models in Crime Investigation and Surveillance Tasks

Andrew Semenov, Svyatoslav Dorofeev · Kiz8

Overview

What can a language-model agent establish from records, and when should it decline to answer? Kierston simulates daily life in Allentown, Pennsylvania, then derives telecommunications, financial, administrative and licence-plate records from one shared behavioral timeline. KierstonBench asks agents to investigate through a restricted records interface, without access to the simulation ground truth or a supplied list of candidates.

~125KSynthetic residents
32Task families
16Models evaluated
20 minTime limit per task
Question
Can agents connect records across providers, reconstruct events and distinguish supported conclusions from unsupported identifications?
Method
A deterministic city simulator built from public census and geographic inputs. Synthetic people share households, routines and travel; provider records include incomplete observations and sensor errors. The underlying events remain available to the evaluator, not the agent.
Experiment
Each model attempts one case per task family in a fresh container with a shell, Python and the Allentown Data Interface. Incident tasks expose only records available by the stated case time. Correct identifications earn credit, incorrect ones incur penalties, and abstentions score zero.
22 task families

Technical tasks

Link identities and reconstruct daily activity across provider records.

7 task families

Real-time investigations

Investigate staged incidents using only records available before the case cutoff.

3 task families

Deception tasks

Check a caller’s false account against independently generated records.

Findings · selected modelsScore, −1 to 1

Linking records is not solving a case.

Frontier models resolve identities and reconstruct routines, but the paper reports that no model identified a perpetrator in any of the five suspect-identification tasks. Proximity, firearm ownership and criminal history were repeatedly treated as evidence of involvement without a link to the incident.

Abstaining can prevent an unsupported identification. A zero score is not the same as a correct answer.

KierstonBench scores for four selected models from arXiv v1, Table 15
ModelTTRTIDTAll
GPT-6 Sol0.670.001.000.55
Claude Fable 5.10.75−0.381.000.52
GPT-6.1 Sol0.580.000.670.46
GPT-6 Astra0.530.140.330.43

TT: technical tasks · RTI: real-time investigations · DT: deception tasks. All-task and group means include abstentions at zero. Scores are not accuracy percentages. Snapshot: arXiv v1, Table 15; four of 16 evaluated models.

Full evaluation and abstentions ↗
Limitations
One attempt per family, on one sampled instance of one simulated day. Small score differences may change on another attempt. These results do not establish real-world investigative performance. The disappearance scenario was corrected during evaluation; seven models retain results from the original staging, as documented in the paper.
Dual use & release
The engine can support development and independent scrutiny of surveillance and records-fusion systems. The paper releases engine and benchmark code with public inputs, but not generated outputs or evaluation tasks: synthetic identities may coincide with real people, creating privacy and defamation risks.
Cite Kierston
@misc{semenov2026kierston,
  title         = {Kierston \& KierstonBench: Simulation of Allentown, PA and Evaluation of Language Models in Crime Investigation and Surveillance Tasks},
  author        = {Semenov, Andrew and Dorofeev, Svyatoslav},
  year          = {2026},
  eprint        = {2611.04785},
  archivePrefix = {arXiv},
  primaryClass  = {cs.AI},
  doi           = {10.48550/arXiv.2611.04785},
  url           = {https://arxiv.org/abs/2611.04785}
}
Paper 01 · arXiv:2606.11213 [cs.CL] · Submitted 1 May 2026

Beyond Compaction: Structured Context Eviction for Long-Horizon Agents

Andrew Semenov, Svyatoslav Dorofeev · Kiz8

Abstract

We present Context Window Lifecycle (CWL), a context-management scheme that gives long-horizon LLM agents an effectively unbounded working horizon. As a session accumulates history, CWL keeps the context within budget through graduated, semantically-aware eviction: the agent annotates its trajectory as typed, dependency-linked episodes as work proceeds, and a deterministic, LLM-free policy evicts content in priority order within that structure when a token budget is exceeded.

89Sequential tasks in one session
80M+Tokens across the session
80KActive token budget
$55Approximate cost per run
Question
Can one long-running LLM agent keep working without losing coherence once its history outgrows the context window, without summarising that history away?
Method
Context Window Lifecycle (CWL). The agent annotates its own trajectory as typed, dependency-linked episodes while it works. When the token budget is exceeded, a deterministic, model-free policy evicts content in graduated levels, oldest-and-most-recoverable first, and never drops context an open action still depends on.
Experiment
Every task of four benchmarks (Terminal Bench 2.0, a 50-task SWE Bench Lite sample, Recovery Bench, LongCLI Bench) run back to back in a single uninterrupted session under an 80,000-token budget, against the standard fresh session per task. GPT-5.4; five runs on Terminal Bench 2.0, three elsewhere.
Findings
No measurable degradation in accuracy: the two conditions differ by at most 3 points, within run-to-run variance (Terminal Bench 2.0: 68.25% with CWL, 68.40% baseline). One session completed 89 sequential tasks across more than 80 million tokens, at about $55 per run.
Limitations
Dependencies attach to whole exploratory episodes, not individual tool calls. The design assumes one linear stream of episodes. The annotation protocol may change how the model explores (rushing in some sessions, looping in others), which the authors could not isolate. Larger evaluations are planned for a follow-up.
Results by benchmarkAccuracy, %
  • CWL · one session
  • Baseline · fresh session per task
Accuracy by benchmark, CWL versus baseline
BenchmarkCWLBaselineΔ pts
Terminal Bench 2.0 · n=568.2568.40−0.15
SWE Bench Lite · 50 tasks · n=343.0040.00+3.00
Recovery Bench · n=366.8069.75−2.95
LongCLI Bench · n=320.0020.000.00

The comparison is deliberately asymmetric: CWL runs every task in one session, the baseline starts fresh for each task. The principal result is parity under the harder regime.

Cite as
@misc{semenov2026beyond,
  title         = {Beyond Compaction: Structured Context Eviction for Long-Horizon Agents},
  author        = {Semenov, Andrew and Dorofeev, Svyatoslav},
  year          = {2026},
  eprint        = {2606.11213},
  archivePrefix = {arXiv},
  primaryClass  = {cs.CL},
  doi           = {10.48550/arXiv.2606.11213}
}

How we report AI research.

  1. Question

    What we need to know, stated so that an experiment can answer it.

  2. Method

    What we built or changed to answer it.

  3. Experiment

    How it was tested: which benchmarks or data, against what baseline, how many runs.

  4. Findings

    What held, with the numbers.

  5. Limitations

    What the result does not show, and what we could not isolate.

Problems from practice become research topics. Research improves our methods, and part of it becomes open tools.

Scientific field notes.

Shorter write-ups from our AI experiments.

  1. Achieving endless context window beyond compaction

    We ran a single agent session through 89 sequential tasks of Terminal Bench 2.0 and 80 million tokens with no measurable accuracy loss compared to per-task isolated sessions.

    Research8 min · Andrew Semenov
All field notes ›