{"id":"W2914551285","doi":"10.1007/978-3-642-33090-2_64","title":"Succinct Posets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Reachability; Transitive closure; Combinatorics; Transitive reduction; Mathematics; Oracle; Data structure; Transitive relation; Discrete mathematics; Directed graph; Graph; Computer science; Line graph; Voltage graph","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.0006299432,0.001446498,0.0008809067,0.001545837,0.001141444,0.003703827,0.001294,0.0009989953,0.05690422],"category_scores_gemma":[0.002565219,0.0009777071,0.0008681932,0.002381963,0.001644847,0.008637801,0.003414703,0.004292241,0.01281512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089996,"about_ca_system_score_gemma":0.0007199734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005720308,"about_ca_topic_score_gemma":0.001188544,"domain_scores_codex":[0.9989368,0.0001971157,0.00007434979,0.0002106587,0.0004758739,0.0001051874],"domain_scores_gemma":[0.9990275,0.0004081257,0.00005666158,0.0002707242,0.00016179,0.00007507915],"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.00007627143,0.00005958317,0.000104286,0.0002868846,0.00001344955,0.00007848824,0.0003171935,0.004653449,0.001707292,0.8822905,0.02851937,0.08189326],"study_design_scores_gemma":[0.00001677167,0.00002469695,0.00009337923,0.0001039944,0.00001248032,0.0001416478,0.00007827878,0.003121085,0.00158,0.8949443,0.09986707,0.00001637692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02708019,0.003886883,0.3783039,0.003932983,0.001250171,0.000321693,0.006808855,0.002301747,0.5761136],"genre_scores_gemma":[0.4055265,0.007253144,0.1651271,0.001851974,0.001133256,0.0007617284,0.02207709,0.002194089,0.3940749],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.05690422,"threshold_uncertainty_score":0.1903635,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02168753748394431,"score_gpt":0.2453524668747948,"score_spread":0.2236649293908505,"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."}}