{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068437055,0.00040109898,0.9217671,0.00020559195,0.00012461637,0.00012848682,0.00006695376,0.0018267626,0.0070423502],"genre_scores_gemma":[0.31540328,0.0004240992,0.67412764,0.00017280177,0.00023404317,0.00015133164,0.0005176778,0.00042317246,0.008545885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.000121499404,0.000043649816,0.000118685544,0.00042394438,0.00012447702],"domain_scores_gemma":[0.9994221,0.00017434533,0.00005838333,0.00016691307,0.00014394104,0.000034404176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004627994,0.0005340819,0.0005873775,0.0014821811,0.0007229525,0.00081963366,0.0008330267,0.00041483677,0.0037152963],"category_scores_gemma":[0.0015587602,0.00017884625,0.00060004974,0.000869097,0.0006180586,0.0020258103,0.0010621895,0.0011737982,0.0016709681],"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.00075707043,0.00019479275,0.0016609733,0.00024565778,0.000059475446,0.00027916973,0.00053309323,0.01357632,0.13129294,0.12214589,0.006514851,0.7227398],"study_design_scores_gemma":[0.00046535835,0.0012619231,0.0033356159,0.00012440025,0.00020468487,0.0022407204,0.0003407816,0.32117057,0.38403496,0.19650093,0.09010189,0.00021819716],"about_ca_topic_score_codex":0.0004438243,"about_ca_topic_score_gemma":0.00059860805,"teacher_disagreement_score":0.0037152963,"about_ca_system_score_codex":0.0004308133,"about_ca_system_score_gemma":0.00061586266,"threshold_uncertainty_score":0.012428939},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050340995,0.0008433222,0.88958406,0.000390276,0.0004216625,0.00015761131,0.00022993148,0.002037625,0.05599456],"genre_scores_gemma":[0.5160355,0.0009876954,0.45373255,0.00047257682,0.00039831715,0.00018950408,0.0005697661,0.00049372384,0.027120413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00011461106,0.00009118648,0.00013789155,0.00049293396,0.00012721641],"domain_scores_gemma":[0.9989987,0.000262707,0.00012540421,0.00030527724,0.00026032227,0.000047568985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006258747,0.00065348134,0.0005685304,0.0011832695,0.0007254076,0.0014957843,0.0011938591,0.0007219524,0.012415228],"category_scores_gemma":[0.0032008092,0.0002923183,0.00076792913,0.0014250388,0.00079583074,0.0028383797,0.0016180605,0.0014616207,0.003327736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00022268802,0.00007921141,0.0005969866,0.00028309526,0.00003991312,0.0003227404,0.00024795282,0.010759999,0.04235686,0.5873148,0.009675511,0.34810024],"study_design_scores_gemma":[0.00013539907,0.0005083444,0.0009663748,0.00017282134,0.00014986495,0.0022586912,0.00013036869,0.17331812,0.10563599,0.5630672,0.15349494,0.000161998],"about_ca_topic_score_codex":0.00029729985,"about_ca_topic_score_gemma":0.00060829066,"teacher_disagreement_score":0.012415228,"about_ca_system_score_codex":0.00067006215,"about_ca_system_score_gemma":0.00056045345,"threshold_uncertainty_score":0.041533113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.172139,0.0050491397,0.69768906,0.0036932584,0.0007010274,0.00010829291,0.0003332502,0.0033852432,0.116901666],"genre_scores_gemma":[0.77582395,0.00199253,0.19715661,0.0006490425,0.00036501506,0.000133302,0.00026516666,0.00055627536,0.023058087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974927,0.00039667162,0.00013760841,0.0006174626,0.0010246293,0.00033094484],"domain_scores_gemma":[0.9922925,0.004151387,0.0007891122,0.0019646585,0.0006654227,0.00013687013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156873,0.0009019704,0.00057728647,0.0006396945,0.0008333057,0.00357994,0.0010082033,0.0005612727,0.009063195],"category_scores_gemma":[0.007998832,0.00036651705,0.0005279832,0.00092651375,0.0021002537,0.007505607,0.0015480164,0.002155653,0.0029530874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0010167457,0.000094406816,0.0013707458,0.0007029103,0.000043896795,0.00027496426,0.00061258284,0.016790215,0.045626063,0.76990175,0.0061462275,0.15741941],"study_design_scores_gemma":[0.00011845492,0.00046252593,0.0008648708,0.00019929148,0.00014377704,0.0013987496,0.0002802856,0.14457922,0.1584013,0.5668255,0.12664737,0.000078761754],"about_ca_topic_score_codex":0.00058880204,"about_ca_topic_score_gemma":0.0008775916,"teacher_disagreement_score":0.009063195,"about_ca_system_score_codex":0.0015108681,"about_ca_system_score_gemma":0.0012321931,"threshold_uncertainty_score":0.030319393},"labels":[],"label_agreement":null}]}