{"id":"W4292697948","doi":"10.48550/arxiv.1603.04626","title":"TAPER: query-aware, partition-enhancement for large, heterogenous,\\n 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.001107252,0.001507596,0.0008051551,0.001260139,0.0009622566,0.001594572,0.003445221,0.0008042794,0.003836055],"category_scores_gemma":[0.004695557,0.0005826353,0.0009294978,0.001469246,0.0009148964,0.003789999,0.002955085,0.0010264,0.001983841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026277,"about_ca_system_score_gemma":0.001139097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008844943,"about_ca_topic_score_gemma":0.01355599,"domain_scores_codex":[0.9987618,0.0002514992,0.00006794575,0.0002753008,0.0004591832,0.0001842067],"domain_scores_gemma":[0.9968046,0.0009278147,0.0001898816,0.001551118,0.0003214908,0.0002050403],"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.002935553,0.001016658,0.007262932,0.001244335,0.0002893276,0.0006593119,0.001548693,0.1737568,0.155856,0.01310924,0.1025414,0.5397798],"study_design_scores_gemma":[0.0003432082,0.0007996528,0.003411305,0.00004994992,0.00009019783,0.0006515224,0.0007986251,0.8858766,0.06561288,0.008608273,0.0336557,0.0001021095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2855699,0.003092913,0.4754089,0.0009473081,0.0004212726,0.000888761,0.003698082,0.2095058,0.02046709],"genre_scores_gemma":[0.5644484,0.0007305921,0.4107598,0.0005722932,0.0001178832,0.0003250596,0.009373522,0.005903746,0.007768618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008844943,"threshold_uncertainty_score":0.01758695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04841516048492684,"score_gpt":0.1930782317910134,"score_spread":0.1446630713060866,"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."}}