{"id":"W2964076874","doi":"10.4230/lipics.approx-random.2018.5","title":"Greedy Bipartite Matching in Random Type Poisson Arrival Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Poisson distribution; Bipartite graph; Matching (statistics); Combinatorics; Node (physics); Type (biology); Greedy algorithm; Random graph; Competitive analysis; Mathematics; Upper and lower bounds; Discrete mathematics; Computer science; Graph; Algorithm; Statistics; Physics","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.005752823,0.001369321,0.002715462,0.001603247,0.00100523,0.003180143,0.007784071,0.004206001,0.008890032],"category_scores_gemma":[0.01923505,0.00120277,0.002373491,0.002817283,0.002039134,0.005835408,0.003262941,0.004290326,0.002342614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0033934,"about_ca_system_score_gemma":0.001702214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00227684,"about_ca_topic_score_gemma":0.002000817,"domain_scores_codex":[0.993725,0.002683363,0.0001948433,0.00120211,0.001176418,0.001018186],"domain_scores_gemma":[0.9895176,0.005703593,0.001433148,0.001732686,0.0008316369,0.0007813836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005326639,0.0002409562,0.001387609,0.0002379597,0.0001024366,0.0004668475,0.0002313841,0.4699475,0.002852541,0.5022522,0.006359091,0.01538882],"study_design_scores_gemma":[0.00005990261,0.00005744702,0.0001698647,0.00001044503,0.0000156836,0.0001082637,0.00003047301,0.8859249,0.0004394329,0.1119147,0.001247726,0.00002125469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04384034,0.0002529488,0.9450998,0.001178266,0.0001865327,0.0002893707,0.0007860635,0.0007258597,0.007640967],"genre_scores_gemma":[0.7872803,0.0008320972,0.1884852,0.001472549,0.0004673709,0.0009238371,0.00136673,0.0004179748,0.01875385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008890032,"threshold_uncertainty_score":0.03042418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03106420259806995,"score_gpt":0.2894529962002337,"score_spread":0.2583887936021638,"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."}}