{"id":"W2952084543","doi":"10.48550/arxiv.1407.6251","title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Computer science; Bounded function; Online algorithm; Tracking (education); Inference; Minimum-cost flow problem; Algorithm; Sequence (biology); Mathematical optimization; Flow network; Mathematics; Artificial intelligence","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"],"consensus_categories":[],"category_scores_codex":[0.0006829689,0.0003805828,0.0004792715,0.0002778224,0.0002456158,0.0002828124,0.0008261187,0.000228844,0.000003599559],"category_scores_gemma":[0.00004542841,0.0003851445,0.0001335929,0.0004901709,0.0001502223,0.0002125819,0.0007472754,0.000544103,0.00001121773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001305652,"about_ca_system_score_gemma":0.0001747734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000088311,"about_ca_topic_score_gemma":0.0001720943,"domain_scores_codex":[0.9976071,0.0003465871,0.0002327947,0.001259016,0.0001640801,0.0003903868],"domain_scores_gemma":[0.9981632,0.0003103474,0.0003090579,0.0008155309,0.0002213403,0.0001805216],"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.00005175345,0.0001395402,0.00311845,0.0001241602,0.0001044566,0.0002559451,0.0004066919,0.9527845,0.00001924338,0.003314495,0.00003638447,0.03964432],"study_design_scores_gemma":[0.001051909,0.00008622737,0.01267043,0.0001853164,0.00006751528,0.00002217008,0.00004385781,0.9788249,0.00008087274,0.006305191,0.0001527295,0.0005089233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4079218,0.00005053018,0.5909109,0.00006561906,0.0003483355,0.0002428986,0.000009563703,0.0001637287,0.0002866336],"genre_scores_gemma":[0.9511613,0.00004083338,0.04838312,0.0001169144,0.00008984613,0.000001015712,0.00004412217,0.00002426335,0.0001386391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5432394,"threshold_uncertainty_score":0.99986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07850547832486682,"score_gpt":0.229777016911832,"score_spread":0.1512715385869652,"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."}}