{"id":"W1966045745","doi":"10.1016/j.tcs.2005.11.044","title":"On linear complexity of sequences over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Computer science; Theology; Philosophy","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":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005740106,0.001765747,0.0008264399,0.001227844,0.003588063,0.003932913,0.008150856,0.002793329,0.0917068],"category_scores_gemma":[0.001895744,0.002961716,0.003026673,0.003984679,0.0133862,0.003170697,0.006177713,0.003178985,0.002490809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004918889,"about_ca_system_score_gemma":0.002581737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001796766,"about_ca_topic_score_gemma":0.0006179989,"domain_scores_codex":[0.9804137,0.001304671,0.003297328,0.004309237,0.005942989,0.004732022],"domain_scores_gemma":[0.985859,0.004010425,0.002889103,0.004485109,0.0005628242,0.002193552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001779826,0.0008404015,0.00002692446,0.0009192102,0.0009679523,0.001335244,0.002527724,0.004337728,0.002153526,0.9338788,0.04451171,0.006720923],"study_design_scores_gemma":[0.002096602,0.003965067,0.0001503676,0.00162193,0.0009513655,0.001457164,0.0007631679,0.372144,0.5856515,0.0274672,0.001234897,0.002496763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8047118,0.001081653,0.02110029,0.001393704,0.00464714,0.000127702,0.0005859108,0.000629361,0.1657225],"genre_scores_gemma":[0.9790492,0.0005374007,0.01322283,0.002567644,0.002846811,0.0005567481,0.0004830901,0.0006482993,0.00008794729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9064116,"threshold_uncertainty_score":0.9995088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01959451376165914,"score_gpt":0.2456674236375735,"score_spread":0.2260729098759144,"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."}}