{"id":"W2054116841","doi":"10.2298/yjor1101011d","title":"On-line computation and maximum-weighted hereditary subgraph problems","year":2011,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Computation; Line (geometry); Focus (optics); Mathematics; Graph; Subgraph isomorphism problem; Set (abstract data type); Computer science; Algorithm; Line graph; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705896,0.0001117835,0.0001786432,0.0008345426,0.0005083233,0.0002704612,0.0006845761,0.00005783056,0.00006448656],"category_scores_gemma":[0.0001070105,0.00008987261,0.00006870758,0.0009993234,0.0002162474,0.0007827717,0.0001772806,0.0006131933,0.00001971583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003539198,"about_ca_system_score_gemma":0.0001846962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008376953,"about_ca_topic_score_gemma":0.00005793697,"domain_scores_codex":[0.9979627,0.0003274956,0.0004388433,0.0002232595,0.0007626121,0.0002851646],"domain_scores_gemma":[0.9981773,0.0002318341,0.00005843348,0.0002615169,0.00108954,0.0001813617],"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.0002048952,0.002399604,0.0008921906,0.00009730488,0.0003233727,0.0007957991,0.0150468,0.01566785,0.001417239,0.7172592,0.008379024,0.2375167],"study_design_scores_gemma":[0.001733303,0.004024088,0.004719296,0.0002123478,0.00001247221,0.001001709,0.0003450905,0.5301065,0.00187472,0.455004,0.0006411118,0.0003253466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2302716,0.0006956019,0.7643048,0.001612208,0.0004622506,0.0003238243,0.000006311398,0.00003667292,0.002286769],"genre_scores_gemma":[0.8683207,0.0001613784,0.1312066,0.00007084291,0.0001338679,0.000007916302,0.000002859558,0.000009208649,0.00008660958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6380491,"threshold_uncertainty_score":0.3909663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1693381571729664,"score_gpt":0.3650028625847389,"score_spread":0.1956647054117725,"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."}}