{"meta":{"query_hash":"1c45d50205b1","filters":{"venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1c45d50205b1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings%2FProceedings+-+Symposium+on+Computer+Arithmetic"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011483169382318864,"score_gpt":0.24100293752232482,"score_spread":0.22951976814000596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142005615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20785032,0.0001111201,0.785606,0.0008116772,0.0022698678,0.0016817196,0.000009516839,0.0008338128,0.0008259172],"genre_scores_gemma":[0.5077279,0.00004455374,0.48933533,0.00036245497,0.002189267,0.00015437306,0.000012181964,0.0001089489,0.00006497583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941452,0.00001034151,0.0012435275,0.0020331226,0.0010071881,0.0015605848],"domain_scores_gemma":[0.99687606,0.00015455471,0.00070438866,0.00041025336,0.001293708,0.0005610485],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016562894,0.00088645204,0.0007621642,0.0017625575,0.0009461779,0.0010713444,0.0017191247,0.00047989836,0.0000035916207],"category_scores_gemma":[0.000045868303,0.00087603263,0.0005676617,0.0021891207,0.00025677844,0.0021971788,0.00047714353,0.0006860062,0.000021353611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057990954,0.0025732208,0.0016406025,0.0011507316,0.0006636817,0.000026984962,0.01075493,0.00067808095,0.3755118,0.048848875,0.005531092,0.5520401],"study_design_scores_gemma":[0.0025399174,0.00095708255,0.001466446,0.0003913604,0.0001395142,0.000454766,0.0003011922,0.8882418,0.09882645,0.003169422,0.0021073835,0.0014046646],"about_ca_topic_score_codex":0.000042138432,"about_ca_topic_score_gemma":8.296101e-7,"teacher_disagreement_score":0.8875637,"about_ca_system_score_codex":0.0005224181,"about_ca_system_score_gemma":0.00009604224,"threshold_uncertainty_score":0.99996567},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00907540417949722,"score_gpt":0.22752003212094424,"score_spread":0.218444627941447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162548688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22819775,0.00053741876,0.61924994,0.0035241083,0.0038715014,0.001941299,0.0000051529532,0.003938117,0.1387347],"genre_scores_gemma":[0.8499635,0.000078270845,0.14680247,0.0015704782,0.0012070084,0.000058617465,0.0000029757377,0.00010738741,0.00020930763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927505,0.0000110018655,0.00128157,0.0021389988,0.0016931278,0.0021247633],"domain_scores_gemma":[0.9967937,0.00033048686,0.00055684824,0.0004980971,0.00097479986,0.00084607553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023962592,0.001009236,0.0008537266,0.0031935214,0.00088863634,0.0018961827,0.0031247586,0.00043631266,0.000011567141],"category_scores_gemma":[0.00010103556,0.00094904867,0.0005428863,0.0059136916,0.0002191807,0.0020964227,0.0011501344,0.0011248488,0.0002289314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001974683,0.0016113677,0.020829644,0.0007587701,0.00035466626,0.00013834814,0.0042261034,0.00009390712,0.013232029,0.79056484,0.0092534665,0.15873937],"study_design_scores_gemma":[0.015056063,0.012443228,0.18066631,0.002640176,0.0006626194,0.004374602,0.0010599775,0.37928,0.20793544,0.08032769,0.1027714,0.012782479],"about_ca_topic_score_codex":0.000027853239,"about_ca_topic_score_gemma":0.0000019828171,"teacher_disagreement_score":0.71023715,"about_ca_system_score_codex":0.00029254283,"about_ca_system_score_gemma":0.00007215811,"threshold_uncertainty_score":0.999296},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013488359848803496,"score_gpt":0.26533982185857047,"score_spread":0.251851462009767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167110608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024964038,0.00014726425,0.9468652,0.008660264,0.0011351344,0.00097500056,0.000015229729,0.0013605282,0.015877336],"genre_scores_gemma":[0.2524225,0.00006513223,0.7393788,0.0064294417,0.001013373,0.000087332075,0.0000061667965,0.00010301002,0.000494246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944449,0.000012376921,0.0010535055,0.0019088007,0.0012168675,0.0013635601],"domain_scores_gemma":[0.99709564,0.00025642096,0.00053097244,0.00036522772,0.00102766,0.0007240935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019017253,0.0007421767,0.0007008477,0.00061262003,0.00048559206,0.0013445633,0.002050483,0.0003009244,0.000019994612],"category_scores_gemma":[0.000089042966,0.0006853061,0.0002602284,0.0021172145,0.00021896676,0.0013004179,0.0006522367,0.00073866965,0.00018929852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022084924,0.0022732732,0.005282581,0.00047552038,0.00025775307,0.00003766789,0.0053752623,0.000008365681,0.22324644,0.29114768,0.09175329,0.37992132],"study_design_scores_gemma":[0.0042259214,0.003334247,0.0021588025,0.00048563,0.00011253948,0.00052576204,0.00029202428,0.5531386,0.2738242,0.016835334,0.14156683,0.0035000995],"about_ca_topic_score_codex":0.000022487877,"about_ca_topic_score_gemma":1.7540961e-7,"teacher_disagreement_score":0.55313027,"about_ca_system_score_codex":0.00024553682,"about_ca_system_score_gemma":0.000054900174,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null}]}