{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C66E7IT6O2KJE6HDED2CRFWRKO","short_pith_number":"pith:C66E7IT6","schema_version":"1.0","canonical_sha256":"17bc4fa27e76949278e320f42896d153a3c3c8f20f654e43145668e63037ffd0","source":{"kind":"arxiv","id":"2302.12822","version":3},"attestation_state":"computed","paper":{"title":"Automatic Prompt Augmentation and Selection with Chain-of-Thought from Labeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kashun Shum, Shizhe Diao, Tong Zhang","submitted_at":"2023-02-24T18:58:06Z","abstract_excerpt":"Chain-of-thought (CoT) advances the reasoning abilities of large language models (LLMs) and achieves superior performance in complex reasoning tasks. However, most CoT studies rely on carefully designed human-annotated rational chains to prompt LLMs, posing challenges for real-world applications where labeled data is available without rational chains. This paper proposes a new strategy, Automate-CoT (Automatic Prompt Augmentation and Selection with Chain-of-Thought), that can bypass human engineering of CoT by automatically augmenting rational chains from a small labeled dataset, and then prun"},"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":"2302.12822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-02-24T18:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"e2d8f362d315619c1476c2d3dd3500cfe0c83e668fbca6e668a5a4593f94fd57","abstract_canon_sha256":"97476a43105d63d253f177d04c2f75974fe88c02a0569c911e59202383f60067"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:30.275599Z","signature_b64":"J3sLAoKSQ108FUigq4OHMezSWetl+4FwBA5QvNW+K48RLDt5b7WMGtD2+Fl7HKiYh3WYgxVZcDg+NaaoSb9sAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17bc4fa27e76949278e320f42896d153a3c3c8f20f654e43145668e63037ffd0","last_reissued_at":"2026-07-05T07:49:30.275108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:30.275108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Prompt Augmentation and Selection with Chain-of-Thought from Labeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kashun Shum, Shizhe Diao, Tong Zhang","submitted_at":"2023-02-24T18:58:06Z","abstract_excerpt":"Chain-of-thought (CoT) advances the reasoning abilities of large language models (LLMs) and achieves superior performance in complex reasoning tasks. However, most CoT studies rely on carefully designed human-annotated rational chains to prompt LLMs, posing challenges for real-world applications where labeled data is available without rational chains. This paper proposes a new strategy, Automate-CoT (Automatic Prompt Augmentation and Selection with Chain-of-Thought), that can bypass human engineering of CoT by automatically augmenting rational chains from a small labeled dataset, and then prun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12822","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/2302.12822/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":"2302.12822","created_at":"2026-07-05T07:49:30.275165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.12822v3","created_at":"2026-07-05T07:49:30.275165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12822","created_at":"2026-07-05T07:49:30.275165+00:00"},{"alias_kind":"pith_short_12","alias_value":"C66E7IT6O2KJ","created_at":"2026-07-05T07:49:30.275165+00:00"},{"alias_kind":"pith_short_16","alias_value":"C66E7IT6O2KJE6HD","created_at":"2026-07-05T07:49:30.275165+00:00"},{"alias_kind":"pith_short_8","alias_value":"C66E7IT6","created_at":"2026-07-05T07:49:30.275165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.18512","citing_title":"Expressive Prompting: Improving Emotion Intensity and Speaker Consistency in Zero-Shot TTS","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16549","citing_title":"MathFlow: Enhancing the Perceptual Flow of MLLMs for Visual Mathematical Problems","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2504.05605","citing_title":"ShadowCoT: Cognitive Hijacking for Stealthy Reasoning Backdoors in LLMs","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17088","citing_title":"ACIL: Auto Chain of Thoughts for In-Context Learning","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":296,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO","json":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO.json","graph_json":"https://pith.science/api/pith-number/C66E7IT6O2KJE6HDED2CRFWRKO/graph.json","events_json":"https://pith.science/api/pith-number/C66E7IT6O2KJE6HDED2CRFWRKO/events.json","paper":"https://pith.science/paper/C66E7IT6"},"agent_actions":{"view_html":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO","download_json":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO.json","view_paper":"https://pith.science/paper/C66E7IT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.12822&json=true","fetch_graph":"https://pith.science/api/pith-number/C66E7IT6O2KJE6HDED2CRFWRKO/graph.json","fetch_events":"https://pith.science/api/pith-number/C66E7IT6O2KJE6HDED2CRFWRKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO/action/storage_attestation","attest_author":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO/action/author_attestation","sign_citation":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO/action/citation_signature","submit_replication":"https://pith.science/pith/C66E7IT6O2KJE6HDED2CRFWRKO/action/replication_record"}},"created_at":"2026-07-05T07:49:30.275165+00:00","updated_at":"2026-07-05T07:49:30.275165+00:00"}