{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001054209,0.0006480042,0.0005996181,0.001061542,0.0003827835,0.0005980547,0.005254863,0.0003631001,0.0001029226],"category_scores_gemma":[0.00005748378,0.000603704,0.0002254086,0.0008045284,0.0008472628,0.0009803541,0.00253002,0.001098821,0.0002191297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002591496,"about_ca_system_score_gemma":0.0004222984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002832411,"about_ca_topic_score_gemma":0.0000606875,"domain_scores_codex":[0.9955563,0.00003864466,0.0005419027,0.001558461,0.001223936,0.001080738],"domain_scores_gemma":[0.9966611,0.0004593235,0.0002649273,0.0020823,0.000205781,0.0003265591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000212576,0.00003416187,0.00006217162,0.00002186748,0.000009989589,0.00006804211,0.0003966287,0.0009624982,0.00003229018,0.1045397,0.00003925823,0.8938313],"study_design_scores_gemma":[0.000379975,0.0002128422,0.0007485012,0.0003963273,0.00001483372,0.0003222972,9.650576e-8,0.2207707,0.001073515,0.7550288,0.01948245,0.001569641],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003609065,0.001694889,0.9843715,0.0008181531,0.003552574,0.000303781,0.000007369999,0.0002823714,0.008933296],"genre_scores_gemma":[0.1308387,0.0001743147,0.8632104,0.002957587,0.001842808,0.00001229694,0.00001106444,0.00007196718,0.0008808322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8922616,"threshold_uncertainty_score":0.9996414,"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."}}