{"id":"W1986033668","doi":"10.1007/s11235-009-9227-0","title":"TPGF: geographic routing in wireless multimedia sensor networks","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Equal-cost multi-path routing; Multipath routing; Computer network; Geographic routing; Static routing; Shortest path problem; Link-state routing protocol; Routing (electronic design automation); Policy-based routing; Dynamic Source Routing; Greedy algorithm; Distributed computing; Routing protocol; Algorithm; Theoretical computer science","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.001190846,0.0002689456,0.0004040842,0.0003637892,0.000227864,0.000294571,0.002336328,0.0002308052,0.000002373728],"category_scores_gemma":[0.00004230183,0.0002789096,0.00009533467,0.001517333,0.00005935614,0.0003960935,0.0002394159,0.0005682928,0.00003267798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001268719,"about_ca_system_score_gemma":0.00003397684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003265166,"about_ca_topic_score_gemma":0.00007635717,"domain_scores_codex":[0.9969887,0.0006794819,0.000808787,0.00051396,0.0003680764,0.0006410512],"domain_scores_gemma":[0.9965351,0.0004477565,0.0003798638,0.002351435,0.0001502191,0.0001356773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001086329,0.0003066112,0.01259164,0.00001230675,0.00002257256,0.00001919829,0.0008980723,0.8732754,0.0006744936,0.04464371,0.0001821556,0.06736298],"study_design_scores_gemma":[0.0004323655,0.00003774378,0.01935693,0.0001487376,0.000003187709,0.00002467789,0.00008646538,0.9790426,0.00005517524,0.00002213327,0.0004855939,0.0003043088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2989187,0.002495218,0.68743,0.001421287,0.001170756,0.0009394724,0.000001316874,0.001357754,0.006265494],"genre_scores_gemma":[0.9865358,0.0003024793,0.01260123,0.0002514724,0.0001333266,0.00003595449,0.00002178987,0.00002074843,0.00009713404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6876172,"threshold_uncertainty_score":0.9999663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01403788573095848,"score_gpt":0.2399753375917632,"score_spread":0.2259374518608047,"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."}}