{"id":"W3007479728","doi":"10.1145/3366030.3366077","title":"A Theoretical Approach to Discover Mutual Friendships from Social Graph Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Theoretical computer science; Graph; Graph theory; Mathematics; Combinatorics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001316044,0.0001898179,0.000299849,0.00005682118,0.00009258994,0.0000953715,0.0003018559,0.00005718118,0.006955063],"category_scores_gemma":[0.000001337543,0.0001553008,0.0002505913,0.0003231806,0.00007921612,0.00008194959,0.0002049307,0.0002219801,0.0001776385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001511099,"about_ca_system_score_gemma":0.00001494325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001879137,"about_ca_topic_score_gemma":0.000004746483,"domain_scores_codex":[0.9987609,0.00007464689,0.000213487,0.0004069869,0.0001970575,0.0003469008],"domain_scores_gemma":[0.9994085,0.00008292698,0.00004534639,0.0003298185,0.00002931554,0.0001040441],"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.00002315895,0.0001202557,0.02534835,5.98685e-7,0.0001040609,1.201229e-7,0.0002067188,0.0004808241,0.000025113,0.9619672,0.008967392,0.002756211],"study_design_scores_gemma":[0.0009882175,0.000120711,0.02179744,0.00001948811,0.0002305932,3.305434e-7,0.001560544,0.2084689,0.0003863844,0.7547908,0.01035461,0.001281993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1891794,0.00000641183,0.5360906,0.0001056113,0.00005244506,0.0002166675,0.00001751267,0.00009741252,0.2742339],"genre_scores_gemma":[0.9937158,2.053389e-7,0.004555663,0.0001973231,0.0009137672,0.00004088523,0.000158375,0.00002458325,0.0003933914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8045363,"threshold_uncertainty_score":0.9939527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007003160054402971,"score_gpt":0.2325875554979493,"score_spread":0.2255843954435464,"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."}}