1/329
Looks like no tags are added yet.
A. Fix instrument freshness in the laboratory system, pilot Claude for note extraction and routing, retain chain-of-custody controls, and measure synchronization delay separately from technician intake time.
B. Keep the overnight synchronization, use Claude to infer likely instrument availability from submission notes, retain sample-acceptance approvals, and measure total intake time plus escalation rate.
C. Fix instrument freshness, keep manual note interpretation, and use Claude only to rewrite acceptance notifications, measuring notification clarity and total sample-intake time.
D. Keep the overnight synchronization, let Claude reconcile notes with historical instrument schedules, retain acceptance approvals, and measure extraction confidence alongside total sample-intake time.
A
A. Have Claude interpret submissions and decide eligibility, use the policy system only to record results, let reviewers sample completed cases, and track review time plus omission rate.
B. Have Claude extract submission facts and flag gaps against approved policy; keep eligibility in current systems, route ambiguous cases to reviewers, and gate on time and omission thresholds.
C. Use deterministic templates to extract every submission field, have Claude approve exceptions to policy rules, send incomplete cases to reviewers, and track review time plus omission rate.
D. Have Claude summarize submissions from approved sources, keep all comparisons and eligibility checks manual, and gate the pilot on summary readability, review time, and model cost.
B
A. A responsibility map separating Claude’s interpretation and drafting work, existing-system validation and recording, and human approval decisions.
B. A preferred-model declaration based on the architect’s prior projects, with other models considered only if the pilot fails.
C. A multi-agent topology assigning one agent to summaries, one to CRM updates, and one to contract decisions.
D. A measurable acceptance set covering summary fidelity, action-item recall, unauthorized-change rate, latency, and cost on representative calls.
E. A prompt library containing several tones for follow-up emails, treated as the complete set of solution requirements.
A,D
A. Let Claude interpret the questionnaires, retrieve any needed vendor facts from memory, and update the vendor’s final risk tier when its explanation is confident.
B. Use deterministic rules to summarize narrative responses, while Claude executes risk thresholds and approves exceptions expressed in natural language.
C. Use Claude to analyze narrative responses and draft cited findings; use existing systems for current vendor facts and threshold enforcement; have the procurement officer decide residual-risk acceptance.
D. Create independent agents to vote on each vendor, omit system integrations for the pilot, and measure agreement among agents as the primary business outcome.
C
A. Let Claude answer from its general context, have agents review a daily sample, and select the pilot if average drafting time and per-case cost improve.
B. Use fixed response templates without connecting approved support content, ask Claude only to adjust tone, have agents resolve unmatched cases, and gate on unsupported-step rate, latency, and cost.
C. Let a Claude agent search public troubleshooting sites and update the support knowledge base, have agents approve replies only on complaints, and gate on tone, latency, and cost.
D. Have Claude draft from retrieved approved content, route unsupported cases to agents, keep knowledge changes outside the model, and gate on grounded quality, tone, p95 latency, and cost.
D
A. Send every structured field and policy calculation to Claude so one generative step owns the complete expense-intake decision.
B. Send exception narratives to Claude to classify the reason and draft a policy-grounded request for required evidence.
C. Let Claude infer a missing cost center from prior claims so the case can continue without the current record.
D. Cache policy monthly, let Claude submit exceptions resembling approved claims, and return only novel cases to finance.
E. Keep structured validation in the expense system and return claims to finance whenever current policy or cost-center data is unavailable.
B,E
A. Use Claude for classification and theme drafts, retain source links in the intake system, keep roadmap decisions with the product manager, and measure classification quality, review time, latency, and cost.
B. Use Claude for classification and theme drafts, let it revise the taxonomy when confidence is low, keep roadmap decisions with the product manager, and measure review time, latency, and cost.
C. Use keyword rules for classification, ask Claude only to polish the theme summary, preserve source links, keep roadmap decisions with the product manager, and measure review time, latency, and cost.
D. Use Claude for classification and theme drafts, discard individual source links after aggregation, keep roadmap decisions with the product manager, and measure classification quality, review time, latency, and cost.
A
A. Give Claude a weekly consolidated export, require citations in each brief, let it select the most credible value when sources conflict, keep pricing approval with humans, and gate on quality, latency, and cost.
B. Connect the current sources read-only, have Claude produce an attributed brief that preserves conflicting evidence, keep pricing changes in the existing human-approved process, and gate the pilot on quality, latency, and cost.
C. Connect the current sources read-only, have Claude choose one value for every conflict and produce the brief, keep pricing approval with humans, and gate the pilot on quality, latency, and cost.
D. Connect the current sources, use deterministic rules to suppress flagged accounts from the daily brief, send those accounts to manual research, and gate only the routine path on latency and cost.
B
A. Have Claude draft grounded findings while the incident commander retains the line-stop decision.
B. Let a grounded finding stop the line automatically and ask the commander to review it at shift end.
C. Retrieve the approved procedure, attach its source to the draft, and mark unsupported findings for commander review.
D. Keep the commander as decision owner but let Claude use its general knowledge when the procedure is missing.
E. Choose the most capable model first and define grounding behavior after users try the pilot.
A,C
A. Document regional assumptions during a broad pilot, ground policy answers, use one shared CRM role for proposed updates, require weekly human review, and gate the release on adoption, latency, and cost.
B. Document regional policies, ground answers in approved content, use periodic CRM exports for updates, let Claude commit non-material changes, and gate the release on quality, latency, and cost.
C. Document regional workflows and assumptions, pilot grounded answers with narrowly scoped CRM tools, enforce authorization and material-change approval outside Claude, and expand scope only after quality, latency, and cost gates pass.
D. Document regional workflows, keep all CRM changes manual, answer from approved static policy files, and expand after answer-accuracy and latency gates pass within the monthly budget.
C
A. Validate the intake; retrieve current coverage through an application-executed client tool; produce and validate case-schema JSON; and send reviewed coverage and routing outcomes to task-specific evaluations.
B. Validate serial format, use a nightly coverage snapshot, produce and validate case-schema JSON, archive versioned traces, and evaluate reviewed routing outcomes without a live coverage lookup.
C. Validate the intake and fetch live coverage, but publish a free-text route through a parser and evaluate only cases that customers reopen.
D. Validate the intake, request live coverage, treat the tool_use block as the coverage result, publish schema-valid routing JSON, and track handling time.
A
A. Validate notes, have an authorized worker submit the order, notify staff when submission starts, and reconcile rejected orders from the inventory system afterward.
B. Define a client tool and authorize retries, but persist its tool_use request as a confirmed order before the ordering API returns.
C. Let the application execute the client tool and notify only after success, preserve confirmed orders for review, but keep tool errors outside the Claude loop for staff to resolve manually.
D. Define a client tool; have the application authorize and execute it, return success or error as tool_result, handle the next stop explicitly, and notify only after confirmation.
D
A. Record the input, relevant tool or retrieval evidence, output, version, and reviewed technician disposition; curate verified failures, including rare codes, into the evaluation set.
B. Define task-specific gates for recommendation accuracy, escalation rate, and latency, and rerun normal and edge-case evaluations before releasing changes.
C. Copy every technician edit into the system prompt each night and treat it as a correct label unless another technician objects.
D. Add an autonomous critic to every production request and ship whenever the critic agrees with the first response.
E. Optimize token cost against the original evaluation set and assume rare-code accuracy will improve with a cheaper prompt.
A,B
A. Use output_config.format for fixed fields, publish schema-valid records without checking tenant route or weight rules, and evaluate parsing success.
B. Use output_config.format for fixed fields, validate tenant-specific route and weight rules in the application, and evaluate both parsing and routing accuracy.
C. Use strict tool input as the parcel record, validate its JSON shape in the application, and publish it without checking tenant-specific rules.
D. Use structured output and tenant-rule validation, but treat every accepted record as factually correct and evaluate only parse success.
B
A. Validate snapshot provenance, let Claude estimate missing readings, create a structured draft for approval, route low-confidence drafts to a second technician, and evaluate urgency errors and latency.
B. Validate snapshot freshness, create a structured draft, automatically open high-confidence urgent orders, and ask technicians to reverse errors before evaluation.
C. Assemble the note and current snapshot, route stale or missing readings to clarification, create a structured draft, require approval, and evaluate urgency errors and latency.
D. Validate snapshot freshness, route incomplete inputs to manual review, create a free-text draft for approval, and evaluate only median response time.
C
A. Continue while stop_reason is tool_use, execute each requested client tool, return its matching tool_result, and explicitly handle every other stop reason.
B. Enforce authorization and idempotency, but show a booking as confirmed when Claude emits tool_use while the application completes the request asynchronously.
C. Enforce authorization and idempotency before each change, then return either the confirmed reservation or an explicit execution error to Claude.
D. Drive the tool loop and validate the final plan schema, but publish a plan without checking its reservations against the latest returned availability.
E. Validate the final schema and reservation rules, then curate sanitized traces with confirmed outcomes into representative edge-case evaluations.
F. Bound retries and escalate failures, but resume the previously approved plan after recovery without retrieving availability again.
A,C,E
A. Send approved content in a bounded request, use structured output for the digest schema, validate it in the application, and evaluate sampled editor decisions.
B. Use an autonomous agent with web and file tools, validate its JSON, and evaluate editor decisions, even though newly found sources are outside the fixed approved set.
C. Summarize each document in separate calls, aggregate into validated JSON, and evaluate fluency without checking factual alignment to the approved sources.
D. Encode the digest through a strict client-tool schema, validate the shape, and publish it without connecting editor decisions to evaluations.
A
A. Retrieve current state, generate a structured proposal, obtain manager approval, write the entitlement into the assistant's own store, then synchronize it to the identity platform and read back the result for audit.
B. Retrieve current state with read-only tools, generate a structured proposal, enforce scoped approval, let the identity platform execute, then read back state and persist request, approval, result, and reconciliation.
C. Generate from cached state, obtain manager approval, retrieve current state immediately before execution, and apply the original proposal without renewed review when the state differs.
D. Retrieve current state, create a structured proposal, enforce scoped approval, execute through the identity platform, and store the request and approval without reconciling the resulting state.
B
A. Have the application store a linked trace containing the input reference, model and output version, extracted fields, field-validation results, and verified corrections.
B. Curate those traces into representative edge-case evaluations and gate releases on field accuracy, correction rate, and operational latency.
C. Track field accuracy and correction totals only as monthly aggregates, without retaining which input and output version produced each error.
D. Append every customer correction to future prompts as ground truth without verification or linkage to the producing version.
E. Rerun JSON schema validation on corrected records and use the pass rate as evidence that semantic extraction improved.
A,B
A. Produce validated JSON from current tools and obtain approval, but after an outage resume the approved action against cached state and record the eventual result.
B. Pause on an outage and refetch current state after recovery, but execute a changed remediation under the approval granted for the earlier proposal.
C. Stop safely on the first tool failure, preserve the case and audit record for responders to restart manually, and report the outage, but keep the failure outside subsequent evaluation cases.
D. Pause and escalate without executing; after recovery refetch state, regenerate any changed proposal, require fresh approval, execute through the application, and add the verified outage outcome to evaluations.
D
A. Use one augmented LLM call that always returns extracted dependencies and an impact rationale, then have the application inspect version syntax afterward.
B. Use an autonomous agent that decides which extraction, validation, and assessment stages to run for each release note.
C. Use prompt chaining: dependency extraction, a programmatic version-syntax gate, then impact assessment from the accepted record.
D. Run dependency extraction and impact assessment in parallel, then compare their outputs after both finish.
C
A. Detect the modality, then route high-confidence inputs to the corresponding specialized processing path.
B. Let an autonomous agent invent a new modality and processing sequence separately for every file.
C. Quarantine low-confidence or hybrid inputs for explicit fallback handling before any specialized path runs.
D. Run every modality pipeline for each file and retain whichever output contains the most extracted fields.
A,C
A. Use a fixed prompt chain that drafts first, retrieves handbook passages second, and attaches citations last.
B. Use an autonomous search agent that continues retrieving until it decides it has enough evidence, without an iteration limit.
C. Use a routing workflow that assigns each question to a separate policy-writing agent.
D. Use one augmented LLM call supplied with retrieved current handbook passages and explicit citation instructions.
D
A. Run three focused reviews concurrently and aggregate their structured findings into one decision packet.
B. Chain the three reviews so each assessment receives and extends the preceding assessment.
C. Route each proposal to only one of the three review specialties based on its dominant risk.
D. Let an autonomous agent decide which review dimensions to perform and stop when it considers coverage sufficient.
A
A. Use a fixed chain that always reads contracts, then usage ledgers, then payments, and stops if any source is unavailable.
B. Use an orchestrator that assigns the same three analyses to workers once, then synthesizes their reports without further evidence queries.
C. Use an agent that follows fresh evidence and edits the royalty ledger whenever its confidence exceeds a prompt-defined threshold.
D. Use a bounded read-only agent guided by fresh evidence, with explicit stop or escalation limits and finance-approved corrections executed by the application.
D
A. Separate generation from evaluation and require the evaluator to return feedback tied to the stable rubric.
B. Allow the evaluator to redefine passing criteria after each draft based on the prose style it prefers.
C. Revise until rubric thresholds are met or a maximum iteration count is reached, then expose remaining gaps.
D. Replace the evaluator with an autonomous agent that may add tools and execute migration steps while refining the plan.
E. Keep release outside the refinement loop so a human or application approves the plan after reviewing rubric evidence.
A,C,E
A. Predefine workers for every possible specialty and run all of them for every site packet.
B. Use a prompt chain that always performs contract, equipment, and environmental review in the same order.
C. Use an orchestrator to identify packet-specific subanalyses, delegate them to focused workers, and synthesize their findings.
D. Use an autonomous agent that both commissions analyses and approves the final decommissioning action.
C
A. Route each record pair to one specialist prompt based on the collection that supplied the older record.
B. Run several independent assessments, aggregate them with a defined agreement threshold, and abstain to human review when agreement is low.
C. Chain a first judgment into later calls that are instructed to justify and refine that same conclusion.
D. Let an agent repeat the assessment until it produces the same answer twice, then treat repetition as consensus.
B
A. Use an autonomous agent that chooses which field checks, program rules, and processing order to apply to each application.
B. Use orchestrator-workers so a model invents and delegates a new set of acknowledgment checks for every application.
C. Add an evaluator-optimizer loop that rewrites next-step instructions until an evaluator prefers the prose, without a measured release threshold.
D. Use a predefined workflow with deterministic field validation and program lookup, one bounded instruction-generation call, and an explicit officer-approval gate.
D
A. Assign each ward to a context-isolated review agent with a common barrier schema, then have a coordinator prioritize the hospital-wide resolution queue.
B. Keep one agent, retrieve all ward records into one conversation, and ask it to assess every patient before prioritizing barriers.
C. Create sequential extraction, clinical-review, coordination-review, and prioritization agents that pass all six wards at every handoff.
D. Launch several agents over the undivided hospital dataset and adopt the first resolution queue that finishes after a format check.
A
A. Create attribute, vision, drafting, policy, and publishing agents that negotiate the processing order for every product.
B. Keep the predefined pipeline and deterministic gates; add agents only if evaluation identifies a constraint the workflow cannot meet.
C. Replace the deterministic claim and format checks with several agents, publishing whenever a simple majority accepts the description.
D. Use an autonomous coordinator that may omit attribute loading or deterministic checks when it predicts they will add latency.
B
A. Give each evidence area a worker with bounded context, a clear output schema, and area-specific tools.
B. Let all workers edit one shared conclusion continuously without ownership boundaries or conflict handling.
C. Split planning, searching, citation capture, and writing into separate sequential agents for every evidence area.
D. Have the coordinator check required areas, reconcile conflicts, and label missing evidence before synthesis.
E. Pass every worker's full source corpus and entire reasoning transcript to every other worker before they begin.
A,D
A. Keep every action on one agent and expand descriptions, while requiring the agent to reconsider its first system choice.
B. Give three agents every cooperative action, run them in parallel, and use whichever complete drought plan arrives first.
C. Create irrigation, storage, and invoice specialists with focused actions, and use a coordinator with explicit handoff contracts to combine drought-response work.
D. Remove system actions from the assistant and generate instructions for staff to perform every irrigation, storage, and invoice change manually.
C
A. Give a verifier the plan, explicit criteria, and authoritative facility records; require structured evidence for every zone and prohibited route before release.
B. Give an independent verifier the plan and criteria, but permit it to validate the highest-occupancy zones and extrapolate the result to the rest.
C. Require every zone to receive structured pass/fail evidence, but let the verifier derive all reference facts from the generated plan itself.
D. Assign one verifier route reachability and another occupancy and assistance coverage, but release as soon as either complementary verifier passes.
A
A. Retry a timed-out worker indefinitely before the coordinator may return any result.
B. Set a timeout for each worker and return an explicit failure marker to the coordinator.
C. Let the coordinator invent a commercial conclusion when the worker times out and label the synthesis complete.
D. Record which workers ran, but omit failed areas from the final answer to keep it concise.
E. Require both evidence areas and label the missing area when one worker fails instead of presenting a complete synthesis.
B,E
A. Retain researcher, writer, and checker agents for both annexes, but require longer summaries at every phase boundary.
B. Assign one agent each annex from source analysis through validation, use the manifest as the interface, and verify cross-references when the coordinator assembles the dossier.
C. Let both agents edit both annexes and the manifest concurrently, then resolve identifier and cross-reference conflicts after drafting.
D. Keep one agent, retrieve one annex at a time, and compact between annexes to avoid coordination overhead despite the measured accuracy loss and parallel deadline.
B
A. Keep completion status only in coordinator memory and reconstruct prior results from non-authoritative, best-effort worker logs after restart.
B. Serialize all language workers and assign a new task identifier after every restart so previous identifiers cannot be reused.
C. Give each language package a stable logical task ID, durably commit its completion state, and replay only tasks without committed completion after recovery.
D. After restart, rerun every language package twice and retain a delivery only when both new executions match exactly.
C
A. Declare only the tools and MCP servers required by each specialist's responsibility.
B. Use the session vault for credentials and expose every connected server to every specialist, relying on prompts alone to prevent out-of-domain calls.
C. Pin specialist versions in the coordinator roster and update the coordinator deliberately when a newer agent configuration should be adopted.
D. Define bounded task payloads, but assume worker context and tool results automatically appear in the coordinator thread, so workers return no explicit result.
E. Have the coordinator send a bounded task and receive a bounded result containing only the context needed for the cross-domain request.
F. Use identical self-copies with the complete toolset and provide domain-specific task instructions per call to avoid maintaining versioned specialist configurations.
A,C,E
A. Divide the source by page, have each worker create its own obligations, mappings, and instructions, then merge outputs that share a heading.
B. Start one worker per business unit before the obligation ledger is stable, let each infer its own identifiers, then reconcile missing and duplicate obligations after the instructions are drafted.
C. Keep extraction, mapping, drafting, and traceability in one unconstrained call because any dependency makes intermediate decomposition unsafe.
D. Create and validate the obligation ledger, fan out bounded unit mappings, join them through coverage and conflict gates, then draft and trace-check the instructions.
D
A. Validate the header, route a confident record to its line-specific validation workflow, quarantine uncertain records, and normalize accepted outputs to the common release schema.
B. Route by anomaly severity so records with similar warning counts share a workflow even when their line schemas and hazard rules differ.
C. Send every record to all three line workflows, archive the slower results, and accept the first output whose fields can be converted to the common release schema.
D. Route confident records by line but pass each workflow's native result directly to analytics, adding normalization only after consumers report incompatibilities.
A
A. Split each review into separate preparation, analysis, and reporting agents that hand the evolving issue context forward at every phase.
B. Give each review one worker that owns input verification through evidence capture against the same immutable issue revision and pinned source snapshots.
C. Allow a review worker to revise the shared issue when it finds a failure and let the remaining reviews continue on whichever revision they hold.
D. Run three workers on the entire issue and authorize publication when two independently report overall success.
E. Use a join barrier that records each required review's status and evidence revision, blocking publication on missing or failed results.
B,E
A. Create one open-ended worker per specialty, let workers spawn any follow-up work, and have all of them edit the release specification directly.
B. Build a dependency graph of bounded artifact-centered tasks with an owner, prerequisites, success criteria, and result schema; schedule ready tasks and replan from returned evidence.
C. Always divide expansion work into discovery, design, production, and review agents, passing the complete project history through each phase regardless of the discovered issue.
D. Create one independent task for every playtest comment and mark it complete when its local note is written, even if it changes another package's prerequisite.
B
A. Keep four specialist agents with independent plans, increase synchronization frequency until a deadline, and require each agent to republish its full resource assumptions after every proposed adjustment.
B. Freeze the first specialist plan that satisfies its local constraints, reserve its resources, and require later specialists to adapt without reopening the earlier allocation.
C. Keep the coupled scheduling decisions in one context owner using the authoritative constraints, then pass the complete schedule to an independent black-box validator before release.
D. Partition work by morning and afternoon shifts, although patients, nurses, chairs, and drug preparations can cross the boundary, and reconcile overlaps after publication.
C
A. Use one model evaluator to score facts, length, and action clarity subjectively, average those dimensions into one value, then revise whenever its overall confidence falls below a threshold.
B. Use deterministic validators for station identifiers, times, and length, then release whenever those checks pass without assessing whether the required action is understandable.
C. Let fact and clarity evaluators edit the draft concurrently, then give the generator their merged comments without criterion identifiers or conflict handling.
D. Run deterministic validators for exact constraints and a rubric-based evaluator for action clarity; return criterion-labeled defects and require the combined gate to pass within the attempt limit.
D
A. Give each gallery one worker that owns its inventory-to-move packet under a common handoff schema.
B. Split every gallery into cataloging, packing, and scheduling agents, transferring the full object history between roles before each decision.
C. Let gallery workers reserve shared elevators, vehicles, and staging slots directly, then reconcile collisions after loading begins.
D. Have the coordinator reconcile shared-resource capacity, inter-gallery dependencies, and staging order before issuing the assembled move plan.
E. Generate several complete move plans and select the first one that meets the move date without comparing gallery coverage or resource-failure behavior.
F. Give an independent verifier the assembled plan, authoritative constraints, all-gallery criteria, and the required elevator-outage rehearsal before approval.
A,D,F
A. Maintain a hypothesis-evidence graph, create bounded probe tasks for unresolved claims, update the graph only from tool results, and return supported findings plus unresolved gaps at a stopping condition.
B. Run a fixed exhaustive chain that retrieves every available record for every suspected account before evaluating whether each source is relevant.
C. Assign one worker to each data tool with the full investigation transcript, ask every worker for an independent conclusion, then accept the hypothesis supported by the largest number of summaries.
D. Choose one fraud category from the first anomaly, execute only that category's checklist, and prohibit replanning when later evidence contradicts the initial route.
A
A. Give every category team a private copy of the complete taxonomy and attribute catalog, allow independent finalization, and merge conflicting identifiers, definitions, and relationships immediately before quarterly publication.
B. Pass the entire taxonomy sequentially from apparel to homeware to electronics, letting each team overwrite earlier definitions when its own category model requires a change.
C. Have a taxonomy steward own the versioned term and relationship registry; delegate bounded category tasks against a named snapshot, then serialize accepted proposals and reissue stale tasks.
D. Let all category teams edit the shared taxonomy directly, but require more frequent synchronization messages and a final vote when two edits conflict.
C
A. Evaluate an efficient model on actual records, accept outputs that pass the accuracy contract, and escalate only ambiguous or failed cases to a more capable model.
B. Use the most capable available model for every record, add a full reasoning review even for approved templates, and treat the resulting cost or latency as unavoidable because some cases are ambiguous.
C. Use the least expensive model for every record and lower the field-accuracy threshold until the cost ceiling is met.
D. Select a model from published benchmark rankings alone and estimate production latency and acceptance without testing the retailer's prompts and records.
A
A. Place project-specific facts before the handbook and cache everything through the project question so the longest possible prefix is stored.
B. Place stable tools, system instructions, and handbook content in a consistent prefix through a cache breakpoint, then append project-specific facts and the question.
C. Create a separate cache entry for every sentence in the handbook and choose sentence caches after Claude has generated the answer.
D. Cache only the short project question and resend the full stable handbook after it on every request.
B
A. Map each workflow to a controlled workspace or internal deployment identifier, group API reports by supported workspace and configuration dimensions, and join them to that mapping.
B. Track only the organization's total monthly bill and reduce the largest prompt file whenever the bill rises.
C. Use output-token count as the acceptance metric because longer responses necessarily provide more client value.
D. Join attributed usage and cost with accepted-deliverable rate, revision burden, and SLA attainment for the same workflow period.
E. Replace every workflow with the lowest-cost model before collecting outcome baselines, then declare any spend reduction successful.
A,D
A. Use the validated metrics and faster model for both deliverables, add a disclaimer that causal interactions may be incomplete, and keep the list and memo within five seconds.
B. Start the stronger model synchronously for both deliverables, show its first detected anomaly within five seconds, and reuse the completed response as the causal memo.
C. Produce the anomaly list from validated metrics and an evaluated fast summary, then run the capability-first causal memo asynchronously with linked data provenance and its own acceptance gate.
D. Run both models concurrently for both deliverables, publish the faster anomaly list, and select the causal memo by whichever model reports higher confidence.
C
A. Keep the multi-agent path and redefine approval to reward the number of internal perspectives, even though facilities staff do not use them.
B. Remove only the writer agent, retain the planner-to-analyst and reviewer handoffs, and assume one fewer role will restore both cost and latency without another controlled comparison or rollback threshold.
C. Run the four agents concurrently on every narrative and publish the first output that passes the arithmetic checks.
D. Retire the multi-agent path, adopt the validated bounded design with its deterministic checks, and monitor the same approval, correction, cost, and turnaround measures with a rollback threshold.
D
A. Place member facts before all shared content and use one cache breakpoint after the full request so requests from different members can reuse it.
B. Keep the common tools, instructions, and catalog in a stable prefix, then place a versioned employer-policy segment before member-specific content with deliberate breakpoints.
C. After a policy update, continue sending the previous policy prefix with a short correction in the member-specific suffix until the cached prefix expires.
D. Default every employer policy segment to the one-hour TTL based on catalog size, without measuring whether requests repeat during that hour.
E. Version policy content, monitor cache reads and writes plus hit latency, and select breakpoints and TTLs from each layer's change and reuse pattern.
B,E
A. Keep the latest-change-note design because API input cost is the only architecture cost that can be measured consistently.
B. Use targeted relevant retrieval and govern the design by accepted-packet cost, dependency coverage, and production start SLA rather than input tokens alone.
C. Attach the complete unfiltered project history to every prompt so no possible detail is excluded, regardless of latency or relevance.
D. Upgrade the model for the latest-change-note prompt and assume stronger reasoning can reconstruct drawing, material, and finish facts that were never provided.
B
A. Define path-specific success criteria and SLAs, including seller acceptance and tail latency for the interactive path and completed coverage and findings for the nightly path.
B. Adopt one organization-wide average-latency target and optimize both paths until that average falls, regardless of abandonment or morning completion.
C. Evaluate supported model and effort settings separately for each path, and apply caching only where measured prefix reuse makes it applicable.
D. Move both paths to the lowest-cost configuration immediately and treat lower spend as success unless users file complaints.
E. Use the same cache breakpoint and TTL for both paths because the nightly audit has repeated catalog context, without confirming reuse in the interactive prefix.
F. Compare candidate configurations for each path on actual data and retain only those that meet that path's outcome, SLA, and spend targets together.
A,C,F
A. Keep the one-hour cache and add more breakpoints throughout the manual so each report writes additional reusable segments.
B. Move report-specific data into the cached prefix so each cache entry contains everything needed for the next request.
C. Ignore cache reads and compare only total input tokens and manual stability, because unchanged content is assumed to guarantee that caching will eventually become economical across reporting cycles.
D. Reassess caching from observed timing and read/write cost; disable it for this path unless its access pattern changes enough to create reuse within a supported TTL.
D
A. Keep the qualified current model for the release and evaluate the candidate on the same actual prompts, data, edge cases, quality, latency, and cost criteria before switching.
B. Switch before the release because lower advertised latency and price are sufficient evidence when the model comes from the same provider.
C. Replace the current edge-case set with the candidate's public benchmark so both models can be compared on a larger dataset.
D. Run one demonstration prompt against the candidate and switch if its answer is faster, deferring quality and cost measurement until after release.
A
A. Release an efficient candidate and ask designers to repair broken prerequisites after generation because its style already passes.
B. Select the capability-leading candidate for release, preserve the dependency-consistency evaluation, and test any later supported efficiency changes against the same gate.
C. Select the efficient candidate with the fewest generated tokens because shorter quest specifications are less likely to contain continuity defects.
D. Combine sections from both failed efficient candidates and accept the result when their style scores agree, without rerunning dependency checks.
B
A. Define required capabilities, a response-quality rubric, the p95 response target, and the development and production budget before comparing candidates.
B. Adopt the model with the highest public benchmark score and infer that it will also meet the servicing team's latency and tone requirements.
C. Choose the model with the lowest input-token price and treat any later editing work as outside the model-selection decision.
D. Evaluate candidates with actual prompts and representative data, including edge cases, and compare quality, latency, and cost against the defined criteria.
E. Let each developer use a preferred model during the pilot and select the one that receives the fewest informal complaints.
A,D
A. Move immediately to the untested smaller model because changing model families always reduces cost more than tuning effort.
B. Keep the current effort unchanged because any reduction in reasoning effort necessarily invalidates the earlier correctness evaluation.
C. Adopt the evaluated lower effort setting for the current model, monitor the same gates and SLAs, and test the smaller model separately before any later switch.
D. Raise effort to maximize intelligence and offset the additional latency by excluding slow runs from the p95 calculation.
C
A. Select Model P because the highest average quality score should override latency and cost once it is statistically significant.
B. Select Model R because speed and cost are directly observable, while failed disruption cases can be handled after launch.
C. Select Model P for half of requests and Model R for the rest without defining routing criteria, then judge success from the combined average.
D. Select Model Q because application-specific evaluation shows it satisfies the required capability, edge-case, speed, and cost criteria together.
D
A. Select the evaluated efficient model because it meets the same quality and edge-case gates while improving the measured latency and accepted-record cost.
B. Keep the capability-leading model indefinitely because a stronger model should be preferred even when measured outcomes are equivalent.
C. Switch to an even cheaper untested model because the first downgrade succeeded and therefore further downgrades will also preserve accuracy.
D. Adopt the efficient model and remove the accuracy checks so the lower-cost path is not delayed by validation.
A
A. Select Candidate X from the overall average and treat the rare collateral regression as acceptable because it affects few records.
B. Keep category-level acceptance gates and weight the collateral edge cases by their business impact rather than relying on the overall average alone.
C. Lower the collateral-category threshold until Candidate X passes, then document the new average as an improvement.
D. Deploy both candidates randomly and compare only monthly average reviewer scores without recording category, latency, or cost.
E. Compare Candidate Y and any revised Candidate X on actual narratives and edge cases, and migrate only a candidate that meets every mandatory quality gate plus latency and budget limits.
F. Use only overall averages for future candidate comparisons and omit category labels now that Candidate Y has passed the current evaluation.
B,E
A. Conclude that no tested configuration currently satisfies the complete release contract and keep the release gate closed.
B. Release the lower-effort configuration because latency and cost are user-visible, and document nuanced correction as a later enhancement.
C. Optimize the prompt for the lower-effort configuration and rerun the same feedback, image, latency, and cost evaluation.
D. Release the high-effort configuration and exclude its slowest coaching turns from the p95 calculation until usage grows.
E. Select the faster candidate from its text results and infer that image-grounded feedback will transfer without separate testing.
F. Evaluate the faster candidate on actual learner text and images, including feedback edge cases, and compare it against the same p95 and cost criteria.
A,C,F
A. Wait for the investigator to start a new session because the template update will apply at that time.
B. Rename the export tool to indicate that only authorized investigators should use it.
C. Change the future template from automatic execution to confirmation and let the revoked investigator approve any pending export.
D. Enforce current export entitlement at the records boundary on every call, archive the credential, and terminate the existing session in addition to changing future sessions.
D
A. Retry the rejected request until the target model eventually accepts the final assistant prefill.
B. Move the partial status object into the system role and allow Claude to choose the remaining field names.
C. Keep the old request format and route production traffic back to the earlier model without evaluating supported migration controls.
D. Remove the prefill, specify the complete object contract in the prompt, and regression-test the unchanged parser on the target model.
D
A. Reuse the token count measured on the previous model because the prompt text and parser have not changed.
B. Count only the extracted PDF text and ignore the system prompt, tools, images, and requested output allowance.
C. Pre-count the complete target-model request, then enforce an input budget that preserves the evaluated output allowance.
D. Send every request first and truncate the newest user content only after the API reports that the prompt is too long.
C
A. Treat the authentication event as a failed payment dependency, isolate and block the payment path, record the event, rotate or refresh the credential, and resume payment only after successful authentication.
B. Retry the payment tool after every rate lookup because a later session transition may make the expired credential valid.
C. Replace the MCP payment tool with a custom tool that embeds a fallback administrator token when authentication fails.
D. Let the agent mark the payment as completed from the requested intent, then reconcile the transaction after credentials recover.
A
A. Treat successful OAuth authentication as authorization for every exposed MCP tool because the token identifies an employee.
B. Expose all tools but add policy text to the system prompt so Claude can infer the employee's role.
C. Require confirmation for every read and write while leaving the MCP server without role or resource checks.
D. Enforce current role, resource, and action authorization at the application or MCP server, expose only applicable tools, and require confirmation for employee deletion.
D
A. Keep every raw tool payload in the conversation because reproducibility requires all source bytes to remain in model context.
B. After evidence selection, persist accepted quotations, source versions, and record IDs, then clear superseded raw payloads at the stage boundary.
C. Clear each raw payload immediately after retrieval, before the assistant selects evidence or records its provenance.
D. Keep stable record IDs and make cleared payloads reloadable from the system of record when a later claim needs rechecking.
E. Replace every raw payload with an uncited model summary and discard the source version and record identifier.
B,D
A. Use the evaluated direct prompt and remove the anchoring examples, preserving the explicit audience, prohibition, and diversity constraints.
B. Add more copies of the three old campaigns so Claude learns the preferred metaphors more consistently.
C. Keep the examples and remove the diversity criteria because the examples already imply the desired range.
D. Keep the old examples and add a diversity instruction, without testing whether their observed anchoring remains.
A
A. Shorten every tool description to a regional code so the full catalog remains beside the bid documents.
B. Delete every low-frequency regional tool because the current request usually names common jurisdictions.
C. Prompt-cache all definitions and assume cache reads reserve more context for the bid evidence.
D. Discover tools from jurisdiction metadata, load only the relevant definitions, and regression-test bid completeness, tokens, and latency.
D
A. Add several relevant and diverse examples that cover normal and edge cases, and wrap each example in a consistent example structure.
B. Duplicate the single example ten times so its wording receives greater weight than new customer facts.
C. Remove the stated headings and rely on examples alone so Claude has fewer instructions to reconcile.
D. Keep explicit positive instructions for the three required sections and state which case facts belong in each section.
E. Tell Claude to avoid all mistakes and use its best judgment when an example does not match.
A,D
A. Keep the radial-network recipe and append another mandatory reasoning step after every newly observed failure.
B. Retain the fourteen-step recipe and raise effort to maximum so Claude can compensate for its missing topology branch.
C. Use the tested general constraint prompt with adaptive thinking at medium effort, retaining the plan schema and regression set.
D. Disable thinking and require the planner to imitate the radial plan closest to each meshed site.
C
A. Require a complete answer to every question and prohibit uncertainty because users expect confident guidance.
B. Limit policy claims to the packet, cite each claim, and state when the packet lacks support.
C. Ask Claude to answer from memory first, then add one packet citation anywhere in the response.
D. Include the entire packet but omit source labels so Claude can focus on fluent prose rather than attribution.
B
A. Retain every layer and add another tracing agent because framework components are safer when no one can remove them.
B. Keep the validated router, remove or inline layers with no measured benefit, expose underlying prompts and tool traces, and rerun the same evaluation.
C. Remove the router because simplicity requires deleting the only layer with measured outcome benefit.
D. Replace the framework with one autonomous agent that has no route contract, traces, or acceptance evaluation.
B
A. Expose both complete surfaces to every request and tell the model to prefer MCP unless a legacy name looks more familiar.
B. Assign each traffic cohort one authoritative capability surface, remove its duplicate from active context, and retain the legacy integration outside the cohort for measured rollback.
C. Wrap both integrations in a third agent that can call either surface and retry whichever one returns first.
D. Rename legacy and MCP tools identically so either backend can satisfy the same model call without recording which one executed.
B
A. Use supported adaptive thinking and calibrate effort against separate simple and complex incident evaluations.
B. Require maximum visible reasoning for status lookups so their treatment matches complex recoveries.
C. Give the overlapping tools distinct descriptions, explicit selection criteria, and contrasting valid-use examples.
D. Rename both recovery tools to the same generic action so Claude can choose based on parameter count.
E. Treat longer visible narration as the quality metric and remove the incident-resolution rubric.
F. Keep simple final responses concise and evaluate quality, latency, and tool behavior separately for both workload classes.
A,C,F
A. Treat the federated batch-worker identity as the human requester and authorize every cost center available to the corporate MCP credential.
B. Ask Claude to compare the requester and cost center strings in the task text before it decides whether the purchase is authorized.
C. Authenticate the employee when the job is accepted and attach a server-generated, immutable requester and cost-center context instead of trusting task text.
D. Have the procurement service authorize the current employee, cost center, action, and amount on every purchase call, treating the corporate OAuth credential only as connector authentication.
E. For above-threshold purchases, require confirmation from a distinct authenticated approver before execution and audit the employee, workload, approver, tool target, and outcome.
C,D,E
A. Start each client case with clean context, hydrate only its approved state, and preserve the active tool-cycle block until completion.
B. Delete every thinking block before returning a tool result, including the signed block associated with the active request.
C. Clear only prior thinking while retaining the previous client's messages and tool results in the new review.
D. Copy all prior thinking into new user messages so it becomes an explicit cross-client review history.
A
A. Treat any scheduling question as authorization to send the earliest available invitation.
B. Return choices for availability questions and require an explicit send request before using the invitation tool.
C. Give the assistant access to all company calendars so it can infer who should attend.
D. Remove the invitation tool even when the user explicitly requests scheduling.
E. Require the selected time and invitee list to be confirmed before the invitation is sent.
F. Send whenever the assistant reports high confidence, without an explicit action request.
B,E
A. Create one long-lived cached prompt containing the response contract, validation script text, and current tax tables.
B. Put the current tax tables inside the Skill and let its execution container retrieve regulatory changes directly.
C. Keep the response contract in the prompt module, version the executable Skill, inject authorized current tables per request, and record the composition.
D. Allow each region to keep all three copies and reconcile differences only when two generated invoices disagree.
C
A. Keep the release because average latency improved and rare cases contribute little to the aggregate score.
B. Restore the known accurate configuration, establish TTFT, completion, overall, and high-risk-slice baselines, then change and evaluate one latency lever at a time.
C. Increase the output limit while retaining the new model and prompt, then assume any recovered accuracy came from the limit.
D. Optimize latency further before defining quality criteria so the team can discover the fastest possible configuration.
B
A. Authenticate the product user, resolve the permitted vault server-side from that identity, and reject any client-supplied cross-user vault reference.
B. Rename vault display names with random strings and continue accepting any vault ID from the browser.
C. Rely on credential values being write-only because a user who cannot read a token cannot use its vault.
D. Set every MCP tool to require confirmation and let the agent decide whether the selected vault belongs to the browser user.
E. Create a new workspace for every request so that no credential persists long enough to be misused.
F. Authorize each downstream action against the current support principal and assigned queue, and record the principal, vault, server, tool, and target in the audit event.
A,F
A. Use the capable high-effort configuration sequentially at every stage because final accuracy is the only meaningful requirement.
B. Use the faster configuration for the entire workflow because it satisfies the extraction and lookup-selection evaluations.
C. Use the faster configuration for identifier and lookup planning, use the capable configuration for final synthesis only after both lookups succeed, and evaluate stage, failure, and end-to-end metrics.
D. Start final synthesis as soon as the first manual returns and append the second lookup later if it becomes available.
C
A. Remove the scoring rubric and ask Claude to use professional judgment so proposal text has less competition for attention.
B. Repeat the final question after every paragraph of every proposal so Claude cannot forget the requested task.
C. Place all material in one longer system prompt because system content is always interpreted as data rather than instruction.
D. Use consistent descriptive tags for instructions, rubric, and each indexed proposal, then place the final evaluation query after the structured documents.
D
A. Add an expiration date to the exposed key and let existing jobs use it until that date.
B. Revoke the exposed key, configure WIF from the trusted CI issuer to environment-scoped Claude identities, and audit the upstream IdP rules and token exchange.
C. Place the exposed key in the system prompt so only the model, rather than the build script, can access it.
D. Move one replacement organization-wide key into a secret manager and use it for every environment.
B
A. Capture RPM, ITPM, and OTPM headroom together with the remaining, reset, and retry-after response headers by model.
B. Use only the monthly spend total, because remaining budget determines whether a short burst receives a 429.
C. Track uncached input, cache creation, cache reads, output tokens, and cache rate by model and workload.
D. Immediately retry every 429 in parallel so the next replenishment window is fully utilized.
E. Infer capacity solely from hourly average RPM and omit shorter time windows.
F. Graph short-window peaks, pace traffic and ramp-ups, and use bounded backoff that honors retry-after while measuring retry volume.
A,C,F
A. Use Configuration Y and monitor validation failures, retries, accepted accuracy, and valid-result P95 as one end-to-end outcome.
B. Use Configuration X because its average first-response time is lower, and exclude retry time from the SLA.
C. Use Configuration X and accept failed validation on the first attempt so retries no longer affect latency.
D. Alternate X and Y and report the average of their first-response times as the production P95.
A
A. Assume the model can still inspect all raw messages that preceded the latest compaction block whenever the summary is ambiguous.
B. Use the default summary without a preservation rubric because any compaction summary is equivalent for regulated state.
C. Define compaction instructions for the required identifiers, decisions, and approval state, then evaluate the generated summary against that preservation rubric.
D. Place the trigger at the context limit with no output headroom so the workflow performs fewer compactions.
E. Pause after compaction so the application can validate the summary and add the current exact authorization record before generation resumes.
F. Pass the returned compaction block on subsequent requests and log the compaction stop reason, validated state, and resume event.
C,E,F
A. Use a direct-only refund path, remove the unused programmatic execution capability, and enforce the approval and authorization in the application.
B. Keep both caller modes and accept any invocation bearing a code-execution caller as proof of human approval.
C. Move the refund into an autonomous agent with both callers so it can choose whether an approval is necessary.
D. Create a second refund tool for programmatic calls while leaving the original available directly on every request.
A
A. Overwrite the prompt on random instances and let all first requests write their own entry until one version becomes dominant.
B. Publish one versioned prefix, observe one validation response start, verify its contract, then release the cohort and confirm cache reads.
C. Put the new version label after the cache boundary while changing the instructions before it so both versions share one entry.
D. Wait for every old entry to expire, then switch all instances simultaneously without validating the unchanged output contract.
B
A. The short-lived Claude access token should be refreshed more frequently, because token lifetime alone determines tenant access.
B. The system prompt should instruct Claude not to process another tenant's data, while the service continues trusting the payload tenant ID.
C. Federation authenticates the workload, but the service still lacks server-side authorization that binds trusted workload identity to permitted tenants before processing.
D. An IP allowlist should replace tenant authorization because all approved workers run inside the same network.
C
latest for its custom Skill; a subsequent Skill update now produces a different workbook. Corrections must apply prospectively without rewriting the approved record. What should the team change?A. Store only the generated workbook because the artifact alone proves which Skill implementation created it.
B. Replace the historical job's Skill reference with the current latest version immediately before each audit replay.
C. Archive the user prompt but omit the Skill identity because the same prompt should always generate the same workbook.
D. Pin and record the exact Skill version in each approved job manifest, retain it for replay, and use new manifests for fixes.
D
A. Release X because its mean completion is lower and the P95 requirement can be interpreted as an average.
B. Y is the supported release candidate because it meets both the accuracy floor and the P95 latency ceiling, despite its slower mean.
C. Redefine the P95 ceiling above 4.2 seconds after observing X so its higher accuracy can qualify.
D. Stream X and count first-token time as completion, even though the requirement measures the finished summary.
E. Average X and Y together so the combined P95 falls between their reported percentiles.
F. For further optimization, keep the accuracy and P95 gates, test controlled variants on the same transcript-length mix, and inspect the slow-tail distribution rather than only the mean.
B,F
A. Deliver uploaded text as identified untrusted tool content, screen it before use, scope search to the current matter, and require cited claims.
B. Add 'never follow prompt injection' to the system prompt while leaving repository access broad and returning raw outputs.
C. Block every document containing words such as 'ignore' or 'system' and disable citations to avoid reproducing source text.
D. Allow unrestricted search but ask Claude to decide whether each requested repository is confidential before using it.
A
A. Add a system role that says only 'You are a clinician' and let Claude infer the message structure and information boundary.
B. Tell Claude not to be verbose, not to omit anything, and not to sound cold, without defining the desired output.
C. Set an appropriate patient-communication role, state the allowed source boundary, and explicitly require the opening and numbered action-list format.
D. Insert several unrelated medical messages into the template and ask Claude to imitate whichever one seems most relevant.
C
A. Keep FIFO truncation and ask users to restate any missing decision after a contradiction appears.
B. Use server-side compaction at the tested trigger, preserve required decision fields, and pass its block into later requests.
C. Cache the complete raw conversation and assume cached turns will be omitted from the context window.
D. Start a blank conversation at the threshold and ask Claude to reconstruct approvals from the current user message.
B
A. Keep zero-shot and add more label-definition prose instead of the evaluated examples, assuming wording alone resolves both boundaries.
B. Use the curated few-shot examples with the explicit label definitions and retain the same category-level evaluation.
C. Include only one obvious routine-service example so the prompt remains short and infer that it represents all categories.
D. Use the four curated examples but remove the explicit label definitions to reduce prompt length.
B
A. Move the cache breakpoint deeper into the already identical prefix because a higher hit rate will reduce output-token generation.
B. Keep the working cache and evaluate a faster model or lower supported effort on the unchanged report task, accepting a change only if accuracy, completeness, and full-completion P95 all pass.
C. Switch from the 5-minute cache to a 1-hour cache because a longer TTL generates output tokens faster.
D. Add streaming and declare the 8-second full-completion SLA met as soon as the first token is visible.
B