{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VD6I2VNXXRZDEWOUOBPLOMQRVF","short_pith_number":"pith:VD6I2VNX","schema_version":"1.0","canonical_sha256":"a8fc8d55b7bc723259d4705eb73211a95ccebdd02832954ae01b45f8a155e564","source":{"kind":"arxiv","id":"2606.06254","version":1},"attestation_state":"computed","paper":{"title":"SecRL-Prune: Structured Reinforcement Learning-Based Pruning of CodeLLMs for Preserving Adversarial Code Mutation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Khalil El-Khatib, Parsa Memarzadehsaghezi, Pooria Madani","submitted_at":"2026-06-04T14:55:14Z","abstract_excerpt":"Large code language models (CodeLLMs) can generate and rewrite programs, enabling functionality-preserving code mutation that may be used to create diverse malware variants and evade signature-based detection. A key security question is whether this mutation capability survives model compression, which would make deployment feasible under limited hardware budgets. We propose SecRL-Prune, a structured pruning framework for CodeLLMs that operates on feed-forward (MLP/FFN) channels. Starting from a pretrained teacher, it learns a layer-wise pruning policy with reinforcement learning using a teach"},"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":"2606.06254","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-06-04T14:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"89e48fc78d788ba9a8aa293d418400996836bf863321c96702654152f42eeb12","abstract_canon_sha256":"136edba6265336822844e0c067926dcc12537171f3341e18e25d46758f0154c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:39.380970Z","signature_b64":"unqQNB5yKgTQBIR0IZl7jDlr0j/PoiBEoLejZWi5DTWCN4msCFkyGSsseUVyL1/eXAsHmbECTI5Erckzz/khAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fc8d55b7bc723259d4705eb73211a95ccebdd02832954ae01b45f8a155e564","last_reissued_at":"2026-06-05T01:15:39.380405Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:39.380405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SecRL-Prune: Structured Reinforcement Learning-Based Pruning of CodeLLMs for Preserving Adversarial Code Mutation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Khalil El-Khatib, Parsa Memarzadehsaghezi, Pooria Madani","submitted_at":"2026-06-04T14:55:14Z","abstract_excerpt":"Large code language models (CodeLLMs) can generate and rewrite programs, enabling functionality-preserving code mutation that may be used to create diverse malware variants and evade signature-based detection. A key security question is whether this mutation capability survives model compression, which would make deployment feasible under limited hardware budgets. We propose SecRL-Prune, a structured pruning framework for CodeLLMs that operates on feed-forward (MLP/FFN) channels. Starting from a pretrained teacher, it learns a layer-wise pruning policy with reinforcement learning using a teach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06254","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/2606.06254/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":"2606.06254","created_at":"2026-06-05T01:15:39.380493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06254v1","created_at":"2026-06-05T01:15:39.380493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06254","created_at":"2026-06-05T01:15:39.380493+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD6I2VNXXRZD","created_at":"2026-06-05T01:15:39.380493+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD6I2VNXXRZDEWOU","created_at":"2026-06-05T01:15:39.380493+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD6I2VNX","created_at":"2026-06-05T01:15:39.380493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF","json":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF.json","graph_json":"https://pith.science/api/pith-number/VD6I2VNXXRZDEWOUOBPLOMQRVF/graph.json","events_json":"https://pith.science/api/pith-number/VD6I2VNXXRZDEWOUOBPLOMQRVF/events.json","paper":"https://pith.science/paper/VD6I2VNX"},"agent_actions":{"view_html":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF","download_json":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF.json","view_paper":"https://pith.science/paper/VD6I2VNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06254&json=true","fetch_graph":"https://pith.science/api/pith-number/VD6I2VNXXRZDEWOUOBPLOMQRVF/graph.json","fetch_events":"https://pith.science/api/pith-number/VD6I2VNXXRZDEWOUOBPLOMQRVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF/action/storage_attestation","attest_author":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF/action/author_attestation","sign_citation":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF/action/citation_signature","submit_replication":"https://pith.science/pith/VD6I2VNXXRZDEWOUOBPLOMQRVF/action/replication_record"}},"created_at":"2026-06-05T01:15:39.380493+00:00","updated_at":"2026-06-05T01:15:39.380493+00:00"}