{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895259,0.0009330417,0.001117916,0.003650469,0.002941752,0.004773,0.001537227,0.001691691,0.00548788],"category_scores_gemma":[0.007492525,0.001039989,0.001412065,0.002222918,0.004840519,0.01036513,0.003549794,0.004240397,0.0006474143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002091562,"about_ca_system_score_gemma":0.0008723805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001082464,"about_ca_topic_score_gemma":0.001350049,"domain_scores_codex":[0.9979483,0.0008378295,0.0001158177,0.0004078093,0.0003476677,0.0003425832],"domain_scores_gemma":[0.9926144,0.004428872,0.0007001258,0.0005750793,0.0006634194,0.001018041],"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.00003213612,0.00001978088,0.0002000502,0.00002101094,0.000004299667,0.0000861208,0.0002203834,0.0005326725,0.0002821523,0.9964042,0.0003174163,0.001879792],"study_design_scores_gemma":[0.000008831992,0.000009473194,0.00007674023,0.00001456602,0.000005631512,0.00007345447,0.0001168576,0.002580459,0.0002667538,0.995804,0.001035868,0.000007283008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4979631,0.001148866,0.4085425,0.001762811,0.0003903935,0.00009680379,0.0004350223,0.0003330041,0.08932752],"genre_scores_gemma":[0.917056,0.0006007171,0.06232727,0.0005398052,0.0003016489,0.0001449782,0.0007281426,0.000234973,0.01806658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00548788,"threshold_uncertainty_score":0.01835883,"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."}}