{"id":"W1518384768","doi":"10.1109/vlhcc.2004.7","title":"An Automatic Layout Algorithm for Lograph","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Debugger; Computer science; Graph; Graph rewriting; Interpreter; Graph Layout; Programming language; Theoretical computer science; Query optimization; Algorithm; Parallel computing; Debugging; Information retrieval; Graph drawing","routes":{"ca_aff":true,"ca_fund":true,"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.0002113162,0.00008709214,0.00008462303,0.0001035362,0.00007937157,0.0002903091,0.0009649401,0.0000215839,0.00005554381],"category_scores_gemma":[0.000003332734,0.00007225703,0.00004776581,0.0002096571,0.00001607204,0.001497834,0.000115773,0.00002821226,0.0001164679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008463062,"about_ca_system_score_gemma":0.000009014454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007492085,"about_ca_topic_score_gemma":0.000007846807,"domain_scores_codex":[0.9992276,0.00001242121,0.0001288231,0.0002700988,0.0001336913,0.0002273822],"domain_scores_gemma":[0.9993139,0.00002347289,0.00003014694,0.0005343785,0.0000261522,0.00007193596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.242092e-8,0.00005392817,0.0000136816,0.000002886837,0.000007300474,8.250219e-7,0.00004024999,0.0000115192,0.000005879913,0.02574522,0.007446987,0.9666714],"study_design_scores_gemma":[0.0002272438,0.00006617577,0.0002422691,0.000002165227,0.000004267215,0.000001341215,0.00001526223,0.9333431,0.0001265125,0.001746069,0.06410848,0.0001171799],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002792039,0.00001847675,0.9943458,0.0009001175,0.0001675084,0.0001984346,0.00000643322,0.0005126685,0.00357134],"genre_scores_gemma":[0.007477663,0.000002808879,0.9895115,0.001022746,0.000165345,0.00002977662,0.00002153874,0.000006095376,0.001762552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9665542,"threshold_uncertainty_score":0.2946556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01412920175291357,"score_gpt":0.2685554322895135,"score_spread":0.2544262305365999,"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."}}