{"actions":{"bootstrapAndRun":{"effect":"installs rote if missing, inspects, prepares, and asks before running","href":"https://play.modiqo.ai/install?play=himanshu-jha/ranking-slice-paradox@0.1.0","method":"GET","rel":"https://rote.dev/rels/bootstrap-and-run","requiresConsent":true,"responseMediaType":"text/x-shellscript"},"inspect":{"command":"rote play inspect https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0","effect":"read-only"},"installCliOnly":{"effect":"installs the rote CLI, nothing else","href":"https://play.modiqo.ai/install","method":"GET","rel":"https://rote.dev/rels/install-cli","requiresConsent":true,"responseMediaType":"text/x-shellscript"},"run":{"command":"rote play run https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0","effect":"executes the play locally after consent","headless":{"approvalAssertion":"--yes","approvalRequiredBeforeInvocation":true,"commandTemplate":"rote play run https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0 <name=value...> --yes","stdinPolicy":"never pipe input to automate the interactive Ready selector"},"requiresConsent":true}},"description":"Audits two ranking models for an aggregate-versus-slice paradox. Four independent probes compute O(N log N) rank-based AUC with an O(replicates * N) deterministic weighted bootstrap, group slices, calibration and top-K composition, and Simpson reversal witnesses; a synthesis join reports when an aggregate win hides consistent slice losses. Omit input to use the bundled adversarial demo, or pass input=path for fresh evidence. It is read-only, deterministic, network-free, and Python-standard-library-only.","distribution":{"digest":"sha256:98d841156f9d52aca685a46e05aaf6420c179e2475856d9890707ddba4c84cc6","mediaType":"application/vnd.modiqo.rote-flow","size":13083,"verifiedBy":"rote verifies the downloaded archive against this digest before it runs"},"effects":{"credentialsProvidedBy":"runner","credentialsRemainLocal":true,"declaredWrites":[],"publisherReceivesCredentials":false},"id":"https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0","inputPolicy":{"optionalWithDefault":"show_default_and_accept_override","optionalWithoutDefault":"omit_unless_supplied","required":"ask","secrets":"collect_locally_outside_conversation"},"license":"MIT","links":{"docs":"https://rote.dev","page":"https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0","protocol":"https://play.modiqo.ai/.well-known/rote","self":"https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0.json"},"name":"ranking-slice-paradox","owner":{"kind":"org","slug":"himanshu-jha"},"parameters":[{"description":"Local input path, absolute or relative to the invocation directory. Omit it to analyze the bundled demo resource.","example":"evidence/input.json","input":{"allowCustom":true,"choices":[],"label":"Input"},"name":"input","required":false,"type":"string"}],"preparation":[{"action":{"command":"rote play inspect https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0 --json","effect":"read-only"},"step":1,"type":"inspect_local_readiness"},{"references":["/parameters"],"step":2,"type":"collect_parameters"},{"references":["/parameters","/requirements","/effects"],"step":3,"type":"review"},{"consentBoundary":"the user approves the exact play and parameter values","references":["/parameters","/requirements","/effects"],"step":4,"type":"obtain_run_consent"},{"action":{"command":"rote play run https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0","headlessCommandTemplate":"rote play run https://play.modiqo.ai/himanshu-jha/ranking-slice-paradox@0.1.0 <name=value...> --yes"},"preservesAcquisitionBoundaries":["adapter_selection","oauth_dcr","google_discovery","static_token_setup","runtime_security_checks"],"requiresConsent":true,"step":5,"type":"run"}],"producedBy":{"roteVersion":"0.78.0"},"publishedAt":"2026-09-04T10:40:11.367964+00:00","reference":"himanshu-jha/ranking-slice-paradox@0.1.0","requirements":{"adapters":[],"browser":{"dependencies":[],"runtime":false,"signIn":false},"localTools":["python3"],"roteCli":{"minimumVersion":"0.62.0"},"sessions":false},"resolution":"pinned","schema":"rote.play.v1","stats":{"downloads":1,"installs":0},"steps":{"count":5,"names":["audit_calibration_and_topk","detect_simpson_reversal","measure_group_slices","measure_overall_ordering","synthesize_ranking_audit"]},"title":"ranking-slice-paradox","type":"play","version":"0.1.0","visibility":"public"}