{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W2JEAO2CUAVQ5DPNMHNGVNXODC","short_pith_number":"pith:W2JEAO2C","schema_version":"1.0","canonical_sha256":"b692403b42a02b0e8ded61da6ab6ee1897962616ab591efc7080af0ae561fb1d","source":{"kind":"arxiv","id":"2607.11258","version":1},"attestation_state":"computed","paper":{"title":"TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Burak S. Akbudak, Can S. Erer, G\\\"ozde G\\\"ul \\c{S}ahin, Zeynel A. Ulu\\c{s}an","submitted_at":"2026-07-13T08:40:33Z","abstract_excerpt":"Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning and do not provide native integration with formal verifiers, while theorem proving systems often rely on task-specific search implementations. We introduce TreeThink, an open-source Python library for modular, fully asynchronous tree search in neural theorem proving. It integrates established tree search methods with vLLM-based inference pipelines and diverse node evaluation techniques, ranging from lightweight heurist"},"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":"2607.11258","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-13T08:40:33Z","cross_cats_sorted":[],"title_canon_sha256":"22e16a8b2701218dc9de896f7e821163127e538a7d87e5987c08540c2235f2b4","abstract_canon_sha256":"a0c24e3888fecc1f134ca9a09f363347a872100a266926eda59bc9c523980989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:25.138378Z","signature_b64":"S5lpKSMJaRszQK/sfajwYAkwODx5GEwHxYtB++i/LMd9GKYHE8FO1+wCSaNIsdARVx51wzo096Ys9ukJv0XrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b692403b42a02b0e8ded61da6ab6ee1897962616ab591efc7080af0ae561fb1d","last_reissued_at":"2026-07-14T01:22:25.137546Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:25.137546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Burak S. Akbudak, Can S. Erer, G\\\"ozde G\\\"ul \\c{S}ahin, Zeynel A. Ulu\\c{s}an","submitted_at":"2026-07-13T08:40:33Z","abstract_excerpt":"Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning and do not provide native integration with formal verifiers, while theorem proving systems often rely on task-specific search implementations. We introduce TreeThink, an open-source Python library for modular, fully asynchronous tree search in neural theorem proving. It integrates established tree search methods with vLLM-based inference pipelines and diverse node evaluation techniques, ranging from lightweight heurist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11258","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/2607.11258/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":"2607.11258","created_at":"2026-07-14T01:22:25.137971+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11258v1","created_at":"2026-07-14T01:22:25.137971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11258","created_at":"2026-07-14T01:22:25.137971+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2JEAO2CUAVQ","created_at":"2026-07-14T01:22:25.137971+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2JEAO2CUAVQ5DPN","created_at":"2026-07-14T01:22:25.137971+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2JEAO2C","created_at":"2026-07-14T01:22:25.137971+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC","json":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC.json","graph_json":"https://pith.science/api/pith-number/W2JEAO2CUAVQ5DPNMHNGVNXODC/graph.json","events_json":"https://pith.science/api/pith-number/W2JEAO2CUAVQ5DPNMHNGVNXODC/events.json","paper":"https://pith.science/paper/W2JEAO2C"},"agent_actions":{"view_html":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC","download_json":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC.json","view_paper":"https://pith.science/paper/W2JEAO2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11258&json=true","fetch_graph":"https://pith.science/api/pith-number/W2JEAO2CUAVQ5DPNMHNGVNXODC/graph.json","fetch_events":"https://pith.science/api/pith-number/W2JEAO2CUAVQ5DPNMHNGVNXODC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC/action/storage_attestation","attest_author":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC/action/author_attestation","sign_citation":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC/action/citation_signature","submit_replication":"https://pith.science/pith/W2JEAO2CUAVQ5DPNMHNGVNXODC/action/replication_record"}},"created_at":"2026-07-14T01:22:25.137971+00:00","updated_at":"2026-07-14T01:22:25.137971+00:00"}