{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:22BR25DUWNLJGNKFRDABQFUIAI","short_pith_number":"pith:22BR25DU","schema_version":"1.0","canonical_sha256":"d6831d7474b35693354588c0181688020da082551c4d6b44a306c6fb73c1545b","source":{"kind":"arxiv","id":"2503.11657","version":3},"attestation_state":"computed","paper":{"title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kevin Han, Kevin Zhu, Tim Knappe, Vincent Li, Yule Fu","submitted_at":"2025-02-04T07:17:34Z","abstract_excerpt":"Large language models have demonstrated remarkable capabilities in natural language processing tasks requiring multi-step logical reasoning capabilities, such as automated theorem proving. However, challenges persist within theorem proving, such as the identification of key mathematical concepts, understanding their interrelationships, and formalizing proofs correctly within natural language. We present KG-prover, a novel framework that leverages knowledge graphs mined from reputable mathematical texts to augment general-purpose LLMs to construct and formalize mathematical proofs. We also stud"},"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":"2503.11657","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-04T07:17:34Z","cross_cats_sorted":[],"title_canon_sha256":"0a5404ef3992b130ae5a52115f24365d1bde02f38610c19b28e5d9e548b0ba7c","abstract_canon_sha256":"140908c0ee53e1e946fa7e97cf2c95d390e16bf72a9baf4fd7e201c347abf96b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:11.638963Z","signature_b64":"H6UDkSnUneb1VDXxuS4jN2lvOe00uiOmOifuddZ8jLeRcXZu0d9/bZ3mxXKn+U9v9AKQs2Y5CcvTg8EK98iACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6831d7474b35693354588c0181688020da082551c4d6b44a306c6fb73c1545b","last_reissued_at":"2026-05-26T01:03:11.638015Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:11.638015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kevin Han, Kevin Zhu, Tim Knappe, Vincent Li, Yule Fu","submitted_at":"2025-02-04T07:17:34Z","abstract_excerpt":"Large language models have demonstrated remarkable capabilities in natural language processing tasks requiring multi-step logical reasoning capabilities, such as automated theorem proving. However, challenges persist within theorem proving, such as the identification of key mathematical concepts, understanding their interrelationships, and formalizing proofs correctly within natural language. We present KG-prover, a novel framework that leverages knowledge graphs mined from reputable mathematical texts to augment general-purpose LLMs to construct and formalize mathematical proofs. We also stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11657","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/2503.11657/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":"2503.11657","created_at":"2026-05-26T01:03:11.638129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11657v3","created_at":"2026-05-26T01:03:11.638129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11657","created_at":"2026-05-26T01:03:11.638129+00:00"},{"alias_kind":"pith_short_12","alias_value":"22BR25DUWNLJ","created_at":"2026-05-26T01:03:11.638129+00:00"},{"alias_kind":"pith_short_16","alias_value":"22BR25DUWNLJGNKF","created_at":"2026-05-26T01:03:11.638129+00:00"},{"alias_kind":"pith_short_8","alias_value":"22BR25DU","created_at":"2026-05-26T01:03:11.638129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19678","citing_title":"From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review","ref_index":206,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI","json":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI.json","graph_json":"https://pith.science/api/pith-number/22BR25DUWNLJGNKFRDABQFUIAI/graph.json","events_json":"https://pith.science/api/pith-number/22BR25DUWNLJGNKFRDABQFUIAI/events.json","paper":"https://pith.science/paper/22BR25DU"},"agent_actions":{"view_html":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI","download_json":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI.json","view_paper":"https://pith.science/paper/22BR25DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11657&json=true","fetch_graph":"https://pith.science/api/pith-number/22BR25DUWNLJGNKFRDABQFUIAI/graph.json","fetch_events":"https://pith.science/api/pith-number/22BR25DUWNLJGNKFRDABQFUIAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI/action/storage_attestation","attest_author":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI/action/author_attestation","sign_citation":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI/action/citation_signature","submit_replication":"https://pith.science/pith/22BR25DUWNLJGNKFRDABQFUIAI/action/replication_record"}},"created_at":"2026-05-26T01:03:11.638129+00:00","updated_at":"2026-05-26T01:03:11.638129+00:00"}