{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662836,0.0001301265,0.00009883225,0.0002497009,0.0007454942,0.0003041777,0.0003776599,0.00004881477,0.000004079501],"category_scores_gemma":[0.000009869999,0.00008331203,0.00004423824,0.0005434844,0.00006162576,0.0007072625,0.000005901085,0.0002953048,0.00001288456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002153468,"about_ca_system_score_gemma":0.00005361324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009991149,"about_ca_topic_score_gemma":0.000003863879,"domain_scores_codex":[0.9992151,0.00009914149,0.0002040019,0.0001289436,0.0001810446,0.0001717539],"domain_scores_gemma":[0.999029,0.0003997702,0.00008115527,0.000395022,0.00005591765,0.00003910509],"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.00003158471,0.00002727901,9.473464e-7,0.00003569823,0.00004811032,5.436808e-7,0.003377895,0.1009805,0.0000121647,0.7610286,0.00005066392,0.1344059],"study_design_scores_gemma":[0.0003121584,0.0000804024,0.00004531994,0.00006785199,0.00001401294,0.00001790931,0.0001797825,0.8837286,0.0005967544,0.1138603,0.0009817489,0.0001152148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007625879,0.00001202277,0.9900021,0.0009163065,0.0005556213,0.0001629651,0.000008343399,0.0002615688,0.0004551674],"genre_scores_gemma":[0.9919234,0.00001594721,0.006879142,0.00111002,0.000008603486,0.00002008183,8.535157e-7,0.000003695502,0.00003823933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9842975,"threshold_uncertainty_score":0.5733814,"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."}}