{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8574087,0.00009393615,0.12714605,0.00039359537,0.00025744474,0.00054342044,0.000009826208,0.000016149022,0.014130852],"genre_scores_gemma":[0.91059315,0.000020253323,0.08919286,0.00006728132,0.0000030275626,0.0000025842069,7.444191e-7,0.0000127837375,0.00010732446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808925,0.000028801811,0.0009528795,0.00018117507,0.0005586584,0.00018925556],"domain_scores_gemma":[0.9972802,0.00030002504,0.0013619929,0.00068020675,0.0002621326,0.000115454284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870167,0.000164469,0.0006341081,0.0001666431,0.00004525706,0.00008331587,0.0017475412,0.000058655754,0.0000312331],"category_scores_gemma":[0.00007574573,0.00011684935,0.00012506827,0.0003622518,0.00007091605,0.0001810583,0.00042179745,0.00021797202,0.00001837868],"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.000011739402,0.0002831507,0.00003758771,0.00015326518,0.0000564918,0.0000024472724,0.0013146889,0.00031923494,0.06367596,0.9319515,0.00011373875,0.0020801655],"study_design_scores_gemma":[0.0015473234,0.00067564996,0.00021465399,0.0011429848,0.00005731595,0.000043563043,0.0004580146,0.003740387,0.05334316,0.9384897,0.000034707544,0.00025255236],"about_ca_topic_score_codex":0.000004645364,"about_ca_topic_score_gemma":5.8511176e-7,"teacher_disagreement_score":0.053184416,"about_ca_system_score_codex":0.000013588394,"about_ca_system_score_gemma":0.00010267727,"threshold_uncertainty_score":0.4764978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621077,0.000020161395,0.0011676293,0.00093930855,0.00009358414,0.0010592551,0.000090223286,0.0000069969387,0.03451515],"genre_scores_gemma":[0.9948176,0.000009881691,0.0048452844,0.000058437425,0.000025167106,0.00006637283,0.0000010852707,0.000030879288,0.00014527969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976847,0.00017664029,0.001017372,0.00013311916,0.0007953705,0.00019277468],"domain_scores_gemma":[0.99546665,0.0013838045,0.0020865013,0.0008967994,0.00010616101,0.000060073944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647764,0.00017996869,0.0005238309,0.000096351614,0.00039725253,0.000039017592,0.002639054,0.00005459611,0.0002831974],"category_scores_gemma":[0.00021891693,0.00010118171,0.00027814117,0.0005460731,0.0002336075,0.00007210726,0.0007664829,0.00063142076,0.0000021667154],"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.00010784244,0.0004670765,0.00003572403,0.00006403141,0.00011945581,0.0000014478144,0.0016942316,0.000088499175,0.0069518634,0.9885602,0.0018113956,0.00009824984],"study_design_scores_gemma":[0.00065959396,0.00015744986,0.0001526652,0.000107697684,0.00017325056,0.000060921247,0.0040485025,0.000034831104,0.012421931,0.98184097,0.00021909385,0.00012308397],"about_ca_topic_score_codex":0.000010208254,"about_ca_topic_score_gemma":0.000013297331,"teacher_disagreement_score":0.03436987,"about_ca_system_score_codex":0.00003319578,"about_ca_system_score_gemma":0.00014668069,"threshold_uncertainty_score":0.49040627},"labels":[],"label_agreement":null}]}