{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CPR5GXVSORQ3OAACAIO7NX3TRL","short_pith_number":"pith:CPR5GXVS","canonical_record":{"source":{"id":"2105.03868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-09T08:12:18Z","cross_cats_sorted":[],"title_canon_sha256":"ff20f7f4df0a3f03b1c569881b3a09e157e8f7f43db7a00069e5826f6755d09e","abstract_canon_sha256":"b8312eb70f40b9d4e3e4f5ea8159052d128073e7219bc308686e70ab7bd48389"},"schema_version":"1.0"},"canonical_sha256":"13e3d35eb27461b70002021df6df738ac7ba0a94454f9e12ed9d455a93534c1b","source":{"kind":"arxiv","id":"2105.03868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.03868","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"arxiv_version","alias_value":"2105.03868v1","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03868","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_12","alias_value":"CPR5GXVSORQ3","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_16","alias_value":"CPR5GXVSORQ3OAAC","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_8","alias_value":"CPR5GXVS","created_at":"2026-07-05T02:38:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CPR5GXVSORQ3OAACAIO7NX3TRL","target":"record","payload":{"canonical_record":{"source":{"id":"2105.03868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-09T08:12:18Z","cross_cats_sorted":[],"title_canon_sha256":"ff20f7f4df0a3f03b1c569881b3a09e157e8f7f43db7a00069e5826f6755d09e","abstract_canon_sha256":"b8312eb70f40b9d4e3e4f5ea8159052d128073e7219bc308686e70ab7bd48389"},"schema_version":"1.0"},"canonical_sha256":"13e3d35eb27461b70002021df6df738ac7ba0a94454f9e12ed9d455a93534c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:39.725676Z","signature_b64":"QJuCCq7cFeIfOmq+2izZMkVrXRnXLBnGT5jgcfGMjAp81WoPLWClFnJkmV3qXk2PcitSNBQSRdC9u6t6kLvaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e3d35eb27461b70002021df6df738ac7ba0a94454f9e12ed9d455a93534c1b","last_reissued_at":"2026-07-05T02:38:39.725263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:39.725263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.03868","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:38:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxXylRraf7mWVVX9F8E7MIOxGZ7f04995UQHgzDXyzWJ6BkD+W0rjA6HVjVAbx/ZxqOhcypSVi4JUCE1H0VlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:03:52.073634Z"},"content_sha256":"e38b7f606a756373bc282708f76801df64060629b7f0536d5688617eda886391","schema_version":"1.0","event_id":"sha256:e38b7f606a756373bc282708f76801df64060629b7f0536d5688617eda886391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CPR5GXVSORQ3OAACAIO7NX3TRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Recursive Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Chen, Yue Xu, Zengde Deng, Zhoujun Li","submitted_at":"2021-05-09T08:12:18Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) are powerful models for node representation learning tasks. However, the node representation in existing GCN models is usually generated by performing recursive neighborhood aggregation across multiple graph convolutional layers with certain sampling methods, which may lead to redundant feature mixing, needless information loss, and extensive computations. Therefore, in this paper, we propose a novel architecture named Non-Recursive Graph Convolutional Network (NRGCN) to improve both the training efficiency and the learning performance of GCNs in the context"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03868","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/2105.03868/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:38:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+EWW3OU3skCznCRF4gP54mpVzFjDQLKaLbsuCNR1fGgoox5Pp1ajUrSlz6i2nYNny5n0VhSMhH55hjjiawV5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:03:52.074142Z"},"content_sha256":"e86f0feffe9538ac1c5efdc644149cc83b4f988d5215f9588deecf4086b200fc","schema_version":"1.0","event_id":"sha256:e86f0feffe9538ac1c5efdc644149cc83b4f988d5215f9588deecf4086b200fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/bundle.json","state_url":"https://pith.science/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T22:03:52Z","links":{"resolver":"https://pith.science/pith/CPR5GXVSORQ3OAACAIO7NX3TRL","bundle":"https://pith.science/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/bundle.json","state":"https://pith.science/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPR5GXVSORQ3OAACAIO7NX3TRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CPR5GXVSORQ3OAACAIO7NX3TRL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b8312eb70f40b9d4e3e4f5ea8159052d128073e7219bc308686e70ab7bd48389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-09T08:12:18Z","title_canon_sha256":"ff20f7f4df0a3f03b1c569881b3a09e157e8f7f43db7a00069e5826f6755d09e"},"schema_version":"1.0","source":{"id":"2105.03868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.03868","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"arxiv_version","alias_value":"2105.03868v1","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03868","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_12","alias_value":"CPR5GXVSORQ3","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_16","alias_value":"CPR5GXVSORQ3OAAC","created_at":"2026-07-05T02:38:39Z"},{"alias_kind":"pith_short_8","alias_value":"CPR5GXVS","created_at":"2026-07-05T02:38:39Z"}],"graph_snapshots":[{"event_id":"sha256:e86f0feffe9538ac1c5efdc644149cc83b4f988d5215f9588deecf4086b200fc","target":"graph","created_at":"2026-07-05T02:38:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.03868/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Networks (GCNs) are powerful models for node representation learning tasks. However, the node representation in existing GCN models is usually generated by performing recursive neighborhood aggregation across multiple graph convolutional layers with certain sampling methods, which may lead to redundant feature mixing, needless information loss, and extensive computations. Therefore, in this paper, we propose a novel architecture named Non-Recursive Graph Convolutional Network (NRGCN) to improve both the training efficiency and the learning performance of GCNs in the context","authors_text":"Hao Chen, Yue Xu, Zengde Deng, Zhoujun Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-09T08:12:18Z","title":"Non-Recursive Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03868","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e38b7f606a756373bc282708f76801df64060629b7f0536d5688617eda886391","target":"record","created_at":"2026-07-05T02:38:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b8312eb70f40b9d4e3e4f5ea8159052d128073e7219bc308686e70ab7bd48389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-09T08:12:18Z","title_canon_sha256":"ff20f7f4df0a3f03b1c569881b3a09e157e8f7f43db7a00069e5826f6755d09e"},"schema_version":"1.0","source":{"id":"2105.03868","kind":"arxiv","version":1}},"canonical_sha256":"13e3d35eb27461b70002021df6df738ac7ba0a94454f9e12ed9d455a93534c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13e3d35eb27461b70002021df6df738ac7ba0a94454f9e12ed9d455a93534c1b","first_computed_at":"2026-07-05T02:38:39.725263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:39.725263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QJuCCq7cFeIfOmq+2izZMkVrXRnXLBnGT5jgcfGMjAp81WoPLWClFnJkmV3qXk2PcitSNBQSRdC9u6t6kLvaDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:39.725676Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.03868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e38b7f606a756373bc282708f76801df64060629b7f0536d5688617eda886391","sha256:e86f0feffe9538ac1c5efdc644149cc83b4f988d5215f9588deecf4086b200fc"],"state_sha256":"4e120cb7003143f00dee488b0a7366cd865770027e08288f22ae2897ae2827c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xw9cSfst06riK/SjbukNd+E79vxWbmPG2wqBsOl0RJcKYLa553i9B7VhazLqdW3CErT7yMFUIA/HXapf4ecCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:03:52.081557Z","bundle_sha256":"fd3f63c951b1bbf86f6649d18cbe3bc1933a317c58fd138eae5d6983a4b19369"}}