{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"07dddd70cf64","filters":{"venue":"Proceedings - Computer Security Foundations Workshop/Proceedings"}},"results":[{"id":"W2160908866","doi":"10.1109/csf.2007.27","title":"Probability of Error in Information-Hiding Protocols","year":2007,"lang":"en","type":"article","venue":"Proceedings - Computer Security Foundations Workshop/Proceedings","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Inference; Conditional probability; Principle of maximum entropy; Theoretical computer science; Conditional entropy; Entropy (arrow of time); Information hiding; Algorithm; Artificial intelligence; Mathematics; Statistics; Embedding","authors":[{"name":"Konstantinos Chatzikokolakis","is_ca":false},{"name":"Catuscia Palamidessi","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03507202966907516,"gpt":0.2962015636138127,"spread":0.2611295339447375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03683483,0.002604835,0.003788716,0.004279161,0.002786593,0.008140906,0.005832634,0.004586336,0.003854895],"category_scores_gemma":[0.1730353,0.002216672,0.002666333,0.003315407,0.01355577,0.01772825,0.008509963,0.008851353,0.0007926891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007796145,"about_ca_system_score_gemma":0.003091104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741236,"about_ca_topic_score_gemma":0.0009094381,"domain_scores_codex":[0.9586744,0.02130783,0.001867032,0.0039934,0.01113496,0.003022461],"domain_scores_gemma":[0.6790761,0.288845,0.01000239,0.01333591,0.006827117,0.001913519],"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.0003705643,0.00005747735,0.001199555,0.0002323069,0.00009464887,0.000283015,0.0006953751,0.2167406,0.001534964,0.7656894,0.0007890796,0.012313],"study_design_scores_gemma":[0.00003285972,0.00004911873,0.0002093952,0.00006687013,0.00003307014,0.0001049255,0.00007062657,0.4599036,0.001894391,0.5370123,0.0005791994,0.00004357692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02810938,0.0005659834,0.9636426,0.001614528,0.00004881611,0.0001265783,0.000156254,0.0002676065,0.005468256],"genre_scores_gemma":[0.8632983,0.001412996,0.1274403,0.0004577556,0.0003807123,0.0007209739,0.0002399318,0.0003767413,0.005672443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03683483,"threshold_uncertainty_score":0.1948035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}