{"id":"W4407901096","doi":"10.1109/tit.2025.3544970","title":"Bounding the Graph Capacity With Quantum Mechanics and Finite Automata","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Quantum finite automata; Automaton; Deterministic finite automaton; Computer science; Nondeterministic finite automaton; Theoretical computer science; Discrete mathematics; Mathematics; Automata theory; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003440938,0.001050719,0.001133953,0.001929746,0.00157134,0.004271518,0.0027993,0.002160274,0.005471752],"category_scores_gemma":[0.02510291,0.0007099248,0.001531056,0.001744693,0.01012998,0.01339667,0.004939874,0.004945847,0.0006837919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00512913,"about_ca_system_score_gemma":0.002550453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004454026,"about_ca_topic_score_gemma":0.003620652,"domain_scores_codex":[0.9953853,0.001525615,0.0001936894,0.0008705653,0.001361351,0.0006635002],"domain_scores_gemma":[0.9781137,0.01737846,0.0007718488,0.002315789,0.0008519497,0.000568187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003253204,0.0000215494,0.0001736023,0.00004917616,0.00001271056,0.00003161337,0.000169274,0.04730901,0.0007212572,0.9468808,0.0006712762,0.003927276],"study_design_scores_gemma":[0.000004215105,0.000007240021,0.00003862345,0.00001341557,0.000003982941,0.00001119812,0.00002045702,0.1611396,0.0007270557,0.8374592,0.0005597099,0.00001520953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.133146,0.001332424,0.824137,0.003224742,0.0001983381,0.00008989905,0.0002812044,0.0006929192,0.0368975],"genre_scores_gemma":[0.9156114,0.0007639523,0.07652853,0.0003633796,0.0002252458,0.0002201021,0.0001797406,0.0002873181,0.005820376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005471752,"threshold_uncertainty_score":0.03721464,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00695810918766361,"score_gpt":0.2052179497389063,"score_spread":0.1982598405512427,"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."}}