{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007634791,0.0003560225,0.0003684754,0.0006721923,0.0002159765,0.0001956277,0.002350155,0.0003295295,0.00001567134],"category_scores_gemma":[0.00008328479,0.0004209634,0.0002914381,0.0009741976,0.0001544879,0.0005899893,0.001191702,0.0005918063,0.0001336894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003798352,"about_ca_system_score_gemma":0.0005600801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005836006,"about_ca_topic_score_gemma":0.00002145075,"domain_scores_codex":[0.9974269,0.0002380554,0.0002132246,0.001368632,0.0001733987,0.0005798306],"domain_scores_gemma":[0.9971305,0.000292739,0.0002800024,0.001260799,0.0007184507,0.0003175155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006542649,0.001123965,0.0005960204,0.0009300283,0.0005633803,0.001280268,0.0006816111,0.3988832,0.0001739262,0.1780569,0.006565059,0.4104914],"study_design_scores_gemma":[0.0008541742,0.0001338303,0.00001816281,0.00007853639,0.00003497471,0.000002706976,0.00003191076,0.7047998,0.0003477173,0.2920239,0.00126074,0.0004135382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01262392,0.0001172427,0.9843003,0.0001135356,0.0004726057,0.0008647175,0.0001686563,0.000543293,0.0007957923],"genre_scores_gemma":[0.7025703,0.0001579191,0.2943185,0.000214255,0.0002730032,0.00003063732,0.0002311157,0.00008424031,0.002120029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6899817,"threshold_uncertainty_score":0.9998242,"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."}}