{"id":"W2512595308","doi":"10.14778/3067421.3067422","title":"Effective and complete discovery of order dependencies via set-based axiomatization","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the VLDB Endowment","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor; University of Waterloo; York University; Ontario Tech University","funders":"","keywords":"Computer science; Tuple; Completeness (order theory); Inference; Axiom; Rule of inference; Functional dependency; Set (abstract data type); Data mining; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Relational database; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003359446,0.0002750951,0.0006356508,0.0002505817,0.0002228692,0.0005649687,0.002077858,0.0001183693,0.00001970475],"category_scores_gemma":[0.002580051,0.0001719684,0.0001823894,0.0002198378,0.0004109991,0.0005211645,0.003889347,0.0002096518,0.000006024994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007165452,"about_ca_system_score_gemma":0.00006601547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004662753,"about_ca_topic_score_gemma":0.00005052134,"domain_scores_codex":[0.9965212,0.00006402037,0.000819087,0.0006414158,0.001749806,0.0002044418],"domain_scores_gemma":[0.9958264,0.0004531025,0.00221529,0.0006880905,0.0007677205,0.00004936311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002354641,0.003064084,0.08989029,0.02366118,0.003795919,0.000007575227,0.03018588,0.007448188,0.2422698,0.2657902,0.05540025,0.2761321],"study_design_scores_gemma":[0.003221047,0.0005234475,0.1476767,0.003035057,0.0008055654,0.000007890549,0.004164586,0.01907125,0.256067,0.5560165,0.008098816,0.001312084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9286258,0.0005723568,0.04424132,0.004817606,0.001897197,0.00620824,0.001266979,0.00007313653,0.01229739],"genre_scores_gemma":[0.9976421,0.00004405493,0.00161178,0.000101328,0.00003790453,0.0001238051,0.00001744494,0.00001344177,0.0004081534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2902263,"threshold_uncertainty_score":0.7012666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1062798927027729,"score_gpt":0.365548465284661,"score_spread":0.2592685725818881,"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."}}