{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WJ2OJVP7NLGU7CDKOTMS3MMBCA","short_pith_number":"pith:WJ2OJVP7","schema_version":"1.0","canonical_sha256":"b274e4d5ff6acd4f886a74d92db18110091517210d29ac948155784b19eb96b4","source":{"kind":"arxiv","id":"2206.09677","version":5},"attestation_state":"computed","paper":{"title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ce Zhang, Kenza Amara, Rex Ying, Sebastian Schemm, Ulrik Brandes, Yinan Shan, Zhihao Han, Zitao Zhang","submitted_at":"2022-06-20T09:33:12Z","abstract_excerpt":"As one of the most popular machine learning models today, graph neural networks (GNNs) have attracted intense interest recently, and so does their explainability. Users are increasingly interested in a better understanding of GNN models and their outcomes. Unfortunately, today's evaluation frameworks for GNN explainability often rely on few inadequate synthetic datasets, leading to conclusions of limited scope due to a lack of complexity in the problem instances. As GNN models are deployed to more mission-critical applications, we are in dire need for a common evaluation protocol of explainabi"},"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":"2206.09677","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-20T09:33:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a0c8ae460edcfe597e552b0364a0533478e090ba4ebdd8dd5700e65e759db13","abstract_canon_sha256":"13d8d1824d277bec0c7cce5ed42e7d883fcc7c3e7b514e9974a45246bbea3a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:36.514596Z","signature_b64":"vGlrwzbmF+b6VDKu26+rxTL05s2+G0t8QA0VGVgnabxxTAGgfePAasFX3fq7VLJd0EEXeZjzxaAnRbdH6gXmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b274e4d5ff6acd4f886a74d92db18110091517210d29ac948155784b19eb96b4","last_reissued_at":"2026-07-05T08:21:36.514109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:36.514109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ce Zhang, Kenza Amara, Rex Ying, Sebastian Schemm, Ulrik Brandes, Yinan Shan, Zhihao Han, Zitao Zhang","submitted_at":"2022-06-20T09:33:12Z","abstract_excerpt":"As one of the most popular machine learning models today, graph neural networks (GNNs) have attracted intense interest recently, and so does their explainability. Users are increasingly interested in a better understanding of GNN models and their outcomes. Unfortunately, today's evaluation frameworks for GNN explainability often rely on few inadequate synthetic datasets, leading to conclusions of limited scope due to a lack of complexity in the problem instances. As GNN models are deployed to more mission-critical applications, we are in dire need for a common evaluation protocol of explainabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09677","kind":"arxiv","version":5},"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/2206.09677/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":"2206.09677","created_at":"2026-07-05T08:21:36.514163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09677v5","created_at":"2026-07-05T08:21:36.514163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09677","created_at":"2026-07-05T08:21:36.514163+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJ2OJVP7NLGU","created_at":"2026-07-05T08:21:36.514163+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJ2OJVP7NLGU7CDK","created_at":"2026-07-05T08:21:36.514163+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJ2OJVP7","created_at":"2026-07-05T08:21:36.514163+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.32016","citing_title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","ref_index":214,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25885","citing_title":"Explainable AI for Jet Tagging: A Comparative Study of GNNExplainer, GNNShap, and GradCAM for Jet Tagging in the Lund Jet Plane","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20577","citing_title":"Evaluating Assurance Cases as Text-Attributed Graphs for Structure and Provenance Analysis","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19372","citing_title":"TACENR: Task-Agnostic Contrastive Explanations for Node Representations","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA","json":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA.json","graph_json":"https://pith.science/api/pith-number/WJ2OJVP7NLGU7CDKOTMS3MMBCA/graph.json","events_json":"https://pith.science/api/pith-number/WJ2OJVP7NLGU7CDKOTMS3MMBCA/events.json","paper":"https://pith.science/paper/WJ2OJVP7"},"agent_actions":{"view_html":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA","download_json":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA.json","view_paper":"https://pith.science/paper/WJ2OJVP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09677&json=true","fetch_graph":"https://pith.science/api/pith-number/WJ2OJVP7NLGU7CDKOTMS3MMBCA/graph.json","fetch_events":"https://pith.science/api/pith-number/WJ2OJVP7NLGU7CDKOTMS3MMBCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA/action/storage_attestation","attest_author":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA/action/author_attestation","sign_citation":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA/action/citation_signature","submit_replication":"https://pith.science/pith/WJ2OJVP7NLGU7CDKOTMS3MMBCA/action/replication_record"}},"created_at":"2026-07-05T08:21:36.514163+00:00","updated_at":"2026-07-05T08:21:36.514163+00:00"}