{"id":"W2479263369","doi":"10.1016/j.jda.2016.07.001","title":"Reconstructing binary matrices with timetabling constraints","year":2016,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dimension (graph theory); Binary number; Greedy algorithm; Relaxation (psychology); Matrix (chemical analysis); Mathematical optimization; Mathematics; Computational complexity theory; Computer science; Algorithm; Time complexity; Combinatorics","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.0004180031,0.0001561881,0.0002663419,0.0002794513,0.00007491007,0.0003969484,0.0009030168,0.0000439722,0.00001535058],"category_scores_gemma":[0.0001218704,0.00008399324,0.00009008165,0.0003845455,0.0002292555,0.003733063,0.000160209,0.0001532316,0.000009520813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004787381,"about_ca_system_score_gemma":0.0001846911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001589787,"about_ca_topic_score_gemma":1.568401e-7,"domain_scores_codex":[0.998606,0.00004232223,0.0004689863,0.000205479,0.0004113398,0.0002658843],"domain_scores_gemma":[0.9984096,0.0001641129,0.0006971674,0.0002478228,0.0003461361,0.0001351759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000147062,0.00002908292,0.0007706952,0.00001459426,0.00006022205,0.000230669,0.00006329188,0.000001920559,0.006816817,0.0009748749,0.00037818,0.9906449],"study_design_scores_gemma":[0.01337849,0.01043848,0.004219574,0.01795371,0.0005467354,0.09624629,0.001608065,0.0237216,0.5499816,0.2594145,0.01686321,0.005627768],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00907032,0.0005014538,0.9863839,0.0008440034,0.0002048806,0.0000559577,0.000003917979,0.0001294317,0.002806113],"genre_scores_gemma":[0.221026,0.00006186456,0.7786182,0.00005068035,0.0001117348,0.000001152408,1.186283e-7,0.00001315974,0.000117148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9850172,"threshold_uncertainty_score":0.3827782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01348761331051964,"score_gpt":0.2561381153743783,"score_spread":0.2426505020638586,"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."}}