{"id":"W62729806","doi":"10.1007/978-3-642-38457-8_17","title":"Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Soundness; Computer science; Hyperbolic tree; Probabilistic logic; Spanning tree; Tree (set theory); Theoretical computer science; Constraint (computer-aided design); Multi-agent system; Distributed computing; Artificial intelligence; Mathematics; Programming language; Discrete mathematics","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.0004493482,0.0002431994,0.0006260575,0.0005335082,0.001034192,0.001168827,0.001154625,0.0007387678,0.00161077],"category_scores_gemma":[0.001288296,0.0003093524,0.0005229107,0.001281039,0.0005082597,0.001580365,0.001851951,0.000737604,0.0004458446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000451036,"about_ca_system_score_gemma":0.001029605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000631146,"about_ca_topic_score_gemma":0.0008170654,"domain_scores_codex":[0.9994884,0.0001344035,0.00003112393,0.000118183,0.0001586162,0.00006932225],"domain_scores_gemma":[0.9993804,0.0001189313,0.00006238116,0.0002257146,0.0001324897,0.0000800599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003837158,0.0003000701,0.003821653,0.0004124659,0.0001265691,0.0009837114,0.0009739302,0.2885653,0.05060642,0.329921,0.01460814,0.3092971],"study_design_scores_gemma":[0.0000350025,0.0001165119,0.0006315624,0.00002864145,0.00005007946,0.0005286689,0.0002775322,0.8574784,0.009945732,0.1179052,0.01297877,0.0000240094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05951766,0.0002052818,0.9336221,0.0002993608,0.00005714556,0.0001288068,0.0002022795,0.0005394108,0.005428103],"genre_scores_gemma":[0.5610709,0.0003538909,0.4330488,0.00009978207,0.00003483432,0.0001862941,0.0006219245,0.00009584525,0.004487805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00161077,"threshold_uncertainty_score":0.005388498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01550701712993679,"score_gpt":0.2226875022101129,"score_spread":0.2071804850801761,"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."}}