{"meta":{"query_hash":"1c8c85d5c961","filters":{"venue":"Journal of Discrete Mathematics"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/1c8c85d5c961","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Discrete+Mathematics"},"results":[{"id":"W1988825410","doi":"10.1155/2013/625912","title":"On Maximum Lee Distance Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Singleton; Algorithm; Combinatorics; Computer science; Mathematics","score_opus":0.011713277315717037,"score_gpt":0.23453029728225067,"score_spread":0.22281701996653364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988825410","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.09573937,0.00007198164,0.89644706,0.0010546866,0.00024467244,0.000080048834,0.0000012084888,0.00003126958,0.006329672],"genre_scores_gemma":[0.8799495,0.000020697862,0.11960549,0.00022734435,0.00006559938,0.0000025968675,1.2808457e-7,0.000009321625,0.00011933435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989464,0.000042629377,0.0003935508,0.00009553203,0.0003490816,0.00017275756],"domain_scores_gemma":[0.99875206,0.000271358,0.0003820269,0.00036875726,0.0001230321,0.00010277179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040185056,0.00011821979,0.00022680048,0.00011438232,0.00007601018,0.00021856827,0.0008368128,0.00003362668,0.00007212825],"category_scores_gemma":[0.00010066255,0.00008059955,0.00017312095,0.00021151101,0.000051588548,0.00045358934,0.00007649466,0.00017721941,0.00007216616],"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.000006851289,0.00012789952,0.00006644097,0.000045844572,0.000042854612,0.000014298204,0.0011048276,0.000051970528,0.00047495228,0.98922724,0.0034643486,0.0053724474],"study_design_scores_gemma":[0.00021200861,0.00026714854,0.00020963702,0.00017766276,0.000012262176,0.00006564747,0.00015303491,0.0046254224,0.00068423623,0.99283797,0.0006302532,0.00012472682],"about_ca_topic_score_codex":6.2740907e-7,"about_ca_topic_score_gemma":4.397763e-7,"teacher_disagreement_score":0.7842101,"about_ca_system_score_codex":0.000017366405,"about_ca_system_score_gemma":0.000020226295,"threshold_uncertainty_score":0.32867542},"labels":[],"label_agreement":null}]}