When is the partial map classifier a Sierpi'nski cone?

We study the relationship between partial map classifiers, Sierpi'nski cones, and axioms for synthetic higher categories and domains within univalent foundations. In particular, we show that synthetic ∞-categories are closed under partial map classifiers assuming Phoa's principle, and we isolate a new reflective subuniverse of types within which the Sierpi'nski cone (a lax colimit) can be computed as a partial map classifier by strengthening the Segal condition.