{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NDCNIWFM2TRF22GNRQDIR4DOGX","short_pith_number":"pith:NDCNIWFM","schema_version":"1.0","canonical_sha256":"68c4d458acd4e25d68cd8c0688f06e35cbf57ef3c0daf406122a2d1b750c588d","source":{"kind":"arxiv","id":"2501.10069","version":4},"attestation_state":"computed","paper":{"title":"A Survey on LLM Test-Time Compute via Search: Tasks, LLM Profiling, Search Algorithms, and Relevant Frameworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Xinzhe Li","submitted_at":"2025-01-17T09:42:48Z","abstract_excerpt":"LLM test-time compute (or LLM inference) via search has emerged as a promising research area with rapid developments. However, current frameworks often adopt distinct perspectives on three key aspects: task definition, LLM profiling, and search procedures, making direct comparisons challenging. Moreover, the search algorithms employed often diverge from standard implementations, and their specific characteristics are not thoroughly specified. This survey aims to provide a comprehensive but integrated technical review on existing LIS frameworks. Specifically, we unify task definitions under Mar"},"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":"2501.10069","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-17T09:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"6dd827edc92d298f18d2a81b93d56cd3dc46eea2bf7a8665ed837ced184d9ddd","abstract_canon_sha256":"3384c051c8e9005e62983944687625b07bed906158e55ea637ec6e3d27d0d396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:41.720087Z","signature_b64":"YcBm4894pgS61WNGsFDopoGf6Svq8Kl28tsz9pX85AgkKjrvBmc898TxeakJLjRNAgL/yfGY1kj3P7YrId2VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c4d458acd4e25d68cd8c0688f06e35cbf57ef3c0daf406122a2d1b750c588d","last_reissued_at":"2026-07-05T10:54:41.719582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:41.719582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on LLM Test-Time Compute via Search: Tasks, LLM Profiling, Search Algorithms, and Relevant Frameworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Xinzhe Li","submitted_at":"2025-01-17T09:42:48Z","abstract_excerpt":"LLM test-time compute (or LLM inference) via search has emerged as a promising research area with rapid developments. However, current frameworks often adopt distinct perspectives on three key aspects: task definition, LLM profiling, and search procedures, making direct comparisons challenging. Moreover, the search algorithms employed often diverge from standard implementations, and their specific characteristics are not thoroughly specified. This survey aims to provide a comprehensive but integrated technical review on existing LIS frameworks. Specifically, we unify task definitions under Mar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10069","kind":"arxiv","version":4},"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/2501.10069/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":"2501.10069","created_at":"2026-07-05T10:54:41.719647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10069v4","created_at":"2026-07-05T10:54:41.719647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10069","created_at":"2026-07-05T10:54:41.719647+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDCNIWFM2TRF","created_at":"2026-07-05T10:54:41.719647+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDCNIWFM2TRF22GN","created_at":"2026-07-05T10:54:41.719647+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDCNIWFM","created_at":"2026-07-05T10:54:41.719647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21943","citing_title":"Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning","ref_index":106,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX","json":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX.json","graph_json":"https://pith.science/api/pith-number/NDCNIWFM2TRF22GNRQDIR4DOGX/graph.json","events_json":"https://pith.science/api/pith-number/NDCNIWFM2TRF22GNRQDIR4DOGX/events.json","paper":"https://pith.science/paper/NDCNIWFM"},"agent_actions":{"view_html":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX","download_json":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX.json","view_paper":"https://pith.science/paper/NDCNIWFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10069&json=true","fetch_graph":"https://pith.science/api/pith-number/NDCNIWFM2TRF22GNRQDIR4DOGX/graph.json","fetch_events":"https://pith.science/api/pith-number/NDCNIWFM2TRF22GNRQDIR4DOGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX/action/storage_attestation","attest_author":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX/action/author_attestation","sign_citation":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX/action/citation_signature","submit_replication":"https://pith.science/pith/NDCNIWFM2TRF22GNRQDIR4DOGX/action/replication_record"}},"created_at":"2026-07-05T10:54:41.719647+00:00","updated_at":"2026-07-05T10:54:41.719647+00:00"}