# III: Small: Theoretical Foundations of Hypergraph Learning: Expressiveness and Sample Complexity

**Budget Signal Score:** 55/100

| Field | Value |
|---|---|
| Institution | University of Delaware |
| Location | NEWARK, DE |
| Project | III: Small: Theoretical Foundations of Hypergraph Learning: Expressiveness and Sample Complexity |
| Award amount | $597,508 |
| Obligated so far | $597,508 |
| Awarded | 2026-07-23 |
| Period | 2026-09-01 to 2029-08-31 |
| Program | Info Integration & Informatics |
| Directorate / division | CSE / CAIF |
| Award ID | 2546201 |

## Why this score
- Award of $300K or more.
- Equipment- and compute-heavy field.

Source: U.S. National Science Foundation Awards API (https://www.nsf.gov/awardsearch/showAward?AWD_ID=2546201). Last refreshed: 2026-11-04T18:13:44.963Z.
Award data comes from the NSF Awards API and may be amended by NSF. Institution-level only; investigator contact details are not included. Informational only.