{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000403136,0.0003916445,0.0003729477,0.0002744592,0.0003830249,0.0001246152,0.001811902,0.0002644304,0.00005882595],"category_scores_gemma":[0.00001107051,0.0003844554,0.0004802696,0.0003595958,0.0000955354,0.0004304356,0.001181415,0.0002786977,0.0001105042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001151166,"about_ca_system_score_gemma":0.000132422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001183807,"about_ca_topic_score_gemma":0.00001870575,"domain_scores_codex":[0.9975382,0.0001458853,0.000257577,0.001288866,0.0001101653,0.0006592814],"domain_scores_gemma":[0.9978108,0.0001332068,0.000268253,0.001352748,0.0002172142,0.0002177376],"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.0000348162,0.000239544,0.0003848972,0.00008683497,0.0001659055,0.00007644202,0.0001646344,0.001100753,0.00007378722,0.9960464,0.0005653902,0.001060642],"study_design_scores_gemma":[0.0009803894,0.0001495804,0.0000809806,0.0001534481,0.00006789369,0.000005391597,0.00003699672,0.05825206,0.001696656,0.9344977,0.003397574,0.0006813165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05097491,0.00008212879,0.9458696,0.0001400551,0.001194592,0.0005937241,0.0001651198,0.000276423,0.0007035025],"genre_scores_gemma":[0.9960881,0.000212816,0.001673516,0.0002078001,0.00009461799,0.00001619492,0.0000470541,0.00002352899,0.001636297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9451132,"threshold_uncertainty_score":0.9998608,"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."}}