{"id":"W4307921918","doi":"10.32920/21463020.v1","title":"Introducing TAM: Time-Based Access Memory","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interleaved memory; Parallel computing; Uniform memory access; Access time; Static random-access memory; Scalability; Registered memory; Dram; Shared memory; Cache-only memory architecture; CPU cache; Embedded system; Cache; Memory management; Computer hardware; Semiconductor memory; Operating system","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","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007724621,0.000278073,0.000330431,0.0003625985,0.0002375951,0.0007799686,0.004547235,0.0001429603,0.001046231],"category_scores_gemma":[0.00007398296,0.000283345,0.0001500293,0.0004124781,0.00002913274,0.0002160265,0.008025195,0.0007219518,0.00005322686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000152229,"about_ca_system_score_gemma":0.000430598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001188121,"about_ca_topic_score_gemma":9.28285e-7,"domain_scores_codex":[0.9976443,0.0002360575,0.0003663877,0.001020046,0.0004388862,0.00029433],"domain_scores_gemma":[0.997602,0.0001261496,0.0002603864,0.001800399,0.0001247679,0.00008624504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002591112,0.00004962161,0.0000310647,0.00003956339,0.00001505823,0.000009526565,0.00007701869,0.94196,0.00001484276,0.001086757,0.04980489,0.006909076],"study_design_scores_gemma":[0.0001114561,0.0000252076,0.00005479973,0.00003020999,0.000005897059,0.000002071109,0.000001747926,0.9909098,0.001755194,0.002345932,0.004383809,0.0003738708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001941776,0.00009736539,0.954806,0.00214395,0.0008122075,0.0003119039,0.000003375675,0.00294384,0.03868716],"genre_scores_gemma":[0.01799615,0.00001851582,0.9704993,0.002735923,0.0002603073,0.0001394529,0.00008210642,0.00003681425,0.008231401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04894981,"threshold_uncertainty_score":0.9999977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02409840645081019,"score_gpt":0.2963662504187466,"score_spread":0.2722678439679364,"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."}}