{"id":"W1596588646","doi":"10.1007/978-3-642-38562-9_55","title":"Probabilistic Graph Summarization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Probabilistic logic; Graph; Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Database","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006218543,0.0004439187,0.0003599337,0.0008831454,0.000206098,0.001256749,0.004097972,0.0001905387,0.00006815427],"category_scores_gemma":[0.00007408593,0.0003946357,0.0000924574,0.0007845308,0.0004895585,0.001506387,0.00203946,0.0004533298,0.0002751449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001506912,"about_ca_system_score_gemma":0.0002124191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000209275,"about_ca_topic_score_gemma":0.000028604,"domain_scores_codex":[0.9965613,0.00002336752,0.0004295302,0.001473214,0.0009419618,0.0005706247],"domain_scores_gemma":[0.9975955,0.0001812959,0.0002338221,0.001645057,0.0002063365,0.0001379129],"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":[8.997939e-7,0.00002244859,0.00001371555,0.00004894911,0.000008348521,0.00003122879,0.0001323705,0.007438408,0.00001462259,0.1720544,0.0002171726,0.8200174],"study_design_scores_gemma":[0.0001384986,0.00008191104,0.00007924389,0.0001787855,0.000006745286,0.000009467275,3.384546e-8,0.510195,0.00007886555,0.4849584,0.003753257,0.0005197939],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000067634,0.0001103677,0.9846731,0.0005855737,0.001801538,0.0007620329,0.000004989426,0.0002212224,0.01183435],"genre_scores_gemma":[0.009529417,0.00008884177,0.9815614,0.002270972,0.0008315276,0.00005924701,0.00007347791,0.00006386494,0.005521208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8194976,"threshold_uncertainty_score":0.9998506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01492816462219057,"score_gpt":0.2209521364385043,"score_spread":0.2060239718163137,"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."}}