{"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","author_layer_release":"2026-06-26"},"query_hash":"4bef9b2bff11","filters":{"venue":"GANIT Journal of Bangladesh Mathematical Society"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"A.K.M. Tauhidul Islam","is_ca":false},{"name":"M Babul Hasan","is_ca":false},{"name":"HK Das","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008430422427400646,"gpt":0.2284485718426546,"spread":0.220018149415254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436483,0.0006985802,0.0006888099,0.0008210595,0.000616052,0.0008210764,0.001078996,0.0006912272,0.005493884],"category_scores_gemma":[0.001893293,0.0004239803,0.001128874,0.0009366233,0.0008355878,0.00166328,0.001519572,0.002828263,0.001108531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000442686,"about_ca_system_score_gemma":0.001081101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001162372,"about_ca_topic_score_gemma":0.001210633,"domain_scores_codex":[0.9994029,0.0001729447,0.00002810261,0.00008979612,0.0002447095,0.00006155526],"domain_scores_gemma":[0.9994367,0.0002508111,0.00004149047,0.0001222737,0.000110509,0.00003815579],"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.000117352,0.000246672,0.000530662,0.0002871557,0.00009495654,0.0002117756,0.0001920036,0.205851,0.02496537,0.5502387,0.01079605,0.2064682],"study_design_scores_gemma":[0.00002999349,0.00005585978,0.0001141443,0.0000160384,0.00001815261,0.0001395181,0.00001997703,0.9009266,0.003016079,0.08515248,0.01049489,0.00001614561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001219602,0.00003530776,0.9968922,0.00006655029,0.0000242748,0.00001887727,0.000009889601,0.0001044602,0.001628964],"genre_scores_gemma":[0.06218228,0.0001541457,0.9337491,0.0001848384,0.00007594345,0.0001805856,0.00007357723,0.000160411,0.003239095],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005493884,"threshold_uncertainty_score":0.01837885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"HK Das","is_ca":true},{"name":"M Babul Hasan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02182314550067344,"gpt":0.273465294547389,"spread":0.2516421490467156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547768,0.00129837,0.0009805968,0.001805595,0.000866045,0.001255809,0.0010045,0.00107649,0.00510402],"category_scores_gemma":[0.004980289,0.0005179869,0.001857025,0.001553229,0.00129087,0.001880154,0.001741964,0.003787951,0.001307028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006890794,"about_ca_system_score_gemma":0.001021427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001350557,"about_ca_topic_score_gemma":0.001095869,"domain_scores_codex":[0.998955,0.0005669409,0.00004527185,0.0001152125,0.0002451176,0.00007250783],"domain_scores_gemma":[0.9989435,0.0006133432,0.00007445609,0.0001007415,0.0002261159,0.00004183058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007106356,0.0001060397,0.0008592768,0.0005082272,0.00008748865,0.0002151282,0.0003629134,0.2193253,0.006370795,0.6368451,0.006112103,0.1291365],"study_design_scores_gemma":[0.00001179816,0.00005108095,0.0001492577,0.00004770818,0.00002312153,0.000151841,0.00004686866,0.8704682,0.001126743,0.1206487,0.007256499,0.00001815699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009692844,0.0002149214,0.9965899,0.00009081012,0.00003980009,0.00001910331,0.00001478149,0.00002672822,0.002034791],"genre_scores_gemma":[0.08955969,0.001389693,0.9037184,0.0001806856,0.0002540261,0.0003308767,0.0001111419,0.0001574708,0.004297972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00510402,"threshold_uncertainty_score":0.0170747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Md. Kamrujjaman","is_ca":false},{"name":"Kamrun Nahar Keya","is_ca":false},{"name":"Md Shafiqul Islam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03618070937741109,"gpt":0.2867952924520158,"spread":0.2506145830746048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004646681,0.0006397185,0.0006536794,0.0007473603,0.0007168668,0.001099834,0.0007332419,0.0007346128,0.002351398],"category_scores_gemma":[0.001129778,0.0002381261,0.0004791556,0.0002523029,0.0007475484,0.0004880404,0.0009828134,0.0005088552,0.0002139169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055867,"about_ca_system_score_gemma":0.0006547216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01057261,"about_ca_topic_score_gemma":0.003520948,"domain_scores_codex":[0.9998438,0.00005762008,0.000008265137,0.00002578899,0.000029324,0.00003519579],"domain_scores_gemma":[0.9994947,0.0002057359,0.0001236308,0.00001274543,0.0001020742,0.00006105267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001072358,0.00003634284,0.002656442,0.000123585,0.00009170721,0.000906946,0.0003582021,0.8939542,0.008122632,0.08930564,0.001188624,0.003148438],"study_design_scores_gemma":[0.000007537093,0.00002682841,0.0002919126,0.000004694759,0.0000087291,0.00003222149,0.00003546595,0.9949312,0.0001052409,0.004313583,0.0002350336,0.000007581993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6703843,0.001423513,0.2930633,0.001469768,0.00009589156,0.00008082899,0.0002166244,0.0002295386,0.03303616],"genre_scores_gemma":[0.99292,0.0001531816,0.001815918,0.00002854503,0.0000134203,0.00004451764,0.00003843759,0.00001057887,0.004975467],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01057261,"threshold_uncertainty_score":0.02102214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}