Skip to content
How large can an integer-interval subset be if no element divides two other elements? · Research lab — PrizeLab
Research record
Agent record Close ×
Frontier availability 07 Senior reviewer Not started On the roster; the workflow has not woken it in this iteration.
LITERATURE-01 Literature researcher
Reading the landscape around: Exact ILP/exhaustive search for [1,N] and shifted intervals up to
Model
Model used together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile cheap_reasoning
Usage
Model calls 2
Input tokens 2,042
Cached input 0
Output tokens 592
Average latency 14.7 s
Failed calls 0
Cost (estimated) $0.000451
Joined 2026-09-25 18:40:07 UTC
Left 2026-09-25 18:46:44 UTC Recent activity 18:40:07 AGENT LITERATURE-01 joined as Literature Researcher 18:40:07 LITERATURE Literature search started 18:40:07 LITERATURE Indexed: A method for the efficient construction and sampling of vector-valued translation random fields 18:40:07 LITERATURE Indexed: Random sampling of lattice paths with constraints, via transportation 18:40:07 LITERATURE Indexed: Random sampling of contingency tables via probabilistic divide-and-conquer 18:40:07 LITERATURE Literature search: 3 new of 3 18:40:07 LITERATURE Reviewed: A method for the efficient construction and sampling of vector-valued translation random fields 18:40:07 MEMORY Literature: A method for the efficient construction and sampling of vector-valued translation random fields Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
18:43:09 LITERATURE Literature search started
18:43:09 LITERATURE Indexed: SBoxQUBOSearch: Exhaustive subset search and local basis optimization for exact algebraic S-box models
18:43:09 LITERATURE Indexed: Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
18:43:09 LITERATURE Indexed: Exhaustive Key Search
18:43:09 LITERATURE Literature search: 3 new of 3
18:43:09 LITERATURE Reviewed: SBoxQUBOSearch: Exhaustive subset search and local basis optimization for exact algebraic S-box models
18:43:09 MEMORY Literature: SBoxQUBOSearch: Exhaustive subset search and local basis optimization for exact algebraic S-box models
18:46:44 AGENT LITERATURE-01 stood down Mission
Runtime 9 h 14 min
Iteration 57 of 57
Directions 331
Hypotheses 17
Experiments 266
Rejected paths 64 Current direction No direction is open.
Verified 0 Lean-verified intermediate lemmas A verified lemma covers exactly the declaration the kernel accepted. The problem stays open until it is settled either way. Literature
Indexed 109
Highly relevant 1 Iteration 20
Model calls 15
Estimated cost $0.0497 Budget remaining 98%
Iteration details & budget ↗ Engine unreachable
The research engine answered a mission's knowledge in a shape this page cannot read.
Nothing is shown rather than something invented. Start the orchestrator API and reload.