{"id":"W2038115433","doi":"10.1007/s11083-012-9278-9","title":"On Infinite–finite Duality Pairs of Directed Graphs","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Duality (order theory); Directed graph; Constraint satisfaction problem; Construct (python library); Constraint (computer-aided design)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534189,0.0001083563,0.0001470634,0.0001947794,0.00006824002,0.00001924285,0.0005205274,0.00005163024,0.000133372],"category_scores_gemma":[0.0005097245,0.00009251027,0.00005746949,0.001283854,0.0001163074,0.0003799865,0.000192362,0.0001692032,0.0001444145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001260602,"about_ca_system_score_gemma":0.00002781304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009943677,"about_ca_topic_score_gemma":0.000002358301,"domain_scores_codex":[0.998653,0.0002119187,0.0001793344,0.000205453,0.000359758,0.0003905323],"domain_scores_gemma":[0.9982926,0.0006642904,0.00007154272,0.000685781,0.0001588769,0.0001268779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003327045,0.0002812375,0.0179486,0.00001949992,0.0000271788,0.000002414918,0.0008261079,0.0001028224,0.0007202402,0.9650074,0.0005997328,0.01443149],"study_design_scores_gemma":[0.001734407,0.0005408568,0.1549154,0.00009055911,0.00001480946,0.00001073977,0.0001100157,0.006001885,0.01815957,0.7921807,0.02530246,0.0009385993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6244791,0.0004369361,0.3188158,0.000690869,0.0008543124,0.0004717244,0.000018663,0.0007372064,0.05349542],"genre_scores_gemma":[0.9856412,0.00001126739,0.01373764,0.0001880289,0.00001851896,0.00001275524,0.000002279939,0.00001000295,0.00037828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3611622,"threshold_uncertainty_score":0.3772459,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03131159960911015,"score_gpt":0.3098149036877476,"score_spread":0.2785033040786374,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}