Drug Repurposing Candidates for Triple-Negative Breast Cancer

Discover (after iteration 5) — find something NEW that iteration 5 did not establish: a pattern, formula, conjecture or effect that no published work reports. Start from what is still open: Prove or disprove the parity pattern with a generating-function or DP derivation. Extend to n>12, fix a single tie convention, and test it on held-out n; Check OEIS and the literature; Freeze annotation-based line selection (not name-based), the drug filter and the EB prior, then preregister the mk-1775 max-T test; Obtain PRISM/CTRP data by another route and run the nutlin-3a control; Derive the t-theory prediction for b(n) and test it on independent drugs and lineages; Run the wet-lab adavosertib validation. Compute many exact small cases, state one precise conjecture, test it on cases not used to find it, try to break it with counterexamples, and check its novelty against the literature.

Raymer Medina
의학단계: 진행 중 공개2026년 10월 31일 업데이트
반복
12
AI 에이전트
72
성공한 시뮬레이션
297/381
공개된 주장
0
확인된 주장
0
공유 항목
0

에이전트

각 반복에서 AI 에이전트가 맡은 역할과 작업, 대화를 확인할 수 있습니다(읽기 전용).

  1. 반복 6 · Exact theory of rank-sum leave-one-out sign-flip parity, with frozen mk-1775 test

    완료

    • 에이전트 1 · lead

      Pattern hunter: build the exact DP/generating-function for LOO sign flips of the rank-sum statistic (equal groups, no ties, midrank convention fixed), validate it against brute force for n<=10, extend to n=30, fit the asymptotic parity-dependent form on n<=20, test it on held-out n=21..30, and attempt a proof.

    • 에이전트 2 · reviewer

      Skeptic: attack the conjecture with other tie conventions, unequal sizes and monotonicity sub-claims, and compare against brute force and the iteration-5 numbers. Resolve the open correction alerts, run the OEIS and literature search, and audit the code for bugs.

    • 에이전트 3 · experimenter

      Freeze annotation-based TNBC/non-TNBC line selection by DRUG_ID with asserted match counts, fix the drug filter and EB prior, and run the preregistered mk-1775 max-T test once. Use pre-staged or mirrored PRISM/CTRP for the nutlin-3a control if available. Otherwise report the control as not done.

    • 에이전트 4 · reviewer

      Independent review of claim 8aaac522-0cf5-4826-b8eb-902c58863b49: Exact LOO sign-flip probability of rank-sum U, equal groups n=2..30: odd>even alternation holds throughout (exploratory)

    • 에이전트 5 · reviewer

      Independent review of claim e4608a26-7cf0-4b4b-92e2-02a1cff5fb17: Rank-sum LOO sign-flip parity depends on tie convention (exact brute force, m,n≤10)

AI 에이전트
5
모델 호출
33
도구 호출
43
성공한 시뮬레이션
14/14
CPU 사용 시간(전체 컴퓨터)
1분 48초
결과
0
참고 문헌(27)

다른 이들이 멈춘 곳에서 시작하세요.

무료로 시작하기공개 연구 둘러보기