{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1c45d50205b1","filters":{"venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic"}},"results":[{"id":"W2162548688","doi":"10.1109/arith.2007.11","title":"Asymmetric Squaring Formulae","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Pohang University of Science and Technology","keywords":"Pentium; Constant (computer programming); Operand; Mathematics; Division (mathematics); Interpolation (computer graphics); Multiplication (music); Algorithm; Arithmetic; Overhead (engineering); Computer science; Combinatorics; Parallel computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00907540417949722,"gpt":0.2275200321209442,"spread":0.218444627941447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002396259,0.001009236,0.0008537266,0.003193521,0.0008886363,0.001896183,0.003124759,0.0004363127,0.00001156714],"category_scores_gemma":[0.0001010356,0.0009490487,0.0005428863,0.005913692,0.0002191807,0.002096423,0.001150134,0.001124849,0.0002289314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002925428,"about_ca_system_score_gemma":0.00007215811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002785324,"about_ca_topic_score_gemma":0.000001982817,"domain_scores_codex":[0.9927505,0.00001100187,0.00128157,0.002138999,0.001693128,0.002124763],"domain_scores_gemma":[0.9967937,0.0003304869,0.0005568482,0.0004980971,0.0009747999,0.0008460755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001974683,0.001611368,0.02082964,0.0007587701,0.0003546663,0.0001383481,0.004226103,0.00009390712,0.01323203,0.7905648,0.009253467,0.1587394],"study_design_scores_gemma":[0.01505606,0.01244323,0.1806663,0.002640176,0.0006626194,0.004374602,0.001059977,0.37928,0.2079354,0.08032769,0.1027714,0.01278248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2281978,0.0005374188,0.6192499,0.003524108,0.003871501,0.001941299,0.000005152953,0.003938117,0.1387347],"genre_scores_gemma":[0.8499635,0.00007827084,0.1468025,0.001570478,0.001207008,0.00005861746,0.000002975738,0.0001073874,0.0002093076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7102371,"threshold_uncertainty_score":0.999296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167110608","doi":"10.1109/arith.2007.24","title":"Multiplication by a Constant is Sublinear","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Calgary Laboratory Services; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sublinear function; Multiplication (music); Constant (computer programming); Integer (computer science); Conjecture; Mathematics; Scheme (mathematics); Computer science; Arithmetic; Discrete mathematics; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0134883598488035,"gpt":0.2653398218585705,"spread":0.251851462009767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001901725,0.0007421767,0.0007008477,0.00061262,0.0004855921,0.001344563,0.002050483,0.0003009244,0.00001999461],"category_scores_gemma":[0.00008904297,0.0006853061,0.0002602284,0.002117214,0.0002189668,0.001300418,0.0006522367,0.0007386697,0.0001892985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002455368,"about_ca_system_score_gemma":0.00005490017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002248788,"about_ca_topic_score_gemma":1.754096e-7,"domain_scores_codex":[0.9944449,0.00001237692,0.001053505,0.001908801,0.001216867,0.00136356],"domain_scores_gemma":[0.9970956,0.000256421,0.0005309724,0.0003652277,0.00102766,0.0007240935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002208492,0.002273273,0.005282581,0.0004755204,0.0002577531,0.00003766789,0.005375262,0.000008365681,0.2232464,0.2911477,0.09175329,0.3799213],"study_design_scores_gemma":[0.004225921,0.003334247,0.002158802,0.00048563,0.0001125395,0.000525762,0.0002920243,0.5531386,0.2738242,0.01683533,0.1415668,0.0035001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02496404,0.0001472642,0.9468652,0.008660264,0.001135134,0.0009750006,0.00001522973,0.001360528,0.01587734],"genre_scores_gemma":[0.2524225,0.00006513223,0.7393788,0.006429442,0.001013373,0.00008733208,0.000006166797,0.00010301,0.000494246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5531303,"threshold_uncertainty_score":0.9996921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142005615","doi":"10.1109/arith.2007.23","title":"Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reduction (mathematics); Modular arithmetic; Algorithm; Polynomial; Mathematics; Multiplication (music); Modular design; Arithmetic; Computer science; Combinatorics; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01148316938231886,"gpt":0.2410029375223248,"spread":0.229519768140006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001656289,0.000886452,0.0007621642,0.001762558,0.0009461779,0.001071344,0.001719125,0.0004798984,0.000003591621],"category_scores_gemma":[0.0000458683,0.0008760326,0.0005676617,0.002189121,0.0002567784,0.002197179,0.0004771435,0.0006860062,0.00002135361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005224181,"about_ca_system_score_gemma":0.00009604224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004213843,"about_ca_topic_score_gemma":8.296101e-7,"domain_scores_codex":[0.9941452,0.00001034151,0.001243528,0.002033123,0.001007188,0.001560585],"domain_scores_gemma":[0.9968761,0.0001545547,0.0007043887,0.0004102534,0.001293708,0.0005610485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005799095,0.002573221,0.001640602,0.001150732,0.0006636817,0.00002698496,0.01075493,0.0006780809,0.3755118,0.04884887,0.005531092,0.5520401],"study_design_scores_gemma":[0.002539917,0.0009570825,0.001466446,0.0003913604,0.0001395142,0.000454766,0.0003011922,0.8882418,0.09882645,0.003169422,0.002107383,0.001404665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2078503,0.0001111201,0.785606,0.0008116772,0.002269868,0.00168172,0.000009516839,0.0008338128,0.0008259172],"genre_scores_gemma":[0.5077279,0.00004455374,0.4893353,0.000362455,0.002189267,0.0001543731,0.00001218196,0.0001089489,0.00006497583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8875637,"threshold_uncertainty_score":0.9999657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}