{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004140244,0.0004121625,0.0004376489,0.0006427449,0.0002036896,0.000676749,0.003657073,0.0001913305,0.0001035414],"category_scores_gemma":[0.0002091458,0.0003851599,0.00007383302,0.001060649,0.0004229091,0.001597662,0.003178185,0.0003736326,0.00007311947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001829542,"about_ca_system_score_gemma":0.0002278864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005128929,"about_ca_topic_score_gemma":0.000008889238,"domain_scores_codex":[0.9968392,0.00002988771,0.0005645388,0.001175545,0.0009217269,0.000469063],"domain_scores_gemma":[0.9973384,0.0001553421,0.0004793807,0.001485725,0.0004196309,0.0001215872],"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.000002355848,0.00003463707,0.0003151684,0.00008287602,0.00002710806,0.00003704174,0.0003972004,0.005766795,0.0003264941,0.02540923,0.0001904048,0.9674107],"study_design_scores_gemma":[0.0006801423,0.000275984,0.001629984,0.0008880964,0.0000422093,0.0001074169,0.000001645234,0.7194796,0.008362262,0.2609778,0.006296147,0.001258781],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004350183,0.0001081231,0.9942207,0.0007326368,0.001349575,0.0004371313,0.0000120593,0.0001629206,0.002541839],"genre_scores_gemma":[0.06221456,0.00009295762,0.9357892,0.0004335026,0.000454869,0.000009191242,0.0001640829,0.0000579144,0.0007837633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9661519,"threshold_uncertainty_score":0.99986,"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."}}