{"id":"W2950698144","doi":"10.48550/arxiv.1203.2296","title":"Discovering Algorithms with Matrix Code","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Programming language; Code (set theory); Java; Matrix (chemical analysis); Unreachable code; Redundant code; Table (database); Dead code; Algorithm; Row; Prime (order theory); Process (computing); Theoretical computer science; Code generation; Mathematics; Database; Operating system; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003317558,0.0009465944,0.0005481278,0.001688819,0.001092472,0.00325638,0.001713671,0.001130537,0.008453744],"category_scores_gemma":[0.02674782,0.001011209,0.00146776,0.001165466,0.003175267,0.007034848,0.003538747,0.002677665,0.003084461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008605177,"about_ca_system_score_gemma":0.001354255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004415889,"about_ca_topic_score_gemma":0.0005569983,"domain_scores_codex":[0.9967331,0.001063026,0.0002221007,0.0006565743,0.001186979,0.0001382647],"domain_scores_gemma":[0.98445,0.01140978,0.0007220542,0.001981518,0.001226552,0.0002099356],"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.00014494,0.0001398937,0.002155468,0.000537454,0.00004955698,0.0004347544,0.001740896,0.02139277,0.00991335,0.6945137,0.005896296,0.2630808],"study_design_scores_gemma":[0.00004856964,0.0001441516,0.0002564749,0.0001924056,0.00003498721,0.000648865,0.0002688878,0.1153492,0.02967983,0.7964765,0.0568546,0.00004562765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007974727,0.00009145955,0.9869503,0.0004435506,0.00003030895,0.00006698487,0.00006534649,0.001155195,0.003222124],"genre_scores_gemma":[0.0750628,0.0002694791,0.919646,0.00013192,0.00006460102,0.0001631551,0.0003178431,0.000753302,0.003590904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008453744,"threshold_uncertainty_score":0.02828062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06455414769699142,"score_gpt":0.2058991398270344,"score_spread":0.141344992130043,"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."}}