{"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":"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.00096928445,0.00021492143,0.9965899,0.00009081012,0.00003980009,0.000019103307,0.000014781486,0.000026728216,0.0020347906],"genre_scores_gemma":[0.08955969,0.0013896927,0.9037184,0.00018068565,0.00025402612,0.00033087673,0.00011114185,0.00015747079,0.004297972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998955,0.00056694093,0.00004527185,0.00011521246,0.00024511758,0.00007250783],"domain_scores_gemma":[0.9989435,0.0006133432,0.00007445609,0.00010074149,0.00022611585,0.000041830575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477684,0.0012983698,0.0009805968,0.0018055952,0.00086604495,0.0012558086,0.0010044996,0.0010764899,0.0051040202],"category_scores_gemma":[0.0049802894,0.0005179869,0.0018570253,0.0015532293,0.0012908698,0.0018801535,0.0017419636,0.0037879506,0.0013070282],"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.00007106356,0.000106039704,0.0008592768,0.00050822715,0.00008748865,0.00021512815,0.00036291336,0.21932527,0.006370795,0.6368451,0.006112103,0.12913647],"study_design_scores_gemma":[0.000011798155,0.000051080948,0.00014925768,0.000047708178,0.00002312153,0.000151841,0.000046868656,0.8704682,0.0011267428,0.120648704,0.0072564986,0.000018156989],"about_ca_topic_score_codex":0.0013505573,"about_ca_topic_score_gemma":0.0010958685,"teacher_disagreement_score":0.0051040202,"about_ca_system_score_codex":0.0006890794,"about_ca_system_score_gemma":0.0010214273,"threshold_uncertainty_score":0.017074704},"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":"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.0012196018,0.000035307763,0.99689215,0.00006655029,0.000024274797,0.00001887727,0.000009889601,0.000104460225,0.0016289636],"genre_scores_gemma":[0.06218228,0.00015414575,0.93374914,0.0001848384,0.00007594345,0.00018058556,0.00007357723,0.000160411,0.0032390952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00017294465,0.000028102611,0.00008979612,0.00024470952,0.00006155526],"domain_scores_gemma":[0.9994367,0.00025081108,0.000041490468,0.00012227369,0.00011050901,0.000038155795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436483,0.0006985802,0.0006888099,0.0008210595,0.000616052,0.0008210764,0.0010789961,0.0006912272,0.0054938835],"category_scores_gemma":[0.0018932933,0.00042398032,0.0011288744,0.00093662326,0.0008355878,0.0016632803,0.0015195719,0.0028282634,0.0011085311],"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.00011735199,0.00024667205,0.000530662,0.00028715568,0.00009495654,0.00021177558,0.00019200362,0.20585105,0.024965372,0.5502387,0.01079605,0.20646824],"study_design_scores_gemma":[0.000029993489,0.00005585978,0.00011414428,0.000016038395,0.00001815261,0.00013951812,0.000019977035,0.90092665,0.0030160786,0.085152484,0.010494892,0.000016145606],"about_ca_topic_score_codex":0.0011623717,"about_ca_topic_score_gemma":0.0012106329,"teacher_disagreement_score":0.0054938835,"about_ca_system_score_codex":0.000442686,"about_ca_system_score_gemma":0.0010811008,"threshold_uncertainty_score":0.018378854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703843,0.001423513,0.29306328,0.0014697681,0.000095891555,0.00008082899,0.00021662441,0.0002295386,0.033036165],"genre_scores_gemma":[0.99292,0.00015318161,0.0018159185,0.000028545026,0.000013420304,0.000044517637,0.00003843759,0.000010578869,0.0049754675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984384,0.00005762008,0.000008265137,0.000025788986,0.000029324005,0.00003519579],"domain_scores_gemma":[0.9994947,0.00020573585,0.00012363079,0.000012745425,0.00010207417,0.00006105267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046466815,0.00063971855,0.0006536794,0.00074736035,0.00071686675,0.0010998343,0.0007332419,0.0007346128,0.0023513976],"category_scores_gemma":[0.0011297775,0.00023812607,0.00047915563,0.00025230288,0.00074754836,0.0004880404,0.0009828134,0.0005088552,0.00021391692],"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.00010723581,0.00003634284,0.0026564419,0.00012358502,0.00009170721,0.000906946,0.00035820212,0.8939542,0.008122632,0.08930564,0.0011886236,0.0031484384],"study_design_scores_gemma":[0.000007537093,0.000026828406,0.00029191264,0.0000046947594,0.0000087291,0.000032221487,0.00003546595,0.99493116,0.0001052409,0.0043135826,0.00023503357,0.0000075819926],"about_ca_topic_score_codex":0.010572609,"about_ca_topic_score_gemma":0.003520948,"teacher_disagreement_score":0.010572609,"about_ca_system_score_codex":0.0010558667,"about_ca_system_score_gemma":0.0006547216,"threshold_uncertainty_score":0.021022141},"labels":[],"label_agreement":null}]}