{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U7MQGTMIWSDSGZDIURPIVSX6ZN","short_pith_number":"pith:U7MQGTMI","schema_version":"1.0","canonical_sha256":"a7d9034d88b487236468a45e8acafecb44eac5910280f68adbb96c8014d22847","source":{"kind":"arxiv","id":"2206.04355","version":1},"attestation_state":"computed","paper":{"title":"Graph Attention Multi-Layer Perceptron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wen Ouyang, Wentao Zhang, Xiaosen Li, Yang Li, Yangyu Tao, Zeang Sheng, Zhi Yang, Ziqi Yin","submitted_at":"2022-06-09T08:56:11Z","abstract_excerpt":"Graph neural networks (GNNs) have achieved great success in many graph-based applications. However, the enormous size and high sparsity level of graphs hinder their applications under industrial scenarios. Although some scalable GNNs are proposed for large-scale graphs, they adopt a fixed $K$-hop neighborhood for each node, thus facing the over-smoothing issue when adopting large propagation depths for nodes within sparse regions. To tackle the above issue, we propose a new GNN architecture -- Graph Attention Multi-Layer Perceptron (GAMLP), which can capture the underlying correlations between"},"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.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T08:56:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a467519c54a340816b219d9220609d39130d2ede3f34c0c4f7c5f51c9c0245ca","abstract_canon_sha256":"41d5d14cf383801e5e57858b842f317675cad3f680c209480a00779fd279860d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:26.083510Z","signature_b64":"Mrt89by1aPzxatw0TKGWqm/BntVr9YKkbMB62BlVENtCHceEA2k51YO0BCmBBS0dc7s8LLVtJwQU6aNefHcqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d9034d88b487236468a45e8acafecb44eac5910280f68adbb96c8014d22847","last_reissued_at":"2026-07-05T04:30:26.083113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:26.083113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Attention Multi-Layer Perceptron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wen Ouyang, Wentao Zhang, Xiaosen Li, Yang Li, Yangyu Tao, Zeang Sheng, Zhi Yang, Ziqi Yin","submitted_at":"2022-06-09T08:56:11Z","abstract_excerpt":"Graph neural networks (GNNs) have achieved great success in many graph-based applications. However, the enormous size and high sparsity level of graphs hinder their applications under industrial scenarios. Although some scalable GNNs are proposed for large-scale graphs, they adopt a fixed $K$-hop neighborhood for each node, thus facing the over-smoothing issue when adopting large propagation depths for nodes within sparse regions. To tackle the above issue, we propose a new GNN architecture -- Graph Attention Multi-Layer Perceptron (GAMLP), which can capture the underlying correlations between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04355","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/2206.04355/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.04355","created_at":"2026-07-05T04:30:26.083167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.04355v1","created_at":"2026-07-05T04:30:26.083167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04355","created_at":"2026-07-05T04:30:26.083167+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7MQGTMIWSDS","created_at":"2026-07-05T04:30:26.083167+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7MQGTMIWSDSGZDI","created_at":"2026-07-05T04:30:26.083167+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7MQGTMI","created_at":"2026-07-05T04:30:26.083167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN","json":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN.json","graph_json":"https://pith.science/api/pith-number/U7MQGTMIWSDSGZDIURPIVSX6ZN/graph.json","events_json":"https://pith.science/api/pith-number/U7MQGTMIWSDSGZDIURPIVSX6ZN/events.json","paper":"https://pith.science/paper/U7MQGTMI"},"agent_actions":{"view_html":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN","download_json":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN.json","view_paper":"https://pith.science/paper/U7MQGTMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.04355&json=true","fetch_graph":"https://pith.science/api/pith-number/U7MQGTMIWSDSGZDIURPIVSX6ZN/graph.json","fetch_events":"https://pith.science/api/pith-number/U7MQGTMIWSDSGZDIURPIVSX6ZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN/action/storage_attestation","attest_author":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN/action/author_attestation","sign_citation":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN/action/citation_signature","submit_replication":"https://pith.science/pith/U7MQGTMIWSDSGZDIURPIVSX6ZN/action/replication_record"}},"created_at":"2026-07-05T04:30:26.083167+00:00","updated_at":"2026-07-05T04:30:26.083167+00:00"}