{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33166236,0.009823844,0.49605498,0.0022835112,0.0004575504,0.000105869556,0.0011933809,0.00074041315,0.15767808],"genre_scores_gemma":[0.9404122,0.0030357523,0.037992887,0.00048644212,0.0003654708,0.00014134945,0.00082316453,0.00016008713,0.016582567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980318,0.000403666,0.00011455853,0.00032023384,0.0006363929,0.0004933747],"domain_scores_gemma":[0.9902864,0.0059410604,0.00087685103,0.0012631064,0.0010143123,0.00061828643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017772382,0.0010269387,0.0010533193,0.0025443085,0.0012853874,0.0021745027,0.0017817612,0.0012507865,0.006367875],"category_scores_gemma":[0.01179764,0.00048626537,0.0007221496,0.0024215288,0.002354972,0.004467358,0.0034229464,0.0028277738,0.0017524743],"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.00057729986,0.000085696,0.0019019953,0.00046479006,0.00005658378,0.00043248458,0.00055190746,0.055927385,0.010968884,0.8710699,0.005965593,0.051997535],"study_design_scores_gemma":[0.00003558478,0.00019653911,0.0012650274,0.00017887277,0.00003707017,0.0007103653,0.0003078056,0.11575183,0.010697413,0.86160177,0.009097771,0.000119899065],"about_ca_topic_score_codex":0.000888534,"about_ca_topic_score_gemma":0.0014584549,"teacher_disagreement_score":0.006367875,"about_ca_system_score_codex":0.0019164545,"about_ca_system_score_gemma":0.0008888202,"threshold_uncertainty_score":0.02130264},"labels":[],"label_agreement":null}]}