{"meta":{"query_hash":"18de0dd487be","filters":{"venue":"International Conference on Security and Cryptography"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/18de0dd487be","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Security+and+Cryptography"},"results":[{"id":"W109531601","doi":"","title":"A POLYNOMIAL BASED HASHING ALGORITHM","year":2008,"lang":"en","type":"article","venue":"International Conference on Security and Cryptography","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hash function; Polynomial; K-independent hashing; Universal hashing; Dynamic perfect hashing; Algorithm; Theoretical computer science; Hash table; Mathematics; Double hashing; Computer security","score_opus":0.02271641385472183,"score_gpt":0.2323601147967544,"score_spread":0.20964370094203255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109531601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08887509,0.00011548591,0.8629519,0.00035515355,0.0009334453,0.00013424104,0.000093604154,0.00050733704,0.046033792],"genre_scores_gemma":[0.986364,0.00024209234,0.013118548,0.00011132716,0.0000954521,0.000010136708,0.00003986296,0.000010714067,0.000007841616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.0000093069275,0.00011408158,0.00014463923,0.00015101413,0.00011877817],"domain_scores_gemma":[0.99975485,0.000030061015,0.0000225508,0.000079264115,0.000054235417,0.000059016158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034161112,0.00011569356,0.00008901146,0.00015816005,0.00009112003,0.000044278244,0.00010350167,0.000058685313,0.000084847394],"category_scores_gemma":[0.000010914008,0.0001207163,0.000042599393,0.0000641975,0.0000814527,0.00011161661,0.000012406341,0.00016164286,0.000006226647],"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.0005351988,0.0010248882,0.00782531,0.00023631098,0.0008725696,0.0004432731,0.00840806,0.53513545,0.0022834034,0.22601303,0.021340203,0.19588226],"study_design_scores_gemma":[0.001147432,0.00011617439,0.0020757255,0.00007038441,0.000012452042,0.00003111381,0.0001391787,0.96742356,0.0033354703,0.011701407,0.013432204,0.0005148747],"about_ca_topic_score_codex":0.000009027611,"about_ca_topic_score_gemma":0.000005905088,"teacher_disagreement_score":0.89748895,"about_ca_system_score_codex":0.000014021669,"about_ca_system_score_gemma":0.000010590632,"threshold_uncertainty_score":0.49226677},"labels":[],"label_agreement":null},{"id":"W1560863323","doi":"","title":"A four-concern-oriented secure is development approach","year":2011,"lang":"en","type":"article","venue":"International Conference on Security and Cryptography","topic":"Access Control and Trust","field":"Social Sciences","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Model checking; Formal methods; Formal specification; Controller (irrigation); Formal verification; Separation of concerns; Information system; Data modeling; Software engineering; Distributed computing; Programming language; Software; Engineering","score_opus":0.10668276758341616,"score_gpt":0.30973885727905154,"score_spread":0.20305608969563538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560863323","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20120266,0.000108925095,0.0030642091,0.0011444067,0.0004302982,0.00024810812,0.000031989388,0.00010334542,0.79366606],"genre_scores_gemma":[0.99721384,0.00021622138,0.001529055,0.00073091383,0.00012920397,0.00004547271,0.000013109063,0.0000066023135,0.00011560191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986537,0.0000696456,0.00019680319,0.0003282778,0.000507129,0.00024441374],"domain_scores_gemma":[0.9993451,0.000026615666,0.000099696656,0.000104558654,0.00026918048,0.00015483785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024657426,0.0001485553,0.00014893844,0.00017249062,0.0003712351,0.0001262322,0.00036462626,0.00012085637,0.0016299022],"category_scores_gemma":[0.00002614232,0.00013739463,0.000082113285,0.00020046071,0.0003162669,0.00027940606,0.00006152203,0.00020346844,0.000029433344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000093675655,0.00015081922,0.010165175,0.000006047251,0.00009432922,0.000005303358,0.049998306,3.5674304e-8,0.000004808026,0.93291247,0.0002239642,0.0063450886],"study_design_scores_gemma":[0.0029055192,0.00031488805,0.044242516,0.00019790856,0.00007034343,0.000010823844,0.044086944,0.00086261885,0.0006044925,0.37741584,0.5279593,0.001328811],"about_ca_topic_score_codex":0.0005771228,"about_ca_topic_score_gemma":0.00038761558,"teacher_disagreement_score":0.79601115,"about_ca_system_score_codex":0.000023083203,"about_ca_system_score_gemma":0.0001154212,"threshold_uncertainty_score":0.9992827},"labels":[],"label_agreement":null},{"id":"W2616439236","doi":"","title":"BACKWARDS COMPATIBLE, MULTI-LEVEL REGIONS-OF-INTEREST (ROI) IMAGE ENCRYPTION ARCHITECTURE WITH BIOMETRIC AUTHENTICATION","year":2018,"lang":"en","type":"article","venue":"International Conference on Security and Cryptography","topic":"Advanced Steganography and Watermarking Techniques","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":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Raster graphics; Biometrics; Architecture; Computer vision; Authentication (law); Digital image; Artificial intelligence; Image (mathematics); Computer security; Image processing; Geography","score_opus":0.09276621949318023,"score_gpt":0.3180020245255701,"score_spread":0.22523580503238985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616439236","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.097993836,0.000031186013,0.8976625,0.0007442412,0.00017280714,0.0001886622,0.00004564144,0.00016372866,0.0029973888],"genre_scores_gemma":[0.8437936,0.000110932735,0.1558861,0.00011086589,0.000043240765,0.000019707537,0.000022087568,0.000007334088,0.000006154102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868226,0.0000768809,0.00027567305,0.00045309798,0.00031166253,0.00020041199],"domain_scores_gemma":[0.99863833,0.00006556885,0.0002346883,0.0003859883,0.0005853939,0.00009000691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001927816,0.00021023433,0.00019005798,0.0012162897,0.00014555066,0.00017482112,0.0007564878,0.00008952112,0.000026933805],"category_scores_gemma":[0.000026407188,0.00017191976,0.000094189854,0.0010468246,0.0005595236,0.00045381472,0.00013794388,0.00021390154,0.0000050953686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00013263761,0.00028139426,0.0016996919,0.000025930785,0.000082583174,0.000005332837,0.0017619733,6.3465785e-7,0.0056597963,0.9745853,0.00007440544,0.015690334],"study_design_scores_gemma":[0.002066412,0.0024278346,0.037579104,0.00090936007,0.000044016044,0.000102879014,0.00037426225,0.021257125,0.05769884,0.8736497,0.0028916753,0.0009987977],"about_ca_topic_score_codex":0.000027987067,"about_ca_topic_score_gemma":0.000046019046,"teacher_disagreement_score":0.7457997,"about_ca_system_score_codex":0.000013520849,"about_ca_system_score_gemma":0.000029570077,"threshold_uncertainty_score":0.70106846},"labels":[],"label_agreement":null}]}