{"id":"W2031722321","doi":"10.1145/1346330.1346335","title":"Optimal probabilistic fingerprint codes","year":2008,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":217,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Traitor tracing; Alphabet; Upper and lower bounds; Binary number; Code (set theory); Computer science; Fingerprint (computing); Probabilistic logic; Combinatorics; Discrete mathematics; Constant (computer programming); Binary code; Mathematics; Algorithm; Arithmetic; Statistics; Encryption; Public-key cryptography; Set (abstract data type); Computer security","routes":{"ca_aff":true,"ca_fund":true,"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.0002549299,0.00006360778,0.0001125588,0.00005531173,0.0001433468,0.00002796896,0.003171228,0.00002456343,0.000001383398],"category_scores_gemma":[0.0003505884,0.0000358047,0.000141931,0.0001705722,0.00007771234,0.0002599813,0.0007244734,0.000189148,0.000001170615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002158606,"about_ca_system_score_gemma":0.00004837617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.379046e-7,"about_ca_topic_score_gemma":1.997127e-7,"domain_scores_codex":[0.9993461,0.00005105613,0.0002083818,0.00007333243,0.0002052879,0.0001158154],"domain_scores_gemma":[0.9987279,0.00007753237,0.000224427,0.0008404697,0.00009294006,0.00003669307],"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.001078838,0.003064215,0.1814867,0.0003887612,0.001135494,0.003602019,0.04010209,0.1045475,0.08494537,0.2073472,0.1978664,0.1744354],"study_design_scores_gemma":[0.0009719165,0.001035224,0.08104868,0.0005029615,0.00004747592,0.009602202,0.00003600309,0.006263356,0.1123739,0.7565939,0.03087692,0.0006475067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6200101,0.0001756244,0.3750083,0.003844125,0.0004907324,0.00008412937,4.547067e-7,0.00006728411,0.0003192944],"genre_scores_gemma":[0.6983874,0.00003174442,0.3013689,0.0001176038,0.00005233731,7.83334e-7,1.276835e-8,0.000002424936,0.00003871889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5492467,"threshold_uncertainty_score":0.5892984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02532286824823652,"score_gpt":0.2555608767257372,"score_spread":0.2302380084775007,"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."}}