{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZGODUGLCPA5FSEMMIUKW4EXLSH","short_pith_number":"pith:ZGODUGLC","schema_version":"1.0","canonical_sha256":"c99c3a1962783a59118c45156e12eb91d8153e3eda1ee09054ca71fc4364c3ce","source":{"kind":"arxiv","id":"2402.08702","version":4},"attestation_state":"computed","paper":{"title":"PRompt Optimization in Multi-Step Tasks (PROMST): Integrating Human Feedback and Heuristic-based Sampling","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.HC","cs.RO"],"primary_cat":"cs.CL","authors_text":"Chuchu Fan, Jacob Arkin, Nicholas Roy, Yang Zhang, Yilun Hao, Yongchao Chen","submitted_at":"2024-02-13T16:38:01Z","abstract_excerpt":"Prompt optimization aims to find the best prompt to a large language model (LLM) for a given task. LLMs have been successfully used to help find and improve prompt candidates for single-step tasks. However, realistic tasks for agents are multi-step and introduce new challenges: (1) Prompt content is likely to be more extensive and complex, making it more difficult for LLMs to analyze errors, (2) the impact of an individual step is difficult to evaluate, and (3) different people may have varied preferences about task execution. While humans struggle to optimize prompts, they are good at providi"},"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":"2402.08702","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-13T16:38:01Z","cross_cats_sorted":["cs.AI","cs.HC","cs.RO"],"title_canon_sha256":"5a48b192366ec27d67d58ec19626bc75b6ada0702b303d614586b943d56141ce","abstract_canon_sha256":"a6c038b403259186330fab183d2742b9f1cb484f7ba4864031e5e22967b09b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:08.502823Z","signature_b64":"BMaePS/skFs5DIrrGwbbhalkztSAOw5zlHtuySewr3YEsNT+2EC3RFTHGsb7TQfH0BwAS56e2JvO5QejtRt8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c99c3a1962783a59118c45156e12eb91d8153e3eda1ee09054ca71fc4364c3ce","last_reissued_at":"2026-07-05T09:15:08.502401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:08.502401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PRompt Optimization in Multi-Step Tasks (PROMST): Integrating Human Feedback and Heuristic-based Sampling","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.HC","cs.RO"],"primary_cat":"cs.CL","authors_text":"Chuchu Fan, Jacob Arkin, Nicholas Roy, Yang Zhang, Yilun Hao, Yongchao Chen","submitted_at":"2024-02-13T16:38:01Z","abstract_excerpt":"Prompt optimization aims to find the best prompt to a large language model (LLM) for a given task. LLMs have been successfully used to help find and improve prompt candidates for single-step tasks. However, realistic tasks for agents are multi-step and introduce new challenges: (1) Prompt content is likely to be more extensive and complex, making it more difficult for LLMs to analyze errors, (2) the impact of an individual step is difficult to evaluate, and (3) different people may have varied preferences about task execution. While humans struggle to optimize prompts, they are good at providi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08702","kind":"arxiv","version":4},"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/2402.08702/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":"2402.08702","created_at":"2026-07-05T09:15:08.502455+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08702v4","created_at":"2026-07-05T09:15:08.502455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08702","created_at":"2026-07-05T09:15:08.502455+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGODUGLCPA5F","created_at":"2026-07-05T09:15:08.502455+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGODUGLCPA5FSEMM","created_at":"2026-07-05T09:15:08.502455+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGODUGLC","created_at":"2026-07-05T09:15:08.502455+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.08872","citing_title":"Your Brain on ChatGPT: Accumulation of Cognitive Debt when Using an AI Assistant for Essay Writing Task","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21046","citing_title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06699","citing_title":"Adaptive Prompt Structure Factorization: A Framework for Self-Discovering and Optimizing Compositional Prompt Programs","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH","json":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH.json","graph_json":"https://pith.science/api/pith-number/ZGODUGLCPA5FSEMMIUKW4EXLSH/graph.json","events_json":"https://pith.science/api/pith-number/ZGODUGLCPA5FSEMMIUKW4EXLSH/events.json","paper":"https://pith.science/paper/ZGODUGLC"},"agent_actions":{"view_html":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH","download_json":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH.json","view_paper":"https://pith.science/paper/ZGODUGLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08702&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGODUGLCPA5FSEMMIUKW4EXLSH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGODUGLCPA5FSEMMIUKW4EXLSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH/action/storage_attestation","attest_author":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH/action/author_attestation","sign_citation":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH/action/citation_signature","submit_replication":"https://pith.science/pith/ZGODUGLCPA5FSEMMIUKW4EXLSH/action/replication_record"}},"created_at":"2026-07-05T09:15:08.502455+00:00","updated_at":"2026-07-05T09:15:08.502455+00:00"}