Curating Always-Loaded Context for LLM Agents: A Capacitated Assortment Model with Censored Feedback MF0H78XZXC

URI	`m2://res/MF0H78XZXC`
Kind	preprint
Creators	Zexuan Liu, Yuning Yang, Tiancheng Zhao
Date	2026-10-07
Subjects	arxiv cs.AI, arxiv cs.LG, arxiv math.OC
Scope	border

Expressions

Date	2026-10-07
Ids	arXiv 2610.11007

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Load bound on optima	statement	proposition A.5	arxiv
Single deletion	statement	lemma A.6	arxiv
ETC-$m$ under an edit cap, full form	statement	theorem C.12	arxiv
Accretion is unboundedly suboptimal	statement	corollary 1	arxiv
76BHGENCV8	statement	theorem	arxiv
The edit-cap term is unavoidable	statement	theorem 3	arxiv
File size bound under bounded-average compliance	statement	proposition A.3	arxiv
False inclusion	statement	lemma C.8	arxiv
ETC-$m$ under an edit cap	statement	theorem 2	arxiv
Binomial tail	statement	lemma C.7	arxiv
Tuned exploration	statement	corollary C.13	arxiv
Batch errors	statement	lemma C.10	arxiv
File size bound	statement	proposition 1	arxiv
What censored transcripts identify	statement	theorem C.5	arxiv
Deleting on non-compliance is value-blind	statement	proposition 3	arxiv
Plug-in stability	statement	lemma C.11	arxiv
Without dilution, accretion is optimal	statement	proposition 2	arxiv
K7F7ZV0BNX	statement	theorem	arxiv
Optimal files lie inside the accretion closure	statement	proposition A.2	arxiv
File size bound, full version	statement	proposition A.1	arxiv
M77VE5NF0C	statement	theorem	arxiv
N0CD9ZZY10	example	example	arxiv
Delay	statement	lemma C.9	arxiv
NETGJZSVBT	statement	lemma A.4	arxiv
Sharpened size bound	statement	proposition A.7	arxiv
Magnitudes are necessary	statement	proposition C.6	arxiv
A cap insures against an underestimated token price	statement	corollary A.9	arxiv
How many sightings before adding an instruction	statement	theorem 1	arxiv
Envelope bound	statement	lemma A.8	arxiv