{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001599109,0.001047504,0.001005052,0.0008214819,0.001429107,0.000588419,0.002431869,0.0006489783,0.00008519068],"category_scores_gemma":[0.00008654648,0.001257787,0.0005045174,0.002735217,0.0005018955,0.0004615824,0.003044077,0.001452355,0.00001965762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005300007,"about_ca_system_score_gemma":0.0006572731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006576141,"about_ca_topic_score_gemma":0.00005308045,"domain_scores_codex":[0.9940527,0.0008576299,0.000745061,0.002884058,0.0003514996,0.00110906],"domain_scores_gemma":[0.9958026,0.0005821055,0.0007782785,0.001787042,0.0005370394,0.0005128931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001155607,0.0001772749,0.003468223,0.0002675392,0.0002914356,0.0004286341,0.001478771,0.9358484,0.00004331919,0.05723274,0.0000249649,0.000623214],"study_design_scores_gemma":[0.001472886,0.00006918509,0.001021704,0.0008239401,0.0003295508,0.0000402937,0.0003531313,0.9716287,0.0001766928,0.02278801,0.00009612406,0.001199804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2440747,0.0002693264,0.7527884,0.00006559203,0.00132253,0.000577987,0.0001748638,0.0002733954,0.0004531794],"genre_scores_gemma":[0.9946452,0.0003499758,0.004129062,0.000129928,0.00009919977,0.000002419586,0.0001240016,0.00003144187,0.0004887393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7505705,"threshold_uncertainty_score":0.9998709,"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."}}