{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M2UYY7YCS2VT6IEIZUW3NODERX","short_pith_number":"pith:M2UYY7YC","canonical_record":{"source":{"id":"1909.12223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T16:20:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e6583bfcb8b7727320c0077680b39c9ef920782374bdb6f73211f8e9c53065b9","abstract_canon_sha256":"efc251ccd1397aa03d6f3c403799dca7dda6e2d871af007d53cfc701099a26ff"},"schema_version":"1.0"},"canonical_sha256":"66a98c7f0296ab3f2088cd2db6b8648df812e80169efae3b3c121feb4f53d047","source":{"kind":"arxiv","id":"1909.12223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.12223","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1909.12223v2","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12223","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"M2UYY7YCS2VT","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"M2UYY7YCS2VT6IEI","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"M2UYY7YC","created_at":"2026-07-05T00:40:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M2UYY7YCS2VT6IEIZUW3NODERX","target":"record","payload":{"canonical_record":{"source":{"id":"1909.12223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T16:20:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e6583bfcb8b7727320c0077680b39c9ef920782374bdb6f73211f8e9c53065b9","abstract_canon_sha256":"efc251ccd1397aa03d6f3c403799dca7dda6e2d871af007d53cfc701099a26ff"},"schema_version":"1.0"},"canonical_sha256":"66a98c7f0296ab3f2088cd2db6b8648df812e80169efae3b3c121feb4f53d047","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:25.641644Z","signature_b64":"qRSX0/m75tXXbpJqQZZ2yhI4Pxp9kPPEGPGIwT8fQe+s20TBWBRbMqwewT6A8kGCfwcLCAAR8iInwSPtU2UWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a98c7f0296ab3f2088cd2db6b8648df812e80169efae3b3c121feb4f53d047","last_reissued_at":"2026-07-05T00:40:25.641175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:25.641175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.12223","source_version":2,"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-05T00:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mp/9hewjfy6bIpQyjhguX3sTVb93WAk1Bc4MzsTYyXCtEAmhKMSHH1L+hoVwqQX5pg06W4NGpaSuNcPUXzQVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:23:03.744046Z"},"content_sha256":"827d2b396760655ae5c50f14e043dd420b22d5eec4dda715f5b882df900e02dc","schema_version":"1.0","event_id":"sha256:827d2b396760655ae5c50f14e043dd420b22d5eec4dda715f5b882df900e02dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M2UYY7YCS2VT6IEIZUW3NODERX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PairNorm: Tackling Oversmoothing in GNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Leman Akoglu, Lingxiao Zhao","submitted_at":"2019-09-26T16:20:37Z","abstract_excerpt":"The performance of graph neural nets (GNNs) is known to gradually decrease with increasing number of layers. This decay is partly attributed to oversmoothing, where repeated graph convolutions eventually make node embeddings indistinguishable. We take a closer look at two different interpretations, aiming to quantify oversmoothing. Our main contribution is PairNorm, a novel normalization layer that is based on a careful analysis of the graph convolution operator, which prevents all node embeddings from becoming too similar. What is more, PairNorm is fast, easy to implement without any change t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12223","kind":"arxiv","version":2},"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/1909.12223/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-05T00:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzYLtRadJwA6a7FrQO6EC1TXdSgPjtkex7L4mjsEwo8aCL3PLWj7+hzCosFJJLhZGAd7VwxakIx7MxY/OLyVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:23:03.745565Z"},"content_sha256":"72386c885af6f99e8c8689ca4bd0ad007b6917ec4922bbf60188ed7880b221ac","schema_version":"1.0","event_id":"sha256:72386c885af6f99e8c8689ca4bd0ad007b6917ec4922bbf60188ed7880b221ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2UYY7YCS2VT6IEIZUW3NODERX/bundle.json","state_url":"https://pith.science/pith/M2UYY7YCS2VT6IEIZUW3NODERX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2UYY7YCS2VT6IEIZUW3NODERX/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-10T08:23:03Z","links":{"resolver":"https://pith.science/pith/M2UYY7YCS2VT6IEIZUW3NODERX","bundle":"https://pith.science/pith/M2UYY7YCS2VT6IEIZUW3NODERX/bundle.json","state":"https://pith.science/pith/M2UYY7YCS2VT6IEIZUW3NODERX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2UYY7YCS2VT6IEIZUW3NODERX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M2UYY7YCS2VT6IEIZUW3NODERX","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":"efc251ccd1397aa03d6f3c403799dca7dda6e2d871af007d53cfc701099a26ff","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T16:20:37Z","title_canon_sha256":"e6583bfcb8b7727320c0077680b39c9ef920782374bdb6f73211f8e9c53065b9"},"schema_version":"1.0","source":{"id":"1909.12223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.12223","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1909.12223v2","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12223","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"M2UYY7YCS2VT","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"M2UYY7YCS2VT6IEI","created_at":"2026-07-05T00:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"M2UYY7YC","created_at":"2026-07-05T00:40:25Z"}],"graph_snapshots":[{"event_id":"sha256:72386c885af6f99e8c8689ca4bd0ad007b6917ec4922bbf60188ed7880b221ac","target":"graph","created_at":"2026-07-05T00:40:25Z","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/1909.12223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The performance of graph neural nets (GNNs) is known to gradually decrease with increasing number of layers. This decay is partly attributed to oversmoothing, where repeated graph convolutions eventually make node embeddings indistinguishable. We take a closer look at two different interpretations, aiming to quantify oversmoothing. Our main contribution is PairNorm, a novel normalization layer that is based on a careful analysis of the graph convolution operator, which prevents all node embeddings from becoming too similar. What is more, PairNorm is fast, easy to implement without any change t","authors_text":"Leman Akoglu, Lingxiao Zhao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T16:20:37Z","title":"PairNorm: Tackling Oversmoothing in GNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12223","kind":"arxiv","version":2},"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:827d2b396760655ae5c50f14e043dd420b22d5eec4dda715f5b882df900e02dc","target":"record","created_at":"2026-07-05T00:40:25Z","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":"efc251ccd1397aa03d6f3c403799dca7dda6e2d871af007d53cfc701099a26ff","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T16:20:37Z","title_canon_sha256":"e6583bfcb8b7727320c0077680b39c9ef920782374bdb6f73211f8e9c53065b9"},"schema_version":"1.0","source":{"id":"1909.12223","kind":"arxiv","version":2}},"canonical_sha256":"66a98c7f0296ab3f2088cd2db6b8648df812e80169efae3b3c121feb4f53d047","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66a98c7f0296ab3f2088cd2db6b8648df812e80169efae3b3c121feb4f53d047","first_computed_at":"2026-07-05T00:40:25.641175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:25.641175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRSX0/m75tXXbpJqQZZ2yhI4Pxp9kPPEGPGIwT8fQe+s20TBWBRbMqwewT6A8kGCfwcLCAAR8iInwSPtU2UWAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:25.641644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.12223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:827d2b396760655ae5c50f14e043dd420b22d5eec4dda715f5b882df900e02dc","sha256:72386c885af6f99e8c8689ca4bd0ad007b6917ec4922bbf60188ed7880b221ac"],"state_sha256":"acce8d928cdde1225c9e1c34e0e3889c871f39c127fadd679cd192a2c73946a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qr7kq8QhzxHCSdGIasLh9hd0TRwhonWc7KItXOhvWbbh1lVofUMUvEuBnhXK/mwu/eyuJFB1fPaZJ9CBPruUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:23:03.752986Z","bundle_sha256":"162694d81cd3649daa2a35df757d0119ef6099b06d3a0a4549c44cf08c58a8f6"}}