{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KPALQN3YNRT24WBR72VNV6KFW3","short_pith_number":"pith:KPALQN3Y","schema_version":"1.0","canonical_sha256":"53c0b837786c67ae5831feaadaf945b6c805b5a6863b82a7f067a1b3a9475241","source":{"kind":"arxiv","id":"2110.07869","version":3},"attestation_state":"computed","paper":{"title":"DPGNN: Dual-Perception Graph Neural Network for Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dingyi Zeng, Hong Qu, Li Zhou, Malu Zhang, Shaohuan Cheng, Wanlong Liu, Wenyu Chen","submitted_at":"2021-10-15T05:47:26Z","abstract_excerpt":"Graph neural networks (GNNs) have drawn increasing attention in recent years and achieved remarkable performance in many graph-based tasks, especially in semi-supervised learning on graphs. However, most existing GNNs are based on the message-passing paradigm to iteratively aggregate neighborhood information in a single topology space. Despite their success, the expressive power of GNNs is limited by some drawbacks, such as inflexibility of message source expansion, negligence of node-level message output discrepancy, and restriction of single message space. To address these drawbacks, we pres"},"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":"2110.07869","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T05:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"0399a4dc54c396ea4efcf4076b54b10b2c4afc20ba75446f14bb69a6ee4cc9a6","abstract_canon_sha256":"8336104ece5361377dbbecd3590d73eebeeb1fd69325604130f4b0135100c8d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:17.943940Z","signature_b64":"GN5BJtYYQ6wckvki89Nd9AHaEeMLaWvjmxnvfH49pljkxjzD5wMn2RYr8nKOvM0D8tAmUuiLAYC/o6Nq3eVcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c0b837786c67ae5831feaadaf945b6c805b5a6863b82a7f067a1b3a9475241","last_reissued_at":"2026-07-05T07:36:17.943492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:17.943492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DPGNN: Dual-Perception Graph Neural Network for Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dingyi Zeng, Hong Qu, Li Zhou, Malu Zhang, Shaohuan Cheng, Wanlong Liu, Wenyu Chen","submitted_at":"2021-10-15T05:47:26Z","abstract_excerpt":"Graph neural networks (GNNs) have drawn increasing attention in recent years and achieved remarkable performance in many graph-based tasks, especially in semi-supervised learning on graphs. However, most existing GNNs are based on the message-passing paradigm to iteratively aggregate neighborhood information in a single topology space. Despite their success, the expressive power of GNNs is limited by some drawbacks, such as inflexibility of message source expansion, negligence of node-level message output discrepancy, and restriction of single message space. To address these drawbacks, we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07869","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/2110.07869/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":"2110.07869","created_at":"2026-07-05T07:36:17.943555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07869v3","created_at":"2026-07-05T07:36:17.943555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07869","created_at":"2026-07-05T07:36:17.943555+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPALQN3YNRT2","created_at":"2026-07-05T07:36:17.943555+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPALQN3YNRT24WBR","created_at":"2026-07-05T07:36:17.943555+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPALQN3Y","created_at":"2026-07-05T07:36:17.943555+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/KPALQN3YNRT24WBR72VNV6KFW3","json":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3.json","graph_json":"https://pith.science/api/pith-number/KPALQN3YNRT24WBR72VNV6KFW3/graph.json","events_json":"https://pith.science/api/pith-number/KPALQN3YNRT24WBR72VNV6KFW3/events.json","paper":"https://pith.science/paper/KPALQN3Y"},"agent_actions":{"view_html":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3","download_json":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3.json","view_paper":"https://pith.science/paper/KPALQN3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07869&json=true","fetch_graph":"https://pith.science/api/pith-number/KPALQN3YNRT24WBR72VNV6KFW3/graph.json","fetch_events":"https://pith.science/api/pith-number/KPALQN3YNRT24WBR72VNV6KFW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3/action/storage_attestation","attest_author":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3/action/author_attestation","sign_citation":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3/action/citation_signature","submit_replication":"https://pith.science/pith/KPALQN3YNRT24WBR72VNV6KFW3/action/replication_record"}},"created_at":"2026-07-05T07:36:17.943555+00:00","updated_at":"2026-07-05T07:36:17.943555+00:00"}