{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KGHAPZOVII743HQUOAYOIAZMUW","short_pith_number":"pith:KGHAPZOV","schema_version":"1.0","canonical_sha256":"518e07e5d5423fcd9e147030e4032ca5a41c63bbb25e208921a8b8334a2484b1","source":{"kind":"arxiv","id":"2502.07191","version":4},"attestation_state":"computed","paper":{"title":"Bag of Tricks for Inference-time Computation of LLM Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fan Liu, Hao Liu, Naiqiang Tan, Wenshuo Chao","submitted_at":"2025-02-11T02:31:11Z","abstract_excerpt":"With the advancement of large language models (LLMs), solving complex reasoning tasks has gained increasing attention. Inference-time computation methods (e.g., Best-of-N, beam search, et al.) are particularly valuable as they can enhance reasoning performance without modifying model parameters or requiring additional training. However, these techniques come with implementation challenges, and most existing methods remain at the proof-of-concept stage with limited practical adoption due to their computational complexity and varying effectiveness across different tasks. In this paper, we invest"},"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":"2502.07191","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-11T02:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"bfd4daa773bb404e2ba077f622482d341494eb5e966625f3a292cb4b419123a9","abstract_canon_sha256":"31f1b1e60f483273d207cc360fccfb4490320bb7959abf17315c587896f7a2a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:26.105593Z","signature_b64":"p+rtb8mZrDmzj/eOO66iznfeMODLbHcociRcQy93QpkMLGyb7s37g7D3LgzQ3bD4er7OhK14Y3zR1DVC4uvgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"518e07e5d5423fcd9e147030e4032ca5a41c63bbb25e208921a8b8334a2484b1","last_reissued_at":"2026-07-05T10:15:26.105055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:26.105055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bag of Tricks for Inference-time Computation of LLM Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fan Liu, Hao Liu, Naiqiang Tan, Wenshuo Chao","submitted_at":"2025-02-11T02:31:11Z","abstract_excerpt":"With the advancement of large language models (LLMs), solving complex reasoning tasks has gained increasing attention. Inference-time computation methods (e.g., Best-of-N, beam search, et al.) are particularly valuable as they can enhance reasoning performance without modifying model parameters or requiring additional training. However, these techniques come with implementation challenges, and most existing methods remain at the proof-of-concept stage with limited practical adoption due to their computational complexity and varying effectiveness across different tasks. In this paper, we invest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07191","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/2502.07191/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":"2502.07191","created_at":"2026-07-05T10:15:26.105114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07191v4","created_at":"2026-07-05T10:15:26.105114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07191","created_at":"2026-07-05T10:15:26.105114+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGHAPZOVII74","created_at":"2026-07-05T10:15:26.105114+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGHAPZOVII743HQU","created_at":"2026-07-05T10:15:26.105114+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGHAPZOV","created_at":"2026-07-05T10:15:26.105114+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.15616","citing_title":"LENS: Multi-level Evaluation of Multimodal Reasoning with Large Language Models","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2506.19045","citing_title":"Efficient Black-Box Fault Localization for System-Level Test Code Using Large Language Models","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13332","citing_title":"Explicit Reasoning Makes Better Judges: A Systematic Study on Accuracy, Efficiency, and Robustness","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16419","citing_title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06165","citing_title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","ref_index":173,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW","json":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW.json","graph_json":"https://pith.science/api/pith-number/KGHAPZOVII743HQUOAYOIAZMUW/graph.json","events_json":"https://pith.science/api/pith-number/KGHAPZOVII743HQUOAYOIAZMUW/events.json","paper":"https://pith.science/paper/KGHAPZOV"},"agent_actions":{"view_html":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW","download_json":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW.json","view_paper":"https://pith.science/paper/KGHAPZOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07191&json=true","fetch_graph":"https://pith.science/api/pith-number/KGHAPZOVII743HQUOAYOIAZMUW/graph.json","fetch_events":"https://pith.science/api/pith-number/KGHAPZOVII743HQUOAYOIAZMUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW/action/storage_attestation","attest_author":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW/action/author_attestation","sign_citation":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW/action/citation_signature","submit_replication":"https://pith.science/pith/KGHAPZOVII743HQUOAYOIAZMUW/action/replication_record"}},"created_at":"2026-07-05T10:15:26.105114+00:00","updated_at":"2026-07-05T10:15:26.105114+00:00"}