{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:DGGPEIKYJG5TYCLEH23QCPGXXC","short_pith_number":"pith:DGGPEIKY","canonical_record":{"source":{"id":"2101.00417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-02T10:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"2ec6974b58f1ae71489d2ec5124d4852ed0e1f2779e4545880976c8d933cdd01","abstract_canon_sha256":"51f9e01e4434f21cf5dc874b15fde56807c747ee0499ca31478340780dc91e25"},"schema_version":"1.0"},"canonical_sha256":"198cf2215849bb3c09643eb7013cd7b89df1743ece482ffa65e554be664eca0e","source":{"kind":"arxiv","id":"2101.00417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00417","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00417v1","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00417","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"DGGPEIKYJG5T","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"DGGPEIKYJG5TYCLE","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"DGGPEIKY","created_at":"2026-07-05T02:04:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:DGGPEIKYJG5TYCLEH23QCPGXXC","target":"record","payload":{"canonical_record":{"source":{"id":"2101.00417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-02T10:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"2ec6974b58f1ae71489d2ec5124d4852ed0e1f2779e4545880976c8d933cdd01","abstract_canon_sha256":"51f9e01e4434f21cf5dc874b15fde56807c747ee0499ca31478340780dc91e25"},"schema_version":"1.0"},"canonical_sha256":"198cf2215849bb3c09643eb7013cd7b89df1743ece482ffa65e554be664eca0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:18.274988Z","signature_b64":"96PPOhR0S5AN84zk51+qCST8wSGG+3LKOFAJPoMnRYGS1p9QWEn0T83BWjv3PG2eeZxv+9vnhtgPywaNoRuNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"198cf2215849bb3c09643eb7013cd7b89df1743ece482ffa65e554be664eca0e","last_reissued_at":"2026-07-05T02:04:18.274526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:18.274526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.00417","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:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeTeSEShw0XS5uK67xR8h6+uXtLqedD0St6V8l/wRme3JZ/F44/ulH9PbyWWJLuWp2Sjunuba/nHbFM7/uPNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:13:22.677273Z"},"content_sha256":"0d606d1e7b92d00916864d23450542f83f0a3d1f5acf8f0d2ac27791cacd3f06","schema_version":"1.0","event_id":"sha256:0d606d1e7b92d00916864d23450542f83f0a3d1f5acf8f0d2ac27791cacd3f06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:DGGPEIKYJG5TYCLEH23QCPGXXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wei Wei, Xiangnan Feng, Xing Li, Zhiming Zheng","submitted_at":"2021-01-02T10:31:14Z","abstract_excerpt":"Graphs are often used to organize data because of their simple topological structure, and therefore play a key role in machine learning. And it turns out that the low-dimensional embedded representation obtained by graph representation learning are extremely useful in various typical tasks, such as node classification, content recommendation and link prediction. However, the existing methods mostly start from the microstructure (i.e., the edges) in the graph, ignoring the mesoscopic structure (high-order local structure). Here, we propose wGCN -- a novel framework that utilizes random walk to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00417","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/2101.00417/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:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IbPEArcSvJHSu/2AfLPAB2hKMDj9YVf8A2I2AgzCY8VksRCZWn1ZGie6001PIc3vXbeVM66ZLpl/KMpmJEWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:13:22.677811Z"},"content_sha256":"81d503486d96880a84fe628eacc4ebcec9efa2424995870a1c5cee9be053c132","schema_version":"1.0","event_id":"sha256:81d503486d96880a84fe628eacc4ebcec9efa2424995870a1c5cee9be053c132"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/bundle.json","state_url":"https://pith.science/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/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-11T02:13:22Z","links":{"resolver":"https://pith.science/pith/DGGPEIKYJG5TYCLEH23QCPGXXC","bundle":"https://pith.science/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/bundle.json","state":"https://pith.science/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGGPEIKYJG5TYCLEH23QCPGXXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:DGGPEIKYJG5TYCLEH23QCPGXXC","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":"51f9e01e4434f21cf5dc874b15fde56807c747ee0499ca31478340780dc91e25","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-02T10:31:14Z","title_canon_sha256":"2ec6974b58f1ae71489d2ec5124d4852ed0e1f2779e4545880976c8d933cdd01"},"schema_version":"1.0","source":{"id":"2101.00417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00417","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00417v1","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00417","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"DGGPEIKYJG5T","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"DGGPEIKYJG5TYCLE","created_at":"2026-07-05T02:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"DGGPEIKY","created_at":"2026-07-05T02:04:18Z"}],"graph_snapshots":[{"event_id":"sha256:81d503486d96880a84fe628eacc4ebcec9efa2424995870a1c5cee9be053c132","target":"graph","created_at":"2026-07-05T02:04:18Z","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/2101.00417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graphs are often used to organize data because of their simple topological structure, and therefore play a key role in machine learning. And it turns out that the low-dimensional embedded representation obtained by graph representation learning are extremely useful in various typical tasks, such as node classification, content recommendation and link prediction. However, the existing methods mostly start from the microstructure (i.e., the edges) in the graph, ignoring the mesoscopic structure (high-order local structure). Here, we propose wGCN -- a novel framework that utilizes random walk to ","authors_text":"Wei Wei, Xiangnan Feng, Xing Li, Zhiming Zheng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-02T10:31:14Z","title":"Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00417","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:0d606d1e7b92d00916864d23450542f83f0a3d1f5acf8f0d2ac27791cacd3f06","target":"record","created_at":"2026-07-05T02:04:18Z","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":"51f9e01e4434f21cf5dc874b15fde56807c747ee0499ca31478340780dc91e25","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-02T10:31:14Z","title_canon_sha256":"2ec6974b58f1ae71489d2ec5124d4852ed0e1f2779e4545880976c8d933cdd01"},"schema_version":"1.0","source":{"id":"2101.00417","kind":"arxiv","version":1}},"canonical_sha256":"198cf2215849bb3c09643eb7013cd7b89df1743ece482ffa65e554be664eca0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"198cf2215849bb3c09643eb7013cd7b89df1743ece482ffa65e554be664eca0e","first_computed_at":"2026-07-05T02:04:18.274526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:18.274526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96PPOhR0S5AN84zk51+qCST8wSGG+3LKOFAJPoMnRYGS1p9QWEn0T83BWjv3PG2eeZxv+9vnhtgPywaNoRuNBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:18.274988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.00417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d606d1e7b92d00916864d23450542f83f0a3d1f5acf8f0d2ac27791cacd3f06","sha256:81d503486d96880a84fe628eacc4ebcec9efa2424995870a1c5cee9be053c132"],"state_sha256":"6a9c833fc0a20027ec56adafae6cd53d5f1e0500d361d6ce83d7730482dc7b17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/tstWtBjZIATm8ybnoZMl6Tc78dRoSX0Kd1A0SiREKH8z8X0RoalypEW5EFOspF7wQ7M1davDtTCIcDv8luDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:13:22.684051Z","bundle_sha256":"f5deb1f1609e080097d2031c9f007a495cfe4fe95d12ea59c2b3d17129c1a34e"}}