{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:K4FQFYB3OTYMJSAMRV2VJTI4JR","short_pith_number":"pith:K4FQFYB3","canonical_record":{"source":{"id":"2605.30664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T23:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"5881aa6a59f095a0ea68d12bb274edada5d8d823bdded3a2c90f333a5dd22371","abstract_canon_sha256":"6502a66a5b61a78f6c84726545cd9e61f47f93a30978119bad17824e674a7104"},"schema_version":"1.0"},"canonical_sha256":"570b02e03b74f0c4c80c8d7554cd1c4c7af612a0dd7443e223b84bd446157d6d","source":{"kind":"arxiv","id":"2605.30664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30664","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30664v1","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30664","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"K4FQFYB3OTYM","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"K4FQFYB3OTYMJSAM","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"K4FQFYB3","created_at":"2026-06-01T01:03:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:K4FQFYB3OTYMJSAMRV2VJTI4JR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T23:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"5881aa6a59f095a0ea68d12bb274edada5d8d823bdded3a2c90f333a5dd22371","abstract_canon_sha256":"6502a66a5b61a78f6c84726545cd9e61f47f93a30978119bad17824e674a7104"},"schema_version":"1.0"},"canonical_sha256":"570b02e03b74f0c4c80c8d7554cd1c4c7af612a0dd7443e223b84bd446157d6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:07.204083Z","signature_b64":"VymPKMToVdnXyNlXszbhVTehwsT/O9rbL6cs2y1E5Zi4YEE4iAoYgH1qb2XlP1OM5ItaW9Oz7BsBYgOqUFbhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"570b02e03b74f0c4c80c8d7554cd1c4c7af612a0dd7443e223b84bd446157d6d","last_reissued_at":"2026-06-01T01:03:07.203110Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:07.203110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30664","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlIKrtWjxDWUmmqVj0nlJo4TTtYjx71yHzq3sUj014Rz9lX0+DpfZd4V8kQEjgrn4KFUagUxM/1xP4IY0lcMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:23:58.764647Z"},"content_sha256":"8d190fbaae2247e5967024974bd62863bfef58c5de6d9fb4fb6e9a8d815fed64","schema_version":"1.0","event_id":"sha256:8d190fbaae2247e5967024974bd62863bfef58c5de6d9fb4fb6e9a8d815fed64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:K4FQFYB3OTYMJSAMRV2VJTI4JR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-Induced Information for Rerooting Levin Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jake Tuero, Laurent Orseau, Levi H. S. Lelis, Michael Buro","submitted_at":"2026-05-28T23:51:21Z","abstract_excerpt":"Subgoal-based policy tree search, which uses a policy to guide search, is effective for complex single-agent deterministic problems but often relies on explicit subgoal generation that can incur substantial overhead and hinders scalability. In this paper, we overcome these limitations by using a learned ``rerooter'' through the recently-introduced $\\sqrt{\\text{LTS}}$ algorithm. A rerooter implicitly decomposes the problem into soft subtasks. While previous work focused on the formal guarantees for given or handcrafted rerooters, in this work we propose three rerooter designs: (i) a clustering-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30664","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/2605.30664/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5ZT6DuiH/BkLLdzvBdHelb+/Mjs20MqnIZSJOYNFUh3kIw0xi6Y7pQPcnbDBFgNOYVksMJ+B0+/ctNLOrLxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:23:58.765013Z"},"content_sha256":"7d8b131f863f718220968e074147a75185fa9bff50dcf99f70f6490eceff788c","schema_version":"1.0","event_id":"sha256:7d8b131f863f718220968e074147a75185fa9bff50dcf99f70f6490eceff788c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/bundle.json","state_url":"https://pith.science/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T02:23:58Z","links":{"resolver":"https://pith.science/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR","bundle":"https://pith.science/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/bundle.json","state":"https://pith.science/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4FQFYB3OTYMJSAMRV2VJTI4JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:K4FQFYB3OTYMJSAMRV2VJTI4JR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6502a66a5b61a78f6c84726545cd9e61f47f93a30978119bad17824e674a7104","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T23:51:21Z","title_canon_sha256":"5881aa6a59f095a0ea68d12bb274edada5d8d823bdded3a2c90f333a5dd22371"},"schema_version":"1.0","source":{"id":"2605.30664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30664","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30664v1","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30664","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"K4FQFYB3OTYM","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"K4FQFYB3OTYMJSAM","created_at":"2026-06-01T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"K4FQFYB3","created_at":"2026-06-01T01:03:07Z"}],"graph_snapshots":[{"event_id":"sha256:7d8b131f863f718220968e074147a75185fa9bff50dcf99f70f6490eceff788c","target":"graph","created_at":"2026-06-01T01:03:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.30664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subgoal-based policy tree search, which uses a policy to guide search, is effective for complex single-agent deterministic problems but often relies on explicit subgoal generation that can incur substantial overhead and hinders scalability. In this paper, we overcome these limitations by using a learned ``rerooter'' through the recently-introduced $\\sqrt{\\text{LTS}}$ algorithm. A rerooter implicitly decomposes the problem into soft subtasks. While previous work focused on the formal guarantees for given or handcrafted rerooters, in this work we propose three rerooter designs: (i) a clustering-","authors_text":"Jake Tuero, Laurent Orseau, Levi H. S. Lelis, Michael Buro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T23:51:21Z","title":"Structure-Induced Information for Rerooting Levin Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30664","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d190fbaae2247e5967024974bd62863bfef58c5de6d9fb4fb6e9a8d815fed64","target":"record","created_at":"2026-06-01T01:03:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6502a66a5b61a78f6c84726545cd9e61f47f93a30978119bad17824e674a7104","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T23:51:21Z","title_canon_sha256":"5881aa6a59f095a0ea68d12bb274edada5d8d823bdded3a2c90f333a5dd22371"},"schema_version":"1.0","source":{"id":"2605.30664","kind":"arxiv","version":1}},"canonical_sha256":"570b02e03b74f0c4c80c8d7554cd1c4c7af612a0dd7443e223b84bd446157d6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"570b02e03b74f0c4c80c8d7554cd1c4c7af612a0dd7443e223b84bd446157d6d","first_computed_at":"2026-06-01T01:03:07.203110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:07.203110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VymPKMToVdnXyNlXszbhVTehwsT/O9rbL6cs2y1E5Zi4YEE4iAoYgH1qb2XlP1OM5ItaW9Oz7BsBYgOqUFbhDg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:07.204083Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d190fbaae2247e5967024974bd62863bfef58c5de6d9fb4fb6e9a8d815fed64","sha256:7d8b131f863f718220968e074147a75185fa9bff50dcf99f70f6490eceff788c"],"state_sha256":"8d8dcd41905b03d194c49231837c1b3410a2f0465d0021376af67e54d8070171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKuBPwE2nFuGXfq1SzGgxxOjBaPkco1k9IH3w2nCAxT51unuQ5Abf/MNtOVqnAOzlnUsV0VTcwyl/V7zOnD/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:23:58.766957Z","bundle_sha256":"4d986dd5c6e276d4f8145aac0477ab165ead9a03dc8db78f77e7ae05f49561d6"}}