{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003607674,0.0003231149,0.0002931224,0.0001763979,0.0002444169,0.0002878147,0.001635521,0.0001994706,0.000009281619],"category_scores_gemma":[0.0000156865,0.0003184297,0.0001399481,0.0003681398,0.00008339698,0.0005255492,0.001720629,0.00108865,0.0000821916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000162627,"about_ca_system_score_gemma":0.0001229173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003522418,"about_ca_topic_score_gemma":0.00003239147,"domain_scores_codex":[0.9981383,0.0001501383,0.0001346162,0.0009282302,0.0001191866,0.0005295154],"domain_scores_gemma":[0.9982815,0.00007335694,0.0002262837,0.001154653,0.0000542613,0.000209959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000045595,0.0002403299,0.02299852,0.0002228137,0.0002938357,0.000698793,0.003871283,0.7673272,0.00001533528,0.1662388,0.000127328,0.03792011],"study_design_scores_gemma":[0.001733281,0.0002656795,0.006919746,0.000805327,0.0003558354,0.0001113505,0.0007002132,0.9145693,0.0001187744,0.004223367,0.06724284,0.002954288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1267793,0.0001287137,0.871241,0.0000722459,0.0004757206,0.0001460717,0.000004666645,0.0006135025,0.0005388448],"genre_scores_gemma":[0.9511166,0.00002426286,0.04622557,0.00002001563,0.0001365667,9.123917e-7,0.000009540591,0.00002754214,0.002439043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8250154,"threshold_uncertainty_score":0.9999268,"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."}}