{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W5OZFMWU325SDIMXXFMXUIRS5J","short_pith_number":"pith:W5OZFMWU","schema_version":"1.0","canonical_sha256":"b75d92b2d4debb21a197b9597a2232ea7eb2f7ead9adebfea6041f685e93e3ea","source":{"kind":"arxiv","id":"2502.14910","version":3},"attestation_state":"computed","paper":{"title":"EvoP: Robust LLM Inference via Evolutionary Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chun Jason Xue, Hongchao Du, Nan Guan, Shangyu Wu, Shuai Chen, Tei-Wei Kuo, Ying Xiong","submitted_at":"2025-02-19T06:33:59Z","abstract_excerpt":"Large Language Models (LLMs) have achieved remarkable success in natural language processing tasks, but their massive size and computational demands hinder their deployment in resource-constrained environments. Existing model pruning methods address this issue by removing redundant structures (e.g., elements, channels, layers) from the model. However, these methods employ a heuristic pruning strategy, which leads to suboptimal performance. Besides, they also ignore the data characteristics when pruning the model.\n  To overcome these limitations, we propose EvoP, an evolutionary pruning framewo"},"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":"2502.14910","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-19T06:33:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bbd976c0de428fe3de1087750a7be7f853183e9f129b6e8a87b84e482ae94a62","abstract_canon_sha256":"104f3bce111f27663c43a525d913d3b54eb0289f23d502fb3a6e91aa3a5edc99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:59.608545Z","signature_b64":"XBBeYtiXH4gLOUVEE1n9UcfIPSPqb+9dSXjBdckzL1EG9ypJEYjBxgWu9PF2jLBzRzufRtqt0DlpGHEW4ortAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b75d92b2d4debb21a197b9597a2232ea7eb2f7ead9adebfea6041f685e93e3ea","last_reissued_at":"2026-07-05T11:52:59.608078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:59.608078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EvoP: Robust LLM Inference via Evolutionary Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chun Jason Xue, Hongchao Du, Nan Guan, Shangyu Wu, Shuai Chen, Tei-Wei Kuo, Ying Xiong","submitted_at":"2025-02-19T06:33:59Z","abstract_excerpt":"Large Language Models (LLMs) have achieved remarkable success in natural language processing tasks, but their massive size and computational demands hinder their deployment in resource-constrained environments. Existing model pruning methods address this issue by removing redundant structures (e.g., elements, channels, layers) from the model. However, these methods employ a heuristic pruning strategy, which leads to suboptimal performance. Besides, they also ignore the data characteristics when pruning the model.\n  To overcome these limitations, we propose EvoP, an evolutionary pruning framewo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14910","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/2502.14910/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":"2502.14910","created_at":"2026-07-05T11:52:59.608138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.14910v3","created_at":"2026-07-05T11:52:59.608138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14910","created_at":"2026-07-05T11:52:59.608138+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5OZFMWU325S","created_at":"2026-07-05T11:52:59.608138+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5OZFMWU325SDIMX","created_at":"2026-07-05T11:52:59.608138+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5OZFMWU","created_at":"2026-07-05T11:52:59.608138+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10059","citing_title":"GeLaCo: An Evolutionary Approach to Layer Compression","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J","json":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J.json","graph_json":"https://pith.science/api/pith-number/W5OZFMWU325SDIMXXFMXUIRS5J/graph.json","events_json":"https://pith.science/api/pith-number/W5OZFMWU325SDIMXXFMXUIRS5J/events.json","paper":"https://pith.science/paper/W5OZFMWU"},"agent_actions":{"view_html":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J","download_json":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J.json","view_paper":"https://pith.science/paper/W5OZFMWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.14910&json=true","fetch_graph":"https://pith.science/api/pith-number/W5OZFMWU325SDIMXXFMXUIRS5J/graph.json","fetch_events":"https://pith.science/api/pith-number/W5OZFMWU325SDIMXXFMXUIRS5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J/action/storage_attestation","attest_author":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J/action/author_attestation","sign_citation":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J/action/citation_signature","submit_replication":"https://pith.science/pith/W5OZFMWU325SDIMXXFMXUIRS5J/action/replication_record"}},"created_at":"2026-07-05T11:52:59.608138+00:00","updated_at":"2026-07-05T11:52:59.608138+00:00"}