quiz bu lëkkale ak tegtal · Diggante Niveau

Quiz bi LLM defar ci filigran

Teg filigraan mbindu lim, ak token bu wert, gis-gis bu am caabi, SynthID-Text, àppu soppali, ak xayma z-statistique buñ liggéey.

Yooni njiit yu jëm ciFigrana LLM Bind buñ defar
Laaj 1 de 8

How does the soft green-list watermark in the cited scheme influence token generation?

Xoolaatal laaj bu nekk8 laaj

Sooy def quiz bi, tontu yi ak leeral yi dañuy feeñ.

  1. How does the soft green-list watermark in the cited scheme influence token generation?
    • By requiring a visible watermark sentence in every output
    • By encrypting every word into unreadable bytes
    • By adding a preference bias to green-token logits
    • By guaranteeing that every generated token belongs to the green list
  2. What must match when applying a detector for a keyed green-token watermark?
    • The full original training dataset in every case
    • Physical access to the generation GPU
    • Every prompt the provider has ever received
    • The candidate text, scheme settings, tokenization and relevant key
  3. Why can a longer eligible passage provide more evidence for a statistical text watermark?
    • A law requires every long passage to be flagged
    • More scored tokens can make a persistent signal easier to distinguish from null variation
    • Every longer passage must have better factual accuracy
    • All short texts are necessarily unwatermarked
  4. Which published text watermark uses tournament sampling and is documented for Gemini text?
    • SynthID-Text
    • A standard PDF font renderer
    • The TCP packet checksum
    • An ordinary dictionary spell checker
  5. Lan mooy anam wiñ xamee ngir néewal doole wala dindi filigran bind?
    • Lire ko ak baat bu kawe
    • Dañu koy denc ni PDF
    • Imprime ko ci beneen melo
    • Tekki làkk bu diis
  6. What input helps reproduce green-list selection in the original context-dependent scheme?
    • A required live clock reading
    • The relevant preceding token context under the scheme’s seeding rule
    • Only the author’s IP address
    • Only the displayed font color
  7. Using z=(G−gamma×T)/sqrt(T×gamma×(1−gamma)), what is z for T=100, gamma=0.5 and G=60?
    • 2
    • 1
    • 5
    • 10
  8. Why does failing to detect one particular watermark not establish that a passage is human-written?
    • All machine-generated text must contain that exact keyed signature
    • Every negative score proves human authorship mathematically
    • Machine-generated text may not carry the tested watermark or matching configuration
    • The detector has necessarily recovered the original prompt