{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OW3G3H2ELMXFKGSWMZCWK5KKST","short_pith_number":"pith:OW3G3H2E","schema_version":"1.0","canonical_sha256":"75b66d9f445b2e551a56664565754a94f9648571d40e2dcd4f857046731a0789","source":{"kind":"arxiv","id":"1907.04652","version":1},"attestation_state":"computed","paper":{"title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongyang Gao, Shuiwang Ji","submitted_at":"2019-07-05T20:04:14Z","abstract_excerpt":"Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume excessive computational resources, preventing their applications on large graphs. In addition, GAOs belong to the family of soft attention, instead of hard attention, which has been shown to yield better performance. In this work, we propose novel hard graph attention operator (hGAO) "},"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":"1907.04652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T20:04:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c025a996252d500a839fd6bccb344fc1b5796b4ae20cdd7428196bf799558c65","abstract_canon_sha256":"8bdeec04886af0d38d75c391af286cfd332bda821072c94d19761a8ba141a3ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:57.208181Z","signature_b64":"zACrShN8Qw/IC5pWFmC+7ezmJCSzbQH2Fcs/LX2SSValU4YeZfo/Q6DrF2a4WRNSjxLA28CMAnGzf1wUdU7sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b66d9f445b2e551a56664565754a94f9648571d40e2dcd4f857046731a0789","last_reissued_at":"2026-05-17T23:40:57.207552Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:57.207552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongyang Gao, Shuiwang Ji","submitted_at":"2019-07-05T20:04:14Z","abstract_excerpt":"Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume excessive computational resources, preventing their applications on large graphs. In addition, GAOs belong to the family of soft attention, instead of hard attention, which has been shown to yield better performance. In this work, we propose novel hard graph attention operator (hGAO) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04652","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":""},"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":"1907.04652","created_at":"2026-05-17T23:40:57.207655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04652v1","created_at":"2026-05-17T23:40:57.207655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04652","created_at":"2026-05-17T23:40:57.207655+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW3G3H2ELMXF","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW3G3H2ELMXFKGSW","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW3G3H2E","created_at":"2026-05-18T12:33:24.271573+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/OW3G3H2ELMXFKGSWMZCWK5KKST","json":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST.json","graph_json":"https://pith.science/api/pith-number/OW3G3H2ELMXFKGSWMZCWK5KKST/graph.json","events_json":"https://pith.science/api/pith-number/OW3G3H2ELMXFKGSWMZCWK5KKST/events.json","paper":"https://pith.science/paper/OW3G3H2E"},"agent_actions":{"view_html":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST","download_json":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST.json","view_paper":"https://pith.science/paper/OW3G3H2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04652&json=true","fetch_graph":"https://pith.science/api/pith-number/OW3G3H2ELMXFKGSWMZCWK5KKST/graph.json","fetch_events":"https://pith.science/api/pith-number/OW3G3H2ELMXFKGSWMZCWK5KKST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST/action/storage_attestation","attest_author":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST/action/author_attestation","sign_citation":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST/action/citation_signature","submit_replication":"https://pith.science/pith/OW3G3H2ELMXFKGSWMZCWK5KKST/action/replication_record"}},"created_at":"2026-05-17T23:40:57.207655+00:00","updated_at":"2026-05-17T23:40:57.207655+00:00"}