{"id":"W2380860866","doi":"","title":"Core-sorted heavy-edge matching algorithm based on compressed storage format of graph","year":2011,"lang":"en","type":"article","venue":"Computer Engineering and Applications Journal","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Matching (statistics); Vertex (graph theory); Algorithm; Benchmark (surveying); Enhanced Data Rates for GSM Evolution; Graph; Blossom algorithm; Core (optical fiber); Theoretical computer science; Mathematics; Artificial intelligence","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.0003086781,0.0003932437,0.0004907542,0.001412151,0.0006666871,0.0007171008,0.001309143,0.0004202161,0.004404228],"category_scores_gemma":[0.001466845,0.0002044767,0.0003782676,0.001610395,0.0004626398,0.001936037,0.00101303,0.0005930654,0.0006595996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006917953,"about_ca_system_score_gemma":0.0009260927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003162312,"about_ca_topic_score_gemma":0.003882685,"domain_scores_codex":[0.999558,0.00005992513,0.00002933937,0.00009894316,0.000206826,0.0000468899],"domain_scores_gemma":[0.9995142,0.0000802694,0.00004243525,0.0001969652,0.0001437835,0.0000223488],"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.0003308394,0.0001138576,0.001348209,0.0002149567,0.00004022884,0.0001209501,0.0003664741,0.0883117,0.05254927,0.08583818,0.007782598,0.7629828],"study_design_scores_gemma":[0.00009434491,0.0003095717,0.001289066,0.00003464727,0.00004551666,0.0004480024,0.0002374907,0.8445572,0.07141149,0.06276532,0.01874796,0.00005938995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03152442,0.0001413244,0.9626834,0.0001087922,0.00004976097,0.000109211,0.0001235416,0.001007986,0.004251461],"genre_scores_gemma":[0.3052775,0.0001952793,0.6882358,0.0001210347,0.0000412642,0.0001733785,0.0006170334,0.0002156836,0.005123044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004404228,"threshold_uncertainty_score":0.01473355,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02854334037745987,"score_gpt":0.2522637265383004,"score_spread":0.2237203861608405,"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."}}