{"meta":{"query_hash":"4bef9b2bff11","filters":{"venue":"GANIT Journal of Bangladesh Mathematical Society"},"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/4bef9b2bff11","api":"https://metacan.xera.ac/api/v1/cohort?venue=GANIT+Journal+of+Bangladesh+Mathematical+Society"},"results":[{"id":"W2017428041","doi":"10.3329/ganit.v33i0.17660","title":"An Improved Decomposition Approach and its Computational Technique for Analyzing Primal-Dual Relationship in LP & LFP Problems","year":2014,"lang":"en","type":"article","venue":"GANIT Journal of Bangladesh Mathematical Society","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dual polyhedron; Dual (grammatical number); Linear programming; Decomposition; Decomposition method (queueing theory); Mathematical optimization; Computation; Computer science; Mathematics; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Chemistry","score_opus":0.021823145500673442,"score_gpt":0.27346529454738905,"score_spread":0.2516421490467156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017428041","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.025333412,0.00007533641,0.9736748,0.00008511183,0.000020157453,0.0005097105,0.0000033843437,0.000064966305,0.00023315141],"genre_scores_gemma":[0.5043118,0.00000485422,0.49554864,0.000018095514,0.000045065866,0.000029188317,0.0000138754785,0.000022083126,0.000006366481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875253,0.00005550626,0.0006650879,0.00012770492,0.00018283022,0.00021631732],"domain_scores_gemma":[0.9989779,0.00046880968,0.00015911474,0.00008469239,0.00017005872,0.00013940211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593421,0.00015533423,0.00032334772,0.00008217721,0.00009197513,0.00009612353,0.00010068553,0.00015436788,0.000019042927],"category_scores_gemma":[0.00023573582,0.0001391635,0.00013274566,0.00021592125,0.000039909813,0.00033250218,0.00001609455,0.00030778325,0.0000019555453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000088611865,0.0024494543,0.0010192429,0.0113742035,0.00047645392,0.0000020604882,0.015100208,0.67519265,0.06759692,0.22027847,0.000760321,0.0056613795],"study_design_scores_gemma":[0.0007361402,0.00010061257,0.00015272564,0.00015543106,0.000052437692,0.00008404463,0.00013501677,0.9269367,0.00033455767,0.07105773,0.000069599875,0.00018503392],"about_ca_topic_score_codex":1.4774315e-7,"about_ca_topic_score_gemma":4.018693e-7,"teacher_disagreement_score":0.4789784,"about_ca_system_score_codex":0.00007882992,"about_ca_system_score_gemma":0.000017515482,"threshold_uncertainty_score":0.5674923},"labels":[],"label_agreement":null},{"id":"W2473424882","doi":"10.3329/ganit.v34i0.28549","title":"A New Decomposition-Based Pricing Technique For Solving Large-Scale Mixed IP with a Computer Technique","year":2016,"lang":"en","type":"article","venue":"GANIT Journal of Bangladesh Mathematical Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decomposition; Integer programming; Computer science; Scale (ratio); Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Filter (signal processing); Algorithm; Mathematics; Statistics","score_opus":0.008430422427400646,"score_gpt":0.22844857184265463,"score_spread":0.220018149415254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473424882","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.0010663569,0.000034278775,0.997686,0.00031004826,0.00006263062,0.00051760976,0.00000917508,0.00014991961,0.00016393528],"genre_scores_gemma":[0.10836754,0.0000116354195,0.8911817,0.00011282724,0.00017497355,0.000043579716,0.0000023979837,0.000059954702,0.000045351957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880445,0.000019735497,0.00048200358,0.00011816359,0.00023159878,0.00034407174],"domain_scores_gemma":[0.9989481,0.00035103734,0.00017278404,0.00014290794,0.00019987558,0.00018530466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053477444,0.0001919653,0.0003401573,0.00006349283,0.000094208604,0.00006419926,0.00016504273,0.00015300576,0.00016400786],"category_scores_gemma":[0.000028028362,0.0001239555,0.0002666295,0.00020080862,0.00003216894,0.00016711063,0.000017932656,0.00019977795,0.0000053742006],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0004204365,0.0016894218,0.0021985215,0.008124818,0.0020878026,0.000059337497,0.011502413,0.11569149,0.70022905,0.012297737,0.11831184,0.027387125],"study_design_scores_gemma":[0.009742483,0.0014198008,0.00034416182,0.010183728,0.0004674126,0.00084546476,0.00037627495,0.46680105,0.4801869,0.020308493,0.0076492503,0.0016749537],"about_ca_topic_score_codex":3.8449048e-7,"about_ca_topic_score_gemma":9.71756e-7,"teacher_disagreement_score":0.35110956,"about_ca_system_score_codex":0.00014040076,"about_ca_system_score_gemma":0.00008084923,"threshold_uncertainty_score":0.5054758},"labels":[],"label_agreement":null},{"id":"W3203371898","doi":"10.3329/ganit.v40i2.51311","title":"Lyapunov Stability Analysis of a Competition Model with Crowding Eects","year":2021,"lang":"en","type":"article","venue":"GANIT Journal of Bangladesh Mathematical Society","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":1,"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 Prince Edward Island","funders":"","keywords":"Phase portrait; Crowding; Lyapunov function; Extinction (optical mineralogy); Stability (learning theory); Population; Competition (biology); Convergence (economics); Competition model; Constant (computer programming); Mathematics; Nonlinear system; Population size; Focus (optics); Statistical physics; Ecology; Economics; Computer science; Biology; Physics; Demography; Microeconomics; Bifurcation","score_opus":0.036180709377411094,"score_gpt":0.28679529245201585,"score_spread":0.25061458307460477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203371898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122635,0.00007830789,0.48231998,0.0011520394,0.000012674898,0.00007915459,0.000007125798,0.000010899646,0.004076335],"genre_scores_gemma":[0.933304,0.000038474205,0.06602654,0.000490317,0.000034268385,0.000002682423,0.0000072136245,0.0000113493625,0.00008513709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981186,0.00012691194,0.00094990496,0.00018241623,0.00035382214,0.00026834963],"domain_scores_gemma":[0.9973336,0.001146974,0.0003865441,0.00024918243,0.00065254985,0.00023118392],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012155705,0.0001625678,0.0013414245,0.00006077357,0.00007300673,0.000009237778,0.000096847645,0.00021605389,0.0021958733],"category_scores_gemma":[0.0009930494,0.000103433165,0.0008540263,0.0006194521,0.0004675769,0.00008246795,0.00004636579,0.00044908025,0.0000058655623],"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.00038120276,0.0022138897,0.002301265,0.001399996,0.0055951467,0.000093249735,0.0019248673,0.0014762987,0.0065691387,0.9777132,0.0002006722,0.00013104461],"study_design_scores_gemma":[0.0020606488,0.00063491723,0.003046219,0.0005906128,0.009030375,0.0006334894,0.0012289563,0.5589564,0.008096956,0.41545874,0.000017326312,0.00024535606],"about_ca_topic_score_codex":4.213473e-7,"about_ca_topic_score_gemma":9.54469e-7,"teacher_disagreement_score":0.5622545,"about_ca_system_score_codex":0.00005922107,"about_ca_system_score_gemma":0.00017136324,"threshold_uncertainty_score":0.99871624},"labels":[],"label_agreement":null}]}