{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KP7FKE4OGXUY4SLWKYEN6KWLXD","short_pith_number":"pith:KP7FKE4O","canonical_record":{"source":{"id":"2104.02478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-03T01:37:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0f11f56d886937e557ed4f3565d22f56e53e4de2c34e67a521cb32b306a4d773","abstract_canon_sha256":"a89e6fc6aa41547b0255254569e43f2f7af0fecebe90aa7f587de92c33f04bbb"},"schema_version":"1.0"},"canonical_sha256":"53fe55138e35e98e49765608df2acbb8c313c07c388e5b76bdcace9816d1bbb6","source":{"kind":"arxiv","id":"2104.02478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02478","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02478v1","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02478","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_12","alias_value":"KP7FKE4OGXUY","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_16","alias_value":"KP7FKE4OGXUY4SLW","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_8","alias_value":"KP7FKE4O","created_at":"2026-07-05T02:29:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KP7FKE4OGXUY4SLWKYEN6KWLXD","target":"record","payload":{"canonical_record":{"source":{"id":"2104.02478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-03T01:37:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0f11f56d886937e557ed4f3565d22f56e53e4de2c34e67a521cb32b306a4d773","abstract_canon_sha256":"a89e6fc6aa41547b0255254569e43f2f7af0fecebe90aa7f587de92c33f04bbb"},"schema_version":"1.0"},"canonical_sha256":"53fe55138e35e98e49765608df2acbb8c313c07c388e5b76bdcace9816d1bbb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:48.793381Z","signature_b64":"Yaceo1iOyYC0vORO03fli9N1vBhdBEv2H7kJA2uegV+6eUNUOg52tRjDctVzX0NjwetenNeWnviS0uM5M/cKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53fe55138e35e98e49765608df2acbb8c313c07c388e5b76bdcace9816d1bbb6","last_reissued_at":"2026-07-05T02:29:48.792971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:48.792971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.02478","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:29:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Ock6w8l5iEQj3Wfmtbe19eOqB9M0AWyBmD/RU8SyeIl55dzI1EJEwiBIvNqcfaaFAEme5Ozijtcgeo2OiHbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:51:28.028682Z"},"content_sha256":"63d644f2ee245236980cd71729531769134f7eb53f8c880ffb277c6b2e9e6860","schema_version":"1.0","event_id":"sha256:63d644f2ee245236980cd71729531769134f7eb53f8c880ffb277c6b2e9e6860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KP7FKE4OGXUY4SLWKYEN6KWLXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological Regularization for Graph Neural Networks Augmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fausto Giunchiglia, Hao Xu, Ke Zhao, Rui Song","submitted_at":"2021-04-03T01:37:44Z","abstract_excerpt":"The complexity and non-Euclidean structure of graph data hinder the development of data augmentation methods similar to those in computer vision. In this paper, we propose a feature augmentation method for graph nodes based on topological regularization, in which topological structure information is introduced into end-to-end model. Specifically, we first obtain topology embedding of nodes through unsupervised representation learning method based on random walk. Then, the topological embedding as additional features and the original node features are input into a dual graph neural network for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02478","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/2104.02478/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:29:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtJ8GD/fNi6eu+CaTc/E0dAWZUTJvhI2fuYHmq9StqhSVepJ3MOxZhxRluau9v36tYz+XQbW8gIoBx1winh/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:51:28.029052Z"},"content_sha256":"c1c385d0079871ff4cfbc519be5a09c154346b4f0b9dbe6f9846b9c619deb1c3","schema_version":"1.0","event_id":"sha256:c1c385d0079871ff4cfbc519be5a09c154346b4f0b9dbe6f9846b9c619deb1c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/bundle.json","state_url":"https://pith.science/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/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-07-07T15:51:28Z","links":{"resolver":"https://pith.science/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD","bundle":"https://pith.science/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/bundle.json","state":"https://pith.science/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KP7FKE4OGXUY4SLWKYEN6KWLXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KP7FKE4OGXUY4SLWKYEN6KWLXD","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":"a89e6fc6aa41547b0255254569e43f2f7af0fecebe90aa7f587de92c33f04bbb","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-03T01:37:44Z","title_canon_sha256":"0f11f56d886937e557ed4f3565d22f56e53e4de2c34e67a521cb32b306a4d773"},"schema_version":"1.0","source":{"id":"2104.02478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02478","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02478v1","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02478","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_12","alias_value":"KP7FKE4OGXUY","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_16","alias_value":"KP7FKE4OGXUY4SLW","created_at":"2026-07-05T02:29:48Z"},{"alias_kind":"pith_short_8","alias_value":"KP7FKE4O","created_at":"2026-07-05T02:29:48Z"}],"graph_snapshots":[{"event_id":"sha256:c1c385d0079871ff4cfbc519be5a09c154346b4f0b9dbe6f9846b9c619deb1c3","target":"graph","created_at":"2026-07-05T02:29:48Z","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/2104.02478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The complexity and non-Euclidean structure of graph data hinder the development of data augmentation methods similar to those in computer vision. In this paper, we propose a feature augmentation method for graph nodes based on topological regularization, in which topological structure information is introduced into end-to-end model. Specifically, we first obtain topology embedding of nodes through unsupervised representation learning method based on random walk. Then, the topological embedding as additional features and the original node features are input into a dual graph neural network for ","authors_text":"Fausto Giunchiglia, Hao Xu, Ke Zhao, Rui Song","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-03T01:37:44Z","title":"Topological Regularization for Graph Neural Networks Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02478","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:63d644f2ee245236980cd71729531769134f7eb53f8c880ffb277c6b2e9e6860","target":"record","created_at":"2026-07-05T02:29:48Z","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":"a89e6fc6aa41547b0255254569e43f2f7af0fecebe90aa7f587de92c33f04bbb","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-03T01:37:44Z","title_canon_sha256":"0f11f56d886937e557ed4f3565d22f56e53e4de2c34e67a521cb32b306a4d773"},"schema_version":"1.0","source":{"id":"2104.02478","kind":"arxiv","version":1}},"canonical_sha256":"53fe55138e35e98e49765608df2acbb8c313c07c388e5b76bdcace9816d1bbb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53fe55138e35e98e49765608df2acbb8c313c07c388e5b76bdcace9816d1bbb6","first_computed_at":"2026-07-05T02:29:48.792971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:29:48.792971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yaceo1iOyYC0vORO03fli9N1vBhdBEv2H7kJA2uegV+6eUNUOg52tRjDctVzX0NjwetenNeWnviS0uM5M/cKCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:29:48.793381Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.02478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63d644f2ee245236980cd71729531769134f7eb53f8c880ffb277c6b2e9e6860","sha256:c1c385d0079871ff4cfbc519be5a09c154346b4f0b9dbe6f9846b9c619deb1c3"],"state_sha256":"0430214defd85fc6eed05c77d954dd852f99a2525b6ba7a9c0f658beeeb3a11f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktHfVVqpH/eNJAfVyGJWytH/2uFLVOARrrMQj8B85g3/+iZMTy2dBsnwDL842l/uNhrCJW5qI+73M1K01iocBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:51:28.031076Z","bundle_sha256":"3464f57b70a5ef196fe0a0c512b2e4f927c9c2cd2d72a3a8a09ab4f70c50babe"}}