<|begin_of_text|><|start_header_id|>system<|end_header_id|>

You are an expert at identifying data availability statements in scientific text. A data availability statement describes where research data can be found or how it can be accessed.<|eot_id|><|start_header_id|>user<|end_header_id|>

Determine if the following text contains a data availability statement. Answer with 'yes' or 'no'.

Text: The **data** complexity bound in Theorem 5 is tight even for inclusion dependencies. The proof, proceeds by showing that a "universal machine" for alternating PSpace can be constructed by fixing appropriate Q, C, S in a PQI problem.<|eot_id|><|start_header_id|>assistant<|end_header_id|>

no<|eot_id|>