{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WEDNWF3BWJC4372CDGQBJ3XKRS","short_pith_number":"pith:WEDNWF3B","schema_version":"1.0","canonical_sha256":"b106db1761b245cdff4219a014eeea8cac2f89efe8ad6a29902cf414dd1e211b","source":{"kind":"arxiv","id":"2512.08967","version":2},"attestation_state":"computed","paper":{"title":"CluCERT: Certifying LLM Robustness via Clustering-Guided Denoising Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Gaojie Jin, Jia Hu, Ronghui Mu, Zixia Wang","submitted_at":"2025-12-01T21:13:44Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have led to their widespread adoption in daily applications. Despite their impressive capabilities, they remain vulnerable to adversarial attacks, as even minor meaning-preserving changes such as synonym substitutions can lead to incorrect predictions. As a result, certifying the robustness of LLMs against such adversarial prompts is of vital importance. Existing approaches focused on word deletion or simple denoising strategies to achieve robustness certification. However, these methods face two critical limitations: (1) they yield loose rob"},"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":"2512.08967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-12-01T21:13:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e5304b57684d126c354ed6b817d5e1663ce1802fe650414c01f14a36b207d83e","abstract_canon_sha256":"3e605b290ce952051b0140bf18b078248f2b516d476d81d1052ed9a9858ac7e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:20:41.138295Z","signature_b64":"7WeGFwP4AUAA40Ag9XYphAfrv6PIiQTEF6anz6oMLywcV86HbqLgKE6vkLf/d0e6UN8uqc7JlMRCF1+d4UPnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b106db1761b245cdff4219a014eeea8cac2f89efe8ad6a29902cf414dd1e211b","last_reissued_at":"2026-07-17T01:20:41.137395Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:20:41.137395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CluCERT: Certifying LLM Robustness via Clustering-Guided Denoising Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Gaojie Jin, Jia Hu, Ronghui Mu, Zixia Wang","submitted_at":"2025-12-01T21:13:44Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have led to their widespread adoption in daily applications. Despite their impressive capabilities, they remain vulnerable to adversarial attacks, as even minor meaning-preserving changes such as synonym substitutions can lead to incorrect predictions. As a result, certifying the robustness of LLMs against such adversarial prompts is of vital importance. Existing approaches focused on word deletion or simple denoising strategies to achieve robustness certification. However, these methods face two critical limitations: (1) they yield loose rob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08967","kind":"arxiv","version":2},"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/2512.08967/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":"2512.08967","created_at":"2026-07-17T01:20:41.137807+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.08967v2","created_at":"2026-07-17T01:20:41.137807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08967","created_at":"2026-07-17T01:20:41.137807+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEDNWF3BWJC4","created_at":"2026-07-17T01:20:41.137807+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEDNWF3BWJC4372C","created_at":"2026-07-17T01:20:41.137807+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEDNWF3B","created_at":"2026-07-17T01:20:41.137807+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.28716","citing_title":"TrajRS: Towards Certified Robustness in Pedestrian Trajectory Prediction","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18672","citing_title":"Position: A Three-Layer Probabilistic Assume-Guarantee Architecture Is Structurally Required for Safe LLM Agent Deployment","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS","json":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS.json","graph_json":"https://pith.science/api/pith-number/WEDNWF3BWJC4372CDGQBJ3XKRS/graph.json","events_json":"https://pith.science/api/pith-number/WEDNWF3BWJC4372CDGQBJ3XKRS/events.json","paper":"https://pith.science/paper/WEDNWF3B"},"agent_actions":{"view_html":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS","download_json":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS.json","view_paper":"https://pith.science/paper/WEDNWF3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.08967&json=true","fetch_graph":"https://pith.science/api/pith-number/WEDNWF3BWJC4372CDGQBJ3XKRS/graph.json","fetch_events":"https://pith.science/api/pith-number/WEDNWF3BWJC4372CDGQBJ3XKRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS/action/storage_attestation","attest_author":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS/action/author_attestation","sign_citation":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS/action/citation_signature","submit_replication":"https://pith.science/pith/WEDNWF3BWJC4372CDGQBJ3XKRS/action/replication_record"}},"created_at":"2026-07-17T01:20:41.137807+00:00","updated_at":"2026-07-17T01:20:41.137807+00:00"}