{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SYODJXACIFMIBZ67H3A5K2W5B7","short_pith_number":"pith:SYODJXAC","schema_version":"1.0","canonical_sha256":"961c34dc02415880e7df3ec1d56add0fe023b03ea6f96b2d8db40a3139c250e7","source":{"kind":"arxiv","id":"2308.10462","version":3},"attestation_state":"computed","paper":{"title":"Exploring Parameter-Efficient Fine-Tuning Techniques for Code Generation with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SE","authors_text":"David Lo, Houari Sahraoui, Kisub Kim, Martin Weyssow, Xin Zhou","submitted_at":"2023-08-21T04:31:06Z","abstract_excerpt":"Large language models (LLMs) demonstrate impressive capabilities to generate accurate code snippets given natural language intents in a zero-shot manner, i.e., without the need for specific fine-tuning. While prior studies have highlighted the advantages of fine-tuning LLMs, this process incurs high computational costs, making it impractical in resource-scarce environments, particularly for models with billions of parameters. To address these challenges, previous research explored in-context learning (ICL) and retrieval-augmented generation (RAG) as strategies to guide the LLM generative proce"},"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":"2308.10462","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-08-21T04:31:06Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"29625c1f3c5566900a5bcd8cf7e4290335fc41e0912886748103e57a4f8380d5","abstract_canon_sha256":"f19a91522dbfee65eb4a2672602eac9997d1b02c06d71c06b709df82273ed0fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:23.542184Z","signature_b64":"Xk/WhB8Hi8BhDuHSD+uzpd0LO6NczQVbuWx9w2jMMWA1H+U6XBJaw0wdLWp32dUcF7yZRswif/aI2uUyFGuWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961c34dc02415880e7df3ec1d56add0fe023b03ea6f96b2d8db40a3139c250e7","last_reissued_at":"2026-07-05T09:54:23.541723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:23.541723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Parameter-Efficient Fine-Tuning Techniques for Code Generation with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SE","authors_text":"David Lo, Houari Sahraoui, Kisub Kim, Martin Weyssow, Xin Zhou","submitted_at":"2023-08-21T04:31:06Z","abstract_excerpt":"Large language models (LLMs) demonstrate impressive capabilities to generate accurate code snippets given natural language intents in a zero-shot manner, i.e., without the need for specific fine-tuning. While prior studies have highlighted the advantages of fine-tuning LLMs, this process incurs high computational costs, making it impractical in resource-scarce environments, particularly for models with billions of parameters. To address these challenges, previous research explored in-context learning (ICL) and retrieval-augmented generation (RAG) as strategies to guide the LLM generative proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10462","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/2308.10462/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":"2308.10462","created_at":"2026-07-05T09:54:23.541782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10462v3","created_at":"2026-07-05T09:54:23.541782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10462","created_at":"2026-07-05T09:54:23.541782+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYODJXACIFMI","created_at":"2026-07-05T09:54:23.541782+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYODJXACIFMIBZ67","created_at":"2026-07-05T09:54:23.541782+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYODJXAC","created_at":"2026-07-05T09:54:23.541782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.10484","citing_title":"EXPEREPAIR: Dual-Memory Enhanced LLM-based Repository-Level Program Repair","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7","json":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7.json","graph_json":"https://pith.science/api/pith-number/SYODJXACIFMIBZ67H3A5K2W5B7/graph.json","events_json":"https://pith.science/api/pith-number/SYODJXACIFMIBZ67H3A5K2W5B7/events.json","paper":"https://pith.science/paper/SYODJXAC"},"agent_actions":{"view_html":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7","download_json":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7.json","view_paper":"https://pith.science/paper/SYODJXAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10462&json=true","fetch_graph":"https://pith.science/api/pith-number/SYODJXACIFMIBZ67H3A5K2W5B7/graph.json","fetch_events":"https://pith.science/api/pith-number/SYODJXACIFMIBZ67H3A5K2W5B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7/action/storage_attestation","attest_author":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7/action/author_attestation","sign_citation":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7/action/citation_signature","submit_replication":"https://pith.science/pith/SYODJXACIFMIBZ67H3A5K2W5B7/action/replication_record"}},"created_at":"2026-07-05T09:54:23.541782+00:00","updated_at":"2026-07-05T09:54:23.541782+00:00"}