{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IFHGNZKWPKWNZFDZUPXUKTXI3O","short_pith_number":"pith:IFHGNZKW","schema_version":"1.0","canonical_sha256":"414e66e5567aacdc9479a3ef454ee8dbac6cfa551a389e0d7bf635610a225c10","source":{"kind":"arxiv","id":"1810.05997","version":6},"attestation_state":"computed","paper":{"title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksandar Bojchevski, Johannes Gasteiger, Stephan G\\\"unnemann","submitted_at":"2018-10-14T08:36:54Z","abstract_excerpt":"Neural message passing algorithms for semi-supervised classification on graphs have recently achieved great success. However, for classifying a node these methods only consider nodes that are a few propagation steps away and the size of this utilized neighborhood is hard to extend. In this paper, we use the relationship between graph convolutional networks (GCN) and PageRank to derive an improved propagation scheme based on personalized PageRank. We utilize this propagation procedure to construct a simple model, personalized propagation of neural predictions (PPNP), and its fast approximation,"},"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":"1810.05997","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-14T08:36:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e8d75fca1c957c8b1d277b36a3ba29d5dc78800590f3fc8f7150dc9a5e2f9418","abstract_canon_sha256":"ae5acf586694a04d84e104a731dfbebedb876360669fe01aa06e0d4ac5d2d997"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:22.056812Z","signature_b64":"TQq9tZA49oeWrbZ3GmD0qkTLDLvENbvSSmmnn/03c/2kJJXgnedNnqZ9XsB0UHx46Z3e7z+RH64JAdGlJtMCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414e66e5567aacdc9479a3ef454ee8dbac6cfa551a389e0d7bf635610a225c10","last_reissued_at":"2026-07-05T04:11:22.056261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:22.056261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksandar Bojchevski, Johannes Gasteiger, Stephan G\\\"unnemann","submitted_at":"2018-10-14T08:36:54Z","abstract_excerpt":"Neural message passing algorithms for semi-supervised classification on graphs have recently achieved great success. However, for classifying a node these methods only consider nodes that are a few propagation steps away and the size of this utilized neighborhood is hard to extend. In this paper, we use the relationship between graph convolutional networks (GCN) and PageRank to derive an improved propagation scheme based on personalized PageRank. We utilize this propagation procedure to construct a simple model, personalized propagation of neural predictions (PPNP), and its fast approximation,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05997","kind":"arxiv","version":6},"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/1810.05997/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":"1810.05997","created_at":"2026-07-05T04:11:22.056322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05997v6","created_at":"2026-07-05T04:11:22.056322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05997","created_at":"2026-07-05T04:11:22.056322+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFHGNZKWPKWN","created_at":"2026-07-05T04:11:22.056322+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFHGNZKWPKWNZFDZ","created_at":"2026-07-05T04:11:22.056322+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFHGNZKW","created_at":"2026-07-05T04:11:22.056322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19185","citing_title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11583","citing_title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09051","citing_title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07538","citing_title":"Bidirectional Semantic Complementary Tool Retrieval for Remote Sensing Agents","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21247","citing_title":"Graph Navier Stokes Networks","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31016","citing_title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12369","citing_title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2501.15461","citing_title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2601.01123","citing_title":"Learning from Historical Activations in Graph Neural Networks","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2505.23875","citing_title":"A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":117,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12329","citing_title":"UniDetect: LLM-Driven Universal Fraud Detection across Heterogeneous Blockchains","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20283","citing_title":"Multi-Perspective Evidence Synthesis and Reasoning for Unsupervised Multimodal Entity Linking","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O","json":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O.json","graph_json":"https://pith.science/api/pith-number/IFHGNZKWPKWNZFDZUPXUKTXI3O/graph.json","events_json":"https://pith.science/api/pith-number/IFHGNZKWPKWNZFDZUPXUKTXI3O/events.json","paper":"https://pith.science/paper/IFHGNZKW"},"agent_actions":{"view_html":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O","download_json":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O.json","view_paper":"https://pith.science/paper/IFHGNZKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05997&json=true","fetch_graph":"https://pith.science/api/pith-number/IFHGNZKWPKWNZFDZUPXUKTXI3O/graph.json","fetch_events":"https://pith.science/api/pith-number/IFHGNZKWPKWNZFDZUPXUKTXI3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O/action/storage_attestation","attest_author":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O/action/author_attestation","sign_citation":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O/action/citation_signature","submit_replication":"https://pith.science/pith/IFHGNZKWPKWNZFDZUPXUKTXI3O/action/replication_record"}},"created_at":"2026-07-05T04:11:22.056322+00:00","updated_at":"2026-07-05T04:11:22.056322+00:00"}