{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SRAJRZRJU3RFFPJURUYGO6K3HG","short_pith_number":"pith:SRAJRZRJ","schema_version":"1.0","canonical_sha256":"944098e629a6e252bd348d3067795b39898b3f3e65a3ff3a25bbc2ffe047e7d4","source":{"kind":"arxiv","id":"2404.01226","version":1},"attestation_state":"computed","paper":{"title":"Stable Code Technical Report","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ashish Datta, Carlos Riquelme, Dakota Mahan, Duy Phung, James Baicoianu, Jonathan Tow, Maksym Zhuravinskyi, Marco Bellagente, Nathan Cooper, Nikhil Pinnaparaju, Reshinth Adithyan","submitted_at":"2024-04-01T16:39:36Z","abstract_excerpt":"We introduce Stable Code, the first in our new-generation of code language models series, which serves as a general-purpose base code language model targeting code completion, reasoning, math, and other software engineering-based tasks. Additionally, we introduce an instruction variant named Stable Code Instruct that allows conversing with the model in a natural chat interface for performing question-answering and instruction-based tasks. In this technical report, we detail the data and training procedure leading to both models. Their weights are available via Hugging Face for anyone to downlo"},"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":"2404.01226","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-01T16:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"b4be7a7333ceb62ff5b7e8754ad4020b2153000417fea039d0649eabebe2740f","abstract_canon_sha256":"f707d613a36e626c480d8b1d3f054f1bf4517b292e69a492467555c3b1e1a57a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:02.967835Z","signature_b64":"d25MljN/EHE6AxIT3dYJ+KXeLqQc9cGA3Er2/hOKL/ng9wzTh01lpprGxvz+6IZbP1+JjQq0qpCmTbmfa0atBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"944098e629a6e252bd348d3067795b39898b3f3e65a3ff3a25bbc2ffe047e7d4","last_reissued_at":"2026-07-05T08:03:02.967345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:02.967345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable Code Technical Report","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ashish Datta, Carlos Riquelme, Dakota Mahan, Duy Phung, James Baicoianu, Jonathan Tow, Maksym Zhuravinskyi, Marco Bellagente, Nathan Cooper, Nikhil Pinnaparaju, Reshinth Adithyan","submitted_at":"2024-04-01T16:39:36Z","abstract_excerpt":"We introduce Stable Code, the first in our new-generation of code language models series, which serves as a general-purpose base code language model targeting code completion, reasoning, math, and other software engineering-based tasks. Additionally, we introduce an instruction variant named Stable Code Instruct that allows conversing with the model in a natural chat interface for performing question-answering and instruction-based tasks. In this technical report, we detail the data and training procedure leading to both models. Their weights are available via Hugging Face for anyone to downlo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.01226","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/2404.01226/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":"2404.01226","created_at":"2026-07-05T08:03:02.967402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.01226v1","created_at":"2026-07-05T08:03:02.967402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.01226","created_at":"2026-07-05T08:03:02.967402+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRAJRZRJU3RF","created_at":"2026-07-05T08:03:02.967402+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRAJRZRJU3RFFPJU","created_at":"2026-07-05T08:03:02.967402+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRAJRZRJ","created_at":"2026-07-05T08:03:02.967402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15865","citing_title":"From Text to DSL: Evaluating Grammar-Based Model Generation Using Open LLMs","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2406.00515","citing_title":"A Survey on Large Language Models for Code Generation","ref_index":215,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG","json":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG.json","graph_json":"https://pith.science/api/pith-number/SRAJRZRJU3RFFPJURUYGO6K3HG/graph.json","events_json":"https://pith.science/api/pith-number/SRAJRZRJU3RFFPJURUYGO6K3HG/events.json","paper":"https://pith.science/paper/SRAJRZRJ"},"agent_actions":{"view_html":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG","download_json":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG.json","view_paper":"https://pith.science/paper/SRAJRZRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.01226&json=true","fetch_graph":"https://pith.science/api/pith-number/SRAJRZRJU3RFFPJURUYGO6K3HG/graph.json","fetch_events":"https://pith.science/api/pith-number/SRAJRZRJU3RFFPJURUYGO6K3HG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG/action/storage_attestation","attest_author":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG/action/author_attestation","sign_citation":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG/action/citation_signature","submit_replication":"https://pith.science/pith/SRAJRZRJU3RFFPJURUYGO6K3HG/action/replication_record"}},"created_at":"2026-07-05T08:03:02.967402+00:00","updated_at":"2026-07-05T08:03:02.967402+00:00"}