Can AI assess suicide risk the way a clinician does — and show its evidence? Now in its 3rd edition, this challenge asks models not just to predict, but to justify.
The challenge A dual-objective task scored jointly. Subtask 1 — classify a Reddit user into one of four clinically grounded risk levels (indicator, ideation, behavior, attempt). Subtask 2 — return the supporting clinical evidence: psychological risk factors (e.g., access to means, prior self-harm, trauma) and protective factors (e.g., social support, coping, meaning of life), plus the verbatim post spans that signal risk.
The data Built on the Protective Factor-Aware (PFA) dataset — 237 Reddit users and 2,515 posts from r/SuicideWatch (2010–2022), expert-annotated with high agreement (Fleiss’ κ = 0.84 for risk, 0.79 for factors) and released in a privacy-protected format.
How you win Macro-F1 on each subtask, combined as S = 0.6·S1 + 0.4·S2 on a hidden test set with a live public leaderboard. Source code and a qualifying report are required for finalist eligibility.
Track record Grew from 21 teams (2024) to 36 teams (2025), with finalists invited to present in Macau.
Organizers Prof. Qing Li’s team at The Hong Kong Polytechnic University, with City University of Hong Kong.
Solar filaments trigger the storms that knock out power grids, GPS, and satellites — yet no operational system has tracked them since around 2016. Help reopen the window.
The challenge Produce pixel-precise segmentations of solar filaments in full-disk H-Alpha images — capturing fine structures (barbs), separating faint material from ground-based noise, and detecting each filament as one coherent object. Any method is welcome, from classical image processing to deep neural networks.
The data MAGFiLO — the largest gold-standard filament dataset ever released (Nature Scientific Data, 2024): 10,244 manually annotated filaments across 1,593 GONG observations, with polygon masks, spines, bounding boxes, and chirality labels. Built over 1.5 years by ~40 annotators across three institutions.
How you win IoU, precision, recall, AP@IoU, hit/miss rate, and the organizers’ Multi-scale IoU (MIoU) for fine structures. Hosted on Kaggle with custom-metric scoring; source code required.
Platform & prizes Kaggle. Cash prizes and/or IEEE Big Data 2026 registration for top teams, with invited talks at the proposed SABiD workshop. NSF-supported.
Organizers Azim Ahmadzadeh (Univ. of Missouri–St. Louis, lead), Dustin Kempton (Georgia State), Qin Li (NJIT), and Alexei Pevtsov (NSF National Solar Observatory).
FinReason Cup invites teams to develop and evaluate financial AI systems across three complementary tasks: verifiable financial reasoning, market-neutral hedging, and targeted audit verification. The competition evaluates both the outputs of these systems and the evidence needed to check their results.
Competition website: the-finai.github.io/IEEE-bigdata-cup
Competition tasks
- Task 1 Verifiable Financial Chain Reasoning: Solve multi-step financial problems and submit typed final answers together with values for the published intermediate reasoning slots. The scorer reports Final answer and Reasoning steps scores separately. Public training data, local development data, unlabeled leaderboard-development questions, and test questions are available through the Task 1 hub.
- Task 2 Market Neutral Hedging: Select an asset pair and manage a zero-net-dollar position over time using point-in-time prices, news, and corporate filings. Planned evaluation measures include cumulative return, Sharpe ratio, and maximum drawdown. Final data windows, execution rules, costs, and scoring requirements will be published with the task release.
- Task 3 Financial Audit Verification: Check targeted numeric facts in SEC EDGAR XBRL filing materials by comparing reported values with values implied by calculation relationships. This task concerns numeric-fact verification, not a full financial-statement audit. The public practice phase is available; the development and test phases are forthcoming.
How to participate
Competition files use organizer-hosted, task-specific submission platforms linked from the competition website. Task 1 is open for direct uploads. It requires no pre-registration, letter of intent, organizer approval, access code, or participant account.
For Task 1, development submissions receive scores and a receipt, and each team’s best eligible result appears on the public leaderboard. Test submissions receive an acceptance receipt only; test scores and rankings remain hidden until the final results release. Follow the published task guide for required files, fields, validation, and submission limits.
Task 1 participant hub | Task 3 participant hub
Task 2 remains in preparation. Only the practice phase of Task 3 currently accepts submissions, and practice submissions are not ranked. Release notices and formal submission routes will be announced through the participant hubs.
Organizer team
The organizer team is led by The Fin AI, with contributors affiliated with MBZUAI, McGill University, Stevens Institute of Technology, Yale University, and the University of Manchester. These affiliations do not imply institutional sponsorship.
Important dates
All dates are in 2026. This schedule replaces the previously published combined 15 November deadline. Competition submissions and Working Notes have separate deadlines.
AoE means Anywhere on Earth (UTC−12). The competition submission window ends at 12:00 UTC on 16 October; results will be released after that instant and verification. The 25 November winner announcement is separate from the 16 October results release.
| Date |
Milestone |
| 15 October, 23:59 AoE | Competition submissions close for Tasks 1–3 |
| 16 October | Final competition results after the cutoff and verification |
| 23 October, 23:59 AoE | Initial Working Notes due through CyberChair SC03 |
| 6 November | Review feedback and paper acceptance decisions |
| 13 November, 23:59 AoE | Camera-ready papers due from accepted teams |
| 20 November | Organizer overview paper due to the conference |
| 25 November | Winning teams announced |
| 14–17 December | IEEE Big Data 2026 in Phoenix, Arizona, USA |
Working Notes and publication
Teams seeking final ranking and awards must submit Working Notes describing their system through the FinReason Cup SC03 track in CyberChair. Papers may contain up to 10 pages total, including references, and must use the IEEE two-column conference format.
Submit Working Notes through CyberChair SC03
The organizers review the papers and decide acceptance. Selected accepted papers may be included in the conference proceedings, subject to conference publication, camera-ready, registration, and presentation requirements. Submission, ranking, or a certificate does not guarantee paper acceptance or publication. If CyberChair displays a different date, follow the organizer schedule above.
Certificates
FinReason Cup does not offer cash prizes. A team receives a participation certificate when it submits both at least one valid final solution under the applicable task rules by 15 October, 23:59 AoE, and Working Notes through SC03 by 23 October, 23:59 AoE. Winning teams receive winner certificates. Registration support is not confirmed, and registration funding is not promised.
Contact
zhuohan.xie@mbzuai.ac.ae | Terms of Participation
For submission questions, include your team name and task number.
Roadside-LiDAR perception is bottlenecked by the cost of labeled data. Can synthetic LiDAR be made realistic enough to train detectors that work on the real thing?
The challenge Train a 3D object detector on synthetic LiDAR only — no real labels — then run it on held-out real frames. Generate your synthetic data any way you like: physics simulation (CARLA), diffusion / flow models, neural radiance fields, or hybrids. Submit 50 synthetic frames, your detections on 50 real frames, and a signed honor declaration.
Two parallel tracks
- LUMPI (Hannover, Germany): multi-perspective roadside LiDAR, 8 classes including vulnerable road users.
- V2X-Real (Los Angeles, USA): infrastructure-centric V2X LiDAR, 3 classes, very different sensor geometry. Winning both proves cross-distribution robustness.
How you win A combined score of 0.6·detection + 0.4·realism — detection via KITTI 3D mAP, realism via Chamfer Distance, MMD, Earth Mover’s Distance, and Fréchet Point-cloud Distance. The exact scorer ships, so you can reproduce server scores locally.
Platform & prizes Codabench (already provisioned). A USD 2,000 pool, with per-track awards of $500 / $300 / $200; top-3 teams release code and present a challenge report.
Head start A reference synthesis pipeline (UrbanTwin), ready-made synthetic datasets (Harvard Dataverse), and the open-source LiGuard toolkit are all provided.
Organizers Muhammad Shahbaz and Shaurya Agarwal, Urbanity Lab, University of Central Florida.
Emulate four decades of the planet’s carbon cycle — the first open competition for global, multi-decadal land-ecosystem forecasting.
The challenge Given initial ecosystem states and long-term environmental forcings, forecast seven annual carbon variables — vegetation height, aboveground biomass, soil carbon, leaf area index, and gross / net primary productivity and heterotrophic respiration — over multi-decadal horizons. Build fast ML emulators of a physics-based ecosystem model.
The data CarbonGlobe (NeurIPS 2025) — 40 years of global data at 0.5° resolution, 136 input variables, and calibrated Ecosystem Demography (ED) model outputs across 54,152 land sites and 15 forest-age conditions: 812,280 forecasting sequences. ED underpins NASA’s Carbon Monitoring System and the Global Carbon Budget.
How you win RMSE and MAE plus problem-driven metrics — cumulative error and year-to-year delta error — on a hidden test set of future ecosystem states. Source code required for reproducibility.
Platform Kaggle, with baselines and starter notebooks on GitHub.
Organizers Yiqun Xie, Zhihao Wang, Lei Ma, and George Hurtt (University of Maryland), Xiaowei Jia (Rutgers), and Yanhua Li (Worcester Polytechnic Institute).
06 TrafficFlowBench — Traffic-State, OD-Demand & Congestion Analytics
Reconstruct, predict, and explain a metropolis’s traffic — and prove the answer is physically real, not just accurate.
Two divisions
- Open Division — no transportation background needed: reconstruct and predict speed and flow at held-out detectors and times, scored on plain RMSE/MAE. Enter in an afternoon with the starter kit; large student & newcomer prizes.
- Expert Division — the full physical benchmark: fundamental-diagram recovery, OD-demand estimation, congestion diagnostics, physical-consistency scoring, and scalability.
Three tracks
- TrafficStateBench — estimation (spatial imputation), prediction (forecast), and fundamental-diagram recovery.
- ODMEBench — time-dependent OD-demand estimation, plus the flagship demand-to-congestion attribution: trace which trips load which bottleneck.
- ShockwaveBench — congestion onset/duration, queue localization, and shockwave tracking, at three difficulty levels.
The data An open, reproducible California benchmark — an OSM2GMNS network with 150 PeMS-style loop detectors across five Los Angeles freeways (I-5, I-10, I-110, I-210, I-405) at 5-minute resolution for all of 2025 (~11.3 million observations), plus GPS traces, POI trip generation, and NGSIM trajectories. A second Shenzhen region (SUTPC) is prospective.
How you win Per-track composite scores blending accuracy, physical consistency, demand attribution, and congestion diagnostics — grounded in the fundamental diagram, kinematic-wave theory, and the Rankine-Hugoniot condition. Reproducibility is a first-class, machine-checked scoring term. GNNs, spatiotemporal foundation models, PINNs, RL, and LLM agents are all welcome.
Platform & prizes Codabench / EvalAI (evergreen leaderboard), cross-posted to Kaggle. Gold $1,500 · Silver $1,000 · Bronze $500 · Student/Newcomer $500, per division and track — backed by a confirmed Gold sponsorship.
Key dates Registration opens July 15, 2026 · Final submission November 6, 2026 · Results workshop at IEEE Big Data 2026, Phoenix, December 14–17, 2026.
Organizers Shenzhen Urban Transport Planning Center (SUTPC) and the IEEE ITS Society TC on Travel Information & Traffic Management, with RERITE — co-chaired by Xuesong (Simon) Zhou and Xiaochun Zhang, with Cathy Wu (MIT) and Yudai Honma (Univ. of Tokyo).
Can an AI agent navigate the administrative maze of U.S. healthcare — prior authorization, utilization management, care management — the way a trained healthcare worker does, and do it reliably enough to trust? This challenge asks agents not just to answer, but to act, justify, and complete.
The challenge Three parallel tracks, each a long-horizon agentic task inside χ-World — a high-fidelity simulator of 20 real-world healthcare apps operable via 151 REST APIs and 87 MCP tools.
- Track 1 (PA) — verify coverage, gather clinical evidence, submit a prior authorization packet, and work the response through RFIs, peer-to-peer review, and appeals to a terminal status.
- Track 2 (UM) — intake the request, check plan medical policy, escalate through nurse and physician reviewers, and issue a coverage determination.
- Track 3 (CM) — review the patient chart, conduct multi-turn outreach, administer assessments, and author a NANDA-I / NOC / NIC care plan.
Every decision must be grounded in a 1,279-document Managed-Care Operations Handbook developed with clinicians at Johns Hopkins Medicine.
The data χ-World — a containerized simulator populated with ~5,000 chart activities for 50 simulated patients and ~90 healthcare workers (~115K lines of Python), with a 29-status case state machine, FHIR-grade encounter linkage, and a held-out private test set of ~75 clinician-validated tasks never released during the competition. Contains no real patient data, no PHI, and requires no IRB clearance.
How you win A two-layer verifier scores each trial: a deterministic contract checks terminal status, routing assignments, structured payloads, and required artifacts; a rubric-based LLM judge (pinned model, three independent votes) grades whether clinical reasoning is grounded in cited policy sections. Primary metric is pass@1 (fraction of tasks solved on a single attempt) across all three tracks, combined into an overall leaderboard score. Ties broken by pass^3 (solved in all 3 independent attempts), then by efficiency (cost and tool-call steps). Source code and a qualifying report are required for finalist eligibility; finalists are re-verified by organizers on the private test set.
Cash prizes Gold (1st overall) $1,500 · Silver (2nd overall) $1,000 · Bronze (3rd overall) $500 · plus a dedicated Reliability Award for the top pass^3 score. Total prize pool: $3,000, sponsored by actAVA.ai. Finalists are additionally offered co-authorship on a post-competition community results report and invited to present at IEEE Big Data 2026 in Phoenix.
Track record The benchmark is far from solved — the best frontier agent resolves only 28.0% of tasks overall (pass@1), no configuration cleared 20% under the strict pass^3 reliability metric, full-session multi-task performance collapses to 3.8%, and the end-to-end provider–payer arena drops the best agents to 0%.
Organizers Weiran Yao (actAVA.ai, lead), Frank Wang (CTO, actAVA.ai), Haolin Chen (actAVA.ai). Clinical advisors: T. Y. Alvin Liu MD (Johns Hopkins Medicine), Hank Capps MD (Wellstar Health System).
Scientific advisors: Philip S. Yu (University of Illinois Chicago), Eric P. Xing (MBZUAI & Carnegie Mellon University), Kun Zhang (CMU & MBZUAI), Sanmi Koyejo (Stanford University), Caiming Xiong (Recursive Superintelligence), Biwei Huang (UC San Diego), Yue Zhao (University of Southern California), Carl Yang (Emory University), Qingsong Wen (independent), Hua Wei (Arizona State University), and Yanjie Fu (Arizona State University).
