{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ESD6E7UPOWUFRFWUECHEMPXTOR","short_pith_number":"pith:ESD6E7UP","schema_version":"1.0","canonical_sha256":"2487e27e8f75a85896d4208e463ef3747f407d5c42e831fd178fd8054af65f86","source":{"kind":"arxiv","id":"2305.16366","version":1},"attestation_state":"computed","paper":{"title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.LO"],"primary_cat":"cs.CL","authors_text":"Lingpeng Kong, Wenda Li, Xueliang Zhao","submitted_at":"2023-05-25T11:35:52Z","abstract_excerpt":"Large language models~(LLMs) present an intriguing avenue of exploration in the domain of formal theorem proving. Nonetheless, the full utilization of these models, particularly in terms of demonstration formatting and organization, remains an underexplored area. In an endeavor to enhance the efficacy of LLMs, we introduce a subgoal-based demonstration learning framework, consisting of two primary elements: Firstly, drawing upon the insights of subgoal learning from the domains of reinforcement learning and robotics, we propose the construction of distinct subgoals for each demonstration examp"},"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":"2305.16366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-25T11:35:52Z","cross_cats_sorted":["cs.AI","cs.LG","cs.LO"],"title_canon_sha256":"2b84d858bd24b3e2068797dd73cfcf9c754dcd37d7240f8558e0ed485ce23078","abstract_canon_sha256":"04dac11b470ead7adaf81603a22e8295bb1ec29aa60a5715eddef5598c6d8311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:12.397289Z","signature_b64":"zk8mmER5MhEK8vKDQGXLDRX9FENYoW9cKge5tDudJHPlKK6cLDummLAhzCvVBg2ZXfxQbL1cxYTwxQ2CUSnxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2487e27e8f75a85896d4208e463ef3747f407d5c42e831fd178fd8054af65f86","last_reissued_at":"2026-07-05T06:14:12.396931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:12.396931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.LO"],"primary_cat":"cs.CL","authors_text":"Lingpeng Kong, Wenda Li, Xueliang Zhao","submitted_at":"2023-05-25T11:35:52Z","abstract_excerpt":"Large language models~(LLMs) present an intriguing avenue of exploration in the domain of formal theorem proving. Nonetheless, the full utilization of these models, particularly in terms of demonstration formatting and organization, remains an underexplored area. In an endeavor to enhance the efficacy of LLMs, we introduce a subgoal-based demonstration learning framework, consisting of two primary elements: Firstly, drawing upon the insights of subgoal learning from the domains of reinforcement learning and robotics, we propose the construction of distinct subgoals for each demonstration examp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16366","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/2305.16366/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":"2305.16366","created_at":"2026-07-05T06:14:12.396984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16366v1","created_at":"2026-07-05T06:14:12.396984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16366","created_at":"2026-07-05T06:14:12.396984+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESD6E7UPOWUF","created_at":"2026-07-05T06:14:12.396984+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESD6E7UPOWUFRFWU","created_at":"2026-07-05T06:14:12.396984+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESD6E7UP","created_at":"2026-07-05T06:14:12.396984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31048","citing_title":"Knowledge Distillation from Large Reasoning Models to Compact Student Models: A Case Study on the John O Bryan Mathematics Competition","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23643","citing_title":"Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR","json":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR.json","graph_json":"https://pith.science/api/pith-number/ESD6E7UPOWUFRFWUECHEMPXTOR/graph.json","events_json":"https://pith.science/api/pith-number/ESD6E7UPOWUFRFWUECHEMPXTOR/events.json","paper":"https://pith.science/paper/ESD6E7UP"},"agent_actions":{"view_html":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR","download_json":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR.json","view_paper":"https://pith.science/paper/ESD6E7UP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16366&json=true","fetch_graph":"https://pith.science/api/pith-number/ESD6E7UPOWUFRFWUECHEMPXTOR/graph.json","fetch_events":"https://pith.science/api/pith-number/ESD6E7UPOWUFRFWUECHEMPXTOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR/action/storage_attestation","attest_author":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR/action/author_attestation","sign_citation":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR/action/citation_signature","submit_replication":"https://pith.science/pith/ESD6E7UPOWUFRFWUECHEMPXTOR/action/replication_record"}},"created_at":"2026-07-05T06:14:12.396984+00:00","updated_at":"2026-07-05T06:14:12.396984+00:00"}