{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J3G6XNNZ4JPWROIVRZADKXOABM","short_pith_number":"pith:J3G6XNNZ","schema_version":"1.0","canonical_sha256":"4ecdebb5b9e25f68b9158e40355dc00b063101802009f7d9f1b193af0c1164a0","source":{"kind":"arxiv","id":"2007.00119","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Networks Including Sparse Interpretability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Lin, Gerald J. Sun, Jonathan R. Dry, Krishna C. Bulusu, Marylens Hernandez","submitted_at":"2020-06-30T21:35:55Z","abstract_excerpt":"Graph Neural Networks (GNNs) are versatile, powerful machine learning methods that enable graph structure and feature representation learning, and have applications across many domains. For applications critically requiring interpretation, attention-based GNNs have been leveraged. However, these approaches either rely on specific model architectures or lack a joint consideration of graph structure and node features in their interpretation. Here we present a model-agnostic framework for interpreting important graph structure and node features, Graph neural networks Including SparSe inTerpretabi"},"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":"2007.00119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-30T21:35:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d9a88b118c4f98d4eb9a46e23c097e9042e92aa4ddca991a6bc4eaebd5ff39b5","abstract_canon_sha256":"afde19cbc651596f5611dc6ede87ff35315dc2cc3cc3c932e479d4f22a4b4e5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:28.299907Z","signature_b64":"12osJQuWnU3/8P8kyyJPMqzwAI/9X+bBYuVhKg+ufAJWlvzJHVcRWODRwrHKnRmQfixjPYvPWPL32+ENOja1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ecdebb5b9e25f68b9158e40355dc00b063101802009f7d9f1b193af0c1164a0","last_reissued_at":"2026-07-05T01:15:28.299500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:28.299500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks Including Sparse Interpretability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Lin, Gerald J. Sun, Jonathan R. Dry, Krishna C. Bulusu, Marylens Hernandez","submitted_at":"2020-06-30T21:35:55Z","abstract_excerpt":"Graph Neural Networks (GNNs) are versatile, powerful machine learning methods that enable graph structure and feature representation learning, and have applications across many domains. For applications critically requiring interpretation, attention-based GNNs have been leveraged. However, these approaches either rely on specific model architectures or lack a joint consideration of graph structure and node features in their interpretation. Here we present a model-agnostic framework for interpreting important graph structure and node features, Graph neural networks Including SparSe inTerpretabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00119","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/2007.00119/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":"2007.00119","created_at":"2026-07-05T01:15:28.299560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00119v1","created_at":"2026-07-05T01:15:28.299560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00119","created_at":"2026-07-05T01:15:28.299560+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3G6XNNZ4JPW","created_at":"2026-07-05T01:15:28.299560+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3G6XNNZ4JPWROIV","created_at":"2026-07-05T01:15:28.299560+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3G6XNNZ","created_at":"2026-07-05T01:15:28.299560+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM","json":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM.json","graph_json":"https://pith.science/api/pith-number/J3G6XNNZ4JPWROIVRZADKXOABM/graph.json","events_json":"https://pith.science/api/pith-number/J3G6XNNZ4JPWROIVRZADKXOABM/events.json","paper":"https://pith.science/paper/J3G6XNNZ"},"agent_actions":{"view_html":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM","download_json":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM.json","view_paper":"https://pith.science/paper/J3G6XNNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00119&json=true","fetch_graph":"https://pith.science/api/pith-number/J3G6XNNZ4JPWROIVRZADKXOABM/graph.json","fetch_events":"https://pith.science/api/pith-number/J3G6XNNZ4JPWROIVRZADKXOABM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM/action/storage_attestation","attest_author":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM/action/author_attestation","sign_citation":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM/action/citation_signature","submit_replication":"https://pith.science/pith/J3G6XNNZ4JPWROIVRZADKXOABM/action/replication_record"}},"created_at":"2026-07-05T01:15:28.299560+00:00","updated_at":"2026-07-05T01:15:28.299560+00:00"}