{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ALRRBOB7XHIK4ZY7UXJPRTPLIX","short_pith_number":"pith:ALRRBOB7","schema_version":"1.0","canonical_sha256":"02e310b83fb9d0ae671fa5d2f8cdeb45e6ece655420b8f5eaf584d271ddb8afa","source":{"kind":"arxiv","id":"2108.10097","version":3},"attestation_state":"computed","paper":{"title":"Graph Attention MLP with Reliable Label Utilization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wen Ouyang, Wentao Zhang, Xiaosen Li, Yangyu Tao, Zeang Sheng, Zhi Yang, Ziqi Yin","submitted_at":"2021-08-23T11:56:20Z","abstract_excerpt":"Graph neural networks (GNNs) have recently achieved state-of-the-art performance in many graph-based applications. Despite the high expressive power, they typically need to perform an expensive recursive neighborhood expansion in multiple training epochs and face a scalability issue. Moreover, most of them are inflexible since they are restricted to fixed-hop neighborhoods and insensitive to actual receptive field demands for different nodes. We circumvent these limitations by introducing a scalable and flexible Graph Attention Multilayer Perceptron (GAMLP). With the separation of the non-line"},"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":"2108.10097","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-08-23T11:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"fe0d00a483d24c06cdc05451c6c9eda60b2b2a80e414e73b9042284e7fe0912b","abstract_canon_sha256":"8e9cdfa5cfa1a32e1beb2497275ba493d22409d6fcad72630870b43f7b1913a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:19.333179Z","signature_b64":"55scBWc2TCBaCQ4m5gW20cB6BtENA3Aan/Ow5D4sv8yz41GpsyOX56AwVt7Ni9Uqo9ub2OU49B19cV8yg8kVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e310b83fb9d0ae671fa5d2f8cdeb45e6ece655420b8f5eaf584d271ddb8afa","last_reissued_at":"2026-07-05T04:30:19.332715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:19.332715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Attention MLP with Reliable Label Utilization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Cui, Wen Ouyang, Wentao Zhang, Xiaosen Li, Yangyu Tao, Zeang Sheng, Zhi Yang, Ziqi Yin","submitted_at":"2021-08-23T11:56:20Z","abstract_excerpt":"Graph neural networks (GNNs) have recently achieved state-of-the-art performance in many graph-based applications. Despite the high expressive power, they typically need to perform an expensive recursive neighborhood expansion in multiple training epochs and face a scalability issue. Moreover, most of them are inflexible since they are restricted to fixed-hop neighborhoods and insensitive to actual receptive field demands for different nodes. We circumvent these limitations by introducing a scalable and flexible Graph Attention Multilayer Perceptron (GAMLP). With the separation of the non-line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10097","kind":"arxiv","version":3},"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/2108.10097/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":"2108.10097","created_at":"2026-07-05T04:30:19.332773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.10097v3","created_at":"2026-07-05T04:30:19.332773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10097","created_at":"2026-07-05T04:30:19.332773+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALRRBOB7XHIK","created_at":"2026-07-05T04:30:19.332773+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALRRBOB7XHIK4ZY7","created_at":"2026-07-05T04:30:19.332773+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALRRBOB7","created_at":"2026-07-05T04:30:19.332773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":159,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX","json":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX.json","graph_json":"https://pith.science/api/pith-number/ALRRBOB7XHIK4ZY7UXJPRTPLIX/graph.json","events_json":"https://pith.science/api/pith-number/ALRRBOB7XHIK4ZY7UXJPRTPLIX/events.json","paper":"https://pith.science/paper/ALRRBOB7"},"agent_actions":{"view_html":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX","download_json":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX.json","view_paper":"https://pith.science/paper/ALRRBOB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.10097&json=true","fetch_graph":"https://pith.science/api/pith-number/ALRRBOB7XHIK4ZY7UXJPRTPLIX/graph.json","fetch_events":"https://pith.science/api/pith-number/ALRRBOB7XHIK4ZY7UXJPRTPLIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX/action/storage_attestation","attest_author":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX/action/author_attestation","sign_citation":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX/action/citation_signature","submit_replication":"https://pith.science/pith/ALRRBOB7XHIK4ZY7UXJPRTPLIX/action/replication_record"}},"created_at":"2026-07-05T04:30:19.332773+00:00","updated_at":"2026-07-05T04:30:19.332773+00:00"}