{"id":"W6891547493","doi":"10.4230/lipics.itcs.2025.37","title":"A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; University of Toronto; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; University of Rochester","keywords":"Boolean function; Logarithm; Parity function; Binary decision diagram; Exponential function; Norm (philosophy); Upper and lower bounds; Integer (computer science); Binary number","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005035624,0.002167183,0.00151788,0.002316478,0.001086135,0.003127064,0.003015825,0.002128273,0.008636189],"category_scores_gemma":[0.03697269,0.0007722596,0.002555757,0.002304254,0.004675878,0.01074243,0.005671989,0.01113183,0.002854784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002681766,"about_ca_system_score_gemma":0.001810699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001056052,"about_ca_topic_score_gemma":0.0008987653,"domain_scores_codex":[0.9955032,0.001111326,0.000204684,0.0008618882,0.001806006,0.0005128551],"domain_scores_gemma":[0.9765276,0.01701483,0.0008629251,0.002617719,0.002162517,0.0008143299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002080477,0.0001900903,0.001044529,0.0003071387,0.00005665009,0.0002136435,0.0002607888,0.0346006,0.01053014,0.8744567,0.006395291,0.07173634],"study_design_scores_gemma":[0.00002520448,0.0001511739,0.0003972058,0.00009009515,0.00003274702,0.0002149316,0.00004428158,0.2767623,0.006620716,0.7086889,0.006908418,0.00006422129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01184471,0.00142978,0.9640082,0.001998794,0.0004062436,0.00008253716,0.0002754121,0.0003578923,0.01959651],"genre_scores_gemma":[0.4950076,0.004971384,0.4679832,0.002924507,0.002701926,0.0010267,0.0009750971,0.0009933687,0.02341618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008636189,"threshold_uncertainty_score":0.02889091,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01565305313479278,"score_gpt":0.2603466745017213,"score_spread":0.2446936213669285,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}