{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"46041a96d33c","filters":{"venue":"International Symposium on Information Theory and its Applications"}},"results":[{"id":"W3139172876","doi":"","title":"A Capacity-achieving One-way Key Agreement with Improved Finite Blocklength Analysis","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Key (lock); Pre-shared key; Computer science; Alice and Bob; Key-agreement protocol; Shared secret; Alice (programming language); Public-key cryptography; Cryptography; Key distribution; Computer security; Cryptographic protocol; Key generation; Protocol (science); Channel (broadcasting); Key exchange; Theoretical computer science; Computer network; Encryption","authors":[{"name":"Setareh Sharifian","is_ca":true},{"name":"Alireza Poostindouz","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01031670758620045,"gpt":0.214881811462932,"spread":0.2045651038767316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412649,0.0009844487,0.001190829,0.001212953,0.001161205,0.001953661,0.0021982,0.00123416,0.003372055],"category_scores_gemma":[0.01189298,0.0006084559,0.001140559,0.001462102,0.003825017,0.006583693,0.003417057,0.003560144,0.0008447177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002361414,"about_ca_system_score_gemma":0.002598316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009979036,"about_ca_topic_score_gemma":0.0006642789,"domain_scores_codex":[0.9966435,0.0009539154,0.0001747926,0.0005712763,0.001177476,0.0004790521],"domain_scores_gemma":[0.9849612,0.01066221,0.001204298,0.001703351,0.001086924,0.00038197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003524795,0.0001147074,0.0004117718,0.0003346389,0.00007033988,0.0002652018,0.0004861717,0.3411435,0.02287098,0.5997494,0.002886679,0.03131418],"study_design_scores_gemma":[0.00004336022,0.000109197,0.0001219048,0.00004699374,0.00002744861,0.0001415185,0.00004960533,0.821911,0.01327455,0.1615322,0.002664757,0.00007756771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02990364,0.0005496537,0.9598486,0.0006085751,0.00006135617,0.00007367293,0.0001613932,0.0003651344,0.008427983],"genre_scores_gemma":[0.8031768,0.0009554122,0.189109,0.0002091355,0.0001507491,0.0003152169,0.0002587676,0.0001595623,0.005665299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003412649,"threshold_uncertainty_score":0.01804805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2585233219","doi":"","title":"Embedded pilot and multi-size OFDM processing for jointly time and frequency selective channels","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Pilot signal; Orthogonal frequency-division multiplexing; Computer science; Frequency domain; Impulse response; Time domain; Channel (broadcasting); SIGNAL (programming language); Frequency divider; Electronic engineering; Time–frequency analysis; Signal processing; MIMO; Impulse (physics); Telecommunications; Engineering; Mathematics; Radar","authors":[{"name":"Christian Schlegel","is_ca":true},{"name":"Marcel Jar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01093807024059796,"gpt":0.2615183208337508,"spread":0.2505802505931528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000214524,0.0003463036,0.0002365782,0.0001537681,0.0001658616,0.0002922021,0.0003371826,0.0003791938,0.001498934],"category_scores_gemma":[0.0008493711,0.0001426703,0.0001673686,0.0002063032,0.0002433621,0.0005151213,0.0003640411,0.0004208008,0.0003608039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451025,"about_ca_system_score_gemma":0.0002306274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002235312,"about_ca_topic_score_gemma":0.0005162809,"domain_scores_codex":[0.9998869,0.00003012868,0.000004875436,0.00001675245,0.00004537384,0.00001594132],"domain_scores_gemma":[0.9996315,0.0001905056,0.00004362683,0.00005650444,0.00006210061,0.00001570721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008973886,0.0001655791,0.000917079,0.0002432693,0.00005415265,0.00105728,0.0002388621,0.09294347,0.5052158,0.02943189,0.002045097,0.36679],"study_design_scores_gemma":[0.0000587507,0.0007330603,0.0008387675,0.00002688949,0.00002730588,0.0009018189,0.00003984092,0.8553169,0.1284769,0.006494078,0.007057623,0.00002811126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04449392,0.0002868188,0.9530703,0.00008138811,0.00007476667,0.00002853756,0.00003154016,0.0003280704,0.001604623],"genre_scores_gemma":[0.5071796,0.0002780269,0.4889484,0.0000834403,0.00009734795,0.00006364326,0.00009137114,0.00004703203,0.003211123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001498934,"threshold_uncertainty_score":0.00501442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2547365694","doi":"","title":"Matched-filter detection of the presence of MPSK signals","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Matched filter; Computer science; Filter (signal processing); Filtering theory; Artificial intelligence; Computer vision","authors":[{"name":"Seyed Ali Saberali","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003803111894123524,"gpt":0.204127451302217,"spread":0.2003243394080935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481567,0.0004476724,0.0005587398,0.0008426158,0.0003069183,0.0007002361,0.0003985454,0.001077993,0.002008807],"category_scores_gemma":[0.003270874,0.0002090124,0.0002424024,0.0005543354,0.000278594,0.0007795061,0.000717502,0.0005615898,0.0005424343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003105294,"about_ca_system_score_gemma":0.0004522982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004773447,"about_ca_topic_score_gemma":0.0006379067,"domain_scores_codex":[0.9994659,0.0000623133,0.00002810661,0.0000949764,0.0002699911,0.00007873835],"domain_scores_gemma":[0.9989053,0.0006370249,0.0001413571,0.00009643855,0.0001790599,0.00004077667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002819817,0.0002176157,0.006610192,0.0004374988,0.0001442747,0.001375631,0.0003156543,0.0198366,0.5176844,0.02047405,0.001670843,0.4284133],"study_design_scores_gemma":[0.00009663573,0.0006783972,0.01841764,0.0001185027,0.0001301314,0.003256249,0.0001636353,0.5415184,0.4123313,0.01590195,0.007307584,0.00007963865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4041847,0.000969236,0.5871724,0.0006173578,0.0003909041,0.00004995272,0.0004495571,0.0006134906,0.005552361],"genre_scores_gemma":[0.9330842,0.0002443635,0.06276061,0.000125441,0.00008538185,0.00002508879,0.0002259437,0.00002570718,0.003423258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002008807,"threshold_uncertainty_score":0.006720066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594741606","doi":"","title":"Dirty interference cancelation for multiple access channels.","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Interference (communication); Computer science; Adjacent-channel interference; Computer network; Telecommunications; Channel (broadcasting)","authors":[{"name":"Ruchen Duan","is_ca":false},{"name":"Yingbin Liang","is_ca":false},{"name":"Ashish Khisti","is_ca":true},{"name":"Shlomo Shamai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01123115713256123,"gpt":0.2696267618955675,"spread":0.2583956047630063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165542,0.00143213,0.0008654362,0.000914209,0.001208861,0.001465545,0.001633895,0.001398263,0.008774281],"category_scores_gemma":[0.006915581,0.000560336,0.0005071331,0.0008789615,0.001332492,0.002377355,0.001614438,0.002204442,0.002855764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006756677,"about_ca_system_score_gemma":0.001297006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001626463,"about_ca_topic_score_gemma":0.004277172,"domain_scores_codex":[0.9976314,0.0005508132,0.00006822844,0.0002546678,0.001173067,0.0003217541],"domain_scores_gemma":[0.9963491,0.001685404,0.0002555796,0.0006836446,0.00088551,0.0001407821],"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.002664861,0.0002072159,0.001182776,0.001226308,0.0003406032,0.001035973,0.0005379125,0.06025761,0.1084189,0.1819867,0.04473272,0.5974084],"study_design_scores_gemma":[0.0003277947,0.0005994479,0.001226656,0.000302492,0.0002727726,0.003740575,0.0002186505,0.6568168,0.1442203,0.1114034,0.08066629,0.0002047757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007229546,0.002805881,0.9778186,0.0004659122,0.0005990412,0.00003720211,0.0001405227,0.0006241995,0.01027915],"genre_scores_gemma":[0.4416155,0.005378195,0.5149764,0.001434269,0.0009627113,0.0001956458,0.0008455829,0.0004382298,0.03415351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008774281,"threshold_uncertainty_score":0.0293529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1556416173","doi":"","title":"On statistical restricted isometry property of a new class of deterministic partial Fourier compressed sensing matrices","year":2012,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Restricted isometry property; Compressed sensing; Block matrix; DFT matrix; Matrix (chemical analysis); Concatenation (mathematics); Algorithm; Isometry (Riemannian geometry); Sparse matrix; Mutual coherence; Discrete Fourier transform (general); Mathematics; Fourier transform; Single-entry matrix; Computer science; Coherence (philosophical gambling strategy); Fourier analysis; Combinatorics; Symmetric matrix; Mathematical analysis; Matrix function; Square matrix; Fractional Fourier transform; Physics; Gaussian","authors":[{"name":"Nam Yul Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01233338157427552,"gpt":0.254788107406447,"spread":0.2424547258321715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390787,0.0007534659,0.0005727854,0.001179004,0.0005092628,0.0009273262,0.0005657759,0.0006733602,0.002842614],"category_scores_gemma":[0.006222908,0.0003111268,0.0005827159,0.0008702737,0.001855056,0.00223597,0.001123396,0.001635015,0.0005335456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004101997,"about_ca_system_score_gemma":0.0005892509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005241997,"about_ca_topic_score_gemma":0.0003214194,"domain_scores_codex":[0.9988769,0.0002611057,0.00005120158,0.0002627993,0.000416587,0.0001313294],"domain_scores_gemma":[0.9967911,0.001483315,0.0005047645,0.0005054071,0.0005784549,0.0001370186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001189614,0.00005558443,0.001123693,0.0001208747,0.00003228265,0.0003134941,0.0002066434,0.05714782,0.01677566,0.8804475,0.002878258,0.04077915],"study_design_scores_gemma":[0.00002911295,0.0002218745,0.0009508822,0.00002948535,0.00001618627,0.0008278821,0.0000912051,0.6130959,0.005975286,0.3724935,0.006215906,0.00005266087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03898227,0.0005043789,0.9516515,0.0004033876,0.00007191508,0.00003938867,0.0001518494,0.0001293035,0.008065945],"genre_scores_gemma":[0.8337933,0.002374425,0.155435,0.0005742495,0.000635063,0.0002558295,0.0007575912,0.0001687885,0.00600573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002842614,"threshold_uncertainty_score":0.009509444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2549675421","doi":"","title":"Design factors for dual-hop AF systems with partial relay selection","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Dual (grammatical number); Selection (genetic algorithm); Hop (telecommunications); Computer network; Artificial intelligence; Physics","authors":[{"name":"Samy S. Soliman","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01882366071901197,"gpt":0.2566302119809246,"spread":0.2378065512619126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124844,0.001614326,0.000649255,0.0006936031,0.0004694504,0.00120198,0.0004928758,0.0004972014,0.005523206],"category_scores_gemma":[0.005586131,0.0004566899,0.0004396054,0.000606007,0.0004458782,0.0008545267,0.000874699,0.0006943432,0.00101111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006966053,"about_ca_system_score_gemma":0.001233232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000975056,"about_ca_topic_score_gemma":0.001445591,"domain_scores_codex":[0.9989719,0.0003857626,0.00004265772,0.0001411324,0.0003407062,0.0001178163],"domain_scores_gemma":[0.997875,0.001203292,0.0001729301,0.0001452963,0.0005312073,0.00007218891],"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.0007113344,0.0001648345,0.001889116,0.0005576697,0.0001698467,0.0001949329,0.0003678659,0.4863361,0.05309005,0.1064727,0.004364309,0.3456813],"study_design_scores_gemma":[0.0001238619,0.0009175671,0.001070647,0.0001445929,0.0001654113,0.0005012568,0.000149226,0.9361483,0.01006087,0.04212358,0.008538582,0.0000561799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02099294,0.0006614854,0.9715514,0.0001817468,0.00005217104,0.00008466895,0.00008797875,0.0001415269,0.00624598],"genre_scores_gemma":[0.7386315,0.001265113,0.2548789,0.0001250009,0.0001468353,0.0003839699,0.0001668218,0.00008104763,0.004320745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005523206,"threshold_uncertainty_score":0.01847696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2584903853","doi":"","title":"Bipartite grammar-based representations of large sparse binary matrices: Framework and transforms","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Terminal and nonterminal symbols; Bipartite graph; Logical matrix; Binary number; Matrix (chemical analysis); Combinatorics; Mathematics; Algorithm; Context (archaeology); Discrete mathematics; Graph; Computer science; Rule-based machine translation; Arithmetic; Artificial intelligence","authors":[{"name":"En‐hui Yang","is_ca":true},{"name":"Jingyun Bian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00808969763943832,"gpt":0.2682132733975769,"spread":0.2601235757581386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046745,0.0005597595,0.0004981889,0.001171878,0.0004008386,0.001066119,0.00092528,0.0008741632,0.00351902],"category_scores_gemma":[0.002944478,0.0003083925,0.0006913511,0.001591539,0.001197394,0.00204156,0.001180105,0.001149246,0.001395184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005179173,"about_ca_system_score_gemma":0.0009276541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002244922,"about_ca_topic_score_gemma":0.002045873,"domain_scores_codex":[0.9992768,0.0002230376,0.0000459759,0.0001323069,0.000247404,0.00007449237],"domain_scores_gemma":[0.9991267,0.0003396721,0.00009278717,0.0001999358,0.0001867034,0.00005408502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00013708,0.00008387271,0.0005498653,0.000148595,0.00002359711,0.0004635535,0.000439609,0.1610084,0.02156121,0.6274144,0.005388534,0.1827812],"study_design_scores_gemma":[0.00002199526,0.00005860074,0.000148306,0.00002541947,0.00001052803,0.0002268988,0.00009543595,0.6818277,0.005914857,0.3016344,0.01000402,0.00003186094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008164554,0.0001150258,0.9887194,0.000121133,0.00004195525,0.0000387478,0.000163812,0.0005200398,0.002115238],"genre_scores_gemma":[0.2489327,0.000508799,0.7421975,0.0003032647,0.0001226654,0.0003569554,0.001243373,0.0005542581,0.005780583],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00351902,"threshold_uncertainty_score":0.01177233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2583896214","doi":"","title":"On a variant of multilinear modular hashing with applications to authentication and secrecy codes","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Universal hashing; Multilinear map; Computer science; Theoretical computer science; Secrecy; Hash function; Universality (dynamical systems); Authentication (law); Modular design; Cryptography; Scheme (mathematics); Message authentication code; Binary code; Algorithm; Binary number; Double hashing; Mathematics; Computer security; Arithmetic; Hash table; Programming language","authors":[{"name":"Khodakhast Bibak","is_ca":true},{"name":"Bruce M. Kapron","is_ca":true},{"name":"Venkatesh Srinivasan","is_ca":true},{"name":"László Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006411805616823589,"gpt":0.2404554890895196,"spread":0.234043683472696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223659,0.0006286051,0.0008004458,0.001309025,0.00124844,0.001346117,0.001104385,0.001118431,0.002462616],"category_scores_gemma":[0.007865245,0.0003245565,0.000890354,0.002236139,0.004942737,0.004116944,0.006084424,0.00247073,0.0005804775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009759408,"about_ca_system_score_gemma":0.0008185686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000638942,"about_ca_topic_score_gemma":0.0003786913,"domain_scores_codex":[0.9979498,0.0007502974,0.0001405581,0.0003809952,0.0005263578,0.0002519902],"domain_scores_gemma":[0.996159,0.001829535,0.0003808658,0.0009892497,0.000395259,0.0002461924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004358619,0.00001710829,0.0002425364,0.00003974393,0.000005411587,0.00007930291,0.0001581268,0.007043819,0.001803066,0.9748465,0.0005672085,0.0151536],"study_design_scores_gemma":[0.00002917143,0.0002068899,0.000263061,0.00004718691,0.00001573111,0.0004232537,0.00009335037,0.09107295,0.003946338,0.8928171,0.01102177,0.00006307125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05302189,0.001408614,0.9256471,0.001124355,0.0002798212,0.0001414101,0.000124762,0.0001972607,0.01805479],"genre_scores_gemma":[0.7214118,0.001898187,0.2654221,0.0006924588,0.0008661373,0.0002397716,0.0001886082,0.000106382,0.009174611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002462616,"threshold_uncertainty_score":0.01182836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139202565","doi":"","title":"A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Channel capacity; Upper and lower bounds; Symmetry (geometry); Simple (philosophy); Coding (social sciences); Channel (broadcasting); Computation; Mathematics; Channel code; Capacity planning; Computer science; Decoding methods; Algorithm; Statistics; Mathematical analysis; Telecommunications; Geometry","authors":[{"name":"Jian-Jia Weng","is_ca":true},{"name":"Fady Alajaji","is_ca":true},{"name":"Tamás Linder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02092861560926353,"gpt":0.253743228671858,"spread":0.2328146130625945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342528,0.001703403,0.001425818,0.002358936,0.001167552,0.002405776,0.002177631,0.001437583,0.006173583],"category_scores_gemma":[0.02536157,0.0005258467,0.001497434,0.002892928,0.00444438,0.005864429,0.003008499,0.004132928,0.001131193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134219,"about_ca_system_score_gemma":0.001631589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001940855,"about_ca_topic_score_gemma":0.001045223,"domain_scores_codex":[0.9964184,0.000876733,0.0001439854,0.0004320407,0.001507418,0.0006214372],"domain_scores_gemma":[0.9826403,0.01243891,0.0009656438,0.001989715,0.001639601,0.000325758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002242378,0.0001055607,0.0007465092,0.0003536042,0.00005822605,0.0002987336,0.0003144754,0.2800331,0.01122596,0.6720474,0.003938713,0.03065341],"study_design_scores_gemma":[0.00001441177,0.00006249214,0.0003121066,0.00006991636,0.00002267615,0.0002324862,0.0000568106,0.7303036,0.01050917,0.2557225,0.002618337,0.00007553124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02101951,0.001263741,0.9552836,0.0004461429,0.0001441595,0.00009580615,0.0002172779,0.0003912542,0.02113855],"genre_scores_gemma":[0.8090193,0.002107061,0.18087,0.000487016,0.0003403698,0.0004549768,0.0004754802,0.0003926029,0.005853327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006173583,"threshold_uncertainty_score":0.02065271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}