shows

P2371
predicate

Indicates that one entity presents, displays, or makes another entity visible or known to an audience or observer.

All labels observed (5)

Label Occurrences
shows canonical 1,086
entertainment 15
oftenShows 5

Description generation (PDg)

The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.

Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning.  
# Instructions
Focus on describing the relationship, not the entities themselves. 
# Response Format
Begin the description with \' Indicates...\'
Input
Predicate: shows
Generated description
Indicates that one entity presents, displays, or makes another entity visible or known to an audience or observer.

Sample triples (1,114)

Subject Object
Zytglogge clock tower
surface form: Zytglogge
moon phase
Zytglogge clock tower
surface form: Zytglogge
day of the week
Intriguing properties of neural networks existence of adversarial examples for deep networks
Intriguing properties of neural networks small imperceptible perturbations can cause misclassification
Intriguing properties of neural networks adversarial examples generalize across different models
Intriguing properties of neural networks adversarial examples can transfer between different architectures
Intriguing properties of neural networks adversarial examples can transfer between models trained on different subsets of data
Intriguing properties of neural networks adversarial examples can transfer between models trained with different hyperparameters
Intriguing properties of neural networks linear behavior in high-dimensional spaces contributes to adversarial vulnerability
Reel Cinemas Hollywood films
Reel Cinemas Bollywood films
Reel Cinemas regional films
NGC 205 mixed-age stellar populations
NGC 205 recent star formation
NGC 205 tidal interaction with Andromeda Galaxy
Magellanic Stream signs of fragmentation
Magellanic Stream signs of interaction with Milky Way halo
Marauder's Map secret passage from Hogwarts to Honeydukes
Marauder's Map location of the Whomping Willow passage
Marauder's Map staff locations
Marauder's Map student locations
Marauder's Map ghost locations
Marauder's Map Animagus locations
Marauder's Map unregistered Animagi
Marauder's Map invisible people
Marauder's Map people under Invisibility Cloaks
Marauder's Map people under Disillusionment Charms
The Rape of the Daughters of Leucippus two nude women being abducted
The Rape of the Daughters of Leucippus two armored horsemen
The Rape of the Daughters of Leucippus rearing horses
The Rape of the Daughters of Leucippus putto
The Rape of the Daughters of Leucippus dramatic sky
Hardy–Ramanujan asymptotic formula p(n) grows rapidly with n
Andromeda II evidence of multiple stellar populations
Andromeda II evidence of past merger event
Håstad’s switching lemma probability that restricted formula has large decision tree depth is exponentially small in depth bound
Håstad’s switching lemma random restrictions simplify small-width CNF and DNF formulas
“Almost optimal lower bounds for small depth circuits”
surface form: Almost optimal lower bounds for small depth circuits
any constant-depth AC0 circuit computing parity requires superpolynomial size
“Almost optimal lower bounds for small depth circuits”
surface form: Almost optimal lower bounds for small depth circuits
lower bounds that are close to optimal up to polynomial factors
delayed-choice experiment measurement can determine whether interference is observed
delayed-choice experiment measurement choice can be made after particle enters interferometer
delayed-choice experiment measurement choice can be made after particle passes first beam splitter
delayed-choice experiment no need to assume particle had definite wave or particle nature beforehand
delayed-choice experiment incompatibility with naive classical trajectory picture
“Inapproximability results for SAT and other problems”
surface form: Inapproximability results for SAT and other problems
certain approximation ratios for SAT are NP-hard to achieve
“Inapproximability results for SAT and other problems”
surface form: Inapproximability results for SAT and other problems
improving beyond specific approximation factors for some problems would imply P = NP
Salvator Mundi frontal half-length figure of Christ
Salvator Mundi Christ raising his right hand in blessing
Salvator Mundi Christ holding a crystal orb in his left hand
Standard of Ur social hierarchy