arXiv:2607. 29496v1 Announce Type: new Abstract: We study transcript management for fixed, finite-precision causal Transformers.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2609. 11326v2 Announce Type: replace-cross Abstract: We ask whether it can be certified algorithmically that a self-modifying computational system preserves a safety property at its next step (preservation) and along its whole evolution (persistence).
arXiv:2607. 26988v1 Announce Type: cross Abstract: What types of decision problems can a causally masked, finite-precision transformer solve for inputs of arbitrary length?
arXiv:2606. 12502v1 Announce Type: cross Abstract: We propose that value -- the quantity goal-directed agents create, destroy, and exchange -- is a lawful structural quantity in the same category as information.
The study investigates how different message formats affect the fidelity of information as it passes through multiple LLM agent relays. Using a controlled testbed, the authors encode twelve atomic facts in five formats (free natural language, precision‑instructed NL, JSON, triples, key‑value) across six hops and evaluate recall against programmatic ground truth. Results show that strong relays maintain near‑lossless recall for all formats, while weaker relays exhibit significant format‑dependent recall loss, and that any injected error is faithfully propagated across all formats without causing collateral damage.
arXiv:2607. 09678v1 Announce Type: new Abstract: When LLM agents hand off information to one another, does the message format matter?
The paper investigates exact factorization and canonical presentations of languages relative to a fixed finite‑monoid observation. It shows that unique factorization does not guarantee a finite relative presentation property (FRP) by presenting a 36‑element quotient with infinite valid prime‑return rules, and introduces the stronger finite‑state relative presentation property (FSRP). The authors further define prime‑target left‑division determinism (PTLD), prove its implications for factorization and rule bounds, and provide efficient learning algorithms for the canonical PTLD presentation and FSRP controller.