{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005288624,0.0007092614,0.002016121,0.001185491,0.002639241,0.002211713,0.003036169,0.002099583,0.001419954],"category_scores_gemma":[0.01133655,0.0004527436,0.001482559,0.003744241,0.001446143,0.008142866,0.005655533,0.001519123,0.0005641962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001786496,"about_ca_system_score_gemma":0.002837586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003285737,"about_ca_topic_score_gemma":0.002391905,"domain_scores_codex":[0.9923884,0.002367251,0.0006270774,0.001930957,0.001783295,0.0009028799],"domain_scores_gemma":[0.987812,0.002650312,0.001151408,0.007010382,0.0008622633,0.0005136945],"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":[0.002849194,0.001012418,0.01348417,0.00055817,0.0003731101,0.001607307,0.002402145,0.3038788,0.04466474,0.1836873,0.02268126,0.4228015],"study_design_scores_gemma":[0.0001228659,0.0003081358,0.001739984,0.00002290951,0.00009502212,0.00108743,0.0007378591,0.8269457,0.02235836,0.1380723,0.0084259,0.00008359483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1036023,0.0003907708,0.888113,0.000951189,0.00008346979,0.0004120247,0.0009223179,0.002823682,0.002701305],"genre_scores_gemma":[0.8538129,0.0001696481,0.1427158,0.0002675143,0.00006254579,0.0001862034,0.001185186,0.00009586684,0.001504225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005288624,"threshold_uncertainty_score":0.0279693,"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."}}