{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4GNRTZIZBQ33JFH7ULH3EO7ZQN","short_pith_number":"pith:4GNRTZIZ","schema_version":"1.0","canonical_sha256":"e19b19e5190c37b494ffa2cfb23bf983621237b76c5441851b9efa231b5727b4","source":{"kind":"arxiv","id":"2407.10930","version":2},"attestation_state":"computed","paper":{"title":"Fine-Tuning and Prompt Optimization: Two Great Steps that Work Better Together","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Christopher Potts, Dilara Soylu, Omar Khattab","submitted_at":"2024-07-15T17:30:31Z","abstract_excerpt":"Natural Language Processing (NLP) systems are increasingly taking the form of sophisticated modular pipelines, e.g., Retrieval Augmented Generation (RAG), where each module may involve a distinct Language Model (LM) and an associated prompt template. These compound systems often lack intermediate labels or gradient flow to optimize each module, making their end-to-end optimization challenging. Here we seek strategies to optimize both the module-level LM weights and the associated prompt templates of such systems to maximize a downstream task metric. We propose for the first time combining the "},"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":"2407.10930","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-07-15T17:30:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c144eb391afe603da82183629b27cea8cee585e285a6d495de17d06d5103c7f9","abstract_canon_sha256":"731bf76f713ba1be799197d5fca4ab30bba2667efbccc56ba6779c47ba65131e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:51.040452Z","signature_b64":"U91f76i1KBljnRQkuO5EXS7Jg3wOQ8N0haxiLyi5rlntSTIemxtRykzNa0Lx+tQJLLoR4j0VFpULXYJVYMuiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e19b19e5190c37b494ffa2cfb23bf983621237b76c5441851b9efa231b5727b4","last_reissued_at":"2026-07-05T09:16:51.039898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:51.039898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Tuning and Prompt Optimization: Two Great Steps that Work Better Together","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Christopher Potts, Dilara Soylu, Omar Khattab","submitted_at":"2024-07-15T17:30:31Z","abstract_excerpt":"Natural Language Processing (NLP) systems are increasingly taking the form of sophisticated modular pipelines, e.g., Retrieval Augmented Generation (RAG), where each module may involve a distinct Language Model (LM) and an associated prompt template. These compound systems often lack intermediate labels or gradient flow to optimize each module, making their end-to-end optimization challenging. Here we seek strategies to optimize both the module-level LM weights and the associated prompt templates of such systems to maximize a downstream task metric. We propose for the first time combining the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10930","kind":"arxiv","version":2},"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/2407.10930/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":"2407.10930","created_at":"2026-07-05T09:16:51.039970+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10930v2","created_at":"2026-07-05T09:16:51.039970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10930","created_at":"2026-07-05T09:16:51.039970+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GNRTZIZBQ33","created_at":"2026-07-05T09:16:51.039970+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GNRTZIZBQ33JFH7","created_at":"2026-07-05T09:16:51.039970+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GNRTZIZ","created_at":"2026-07-05T09:16:51.039970+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12484","citing_title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN","json":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN.json","graph_json":"https://pith.science/api/pith-number/4GNRTZIZBQ33JFH7ULH3EO7ZQN/graph.json","events_json":"https://pith.science/api/pith-number/4GNRTZIZBQ33JFH7ULH3EO7ZQN/events.json","paper":"https://pith.science/paper/4GNRTZIZ"},"agent_actions":{"view_html":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN","download_json":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN.json","view_paper":"https://pith.science/paper/4GNRTZIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10930&json=true","fetch_graph":"https://pith.science/api/pith-number/4GNRTZIZBQ33JFH7ULH3EO7ZQN/graph.json","fetch_events":"https://pith.science/api/pith-number/4GNRTZIZBQ33JFH7ULH3EO7ZQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN/action/storage_attestation","attest_author":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN/action/author_attestation","sign_citation":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN/action/citation_signature","submit_replication":"https://pith.science/pith/4GNRTZIZBQ33JFH7ULH3EO7ZQN/action/replication_record"}},"created_at":"2026-07-05T09:16:51.039970+00:00","updated_at":"2026-07-05T09:16:51.039970+00:00"}