{"meta":{"query_hash":"4a51fd1a8fed","filters":{"venue":"Applied Informatics"},"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/4a51fd1a8fed","api":"https://metacan.xera.ac/api/v1/cohort?venue=Applied+Informatics"},"results":[{"id":"W184568366","doi":"","title":"Dynamic Path Consistency for Interval-based Temporal Reasoning.","year":2003,"lang":"en","type":"article","venue":"Applied Informatics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Local consistency; Consistency (knowledge bases); Computer science; Path (computing); Interval (graph theory); Constraint satisfaction problem; Scheduling (production processes); Consistency model; Constraint satisfaction; Constraint (computer-aided design); Duration (music); Data consistency; Mathematical optimization; Artificial intelligence; Mathematics; Distributed computing","score_opus":0.008811627037441636,"score_gpt":0.22663239341184477,"score_spread":0.21782076637440312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184568366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011003682,0.0000057765233,0.9720792,0.00009876416,0.00019113909,0.00035297783,0.0000051783522,0.00016368789,0.026002875],"genre_scores_gemma":[0.48789865,0.0000018761172,0.51139003,0.00060664525,0.0000024403032,0.00003712555,0.000018570274,0.0000046754208,0.000039954426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.000010963551,0.00039341053,0.00009677212,0.0001412252,0.00018925397],"domain_scores_gemma":[0.99927807,0.00007973656,0.00018744801,0.00030995745,0.000077787496,0.00006703159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025881545,0.00011677162,0.00013217264,0.000087463195,0.00013051534,0.00012530664,0.000208106,0.000059030648,0.00002652934],"category_scores_gemma":[0.00006572562,0.00011196019,0.000057325,0.00019359887,0.000041753145,0.00028118043,0.00002499939,0.000075687305,0.000038756934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.000010943954,0.00005015111,0.00043713127,0.00011357875,0.00002274534,6.178276e-7,0.0015880576,0.0071965936,0.000032442636,0.92248535,0.0016078638,0.066454545],"study_design_scores_gemma":[0.00084384094,0.000045951725,0.00013916803,0.000019810292,0.000007443993,0.000007917251,0.00034056584,0.9823977,0.0002576453,0.0024284674,0.01330593,0.00020557843],"about_ca_topic_score_codex":0.0000014066602,"about_ca_topic_score_gemma":0.0000031890768,"teacher_disagreement_score":0.9752011,"about_ca_system_score_codex":0.000051479536,"about_ca_system_score_gemma":0.0001657476,"threshold_uncertainty_score":0.4565604},"labels":[],"label_agreement":null}]}