{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001776797,0.0005850178,0.0008228034,0.001343494,0.0009038688,0.001398137,0.0016025,0.0018934,0.004036122],"category_scores_gemma":[0.01773137,0.0006076185,0.0006772132,0.001356855,0.001955607,0.003428605,0.00275741,0.001936731,0.001167054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001716066,"about_ca_system_score_gemma":0.001708385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107367,"about_ca_topic_score_gemma":0.0008274667,"domain_scores_codex":[0.996524,0.0007813794,0.000169699,0.0006128481,0.001428528,0.0004834403],"domain_scores_gemma":[0.9887427,0.005109531,0.001395744,0.00337606,0.001011299,0.0003645463],"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.0003862248,0.0001173978,0.001746353,0.0002142189,0.00004796903,0.0000895976,0.00019346,0.1884106,0.009549839,0.6794097,0.004129354,0.1157054],"study_design_scores_gemma":[0.0001378092,0.0001982505,0.0006645739,0.00008231572,0.00003887893,0.0003280909,0.00004852483,0.6335838,0.009367535,0.3463561,0.009115036,0.00007904923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06035361,0.0009793486,0.9222658,0.0009906254,0.000131419,0.0001141033,0.0004443811,0.0006528841,0.01406784],"genre_scores_gemma":[0.7868714,0.001058092,0.2031933,0.0004544941,0.0001886501,0.0003628355,0.0005335773,0.0001436152,0.007194113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004036122,"threshold_uncertainty_score":0.01350218,"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."}}