{"id":"W2951827106","doi":"","title":"On Infinite-finite Duality Pairs of Directed Graphs","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Combinatorics; Duality (order theory); Constraint satisfaction problem; Discrete mathematics; Partially ordered set","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.002128658,0.0005240698,0.0006100863,0.002292012,0.002096887,0.002991505,0.0007455113,0.0008031665,0.003136003],"category_scores_gemma":[0.007005205,0.0006715395,0.0008784073,0.001412461,0.003813233,0.005830525,0.002500706,0.002912592,0.000505982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001562353,"about_ca_system_score_gemma":0.0006282165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005481999,"about_ca_topic_score_gemma":0.0006081467,"domain_scores_codex":[0.9975337,0.001151688,0.000122393,0.0004181995,0.0004490564,0.0003250444],"domain_scores_gemma":[0.9943088,0.003896216,0.0004704027,0.000331136,0.0005381824,0.0004553156],"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.00003454781,0.00002000603,0.0003786315,0.00003595193,0.000004885838,0.0001380029,0.0001988392,0.001548677,0.0009460874,0.9923412,0.0002594164,0.00409383],"study_design_scores_gemma":[0.000007514852,0.00001661618,0.0001536927,0.00001974161,0.000006425937,0.0001258451,0.00009933508,0.006199642,0.0008802233,0.9907681,0.001713885,0.000008799118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4274177,0.001119476,0.4888981,0.001084582,0.0001584912,0.0001017353,0.000382951,0.0003408516,0.08049592],"genre_scores_gemma":[0.9163837,0.0005043427,0.07711148,0.0003014505,0.0001050457,0.0001183085,0.0004535688,0.0001005595,0.0049214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003136003,"threshold_uncertainty_score":0.01133573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02299426730019268,"score_gpt":0.2576813117863962,"score_spread":0.2346870444862036,"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."}}