{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:URETTHOIAJLFP55TPUTUWZZKDV","short_pith_number":"pith:URETTHOI","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"},"canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","source":{"kind":"arxiv","id":"1206.6483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6483","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6483v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6483","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"URETTHOIAJLF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"URETTHOIAJLFP55T","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"URETTHOI","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:URETTHOIAJLFP55TPUTUWZZKDV","target":"record","payload":{"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"},"canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","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"},"source_kind":"arxiv","source_id":"1206.6483","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-05-18T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJYCoADB4LjwsKNJobFqelJ6dUVh5RizNwkpN4QQnBI++q/0jzg3MGjBz2DnUpyC7H0Qw3CfoIizoEDWFWfJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:43.545903Z"},"content_sha256":"81e0b41eb83210c06151c87013f425393252fc617f42b8b528dca84614ed18c4","schema_version":"1.0","event_id":"sha256:81e0b41eb83210c06151c87013f425393252fc617f42b8b528dca84614ed18c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:URETTHOIAJLFP55TPUTUWZZKDV","target":"graph","payload":{"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"},"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-05-18T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqQo21Y5+1pie3yEhzqk2iLoBCXqfGJI3aXvpJDCMav5GU8bt4RtdXBNlB5A0xFhyZ6SDdnINeuaJaSTu1MrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:43.546252Z"},"content_sha256":"e7788a19f0fcdb3e6fe7688927e0780e4a23ad814e1b87b26162decb0c372e90","schema_version":"1.0","event_id":"sha256:e7788a19f0fcdb3e6fe7688927e0780e4a23ad814e1b87b26162decb0c372e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/bundle.json","state_url":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URETTHOIAJLFP55TPUTUWZZKDV/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-05-28T07:25:43Z","links":{"resolver":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV","bundle":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/bundle.json","state":"https://pith.science/pith/URETTHOIAJLFP55TPUTUWZZKDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URETTHOIAJLFP55TPUTUWZZKDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:URETTHOIAJLFP55TPUTUWZZKDV","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":"0408eabd52558148bd08b07435ceabfa00b6ea7993ea2e579621f5ee384d2bfc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"46405aee41d9753672dcc7511b5612f6fd91466aecc0c74db67feca71a081ed2"},"schema_version":"1.0","source":{"id":"1206.6483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6483","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6483v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6483","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"URETTHOIAJLF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"URETTHOIAJLFP55T","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"URETTHOI","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:e7788a19f0fcdb3e6fe7688927e0780e4a23ad814e1b87b26162decb0c372e90","target":"graph","created_at":"2026-05-18T03:52:13Z","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"},"paper":{"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","authors_text":"Nils Kriege (TU Dortmund), Petra Mutzel (TU Dortmund)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Subgraph Matching Kernels for Attributed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6483","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:81e0b41eb83210c06151c87013f425393252fc617f42b8b528dca84614ed18c4","target":"record","created_at":"2026-05-18T03:52:13Z","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":"0408eabd52558148bd08b07435ceabfa00b6ea7993ea2e579621f5ee384d2bfc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"46405aee41d9753672dcc7511b5612f6fd91466aecc0c74db67feca71a081ed2"},"schema_version":"1.0","source":{"id":"1206.6483","kind":"arxiv","version":1}},"canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a449399dc8025657f7b37d274b672a1d69140413acea28624d6d8f0f867f773d","first_computed_at":"2026-05-18T03:52:13.704610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:13.704610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IbVyRMcnn6488ideOBUv1qwEhZmC9MYLzOy5HTHlgx7JMMYHvJeMnfSUXkpbYyppsfft07UKwdRqobKa+pxdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:13.705473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81e0b41eb83210c06151c87013f425393252fc617f42b8b528dca84614ed18c4","sha256:e7788a19f0fcdb3e6fe7688927e0780e4a23ad814e1b87b26162decb0c372e90"],"state_sha256":"dfe3332de9f7e6c3f301110716286d74a4d65fa21ebaacd08b5a5326517447a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrGYl0IbY2xLw8/5q+nShXKFo31myANOOEaf4vyh+Q1twjXG8taRBlq8a/3GGnqeAP/ecwZgeE6vPD5vizaEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:25:43.548445Z","bundle_sha256":"ba1ba0d6179bfd3ef7ce61faf23c3e77c748d96af038f4a0fc1dd74e2876ca40"}}