Research Candidates · preserved K=2–K=7 dataset
Research Candidates
Search for an issue, choose a group size, and inspect bounded research candidates. Research Candidates route investigation; computational similarity does not become evidence.
Supplied-coverage boundary. The publication universe is the supplied assessment: 14,405 unique K=2 pairs after reciprocal rows are collapsed and bounded seeded K=3–K=7 queues. The assessment states a 648,091-pair eligible K=2 universe but does not embed it. Records missing any constituent pair are not displayed. This supplied universe has been accepted for publication and is not described as exhaustive.
The K2–K7 supplied universe is unchanged. Verified bounded component evidence is propagated without converting computational similarity into intersection support or verification. Evidence-supported and verified intersection counts remain zero. Inspect the register.
These records are computational research candidates. They are not governed intersection findings, evidence of causation, or verified claims. Candidate status identifies where additional mechanism, evidence, comparison, and review work may be useful.
v7.37 · bounded question compiler
From computational candidates to investigable questions
The compiler produced a question draft for every supplied K=2–K=7 candidate, applied explicit admission gates, and selected a deterministic 30-record public cohort for diversity rather than an undisclosed importance score.
Inspect compiler and exclusion counts · Download public cohort JSON · Download public cohort CSV
Preserved Research Candidate Dataset
Required constituent pairs: K=2 → 1; K=3 → 3; K=4 → 6; K=5 → 10; K=6 → 15; K=7 → 21. For K greater than 2, the result is a K-issue group whose internal relationships are shown through every available constituent match pair.
Candidate coverage is bounded, not exhaustive
| K | Supplied candidates | Theoretical 1,139-issue combinations | Coverage | Limitation |
|---|---|---|---|---|
| K=2 | 14,405 | 648,091 | 2.222681691306% | Bounded supplied queue; complete closure applies only inside displayed groups. |
| K=3 | 691 | 245,626,489 | 0.000281321450% | Bounded supplied queue; complete closure applies only inside displayed groups. |
| K=4 | 570 | 69,757,922,876 | 0.000000817111% | Bounded supplied queue; complete closure applies only inside displayed groups. |
| K=5 | 484 | 15,835,048,492,852 | 0.000000003057% | Bounded supplied queue; complete closure applies only inside displayed groups. |
| K=6 | 407 | 2,992,824,165,149,028 | 0.000000000014% | Bounded supplied queue; complete closure applies only inside displayed groups. |
| K=7 | 340 | 484,409,968,444,835,532 | 7.018848127580e-14% | Bounded supplied queue; complete closure applies only inside displayed groups. |
Every displayed group has complete constituent-pair closure inside that group. This does not mean the eligible K-level universe was completely generated. Read generation and scoring limitations.
Preparing Research Candidates…
Compare selected groups
Select two or three results.