{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J5W2DGLWZRY44NRA7RHQKDAS4S","short_pith_number":"pith:J5W2DGLW","schema_version":"1.0","canonical_sha256":"4f6da19976cc71ce3620fc4f050c12e4a23a807c8095be9e88174195a03938ac","source":{"kind":"arxiv","id":"2205.05348","version":1},"attestation_state":"computed","paper":{"title":"NDGGNET-A Node Independent Gate based Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changping Peng, Xinrui Liu, Xiwei Zhao, Xuesong Yang, Ye Tang, Zhangang Lin","submitted_at":"2022-05-11T08:51:04Z","abstract_excerpt":"Graph Neural Networks (GNNs) is an architecture for structural data, and has been adopted in a mass of tasks and achieved fabulous results, such as link prediction, node classification, graph classification and so on. Generally, for a certain node in a given graph, a traditional GNN layer can be regarded as an aggregation from one-hop neighbors, thus a set of stacked layers are able to fetch and update node status within multi-hops. For nodes with sparse connectivity, it is difficult to obtain enough information through a single GNN layer as not only there are only few nodes directly connected"},"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":"2205.05348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-11T08:51:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"20150e7efb3602c7db099b4dfad4167684f36e7a241302193dc74a69a83a328b","abstract_canon_sha256":"4010d4cb8b7a1434162022880ca6cf9ba7a911f5a0418d4b6f5109742afe56eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:24.926182Z","signature_b64":"un30G4ghAIq5tSuCK11Pr/477n4iRxzGF2Mwmv00GkqOAZ4oH+bVqCWgOIiHQwJRBuJOuZmQtoNaViyatpnyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6da19976cc71ce3620fc4f050c12e4a23a807c8095be9e88174195a03938ac","last_reissued_at":"2026-07-05T04:22:24.925832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:24.925832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NDGGNET-A Node Independent Gate based Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changping Peng, Xinrui Liu, Xiwei Zhao, Xuesong Yang, Ye Tang, Zhangang Lin","submitted_at":"2022-05-11T08:51:04Z","abstract_excerpt":"Graph Neural Networks (GNNs) is an architecture for structural data, and has been adopted in a mass of tasks and achieved fabulous results, such as link prediction, node classification, graph classification and so on. Generally, for a certain node in a given graph, a traditional GNN layer can be regarded as an aggregation from one-hop neighbors, thus a set of stacked layers are able to fetch and update node status within multi-hops. For nodes with sparse connectivity, it is difficult to obtain enough information through a single GNN layer as not only there are only few nodes directly connected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.05348","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/2205.05348/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":"2205.05348","created_at":"2026-07-05T04:22:24.925890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.05348v1","created_at":"2026-07-05T04:22:24.925890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.05348","created_at":"2026-07-05T04:22:24.925890+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5W2DGLWZRY4","created_at":"2026-07-05T04:22:24.925890+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5W2DGLWZRY44NRA","created_at":"2026-07-05T04:22:24.925890+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5W2DGLW","created_at":"2026-07-05T04:22:24.925890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S","json":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S.json","graph_json":"https://pith.science/api/pith-number/J5W2DGLWZRY44NRA7RHQKDAS4S/graph.json","events_json":"https://pith.science/api/pith-number/J5W2DGLWZRY44NRA7RHQKDAS4S/events.json","paper":"https://pith.science/paper/J5W2DGLW"},"agent_actions":{"view_html":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S","download_json":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S.json","view_paper":"https://pith.science/paper/J5W2DGLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.05348&json=true","fetch_graph":"https://pith.science/api/pith-number/J5W2DGLWZRY44NRA7RHQKDAS4S/graph.json","fetch_events":"https://pith.science/api/pith-number/J5W2DGLWZRY44NRA7RHQKDAS4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S/action/storage_attestation","attest_author":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S/action/author_attestation","sign_citation":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S/action/citation_signature","submit_replication":"https://pith.science/pith/J5W2DGLWZRY44NRA7RHQKDAS4S/action/replication_record"}},"created_at":"2026-07-05T04:22:24.925890+00:00","updated_at":"2026-07-05T04:22:24.925890+00:00"}