{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YG5DI3DTF65RMSYS6PGTCKDVEA","short_pith_number":"pith:YG5DI3DT","schema_version":"1.0","canonical_sha256":"c1ba346c732fbb164b12f3cd31287520269caf6f427705732a250f0e5549acbe","source":{"kind":"arxiv","id":"2201.12872","version":1},"attestation_state":"computed","paper":{"title":"Discovering Invariant Rationales for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"An Zhang, Tat-Seng Chua, Xiangnan He, Xiang Wang, Ying-Xin Wu","submitted_at":"2022-01-30T16:43:40Z","abstract_excerpt":"Intrinsic interpretability of graph neural networks (GNNs) is to find a small subset of the input graph's features -- rationale -- which guides the model prediction. Unfortunately, the leading rationalization models often rely on data biases, especially shortcut features, to compose rationales and make predictions without probing the critical and causal patterns. Moreover, such data biases easily change outside the training distribution. As a result, these models suffer from a huge drop in interpretability and predictive performance on out-of-distribution data. In this work, we propose a new s"},"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":"2201.12872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-30T16:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"bffd31a2715217f531a9d7d2b55bdea4b2943f69546f034fd27efc879f1011f8","abstract_canon_sha256":"b8217a62d2b85e499972ec6baf6f8c691de63d989199d1185adaac91557157fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:40.644093Z","signature_b64":"pehH6w1bkZdHLkDw+X1lSEUs3WjtorpJC8a9NCM6RCrzEJieBfNFdnfOGPdfYXsYx9w1z7xwKnh5zhbwwFTZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1ba346c732fbb164b12f3cd31287520269caf6f427705732a250f0e5549acbe","last_reissued_at":"2026-07-05T03:52:40.643588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:40.643588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Invariant Rationales for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"An Zhang, Tat-Seng Chua, Xiangnan He, Xiang Wang, Ying-Xin Wu","submitted_at":"2022-01-30T16:43:40Z","abstract_excerpt":"Intrinsic interpretability of graph neural networks (GNNs) is to find a small subset of the input graph's features -- rationale -- which guides the model prediction. Unfortunately, the leading rationalization models often rely on data biases, especially shortcut features, to compose rationales and make predictions without probing the critical and causal patterns. Moreover, such data biases easily change outside the training distribution. As a result, these models suffer from a huge drop in interpretability and predictive performance on out-of-distribution data. In this work, we propose a new s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12872","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/2201.12872/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":"2201.12872","created_at":"2026-07-05T03:52:40.643651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12872v1","created_at":"2026-07-05T03:52:40.643651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12872","created_at":"2026-07-05T03:52:40.643651+00:00"},{"alias_kind":"pith_short_12","alias_value":"YG5DI3DTF65R","created_at":"2026-07-05T03:52:40.643651+00:00"},{"alias_kind":"pith_short_16","alias_value":"YG5DI3DTF65RMSYS","created_at":"2026-07-05T03:52:40.643651+00:00"},{"alias_kind":"pith_short_8","alias_value":"YG5DI3DT","created_at":"2026-07-05T03:52:40.643651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18287","citing_title":"Artemis: Anatomy-Resolved inTervention for Eliminating Multimodal NeuroImage confounderS","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05756","citing_title":"Beyond Soft Masks: Hard-Perturbation Mixup Explainer for Robust GNN Explainability","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19778","citing_title":"B-cos GNNs: Faithful Explanations through Dynamic Linearity","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19778","citing_title":"B-cos GNNs: Faithful Explanations through Dynamic Linearity","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03154","citing_title":"DSBD: Dual-Aligned Structural Basis Distillation for Graph Domain Adaptation","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26301","citing_title":"Cheeger--Hodge Contrastive Learning for Structurally Robust Graph Representation Learning","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08404","citing_title":"Adversarial Label Invariant Graph Data Augmentations for Out-of-Distribution Generalization","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA","json":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA.json","graph_json":"https://pith.science/api/pith-number/YG5DI3DTF65RMSYS6PGTCKDVEA/graph.json","events_json":"https://pith.science/api/pith-number/YG5DI3DTF65RMSYS6PGTCKDVEA/events.json","paper":"https://pith.science/paper/YG5DI3DT"},"agent_actions":{"view_html":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA","download_json":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA.json","view_paper":"https://pith.science/paper/YG5DI3DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12872&json=true","fetch_graph":"https://pith.science/api/pith-number/YG5DI3DTF65RMSYS6PGTCKDVEA/graph.json","fetch_events":"https://pith.science/api/pith-number/YG5DI3DTF65RMSYS6PGTCKDVEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA/action/storage_attestation","attest_author":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA/action/author_attestation","sign_citation":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA/action/citation_signature","submit_replication":"https://pith.science/pith/YG5DI3DTF65RMSYS6PGTCKDVEA/action/replication_record"}},"created_at":"2026-07-05T03:52:40.643651+00:00","updated_at":"2026-07-05T03:52:40.643651+00:00"}