{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YQJQQKJRU4NUZBCWOCUDBBGCWM","short_pith_number":"pith:YQJQQKJR","schema_version":"1.0","canonical_sha256":"c413082931a71b4c845670a83084c2b33284c6505b1d002c7c1612a7ac79cc3e","source":{"kind":"arxiv","id":"1808.02510","version":1},"attestation_state":"computed","paper":{"title":"Message Passing Graph Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2018-08-07T18:37:13Z","abstract_excerpt":"Graph kernels have recently emerged as a promising approach for tackling the graph similarity and learning tasks at the same time. In this paper, we propose a general framework for designing graph kernels. The proposed framework capitalizes on the well-known message passing scheme on graphs. The kernels derived from the framework consist of two components. The first component is a kernel between vertices, while the second component is a kernel between graphs. The main idea behind the proposed framework is that the representations of the vertices are implicitly updated using an iterative proced"},"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":"1808.02510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-07T18:37:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"de19f6f794da3738cf9762f7e9ef43e50c2657e0f271ef7e0f73b8452cf91a71","abstract_canon_sha256":"46d00ff620269abf811a856f90dc7a7f5a0e381cbf154017d835f2dcaaf97c81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:35.222351Z","signature_b64":"1R0BxN2GEgGrSCyJGbp3pOB2nj2F1OTUZ+pKowWTfJ5oYCL7kd5wktwTlOcXnio/7ppNpkgZMN3Df9mPV1JvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c413082931a71b4c845670a83084c2b33284c6505b1d002c7c1612a7ac79cc3e","last_reissued_at":"2026-05-18T00:08:35.221656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:35.221656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message Passing Graph Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2018-08-07T18:37:13Z","abstract_excerpt":"Graph kernels have recently emerged as a promising approach for tackling the graph similarity and learning tasks at the same time. In this paper, we propose a general framework for designing graph kernels. The proposed framework capitalizes on the well-known message passing scheme on graphs. The kernels derived from the framework consist of two components. The first component is a kernel between vertices, while the second component is a kernel between graphs. The main idea behind the proposed framework is that the representations of the vertices are implicitly updated using an iterative proced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02510","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":""},"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":"1808.02510","created_at":"2026-05-18T00:08:35.221772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02510v1","created_at":"2026-05-18T00:08:35.221772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02510","created_at":"2026-05-18T00:08:35.221772+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQJQQKJRU4NU","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQJQQKJRU4NUZBCW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQJQQKJR","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM","json":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM.json","graph_json":"https://pith.science/api/pith-number/YQJQQKJRU4NUZBCWOCUDBBGCWM/graph.json","events_json":"https://pith.science/api/pith-number/YQJQQKJRU4NUZBCWOCUDBBGCWM/events.json","paper":"https://pith.science/paper/YQJQQKJR"},"agent_actions":{"view_html":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM","download_json":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM.json","view_paper":"https://pith.science/paper/YQJQQKJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02510&json=true","fetch_graph":"https://pith.science/api/pith-number/YQJQQKJRU4NUZBCWOCUDBBGCWM/graph.json","fetch_events":"https://pith.science/api/pith-number/YQJQQKJRU4NUZBCWOCUDBBGCWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM/action/storage_attestation","attest_author":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM/action/author_attestation","sign_citation":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM/action/citation_signature","submit_replication":"https://pith.science/pith/YQJQQKJRU4NUZBCWOCUDBBGCWM/action/replication_record"}},"created_at":"2026-05-18T00:08:35.221772+00:00","updated_at":"2026-05-18T00:08:35.221772+00:00"}