{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HE4FU52ZRBCVKL7LRFOELXOG5I","short_pith_number":"pith:HE4FU52Z","canonical_record":{"source":{"id":"2404.05449","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-08T12:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"d9ce20655d9fc6d29763aa2c160c6663c3298f2921c750a205d73e6eb01d4cdb","abstract_canon_sha256":"7a93e25cb5473999081006b8d1a9a7f43102b44d811eca750edb6f1608a18a39"},"schema_version":"1.0"},"canonical_sha256":"39385a77598845552feb895c45ddc6ea151a1e07dbf640679659f602c0d3ad0b","source":{"kind":"arxiv","id":"2404.05449","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05449","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05449v3","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05449","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"HE4FU52ZRBCV","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_16","alias_value":"HE4FU52ZRBCVKL7L","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_8","alias_value":"HE4FU52Z","created_at":"2026-07-05T08:45:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HE4FU52ZRBCVKL7LRFOELXOG5I","target":"record","payload":{"canonical_record":{"source":{"id":"2404.05449","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-08T12:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"d9ce20655d9fc6d29763aa2c160c6663c3298f2921c750a205d73e6eb01d4cdb","abstract_canon_sha256":"7a93e25cb5473999081006b8d1a9a7f43102b44d811eca750edb6f1608a18a39"},"schema_version":"1.0"},"canonical_sha256":"39385a77598845552feb895c45ddc6ea151a1e07dbf640679659f602c0d3ad0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:27.220556Z","signature_b64":"zYyfBqrdndIQMpO4NvNvD/jdvP6lcDF1mtyJd1YVlmlH+g5C038pyuTukZ9NH786hNyHoO0FP9YF7Oxnh9LjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39385a77598845552feb895c45ddc6ea151a1e07dbf640679659f602c0d3ad0b","last_reissued_at":"2026-07-05T08:45:27.220107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:27.220107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.05449","source_version":3,"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-07-05T08:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHZeb9CpCBXvXlAoopTDYLRNW4ZdHL/D+4ZnfNgpt8rUPW8hBFJ4evIeTSuV0qI6bZecrhM9gVHhPl4qtZ0FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:04:26.275783Z"},"content_sha256":"ae4aabe90f093348d5a05f86f6984df0efeb612e2686a82e0616d6f55bea0e40","schema_version":"1.0","event_id":"sha256:ae4aabe90f093348d5a05f86f6984df0efeb612e2686a82e0616d6f55bea0e40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HE4FU52ZRBCVKL7LRFOELXOG5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RoT: Enhancing Large Language Models with Reflection on Search Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kewei Tu, Wenyang Hui","submitted_at":"2024-04-08T12:31:23Z","abstract_excerpt":"Large language models (LLMs) have demonstrated impressive capability in reasoning and planning when integrated with tree-search-based prompting methods. However, since these methods ignore the previous search experiences, they often make the same mistakes in the search process. To address this issue, we introduce Reflection on search Trees (RoT), an LLM reflection framework designed to improve the performance of tree-search-based prompting methods. It uses a strong LLM to summarize guidelines from previous tree search experiences to enhance the ability of a weak LLM. The guidelines are instruc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05449","kind":"arxiv","version":3},"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/2404.05449/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-07-05T08:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wdW28PV1U4TfI5Z5dy69sbq9znhZW+c23ICXiZs7T398qrq0UTDm9fc5lT0wIqUoUwhVnXi5eeKYvXtKH8UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:04:26.276702Z"},"content_sha256":"9b10355d5e3a820b49d10ad793e2b0798128e9c7f481bd8d6d2ffd98c2ca30af","schema_version":"1.0","event_id":"sha256:9b10355d5e3a820b49d10ad793e2b0798128e9c7f481bd8d6d2ffd98c2ca30af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/bundle.json","state_url":"https://pith.science/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/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-08-10T19:04:26Z","links":{"resolver":"https://pith.science/pith/HE4FU52ZRBCVKL7LRFOELXOG5I","bundle":"https://pith.science/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/bundle.json","state":"https://pith.science/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HE4FU52ZRBCVKL7LRFOELXOG5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HE4FU52ZRBCVKL7LRFOELXOG5I","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":"7a93e25cb5473999081006b8d1a9a7f43102b44d811eca750edb6f1608a18a39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-08T12:31:23Z","title_canon_sha256":"d9ce20655d9fc6d29763aa2c160c6663c3298f2921c750a205d73e6eb01d4cdb"},"schema_version":"1.0","source":{"id":"2404.05449","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05449","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05449v3","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05449","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"HE4FU52ZRBCV","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_16","alias_value":"HE4FU52ZRBCVKL7L","created_at":"2026-07-05T08:45:27Z"},{"alias_kind":"pith_short_8","alias_value":"HE4FU52Z","created_at":"2026-07-05T08:45:27Z"}],"graph_snapshots":[{"event_id":"sha256:9b10355d5e3a820b49d10ad793e2b0798128e9c7f481bd8d6d2ffd98c2ca30af","target":"graph","created_at":"2026-07-05T08:45:27Z","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/2404.05449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) have demonstrated impressive capability in reasoning and planning when integrated with tree-search-based prompting methods. However, since these methods ignore the previous search experiences, they often make the same mistakes in the search process. To address this issue, we introduce Reflection on search Trees (RoT), an LLM reflection framework designed to improve the performance of tree-search-based prompting methods. It uses a strong LLM to summarize guidelines from previous tree search experiences to enhance the ability of a weak LLM. The guidelines are instruc","authors_text":"Kewei Tu, Wenyang Hui","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-08T12:31:23Z","title":"RoT: Enhancing Large Language Models with Reflection on Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05449","kind":"arxiv","version":3},"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:ae4aabe90f093348d5a05f86f6984df0efeb612e2686a82e0616d6f55bea0e40","target":"record","created_at":"2026-07-05T08:45:27Z","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":"7a93e25cb5473999081006b8d1a9a7f43102b44d811eca750edb6f1608a18a39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-08T12:31:23Z","title_canon_sha256":"d9ce20655d9fc6d29763aa2c160c6663c3298f2921c750a205d73e6eb01d4cdb"},"schema_version":"1.0","source":{"id":"2404.05449","kind":"arxiv","version":3}},"canonical_sha256":"39385a77598845552feb895c45ddc6ea151a1e07dbf640679659f602c0d3ad0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39385a77598845552feb895c45ddc6ea151a1e07dbf640679659f602c0d3ad0b","first_computed_at":"2026-07-05T08:45:27.220107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:45:27.220107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYyfBqrdndIQMpO4NvNvD/jdvP6lcDF1mtyJd1YVlmlH+g5C038pyuTukZ9NH786hNyHoO0FP9YF7Oxnh9LjAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:45:27.220556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05449","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae4aabe90f093348d5a05f86f6984df0efeb612e2686a82e0616d6f55bea0e40","sha256:9b10355d5e3a820b49d10ad793e2b0798128e9c7f481bd8d6d2ffd98c2ca30af"],"state_sha256":"8d45835431aafd7e7fc690411a91534f84e838ec01973c52b8de5a7f3539cf91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBzaLv6a/qDSfK9axRCi4jeXvF53ENwxr7KaP0PkRZGhXzDvoujRitw1AT9nK93/QVdF+nts4VCxSLI/ybxXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:04:26.281676Z","bundle_sha256":"dcc3a05e223d4d5c2e367ac2a1dc426e830378f2391908e96b69bb6a19c04029"}}