{"id":"W4387870430","doi":"10.1109/icc45041.2023.10279733","title":"Efficient and Privacy-Preserving Subgraph Matching Queries in Graph Federation","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Matching (statistics); Factor-critical graph; Subgraph isomorphism problem; Graph database; Theoretical computer science; Graph; Graph factorization; Induced subgraph isomorphism problem; Data mining; Line graph; Voltage graph; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0005242859,0.00008518984,0.00008865003,0.0003006359,0.0002052198,0.0002669259,0.0003491409,0.00002977759,0.000006102686],"category_scores_gemma":[0.00003076141,0.0000745392,0.00002801466,0.0009478063,0.00003114139,0.0002355605,0.0004209471,0.00007997734,0.00001233028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005496635,"about_ca_system_score_gemma":0.000009758778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000070136,"about_ca_topic_score_gemma":0.00005732623,"domain_scores_codex":[0.9991758,0.00006903215,0.0001427826,0.0002610601,0.0001380241,0.0002133031],"domain_scores_gemma":[0.9995509,0.0001019498,0.00002559774,0.0002604185,0.00001691679,0.00004425185],"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.000006526516,0.00004763558,0.00805942,0.0000414102,0.000009815515,0.00004191906,0.009366591,0.008665869,0.003755769,0.9581559,0.0001736105,0.01167552],"study_design_scores_gemma":[0.0003248315,0.00003608314,0.07224199,0.00004677362,0.000001493556,0.0000103436,0.0008047016,0.4464566,0.002004866,0.4777494,0.00007650421,0.0002464518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8033509,0.00003704291,0.1946133,0.0007392628,0.0001341873,0.00008418429,3.364946e-7,0.000256124,0.0007846265],"genre_scores_gemma":[0.99033,0.00001299886,0.00941845,0.0000964307,0.00001095991,0.00001035352,0.000001239148,0.000004392711,0.0001151482],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4804066,"threshold_uncertainty_score":0.3039621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01221323421836344,"score_gpt":0.2357794610849101,"score_spread":0.2235662268665466,"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."}}