{"id":"W2767391894","doi":"10.48550/arxiv.1711.02455","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Upper and lower bounds; Impossibility; Combinatorics; Snapshot (computer storage); Discrete mathematics; Computer science; Mathematics; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01035364,0.002653808,0.002470163,0.002595908,0.003359996,0.007336622,0.005994843,0.003149067,0.01273552],"category_scores_gemma":[0.05180539,0.001970838,0.00719625,0.002683752,0.01037754,0.02569878,0.01572113,0.01501815,0.001798605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004760989,"about_ca_system_score_gemma":0.004418124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002369397,"about_ca_topic_score_gemma":0.002397188,"domain_scores_codex":[0.9826638,0.006395229,0.001078427,0.00309228,0.004523815,0.002246403],"domain_scores_gemma":[0.8983725,0.07706676,0.00330814,0.01540733,0.003615084,0.002230207],"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.0003441721,0.0001557738,0.001509431,0.0002945985,0.000155595,0.0002221989,0.0007745316,0.04542655,0.005114559,0.9242645,0.002472991,0.01926497],"study_design_scores_gemma":[0.00007004347,0.0001674104,0.0002882563,0.00008952973,0.00009874416,0.0001119049,0.0001253107,0.1580459,0.006568295,0.82697,0.007386846,0.00007776164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03104811,0.0004754785,0.9479365,0.003095641,0.0001750392,0.0002026734,0.0002772545,0.00120348,0.01558568],"genre_scores_gemma":[0.6283551,0.001304724,0.3494911,0.002407233,0.001174818,0.001234311,0.000928424,0.001350117,0.01375414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01273552,"threshold_uncertainty_score":0.05475593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08944707148155469,"score_gpt":0.2208138544299236,"score_spread":0.1313667829483689,"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."}}