Smiling Friends
Australian-American adult animated sitcom
Smiling Friends is an adult animated sitcom created by Zach Hadel and Michael Cusack for Cartoon Network's nighttime programming block Adult Swim. The show revolves around the surreal misadventures of a small charity and its four employees dedicated to spreading happiness. It utilizes a wide variety of different art styles and animation techniques, including stylized traditional animation, computer animation, rotoscoping, stop motion, Flash animation, and live-action.
The pilot episode aired April 1, 2020, unannounced as part of Adult Swim's annual April Fools' Day event alongside the premiere of Cusack's other series, YOLO. On May 19, 2021, Adult Swim ordered a full season that was initially set to premiere in late 2021. A panel dedicated to the series was held during the Adult Swim Festival on November 12, 2021, where co-creator Zach Hadel mentioned the show would premiere "within a few months", pushing the release schedule ahead to 2022. The first season contains nine episodes, including the pilot and an 11-minute special. The first season eventually premiered on January 10, 2022, with Adult Swim airing all episodes of the season, except for the special, in one night despite initial plans for a weekly release.
Smiling Friends received positive reviews from critics. It was renewed for a second season on February 9, 2022. The season premiere aired on April 1, 2024, with the rest of the season beginning to air on May 13.
This brief starts where responsible research should: with the source description of “Smiling Friends” as australian-American adult animated sitcom. Everything that follows is an evidence route, not borrowed authority.
Why this record matters
The subject matters to the general reference register because the source frames it as australian-American adult animated sitcom. Its deeper value depends on whether names, dates, institutions and citations support that framing.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Sep 8, 2026. The linked authority identifier is Q107087854. 1 of 1 selected statements include explicit references; 0 carry qualifiers and 0 use preferred rank. The first chronological checks are 2020, 2021, 2022 and 2024.
The absence of detail may reflect summary conventions rather than a lack of surviving documentation. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Smiling Friends”, its source revision and the description used here.
- Expand the search: follow Smiling Friends primary sources, Smiling Friends archive and Smiling research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Smiling Friends”?
- Which cited source is closest to the event, object or claim?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Smiling Friends” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.