{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IUZKZLZADKH3U4SCT3OWSPAKFE","short_pith_number":"pith:IUZKZLZA","schema_version":"1.0","canonical_sha256":"4532acaf201a8fba72429edd693c0a291c117ae43bd42b13fa4ff67eae73609d","source":{"kind":"arxiv","id":"2302.00618","version":1},"attestation_state":"computed","paper":{"title":"Synthetic Prompting: Generating Chain-of-Thought Demonstrations for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Minlie Huang, Nan Duan, Weizhu Chen, Yelong Shen, Yeyun Gong, Zhihong Shao","submitted_at":"2023-02-01T17:33:12Z","abstract_excerpt":"Large language models can perform various reasoning tasks by using chain-of-thought prompting, which guides them to find answers through step-by-step demonstrations. However, the quality of the prompts depends on the demonstrations given to the models, and creating many of them by hand is costly. We introduce Synthetic prompting, a method that leverages a few handcrafted examples to prompt the model to generate more examples by itself, and selects effective demonstrations to elicit better reasoning. Our method alternates between a backward and forward process to generate new examples. The back"},"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.00618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-02-01T17:33:12Z","cross_cats_sorted":[],"title_canon_sha256":"305d122eff8cf2606c6c37108ed05f66db9a64c563ae1b31ca04a38ffaf3a477","abstract_canon_sha256":"09f02f42c41ce25408f42fc13906f2abf84426621777ee30a8d5d8ec53c84791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:05.316031Z","signature_b64":"7RRkGOU1nfs3f512FJ9G9monECfRb/09v8JTLBZkAjdp+7oKeIo34b1V47v9qZ9WrijO5E/Sh5Wywqo5BYkJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4532acaf201a8fba72429edd693c0a291c117ae43bd42b13fa4ff67eae73609d","last_reissued_at":"2026-07-05T05:38:05.315549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:05.315549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthetic Prompting: Generating Chain-of-Thought Demonstrations for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Minlie Huang, Nan Duan, Weizhu Chen, Yelong Shen, Yeyun Gong, Zhihong Shao","submitted_at":"2023-02-01T17:33:12Z","abstract_excerpt":"Large language models can perform various reasoning tasks by using chain-of-thought prompting, which guides them to find answers through step-by-step demonstrations. However, the quality of the prompts depends on the demonstrations given to the models, and creating many of them by hand is costly. We introduce Synthetic prompting, a method that leverages a few handcrafted examples to prompt the model to generate more examples by itself, and selects effective demonstrations to elicit better reasoning. Our method alternates between a backward and forward process to generate new examples. The back"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00618","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/2302.00618/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.00618","created_at":"2026-07-05T05:38:05.315609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00618v1","created_at":"2026-07-05T05:38:05.315609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00618","created_at":"2026-07-05T05:38:05.315609+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUZKZLZADKH3","created_at":"2026-07-05T05:38:05.315609+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUZKZLZADKH3U4SC","created_at":"2026-07-05T05:38:05.315609+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUZKZLZA","created_at":"2026-07-05T05:38:05.315609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2408.00724","citing_title":"Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models","ref_index":249,"is_internal_anchor":false},{"citing_arxiv_id":"2310.03714","citing_title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE","json":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE.json","graph_json":"https://pith.science/api/pith-number/IUZKZLZADKH3U4SCT3OWSPAKFE/graph.json","events_json":"https://pith.science/api/pith-number/IUZKZLZADKH3U4SCT3OWSPAKFE/events.json","paper":"https://pith.science/paper/IUZKZLZA"},"agent_actions":{"view_html":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE","download_json":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE.json","view_paper":"https://pith.science/paper/IUZKZLZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00618&json=true","fetch_graph":"https://pith.science/api/pith-number/IUZKZLZADKH3U4SCT3OWSPAKFE/graph.json","fetch_events":"https://pith.science/api/pith-number/IUZKZLZADKH3U4SCT3OWSPAKFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE/action/storage_attestation","attest_author":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE/action/author_attestation","sign_citation":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE/action/citation_signature","submit_replication":"https://pith.science/pith/IUZKZLZADKH3U4SCT3OWSPAKFE/action/replication_record"}},"created_at":"2026-07-05T05:38:05.315609+00:00","updated_at":"2026-07-05T05:38:05.315609+00:00"}