{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:36TLSUKXSNLHNVVSSGHGAWKHDQ","short_pith_number":"pith:36TLSUKX","schema_version":"1.0","canonical_sha256":"dfa6b95157935676d6b2918e6059471c2a417cd8d6887a1675cad21df59dd42e","source":{"kind":"arxiv","id":"2312.08901","version":3},"attestation_state":"computed","paper":{"title":"Fewer is More: Boosting LLM Reasoning with Reinforced Context Pruning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Fan Yang, Kwang-Ting Cheng, Li Lyna Zhang, Mao Yang, Xijie Huang","submitted_at":"2023-12-14T13:03:13Z","abstract_excerpt":"Large Language Models (LLMs) have shown impressive capabilities, yet they still struggle with math reasoning. In this work, we propose CoT-Influx, a novel approach that pushes the boundary of few-shot Chain-of-Thoughts (CoT) learning to improve LLM mathematical reasoning. Motivated by the observation that adding more concise CoT examples in the prompt can improve LLM reasoning performance, CoT-Influx employs a coarse-to-fine pruner to maximize the input of effective and concise CoT examples. The pruner first selects as many crucial CoT examples as possible and then prunes unimportant tokens to"},"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":"2312.08901","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-14T13:03:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e13bc9fd483de830f340469878009d22a343664249dcaa2ea29a5ca210d587a7","abstract_canon_sha256":"2b868fc321b2dcb8201c6d8e3e7eb4db742e16d9a5cbd9f4e5a68d20577b5f71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:31.857009Z","signature_b64":"9eE/1byYRDcUGRsSoW8bMxFiOUgXGINPWDaFpIP2DYq6wHRU1N/OuShiuc2PO6UqPH7sMHbQEkZlK/HQueJvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfa6b95157935676d6b2918e6059471c2a417cd8d6887a1675cad21df59dd42e","last_reissued_at":"2026-07-05T07:45:31.856457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:31.856457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fewer is More: Boosting LLM Reasoning with Reinforced Context Pruning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Fan Yang, Kwang-Ting Cheng, Li Lyna Zhang, Mao Yang, Xijie Huang","submitted_at":"2023-12-14T13:03:13Z","abstract_excerpt":"Large Language Models (LLMs) have shown impressive capabilities, yet they still struggle with math reasoning. In this work, we propose CoT-Influx, a novel approach that pushes the boundary of few-shot Chain-of-Thoughts (CoT) learning to improve LLM mathematical reasoning. Motivated by the observation that adding more concise CoT examples in the prompt can improve LLM reasoning performance, CoT-Influx employs a coarse-to-fine pruner to maximize the input of effective and concise CoT examples. The pruner first selects as many crucial CoT examples as possible and then prunes unimportant tokens to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08901","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/2312.08901/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":"2312.08901","created_at":"2026-07-05T07:45:31.856530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08901v3","created_at":"2026-07-05T07:45:31.856530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08901","created_at":"2026-07-05T07:45:31.856530+00:00"},{"alias_kind":"pith_short_12","alias_value":"36TLSUKXSNLH","created_at":"2026-07-05T07:45:31.856530+00:00"},{"alias_kind":"pith_short_16","alias_value":"36TLSUKXSNLHNVVS","created_at":"2026-07-05T07:45:31.856530+00:00"},{"alias_kind":"pith_short_8","alias_value":"36TLSUKX","created_at":"2026-07-05T07:45:31.856530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08212","citing_title":"LLMs with in-context learning for Algorithmic Theoretical Physics","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ","json":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ.json","graph_json":"https://pith.science/api/pith-number/36TLSUKXSNLHNVVSSGHGAWKHDQ/graph.json","events_json":"https://pith.science/api/pith-number/36TLSUKXSNLHNVVSSGHGAWKHDQ/events.json","paper":"https://pith.science/paper/36TLSUKX"},"agent_actions":{"view_html":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ","download_json":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ.json","view_paper":"https://pith.science/paper/36TLSUKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08901&json=true","fetch_graph":"https://pith.science/api/pith-number/36TLSUKXSNLHNVVSSGHGAWKHDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/36TLSUKXSNLHNVVSSGHGAWKHDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ/action/storage_attestation","attest_author":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ/action/author_attestation","sign_citation":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ/action/citation_signature","submit_replication":"https://pith.science/pith/36TLSUKXSNLHNVVSSGHGAWKHDQ/action/replication_record"}},"created_at":"2026-07-05T07:45:31.856530+00:00","updated_at":"2026-07-05T07:45:31.856530+00:00"}