{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:URETTHOIAJLFP55TPUTUWZZKDV","short_pith_number":"pith:URETTHOI","schema_version":"1.0","canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","source":{"kind":"arxiv","id":"1206.6483","version":1},"attestation_state":"computed","paper":{"title":"Subgraph Matching Kernels for Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nils Kriege (TU Dortmund), Petra Mutzel (TU Dortmund)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by a flexible scoring scheme comparing vertex and edge attributes by kernels. We show that subgraph matching kernels generalize several known kernels. To compute the kernel we propose a graph-theoretical algorithm inspired by a classical relation between common subgraphs of two grap"},"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":"1206.6483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"46405aee41d9753672dcc7511b5612f6fd91466aecc0c74db67feca71a081ed2","abstract_canon_sha256":"0408eabd52558148bd08b07435ceabfa00b6ea7993ea2e579621f5ee384d2bfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:13.705473Z","signature_b64":"IbVyRMcnn6488ideOBUv1qwEhZmC9MYLzOy5HTHlgx7JMMYHvJeMnfSUXkpbYyppsfft07UKwdRqobKa+pxdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","last_reissued_at":"2026-05-18T03:52:13.704610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:13.704610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph Matching Kernels for Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nils Kriege (TU Dortmund), Petra Mutzel (TU Dortmund)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by a flexible scoring scheme comparing vertex and edge attributes by kernels. We show that subgraph matching kernels generalize several known kernels. To compute the kernel we propose a graph-theoretical algorithm inspired by a classical relation between common subgraphs of two grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6483","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":"1206.6483","created_at":"2026-05-18T03:52:13.704765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6483v1","created_at":"2026-05-18T03:52:13.704765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6483","created_at":"2026-05-18T03:52:13.704765+00:00"},{"alias_kind":"pith_short_12","alias_value":"URETTHOIAJLF","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"URETTHOIAJLFP55T","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"URETTHOI","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2301.01232","citing_title":"Sample efficient graph classification using binary Gaussian boson sampling","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV","json":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV.json","graph_json":"https://pith.science/api/pith-number/URETTHOIAJLFP55TPUTUWZZKDV/graph.json","events_json":"https://pith.science/api/pith-number/URETTHOIAJLFP55TPUTUWZZKDV/events.json","paper":"https://pith.science/paper/URETTHOI"},"agent_actions":{"view_html":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV","download_json":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV.json","view_paper":"https://pith.science/paper/URETTHOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6483&json=true","fetch_graph":"https://pith.science/api/pith-number/URETTHOIAJLFP55TPUTUWZZKDV/graph.json","fetch_events":"https://pith.science/api/pith-number/URETTHOIAJLFP55TPUTUWZZKDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/action/storage_attestation","attest_author":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/action/author_attestation","sign_citation":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/action/citation_signature","submit_replication":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/action/replication_record"}},"created_at":"2026-05-18T03:52:13.704765+00:00","updated_at":"2026-05-18T03:52:13.704765+00:00"}