{"id":"W2953051110","doi":"10.48550/arxiv.1504.06586","title":"A Lex-BFS-based recognition algorithm for Robinsonian matrices","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Changchun Institute of Applied Chemistry; Universitat Politècnica de Catalunya; Università degli Studi G. d'Annunzio Chieti - Pescara; Université Paris Diderot; Universitetet i Bergen; Università degli Studi di Firenze; Tel Aviv University; Technische Universität Berlin; Sapienza Università di Roma; Uniwersytet Warszawski; Albert-Ludwigs-Universität Freiburg; Weizmann Institute of Science; Eidgenössische Technische Hochschule Zürich; Technische Universiteit Eindhoven; Institut national de recherche en informatique et en automatique (INRIA); University of Leicester; Centre National de la Recherche Scientifique; University of Oxford; Université du Québec en Outaouais; Princeton University","keywords":"Combinatorics; Lexicographical order; Recursion (computer science); Adjacency matrix; Enumeration; Simple (philosophy); Mathematics; Matrix (chemical analysis); Adjacency list; Similarity (geometry); Interval (graph theory); Algorithm; Tree (set theory); Computer science; Discrete mathematics; Graph; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.0005307811,0.0008831287,0.0007479824,0.001487109,0.0006818755,0.001248542,0.001340749,0.0008400524,0.008916127],"category_scores_gemma":[0.003743903,0.0004384489,0.0008011986,0.001785115,0.0006722279,0.002975338,0.001337842,0.001380258,0.004538774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000934756,"about_ca_system_score_gemma":0.001685822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003309442,"about_ca_topic_score_gemma":0.004936781,"domain_scores_codex":[0.9992639,0.0001034212,0.00008515262,0.0002202078,0.0002359401,0.00009129995],"domain_scores_gemma":[0.9988133,0.0003586557,0.0001080475,0.0002726456,0.0003801737,0.00006723143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004444898,0.0002300491,0.001459807,0.0003060252,0.00004218521,0.0002049966,0.0003189699,0.03169457,0.04824689,0.0733882,0.0260083,0.8176554],"study_design_scores_gemma":[0.0001592362,0.0003484971,0.0007450844,0.00006914448,0.00004914416,0.000815383,0.0003811267,0.7273456,0.04834843,0.1847278,0.03691711,0.00009347747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01976367,0.0001875842,0.9695263,0.0002551203,0.0000756375,0.0001415034,0.0006115978,0.004984214,0.004454294],"genre_scores_gemma":[0.08415716,0.0001050665,0.9082367,0.0001486333,0.00003789973,0.0001144771,0.00192855,0.0003785343,0.004893001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008916127,"threshold_uncertainty_score":0.02982748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1337464209201131,"score_gpt":0.242750364208401,"score_spread":0.1090039432882879,"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."}}