Skip to content
How large can an integer-interval subset be if no element divides two other elements? · Research lab — PrizeLab
AGENTS / 6 6 agents · 0 working
Frontier availability Showing iteration 10.
Research chronicle 94 RECORDS
All Research Review Verification System
↑ 88 earlier records 18:00:49 §89
GAUSS-02 GAUSS-02 stood down
18:00:49 §90
GAUSS-03 GAUSS-03 stood down
18:00:49 §91
LITERATURE-01 LITERATURE-01 stood down
18:00:49 §92
ARES ARES stood down
18:00:49 §93
SYSTEM Research run finished
18:00:49 §94
SYSTEM Iteration 10 completed
Research graph / proof lineage 7 objects · 0 links · 9 in complete graph
DIRECTION
DIRECTION Probabilistic upper bound via divisor-count concentration COMPLETED DIRECTION Explicit construction via residue classes and interval packing COMPLETED DIRECTION Computational search and pattern extrapolation for exact small-n values COMPLETED DIRECTION Exact solver for f(N) and interval variants via ILP/SAT COMPLETED DIRECTION Construction: verify (N/3, N] and add lower layers for density above 2/3 COMPLETED DIRECTION Upper bound via chain decomposition into m·2^i·3^j families and literature search COMPLETED PROOF
PROOF Chain-decomposition bound check v1 MARKDOWN Explore complete graph / 16 objects → Research record
Agent record Close ×
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 10
Model calls 13
Estimated cost $0.0524 Budget remaining 97%
Iteration details & budget ↗
LITERATURE-01 Literature researcher
Reading the landscape around: Exact solver for f(N) and interval variants via ILP/SAT
Model
Model used together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile cheap_reasoning
Usage
Model calls 2
Input tokens 2,008
Cached input 0
Output tokens 811
Average latency 11.8 s
Failed calls 0
Cost (estimated) $0.000508
Joined 2026-09-25 17:26:27 UTC
Left 2026-09-25 18:00:49 UTC Recent activity 17:26:27 AGENT LITERATURE-01 joined as Literature Researcher 17:26:27 LITERATURE Literature search started 17:26:27 LITERATURE Indexed: An Upper Bound on the Divisor Counting Function 17:26:27 LITERATURE Indexed: Superior highly composite numbers and the explicit upper bound of generalized divisor functions 17:26:27 LITERATURE Indexed: CORRECTION TO ‘AN UPPER BOUND FOR THE GENERALISED GREATEST COMMON DIVISOR OF RATIONAL POINTS’ 17:26:27 LITERATURE Literature search: 3 new of 3 17:26:27 LITERATURE Reviewed: An Upper Bound on the Divisor Counting Function 17:26:27 MEMORY Literature: An Upper Bound on the Divisor Counting Function Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
07 Senior reviewer Not started On the roster; the workflow has not woken it in this iteration.
17:59:57 LITERATURE Literature search started
17:59:57 LITERATURE Indexed: Improved Exact Solver for the Weighted MAX-SAT Problem
17:59:57 LITERATURE Indexed: BESWAC: Boosting Exact Synthesis via Wiser SAT Solver Call
17:59:57 LITERATURE Indexed: Improved bounds on Packing Chromatic Numbers via SAT Solver
17:59:57 LITERATURE Literature search: 3 new of 3
17:59:57 LITERATURE Reviewed: Improved Exact Solver for the Weighted MAX-SAT Problem
17:59:57 MEMORY Literature: Improved Exact Solver for the Weighted MAX-SAT Problem
18:00:49 AGENT LITERATURE-01 stood down