evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_56dbc792dde278f5"}
- id
- vea_35f00d29b7af7388
- frontier
- Erdős problems frontier
- source
- vs_010c18fefea1c369
- finding
- vf_1a91ca4eddee0522
finding binding
boundopen_question
Erdős Problem #683 remains OPEN. Statement: There exists $c > 0$ such that $P(n, k) > \min\{n-k+1, k^{1 + c}\}$ for all $0 < k < n$.} Topics: number theory, primes, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A006530, A074399, A121359, possible.
source binding
source-boundcap_61973ee16b553d57 · vc_56dbc792dde278f5
vs_010c18fefea1c369
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_56dbc792dde278f5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_158ec594978f0a4f
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_45f3024190441100finding.assertedCandidate claim vc_56dbc792dde278f5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_ddc37a330803f21bfinding.addCandidate claim vc_56dbc792dde278f5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.