{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PVBW4K2SST6P2II4XEXN7X5EVQ","short_pith_number":"pith:PVBW4K2S","schema_version":"1.0","canonical_sha256":"7d436e2b5294fcfd211cb92edfdfa4ac0a318c6fccccf400cb8a1d672ca1d950","source":{"kind":"arxiv","id":"2310.12960","version":1},"attestation_state":"computed","paper":{"title":"SEGO: Sequential Subgoal Optimization for Mathematical Problem-Solving","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Lingpeng Kong, Wei Bi, Xinting Huang, Xueliang Zhao","submitted_at":"2023-10-19T17:56:40Z","abstract_excerpt":"Large Language Models (LLMs) have driven substantial progress in artificial intelligence in recent years, exhibiting impressive capabilities across a wide range of tasks, including mathematical problem-solving. Inspired by the success of subgoal-based methods, we propose a novel framework called \\textbf{SE}quential sub\\textbf{G}oal \\textbf{O}ptimization (SEGO) to enhance LLMs' ability to solve mathematical problems. By establishing a connection between the subgoal breakdown process and the probability of solving problems, SEGO aims to identify better subgoals with theoretical guarantees. Addre"},"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":"2310.12960","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-19T17:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"f9476bc5f64189dc46bb564a5b05e99e96b55a61da048e66831556470372133b","abstract_canon_sha256":"467afea1cfc6e80b285e2c2f3485354b78e4ff9fbbe7e6ed52bb70a546c3a3a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:44.892279Z","signature_b64":"u/s4L5nIeA1ddXKzQgcOE8MgOv9ITLAqekBpKUyZleZe2+7IEK3HitWlmOAIeSnJhXXBPf0cpxy6ZAhdN+n0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d436e2b5294fcfd211cb92edfdfa4ac0a318c6fccccf400cb8a1d672ca1d950","last_reissued_at":"2026-07-05T07:02:44.891870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:44.891870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SEGO: Sequential Subgoal Optimization for Mathematical Problem-Solving","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Lingpeng Kong, Wei Bi, Xinting Huang, Xueliang Zhao","submitted_at":"2023-10-19T17:56:40Z","abstract_excerpt":"Large Language Models (LLMs) have driven substantial progress in artificial intelligence in recent years, exhibiting impressive capabilities across a wide range of tasks, including mathematical problem-solving. Inspired by the success of subgoal-based methods, we propose a novel framework called \\textbf{SE}quential sub\\textbf{G}oal \\textbf{O}ptimization (SEGO) to enhance LLMs' ability to solve mathematical problems. By establishing a connection between the subgoal breakdown process and the probability of solving problems, SEGO aims to identify better subgoals with theoretical guarantees. Addre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12960","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/2310.12960/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":"2310.12960","created_at":"2026-07-05T07:02:44.891924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12960v1","created_at":"2026-07-05T07:02:44.891924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12960","created_at":"2026-07-05T07:02:44.891924+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVBW4K2SST6P","created_at":"2026-07-05T07:02:44.891924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVBW4K2SST6P2II4","created_at":"2026-07-05T07:02:44.891924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVBW4K2S","created_at":"2026-07-05T07:02:44.891924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22425","citing_title":"Scaling Reasoning without Attention","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ","json":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ.json","graph_json":"https://pith.science/api/pith-number/PVBW4K2SST6P2II4XEXN7X5EVQ/graph.json","events_json":"https://pith.science/api/pith-number/PVBW4K2SST6P2II4XEXN7X5EVQ/events.json","paper":"https://pith.science/paper/PVBW4K2S"},"agent_actions":{"view_html":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ","download_json":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ.json","view_paper":"https://pith.science/paper/PVBW4K2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12960&json=true","fetch_graph":"https://pith.science/api/pith-number/PVBW4K2SST6P2II4XEXN7X5EVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PVBW4K2SST6P2II4XEXN7X5EVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ/action/storage_attestation","attest_author":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ/action/author_attestation","sign_citation":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ/action/citation_signature","submit_replication":"https://pith.science/pith/PVBW4K2SST6P2II4XEXN7X5EVQ/action/replication_record"}},"created_at":"2026-07-05T07:02:44.891924+00:00","updated_at":"2026-07-05T07:02:44.891924+00:00"}