{"id":"W4292264668","doi":"10.1109/tdsc.2022.3199326","title":"A Comparison of Four Notions of Isomorphism-Based Security for Graphs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Graph homomorphism; Notation; Theoretical computer science; Computer science; Graph; Computational complexity theory; Discrete mathematics; Isomorphism (crystallography); Graph automorphism; Graph property; Adversary; Combinatorics; Mathematics; Algorithm; Line graph; Voltage graph","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":[],"consensus_categories":[],"category_scores_codex":[0.000438586,0.0001707352,0.0003837393,0.0003649089,0.0007448713,0.00003603743,0.000499672,0.00005896476,0.00002817894],"category_scores_gemma":[0.000006228094,0.0001879238,0.0002457375,0.0008050724,0.00008364399,0.0001721686,0.00001784917,0.0003449437,3.451274e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001971559,"about_ca_system_score_gemma":0.00008519594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008551257,"about_ca_topic_score_gemma":0.00005380466,"domain_scores_codex":[0.9984029,0.0001240197,0.0004777571,0.0004009583,0.0003311539,0.0002632248],"domain_scores_gemma":[0.9986358,0.0004732889,0.0002578434,0.0004231026,0.0001262764,0.00008367748],"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.0008663104,0.009022125,0.00334411,0.001648891,0.0006359527,0.00002882407,0.0220414,0.6120437,0.009646621,0.270904,0.003289044,0.06652908],"study_design_scores_gemma":[0.001564511,0.0009835443,0.0001482248,0.00005314371,0.00007040294,0.00002321448,0.0005247871,0.956107,0.02740929,0.01164736,0.001153724,0.00031479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.14109,0.0001483904,0.85742,0.0001652833,0.0003838101,0.0003135954,0.0003695002,0.000071902,0.00003757854],"genre_scores_gemma":[0.974148,0.00000526692,0.02570871,0.00007480723,0.00001035366,0.00002746207,0.00001363724,0.00001022005,0.000001526707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8330581,"threshold_uncertainty_score":0.7663312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03244006460569582,"score_gpt":0.2862247744450732,"score_spread":0.2537847098393773,"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."}}