{"meta":{"query_hash":"95ec32cfa4b6","filters":{"venue":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/95ec32cfa4b6","api":"https://metacan.xera.ac/api/v1/cohort?venue=2007+IFIP+International+Conference+on+Network+and+Parallel+Computing+Workshops+%28NPC+2007%29"},"results":[{"id":"W2146983490","doi":"10.1109/npc.2007.183","title":"An Efficient Contributory Group Rekeying Scheme based on Hash Functions for MANETs","year":2007,"lang":"en","type":"article","venue":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rekeying; Group key; Computer science; Hash function; Communication in small groups; Computer network; Key (lock); Popularity; Key management; Distributed hash table; Scheme (mathematics); Distributed computing; Group (periodic table); Computer security; Peer-to-peer; Encryption; Mathematics","score_opus":0.03019916182386688,"score_gpt":0.2954546532278444,"score_spread":0.26525549140397753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146983490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022083774,0.0002454187,0.9587327,0.00069858064,0.006268458,0.0006498845,0.000017166312,0.00043994669,0.010864036],"genre_scores_gemma":[0.925709,0.000026890513,0.068431355,0.0025478967,0.0028093655,0.00002468826,0.00019171457,0.00004452276,0.00021452908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577993,0.0001789954,0.0007844611,0.0012203697,0.00085175614,0.0011844714],"domain_scores_gemma":[0.99576575,0.002074154,0.0004149724,0.00079487555,0.0005321081,0.00041814332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022767638,0.0005355628,0.00046180325,0.00032576537,0.0007760945,0.000669305,0.001318082,0.00034855574,0.00011258545],"category_scores_gemma":[0.00014037371,0.0005606725,0.000179636,0.0004302127,0.00016590962,0.0002107538,0.00018505448,0.0007980463,0.000058325837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005182786,0.00039999528,0.0012556486,0.000015180356,0.000072749855,0.000042490243,0.00017148882,0.7369203,0.000019965497,0.22788516,0.009395676,0.023303064],"study_design_scores_gemma":[0.0016231358,0.00038755362,0.004155841,0.0004399433,0.000014300725,0.000019128256,0.00007976088,0.98180264,0.000007940761,0.0010550389,0.009809873,0.00060486584],"about_ca_topic_score_codex":0.000019462905,"about_ca_topic_score_gemma":0.000031483745,"teacher_disagreement_score":0.90362525,"about_ca_system_score_codex":0.00020204695,"about_ca_system_score_gemma":0.00010565078,"threshold_uncertainty_score":0.99968445},"labels":[],"label_agreement":null},{"id":"W2149154197","doi":"10.1109/npc.2007.47","title":"A Reliable SLA-based Admission Controller for MPLS Networks","year":2007,"lang":"en","type":"article","venue":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Admission control; Reliability (semiconductor); Service-level agreement; Knapsack problem; Distributed computing; Adaptation (eye); Controller (irrigation); Computer network; Multiprotocol Label Switching; Path (computing); Event (particle physics); Quality of service; Service level; Real-time computing","score_opus":0.023311198198071002,"score_gpt":0.27969306697998825,"score_spread":0.25638186878191727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149154197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003495136,0.0015204125,0.9698659,0.00040061743,0.0025133353,0.0006583069,0.000008094607,0.0009301848,0.02060799],"genre_scores_gemma":[0.8643489,0.00042253506,0.13115248,0.00094366557,0.002144989,0.000039503626,0.000090392314,0.000091138,0.0007664171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971959,0.000027798773,0.0007146766,0.0005897419,0.00036490217,0.0011069932],"domain_scores_gemma":[0.99789125,0.0010846464,0.00016964234,0.0003131569,0.00027538562,0.00026594833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008847952,0.00050115574,0.0005137663,0.00016976829,0.00029267117,0.00016867812,0.00051693845,0.00045012854,0.00015967363],"category_scores_gemma":[0.00014730458,0.00048327012,0.00015025184,0.00030716267,0.00014920153,0.00012512477,0.00010546286,0.0007603265,0.000027015069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005167691,0.00004273184,0.0006211264,0.000018815186,0.00008054316,0.0000134986985,0.000016953083,0.89447725,0.0000133019485,0.030570718,0.029195921,0.04443235],"study_design_scores_gemma":[0.0015952492,0.00013889286,0.0007501207,0.00047560522,0.00002200796,0.0000075660537,0.000049130453,0.9536646,0.000012287365,0.0046829185,0.03807357,0.000528037],"about_ca_topic_score_codex":0.0000041319795,"about_ca_topic_score_gemma":0.0000135503415,"teacher_disagreement_score":0.86085373,"about_ca_system_score_codex":0.00013314713,"about_ca_system_score_gemma":0.0000389398,"threshold_uncertainty_score":0.9997619},"labels":[],"label_agreement":null},{"id":"W4239027077","doi":"10.1109/icnpcw.2007.4351483","title":"An Efficient Contributory Group Rekeying Scheme based on Hash Functions for MANETs","year":2007,"lang":"en","type":"article","venue":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rekeying; Group key; Computer science; Hash function; Communication in small groups; Computer network; Key management; Scheme (mathematics); Key (lock); Distributed computing; Popularity; Computer security; Encryption; Mathematics","score_opus":0.03019916182386688,"score_gpt":0.2954546532278444,"score_spread":0.26525549140397753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239027077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022083774,0.0002454187,0.9587327,0.00069858064,0.006268458,0.0006498845,0.000017166312,0.00043994669,0.010864036],"genre_scores_gemma":[0.925709,0.000026890513,0.068431355,0.0025478967,0.0028093655,0.00002468826,0.00019171457,0.00004452276,0.00021452908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577993,0.0001789954,0.0007844611,0.0012203697,0.00085175614,0.0011844714],"domain_scores_gemma":[0.99576575,0.002074154,0.0004149724,0.00079487555,0.0005321081,0.00041814332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022767638,0.0005355628,0.00046180325,0.00032576537,0.0007760945,0.000669305,0.001318082,0.00034855574,0.00011258545],"category_scores_gemma":[0.00014037371,0.0005606725,0.000179636,0.0004302127,0.00016590962,0.0002107538,0.00018505448,0.0007980463,0.000058325837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005182786,0.00039999528,0.0012556486,0.000015180356,0.000072749855,0.000042490243,0.00017148882,0.7369203,0.000019965497,0.22788516,0.009395676,0.023303064],"study_design_scores_gemma":[0.0016231358,0.00038755362,0.004155841,0.0004399433,0.000014300725,0.000019128256,0.00007976088,0.98180264,0.000007940761,0.0010550389,0.009809873,0.00060486584],"about_ca_topic_score_codex":0.000019462905,"about_ca_topic_score_gemma":0.000031483745,"teacher_disagreement_score":0.90362525,"about_ca_system_score_codex":0.00020204695,"about_ca_system_score_gemma":0.00010565078,"threshold_uncertainty_score":0.99968445},"labels":[],"label_agreement":null},{"id":"W4248607109","doi":"10.1109/icnpcw.2007.4351460","title":"A Reliable SLA-based Admission Controller for MPLS Networks","year":2007,"lang":"en","type":"article","venue":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Quality of service","score_opus":0.023311198198071002,"score_gpt":0.27969306697998825,"score_spread":0.25638186878191727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248607109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003495136,0.0015204125,0.9698659,0.00040061743,0.0025133353,0.0006583069,0.000008094607,0.0009301848,0.02060799],"genre_scores_gemma":[0.8643489,0.00042253506,0.13115248,0.00094366557,0.002144989,0.000039503626,0.000090392314,0.000091138,0.0007664171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971959,0.000027798773,0.0007146766,0.0005897419,0.00036490217,0.0011069932],"domain_scores_gemma":[0.99789125,0.0010846464,0.00016964234,0.0003131569,0.00027538562,0.00026594833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008847952,0.00050115574,0.0005137663,0.00016976829,0.00029267117,0.00016867812,0.00051693845,0.00045012854,0.00015967363],"category_scores_gemma":[0.00014730458,0.00048327012,0.00015025184,0.00030716267,0.00014920153,0.00012512477,0.00010546286,0.0007603265,0.000027015069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005167691,0.00004273184,0.0006211264,0.000018815186,0.00008054316,0.0000134986985,0.000016953083,0.89447725,0.0000133019485,0.030570718,0.029195921,0.04443235],"study_design_scores_gemma":[0.0015952492,0.00013889286,0.0007501207,0.00047560522,0.00002200796,0.0000075660537,0.000049130453,0.9536646,0.000012287365,0.0046829185,0.03807357,0.000528037],"about_ca_topic_score_codex":0.0000041319795,"about_ca_topic_score_gemma":0.0000135503415,"teacher_disagreement_score":0.86085373,"about_ca_system_score_codex":0.00013314713,"about_ca_system_score_gemma":0.0000389398,"threshold_uncertainty_score":0.9997619},"labels":[],"label_agreement":null}]}