{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VKK44NASTUDQT26LREOBVSQD3W","short_pith_number":"pith:VKK44NAS","schema_version":"1.0","canonical_sha256":"aa95ce34129d0709ebcb891c1aca03ddb65c4393d246a2b8690d1b0d208738e0","source":{"kind":"arxiv","id":"2412.13737","version":1},"attestation_state":"computed","paper":{"title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.PF"],"primary_cat":"cs.SE","authors_text":"Antinisca Di Marco, Federica Sarro, Giordano d'Aloisio, Luca Traini","submitted_at":"2024-12-18T11:14:30Z","abstract_excerpt":"Language models have proven successful across a wide range of software engineering tasks, but their significant computational costs often hinder their practical adoption. To address this challenge, researchers have begun applying various compression strategies to improve the efficiency of language models for code. These strategies aim to optimize inference latency and memory usage, though often at the cost of reduced model effectiveness. However, there is still a significant gap in understanding how these strategies influence the efficiency and effectiveness of language models for code. Here, "},"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":"2412.13737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-12-18T11:14:30Z","cross_cats_sorted":["cs.AI","cs.PF"],"title_canon_sha256":"ed47ceb0e6780c972fae599ed888f44a9f8dfc21a502d60c72cd0b6028dd90f8","abstract_canon_sha256":"a1eaff4a492b696b8a52f79f5addb81af6c26721411574f815f0271dd75beb45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:07.312500Z","signature_b64":"f38gZ+wtWaJM6C+EiOnEHma6C9oQ430bBfyCqmSIQBZ9JaQOLGkLy4YWbEsYX0gHc2R+QSaZb22R/233PHonBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa95ce34129d0709ebcb891c1aca03ddb65c4393d246a2b8690d1b0d208738e0","last_reissued_at":"2026-07-05T09:51:07.311955Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:07.311955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.PF"],"primary_cat":"cs.SE","authors_text":"Antinisca Di Marco, Federica Sarro, Giordano d'Aloisio, Luca Traini","submitted_at":"2024-12-18T11:14:30Z","abstract_excerpt":"Language models have proven successful across a wide range of software engineering tasks, but their significant computational costs often hinder their practical adoption. To address this challenge, researchers have begun applying various compression strategies to improve the efficiency of language models for code. These strategies aim to optimize inference latency and memory usage, though often at the cost of reduced model effectiveness. However, there is still a significant gap in understanding how these strategies influence the efficiency and effectiveness of language models for code. Here, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13737","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/2412.13737/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":"2412.13737","created_at":"2026-07-05T09:51:07.312016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.13737v1","created_at":"2026-07-05T09:51:07.312016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13737","created_at":"2026-07-05T09:51:07.312016+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKK44NASTUDQ","created_at":"2026-07-05T09:51:07.312016+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKK44NASTUDQT26L","created_at":"2026-07-05T09:51:07.312016+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKK44NAS","created_at":"2026-07-05T09:51:07.312016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.03949","citing_title":"Model Compression vs. Adversarial Robustness: An Empirical Study on Language Models for Code","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2511.05476","citing_title":"A Metamorphic Testing Perspective on Knowledge Distillation for Language Models of Code: Does the Student Deeply Mimic the Teacher?","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W","json":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W.json","graph_json":"https://pith.science/api/pith-number/VKK44NASTUDQT26LREOBVSQD3W/graph.json","events_json":"https://pith.science/api/pith-number/VKK44NASTUDQT26LREOBVSQD3W/events.json","paper":"https://pith.science/paper/VKK44NAS"},"agent_actions":{"view_html":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W","download_json":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W.json","view_paper":"https://pith.science/paper/VKK44NAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.13737&json=true","fetch_graph":"https://pith.science/api/pith-number/VKK44NASTUDQT26LREOBVSQD3W/graph.json","fetch_events":"https://pith.science/api/pith-number/VKK44NASTUDQT26LREOBVSQD3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W/action/storage_attestation","attest_author":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W/action/author_attestation","sign_citation":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W/action/citation_signature","submit_replication":"https://pith.science/pith/VKK44NASTUDQT26LREOBVSQD3W/action/replication_record"}},"created_at":"2026-07-05T09:51:07.312016+00:00","updated_at":"2026-07-05T09:51:07.312016+00:00"}