{"id":"W2951336423","doi":"10.48550/arxiv.1603.04626","title":"TAPER: query-aware, partition-enhancement for large, heterogenous, graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Partition (number theory); Scalability; Graph partition; Workload; Space partitioning; Hash function; USable; Parallel computing; Theoretical computer science; Graph; Algorithm; Database; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550437,0.001373212,0.0008518318,0.00136523,0.0009456362,0.001655182,0.003133791,0.0008641388,0.003754887],"category_scores_gemma":[0.006530751,0.0007046937,0.00111168,0.001532999,0.001015193,0.003882604,0.003364581,0.00103057,0.001974027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000970391,"about_ca_system_score_gemma":0.001034733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005711283,"about_ca_topic_score_gemma":0.009301656,"domain_scores_codex":[0.9986847,0.0003282765,0.0000736204,0.0002969637,0.0004648065,0.0001517535],"domain_scores_gemma":[0.9956535,0.001332974,0.000230053,0.002184419,0.0003900427,0.0002089981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002313645,0.0007320442,0.006930253,0.001192248,0.0003186857,0.0005839408,0.001476652,0.243964,0.1172706,0.0196624,0.08573093,0.5198246],"study_design_scores_gemma":[0.0003073456,0.0005052934,0.002439185,0.0000379782,0.00006860167,0.0005186093,0.0004600716,0.9123783,0.04170295,0.01769574,0.02381839,0.00006742748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1568619,0.001361562,0.668575,0.0007509441,0.0002455164,0.0007005913,0.002403534,0.1570215,0.01207941],"genre_scores_gemma":[0.4248061,0.0004549555,0.5569851,0.0003641054,0.0001004069,0.0002840843,0.005788653,0.005940446,0.005276208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005711283,"threshold_uncertainty_score":0.01256132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04742599059995042,"score_gpt":0.1925564780161005,"score_spread":0.14513048741615,"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."}}