{"id":"W4231409921","doi":"10.1109/ia3.2018.00011","title":"Scale-Free Graph Processing on a NUMA Machine","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Parallel computing; Distributed memory; Distributed computing; Graph partition; Shared memory; Distributed shared memory; Speedup; Partition (number theory); Graph; Theoretical computer science; Uniform memory access; Memory management; Operating system; Overlay","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":[],"consensus_categories":[],"category_scores_codex":[0.000221302,0.0001008899,0.00008403153,0.0001056854,0.0002184579,0.000134216,0.001015959,0.00003056259,0.00006661836],"category_scores_gemma":[0.00001507891,0.00006421308,0.00004642535,0.0004689264,0.0001075543,0.0003001604,0.0001889191,0.00008140998,0.0001725525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005323137,"about_ca_system_score_gemma":0.00001511013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008064913,"about_ca_topic_score_gemma":0.00001353212,"domain_scores_codex":[0.9991822,0.00003321173,0.0001041518,0.0002883477,0.0001776971,0.0002144478],"domain_scores_gemma":[0.9992294,0.00002368391,0.00003261573,0.0005845575,0.00005435287,0.00007535992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001653659,0.0001482181,0.0004119143,0.00001121755,0.000008379667,0.00001066032,0.0009103907,0.000002423979,0.0004674178,0.3073957,0.001965863,0.6886513],"study_design_scores_gemma":[0.0008758287,0.0006492775,0.002636629,0.0000714561,0.000005315525,0.00004757893,0.00004203636,0.06399575,0.02915008,0.8975385,0.00454803,0.0004395634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02780136,0.00004049851,0.9027178,0.001711576,0.0003760115,0.00009155238,0.000001637365,0.0004634222,0.06679609],"genre_scores_gemma":[0.9305128,0.000001191466,0.06639302,0.001486996,0.0001356773,0.000005055564,4.920465e-7,0.00000680134,0.001457946],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9027115,"threshold_uncertainty_score":0.2618534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009282644588959981,"score_gpt":0.2314970232925089,"score_spread":0.2222143787035489,"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."}}