{"meta":{"query_hash":"0d39ecb0fa88","filters":{"venue":"Open Journal of Discrete Applied Mathematics"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/0d39ecb0fa88","api":"https://metacan.xera.ac/api/v1/cohort?venue=Open+Journal+of+Discrete+Applied+Mathematics"},"results":[{"id":"W2996927339","doi":"10.30538/psrp-odam2019.0021","title":"On graceful difference labelings of disjoint unions of circuits","year":2019,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bijection; Conjecture; Disjoint sets; Vertex (graph theory); Combinatorics; Mathematics; Arc (geometry); Electronic circuit; Graph; Set (abstract data type); Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.018546878991419085,"score_gpt":0.2528436077341566,"score_spread":0.23429672874273752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996927339","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.5658796,0.0009008763,0.38320032,0.001298852,0.00016975502,0.00011368567,0.00073521875,0.0012208341,0.046480954],"genre_scores_gemma":[0.91459346,0.000446152,0.073599614,0.000512753,0.00019122045,0.00016304496,0.00084463967,0.00029115984,0.009357975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978714,0.00044401988,0.00014706513,0.0006687272,0.0004915883,0.00037722313],"domain_scores_gemma":[0.9911574,0.005194833,0.0009536903,0.0015971848,0.0005125708,0.00058424845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740208,0.0006602287,0.0007491159,0.0014703878,0.00158861,0.002584979,0.001422485,0.0012541966,0.0049581993],"category_scores_gemma":[0.0080900295,0.0006929424,0.001003317,0.0014364006,0.003472535,0.005379139,0.0031209043,0.002238459,0.0005765395],"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.00021010968,0.00005438359,0.0012184379,0.00008478324,0.000013281468,0.00013958904,0.00064744666,0.012716179,0.004507486,0.957035,0.0012472485,0.022125954],"study_design_scores_gemma":[0.000032652857,0.00004457391,0.0003275783,0.000027175653,0.00001569393,0.00014061142,0.00012280133,0.028413437,0.0033331937,0.96282697,0.0046962444,0.000019171861],"about_ca_topic_score_codex":0.0012351879,"about_ca_topic_score_gemma":0.0010746359,"teacher_disagreement_score":0.0049581993,"about_ca_system_score_codex":0.002103559,"about_ca_system_score_gemma":0.000544088,"threshold_uncertainty_score":0.0165869},"labels":[],"label_agreement":null},{"id":"W4406659047","doi":"10.30538/psrp-odam2022.0077","title":"On the largest real root of the independence polynomial of a unicyclic graph","year":2022,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Independence (probability theory); Root (linguistics); Graph; Combinatorics; Discrete mathematics; Computer science; Statistics; Linguistics; Philosophy","score_opus":0.03516077578560541,"score_gpt":0.30209388021385525,"score_spread":0.26693310442824986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659047","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.7386715,0.0025150897,0.13943203,0.006821561,0.00055301905,0.00008853504,0.001009827,0.00037469043,0.11053378],"genre_scores_gemma":[0.9797331,0.0011114737,0.0076679257,0.0003217421,0.00057816296,0.000048363716,0.00044859658,0.00014553177,0.009945102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990151,0.00031211728,0.000023799348,0.00022697642,0.00023009257,0.00019191524],"domain_scores_gemma":[0.9847327,0.012090063,0.0011101731,0.0005035312,0.0006185494,0.0009450453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012234709,0.00093879155,0.0012553098,0.0024445003,0.0011067742,0.0023001968,0.0016799594,0.0011539673,0.009510548],"category_scores_gemma":[0.01380075,0.0005434057,0.00073339953,0.0021930074,0.0040614144,0.0038607,0.0016928626,0.004967291,0.0011902761],"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.00062693073,0.00017341167,0.002096896,0.0004545193,0.000055976503,0.00042542344,0.00087245944,0.025400106,0.007364994,0.91934514,0.010278154,0.032906033],"study_design_scores_gemma":[0.000068674184,0.00006463068,0.0016227461,0.00005224297,0.000034989676,0.00029108237,0.00016754778,0.048137665,0.001577507,0.9450333,0.0029009774,0.00004862239],"about_ca_topic_score_codex":0.0018305427,"about_ca_topic_score_gemma":0.0018258742,"teacher_disagreement_score":0.009510548,"about_ca_system_score_codex":0.0014690581,"about_ca_system_score_gemma":0.0008874396,"threshold_uncertainty_score":0.031815946},"labels":[],"label_agreement":null}]}