{"id":"W4387730855","doi":"10.36227/techrxiv.24311155","title":"A Dynamic Vacancy-Applicant Matching System Considering Locking Periods and Break-up Penalties","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Matching (statistics); Flexibility (engineering); Computer science; Workload; The Internet; Blossom algorithm; Stability (learning theory); Distributed computing; Labour economics; Economics; Mathematics; Machine learning; World Wide Web; Management","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006513403,0.0003281605,0.0004577889,0.0002896322,0.0003168364,0.001333671,0.0008744525,0.0001809361,0.00001683642],"category_scores_gemma":[0.00002185742,0.0003063775,0.00008765514,0.0002342941,0.00006865949,0.0002237687,0.004247359,0.0005856762,0.00004043411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001736372,"about_ca_system_score_gemma":0.0002849706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009758578,"about_ca_topic_score_gemma":0.0002500278,"domain_scores_codex":[0.9976005,0.0001124284,0.0004765147,0.0009229055,0.0004240128,0.0004636353],"domain_scores_gemma":[0.9985717,0.0001496197,0.0001877044,0.0007781276,0.0001278184,0.0001850114],"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.00002361191,0.00007910369,0.001546642,0.01390696,0.0006036051,0.0004365231,0.03400582,0.4256983,0.0009260064,0.4777724,0.001758387,0.04324259],"study_design_scores_gemma":[0.0001990662,0.00001405707,0.0002391494,0.0008167914,0.000009140006,0.00008542154,0.001177364,0.9926789,0.00003029181,0.00412501,0.0002244999,0.0004003076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006733236,0.0003379402,0.9866728,0.001198198,0.0009194048,0.000641502,0.00001008711,0.001559437,0.001927434],"genre_scores_gemma":[0.826546,0.0003144406,0.1694042,0.000177911,0.00004601882,0.0001951799,0.00001487807,0.00006238186,0.003239069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8198127,"threshold_uncertainty_score":0.9999388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03398303610395465,"score_gpt":0.2856821808010074,"score_spread":0.2516991446970528,"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."}}