{"id":"W4416236029","doi":"10.48550/arxiv.2511.09052","title":"Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Scalability; Embedding; Pruning; Matching (statistics); Ranking (information retrieval); Load balancing (electrical power); Distributed algorithm; Reachability; Cache","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109798,0.0009459912,0.001299549,0.0009286149,0.0008355133,0.001418368,0.002246214,0.0008259254,0.002251993],"category_scores_gemma":[0.005080295,0.0003593288,0.0005822243,0.001856866,0.0006697675,0.002777367,0.002250369,0.001024319,0.0006712254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300079,"about_ca_system_score_gemma":0.002279465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007801983,"about_ca_topic_score_gemma":0.01741414,"domain_scores_codex":[0.9982159,0.0004144305,0.00009226934,0.0004122709,0.0006211551,0.0002440632],"domain_scores_gemma":[0.9982527,0.0005714396,0.0001174848,0.000693935,0.0002365006,0.0001280549],"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.0005205661,0.0004518672,0.00420421,0.0002657518,0.0001322007,0.0002242467,0.0003265802,0.453469,0.02242599,0.03577719,0.01554577,0.4666566],"study_design_scores_gemma":[0.00002502777,0.00003617258,0.00022071,0.00000365164,0.00001234658,0.00005010915,0.00006016877,0.9828249,0.002637144,0.01296282,0.001159305,0.000007651965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05279335,0.0004864681,0.9376163,0.0004291514,0.00006861539,0.0001652188,0.0002762662,0.004441978,0.00372259],"genre_scores_gemma":[0.5715515,0.0001963918,0.4233905,0.0001786777,0.00005438828,0.0001338107,0.001232042,0.0005059916,0.002756737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007801983,"threshold_uncertainty_score":0.01551312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02266335971849179,"score_gpt":0.1727454366973555,"score_spread":0.1500820769788637,"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."}}