{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LUGG2DU66X35JIHYHJTGKDHT72","short_pith_number":"pith:LUGG2DU6","canonical_record":{"source":{"id":"2407.00320","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-29T05:14:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"36f04af3df0a3ed74ceabafd6f1ad0ea691f089d93a01574ac5da844a0430d6c","abstract_canon_sha256":"a739508d96f17daac2048a42fc5555edbc3b444d6ae664757e1d60f84e06d721"},"schema_version":"1.0"},"canonical_sha256":"5d0c6d0e9ef5f7d4a0f83a66650cf3feab086fdcca464fdfe58eb2caee1e9910","source":{"kind":"arxiv","id":"2407.00320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.00320","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"2407.00320v1","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00320","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"LUGG2DU66X35","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_16","alias_value":"LUGG2DU66X35JIHY","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_8","alias_value":"LUGG2DU6","created_at":"2026-07-05T08:38:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LUGG2DU66X35JIHYHJTGKDHT72","target":"record","payload":{"canonical_record":{"source":{"id":"2407.00320","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-29T05:14:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"36f04af3df0a3ed74ceabafd6f1ad0ea691f089d93a01574ac5da844a0430d6c","abstract_canon_sha256":"a739508d96f17daac2048a42fc5555edbc3b444d6ae664757e1d60f84e06d721"},"schema_version":"1.0"},"canonical_sha256":"5d0c6d0e9ef5f7d4a0f83a66650cf3feab086fdcca464fdfe58eb2caee1e9910","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:40.210535Z","signature_b64":"N7F0CF4yuu6tOqEpLdY20lbIA4Ny6zlHcKJV+MR+pYEARx4YEBhZxsrFBu6Q2LFiENIk55vuG16x6kC8pVPGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d0c6d0e9ef5f7d4a0f83a66650cf3feab086fdcca464fdfe58eb2caee1e9910","last_reissued_at":"2026-07-05T08:38:40.210052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:40.210052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.00320","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-07-05T08:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrDAZK23hB+4G4LMGj6PKBzIFaq/fuGjFapPRqFWZeKo94vsl/QQ5OQG9I3SdZPL0L6hhcT+dGJv6FVZCTNhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:09:40.428448Z"},"content_sha256":"6edb43c4f5c00ee787d8a8a77ab9c707502259c983e6ba325a66a1b3e3328382","schema_version":"1.0","event_id":"sha256:6edb43c4f5c00ee787d8a8a77ab9c707502259c983e6ba325a66a1b3e3328382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LUGG2DU66X35JIHYHJTGKDHT72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LiteSearch: Efficacious Tree Search for LLM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Ante Wang, Baolin Peng, Dian Yu, Dong Yu, Haitao Mi, Jinsong Su, Linfeng Song, Ye Tian","submitted_at":"2024-06-29T05:14:04Z","abstract_excerpt":"Recent research suggests that tree search algorithms (e.g. Monte Carlo Tree Search) can dramatically boost LLM performance on complex mathematical reasoning tasks. However, they often require more than 10 times the computational resources of greedy decoding due to wasteful search strategies, making them difficult to be deployed in practical applications. This study introduces a novel guided tree search algorithm with dynamic node selection and node-level exploration budget (maximum number of children) calculation to tackle this issue. By considering the search progress towards the final answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00320","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/2407.00320/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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IziMwnmWmcAO7z3RRKXHSsJnhogI7A/X3N13s7yHDaLJ8eH0FUp/6V70L+kfa++JMXQpV06MO+1LdW1CMGssBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:09:40.428942Z"},"content_sha256":"dba2b0a131274a89a49eb30a30b48e6bb71a5ddb4e575bf772a6b247dd1b9ea9","schema_version":"1.0","event_id":"sha256:dba2b0a131274a89a49eb30a30b48e6bb71a5ddb4e575bf772a6b247dd1b9ea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUGG2DU66X35JIHYHJTGKDHT72/bundle.json","state_url":"https://pith.science/pith/LUGG2DU66X35JIHYHJTGKDHT72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUGG2DU66X35JIHYHJTGKDHT72/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-05T06:09:40Z","links":{"resolver":"https://pith.science/pith/LUGG2DU66X35JIHYHJTGKDHT72","bundle":"https://pith.science/pith/LUGG2DU66X35JIHYHJTGKDHT72/bundle.json","state":"https://pith.science/pith/LUGG2DU66X35JIHYHJTGKDHT72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUGG2DU66X35JIHYHJTGKDHT72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LUGG2DU66X35JIHYHJTGKDHT72","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":"a739508d96f17daac2048a42fc5555edbc3b444d6ae664757e1d60f84e06d721","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-29T05:14:04Z","title_canon_sha256":"36f04af3df0a3ed74ceabafd6f1ad0ea691f089d93a01574ac5da844a0430d6c"},"schema_version":"1.0","source":{"id":"2407.00320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.00320","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"2407.00320v1","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00320","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"LUGG2DU66X35","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_16","alias_value":"LUGG2DU66X35JIHY","created_at":"2026-07-05T08:38:40Z"},{"alias_kind":"pith_short_8","alias_value":"LUGG2DU6","created_at":"2026-07-05T08:38:40Z"}],"graph_snapshots":[{"event_id":"sha256:dba2b0a131274a89a49eb30a30b48e6bb71a5ddb4e575bf772a6b247dd1b9ea9","target":"graph","created_at":"2026-07-05T08:38:40Z","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/2407.00320/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent research suggests that tree search algorithms (e.g. Monte Carlo Tree Search) can dramatically boost LLM performance on complex mathematical reasoning tasks. However, they often require more than 10 times the computational resources of greedy decoding due to wasteful search strategies, making them difficult to be deployed in practical applications. This study introduces a novel guided tree search algorithm with dynamic node selection and node-level exploration budget (maximum number of children) calculation to tackle this issue. By considering the search progress towards the final answer","authors_text":"Ante Wang, Baolin Peng, Dian Yu, Dong Yu, Haitao Mi, Jinsong Su, Linfeng Song, Ye Tian","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-29T05:14:04Z","title":"LiteSearch: Efficacious Tree Search for LLM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00320","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:6edb43c4f5c00ee787d8a8a77ab9c707502259c983e6ba325a66a1b3e3328382","target":"record","created_at":"2026-07-05T08:38:40Z","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":"a739508d96f17daac2048a42fc5555edbc3b444d6ae664757e1d60f84e06d721","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-29T05:14:04Z","title_canon_sha256":"36f04af3df0a3ed74ceabafd6f1ad0ea691f089d93a01574ac5da844a0430d6c"},"schema_version":"1.0","source":{"id":"2407.00320","kind":"arxiv","version":1}},"canonical_sha256":"5d0c6d0e9ef5f7d4a0f83a66650cf3feab086fdcca464fdfe58eb2caee1e9910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d0c6d0e9ef5f7d4a0f83a66650cf3feab086fdcca464fdfe58eb2caee1e9910","first_computed_at":"2026-07-05T08:38:40.210052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:40.210052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7F0CF4yuu6tOqEpLdY20lbIA4Ny6zlHcKJV+MR+pYEARx4YEBhZxsrFBu6Q2LFiENIk55vuG16x6kC8pVPGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:40.210535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.00320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6edb43c4f5c00ee787d8a8a77ab9c707502259c983e6ba325a66a1b3e3328382","sha256:dba2b0a131274a89a49eb30a30b48e6bb71a5ddb4e575bf772a6b247dd1b9ea9"],"state_sha256":"01659d7150bf10be944c4712c631a5d507fcb7db63e53d4de88fd76851232377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnYJWAPGF8d1yT+qs5mXUcXYQ4cSHHvksvd9acKK4F/eX8BIhA3ulQhnt+6ArMsxA6nEJ8V8ncjvTP43bWBYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:09:40.432622Z","bundle_sha256":"0dfbe8e0fa81c648acf2508eb6a4af1e9647875287094c53366edf26da79745f"}}