{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:33FBOPKUDNYUX2TW7BC7SLGDBU","short_pith_number":"pith:33FBOPKU","schema_version":"1.0","canonical_sha256":"deca173d541b714bea76f845f92cc30d2722cdcb116a4c374b2d533134e467f1","source":{"kind":"arxiv","id":"2606.01708","version":1},"attestation_state":"computed","paper":{"title":"Two-Fidelity Best-Action Identification for Stochastic Minimax Tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Peter Chen, Xi Chen","submitted_at":"2026-06-01T05:21:40Z","abstract_excerpt":"We study fixed-confidence best-action identification (BAI) in stochastic minimax trees. This problem is increasingly relevant in modern AI planning, where deep minimax search and Monte Carlo Tree Search (MCTS) with language model long rollouts face a fundamental tradeoff: heuristic evaluations are cheap but biased, while accurate rollouts are reliable but prohibitively expensive. We propose 2FFS, a two-fidelity tree-search algorithm that brings multi-fidelity flat bandit ideas into trees. The algorithm combines minimax-style fast expansion with MCTS-style stochastic sampling, adaptively decidi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.01708","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T05:21:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"77f8a194f2bf98281fca7d6c6135437911ce62f487c0caa025f2806203d71a3e","abstract_canon_sha256":"8671419c0110b6044a7df88b530ca3bf534da503bbde0e372fba2d7942a4ea7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:40.559198Z","signature_b64":"5/1f+FLqTOoUKwZvH8ADcoo712jGvZhni1c45Su3efq2lQkPF4L/s/Dj5Yz/vBk9tbqn/VGOPBnzIadzertwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deca173d541b714bea76f845f92cc30d2722cdcb116a4c374b2d533134e467f1","last_reissued_at":"2026-06-02T02:04:40.558869Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:40.558869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Fidelity Best-Action Identification for Stochastic Minimax Tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Peter Chen, Xi Chen","submitted_at":"2026-06-01T05:21:40Z","abstract_excerpt":"We study fixed-confidence best-action identification (BAI) in stochastic minimax trees. This problem is increasingly relevant in modern AI planning, where deep minimax search and Monte Carlo Tree Search (MCTS) with language model long rollouts face a fundamental tradeoff: heuristic evaluations are cheap but biased, while accurate rollouts are reliable but prohibitively expensive. We propose 2FFS, a two-fidelity tree-search algorithm that brings multi-fidelity flat bandit ideas into trees. The algorithm combines minimax-style fast expansion with MCTS-style stochastic sampling, adaptively decidi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01708","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01708/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.01708","created_at":"2026-06-02T02:04:40.558923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01708v1","created_at":"2026-06-02T02:04:40.558923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01708","created_at":"2026-06-02T02:04:40.558923+00:00"},{"alias_kind":"pith_short_12","alias_value":"33FBOPKUDNYU","created_at":"2026-06-02T02:04:40.558923+00:00"},{"alias_kind":"pith_short_16","alias_value":"33FBOPKUDNYUX2TW","created_at":"2026-06-02T02:04:40.558923+00:00"},{"alias_kind":"pith_short_8","alias_value":"33FBOPKU","created_at":"2026-06-02T02:04:40.558923+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU","json":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU.json","graph_json":"https://pith.science/api/pith-number/33FBOPKUDNYUX2TW7BC7SLGDBU/graph.json","events_json":"https://pith.science/api/pith-number/33FBOPKUDNYUX2TW7BC7SLGDBU/events.json","paper":"https://pith.science/paper/33FBOPKU"},"agent_actions":{"view_html":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU","download_json":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU.json","view_paper":"https://pith.science/paper/33FBOPKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01708&json=true","fetch_graph":"https://pith.science/api/pith-number/33FBOPKUDNYUX2TW7BC7SLGDBU/graph.json","fetch_events":"https://pith.science/api/pith-number/33FBOPKUDNYUX2TW7BC7SLGDBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU/action/storage_attestation","attest_author":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU/action/author_attestation","sign_citation":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU/action/citation_signature","submit_replication":"https://pith.science/pith/33FBOPKUDNYUX2TW7BC7SLGDBU/action/replication_record"}},"created_at":"2026-06-02T02:04:40.558923+00:00","updated_at":"2026-06-02T02:04:40.558923+00:00"}