{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UCDR66OJLQYDBPZKVE5ID4DVNG","short_pith_number":"pith:UCDR66OJ","schema_version":"1.0","canonical_sha256":"a0871f79c95c3030bf2aa93a81f07569bc5925e53ea8613d3b7a4a83ff100ba9","source":{"kind":"arxiv","id":"2506.01662","version":1},"attestation_state":"computed","paper":{"title":"Explainable AI Systems Must Be Contestable: Here's How to Make It Happen","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CY","authors_text":"Anna Palatkina, Catarina Moreira, Dacia Braca, Dylan M. Walsh, Fang Chen, Nina C. Hubig, Peter J. Leihn","submitted_at":"2025-06-02T13:32:05Z","abstract_excerpt":"As AI regulations around the world intensify their focus on system safety, contestability has become a mandatory, yet ill-defined, safeguard. In XAI, \"contestability\" remains an empty promise: no formal definition exists, no algorithm guarantees it, and practitioners lack concrete guidance to satisfy regulatory requirements. Grounded in a systematic literature review, this paper presents the first rigorous formal definition of contestability in explainable AI, directly aligned with stakeholder requirements and regulatory mandates. We introduce a modular framework of by-design and post-hoc mech"},"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":"2506.01662","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CY","submitted_at":"2025-06-02T13:32:05Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e4d250fcd34b6f2b0bc10c21dc4ec3093450cbe42a283377a7ec76801589057f","abstract_canon_sha256":"1b1a2e62d69d1174159b41418bf2cf016e3f79742cc2395a59c58504e410e481"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:17.472106Z","signature_b64":"gCgn5KKw5i9f8cqFFxDrUmlJXu0R5ekAozSIec/dVqK3z3mvd3qAC3sBogMaSRGEI2MrYjjxUqBLm/EOdb1eCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0871f79c95c3030bf2aa93a81f07569bc5925e53ea8613d3b7a4a83ff100ba9","last_reissued_at":"2026-07-05T11:14:17.471650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:17.471650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explainable AI Systems Must Be Contestable: Here's How to Make It Happen","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CY","authors_text":"Anna Palatkina, Catarina Moreira, Dacia Braca, Dylan M. Walsh, Fang Chen, Nina C. Hubig, Peter J. Leihn","submitted_at":"2025-06-02T13:32:05Z","abstract_excerpt":"As AI regulations around the world intensify their focus on system safety, contestability has become a mandatory, yet ill-defined, safeguard. In XAI, \"contestability\" remains an empty promise: no formal definition exists, no algorithm guarantees it, and practitioners lack concrete guidance to satisfy regulatory requirements. Grounded in a systematic literature review, this paper presents the first rigorous formal definition of contestability in explainable AI, directly aligned with stakeholder requirements and regulatory mandates. We introduce a modular framework of by-design and post-hoc mech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01662","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/2506.01662/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":"2506.01662","created_at":"2026-07-05T11:14:17.471708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01662v1","created_at":"2026-07-05T11:14:17.471708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01662","created_at":"2026-07-05T11:14:17.471708+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCDR66OJLQYD","created_at":"2026-07-05T11:14:17.471708+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCDR66OJLQYDBPZK","created_at":"2026-07-05T11:14:17.471708+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCDR66OJ","created_at":"2026-07-05T11:14:17.471708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16041","citing_title":"Explainable AI Isn't Enough! Rethinking Algorithmic Contestability","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG","json":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG.json","graph_json":"https://pith.science/api/pith-number/UCDR66OJLQYDBPZKVE5ID4DVNG/graph.json","events_json":"https://pith.science/api/pith-number/UCDR66OJLQYDBPZKVE5ID4DVNG/events.json","paper":"https://pith.science/paper/UCDR66OJ"},"agent_actions":{"view_html":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG","download_json":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG.json","view_paper":"https://pith.science/paper/UCDR66OJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01662&json=true","fetch_graph":"https://pith.science/api/pith-number/UCDR66OJLQYDBPZKVE5ID4DVNG/graph.json","fetch_events":"https://pith.science/api/pith-number/UCDR66OJLQYDBPZKVE5ID4DVNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG/action/storage_attestation","attest_author":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG/action/author_attestation","sign_citation":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG/action/citation_signature","submit_replication":"https://pith.science/pith/UCDR66OJLQYDBPZKVE5ID4DVNG/action/replication_record"}},"created_at":"2026-07-05T11:14:17.471708+00:00","updated_at":"2026-07-05T11:14:17.471708+00:00"}