{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6T7Z6FF3T45BHRHQAUJTNMEC4P","short_pith_number":"pith:6T7Z6FF3","canonical_record":{"source":{"id":"1510.06492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-22T05:49:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3430448a85ce0ae046f893bca6c02066a11d863496d19c1ecdb21e723b366345","abstract_canon_sha256":"f193f739adcb30fb068fd91edf9344adaf1673dfccf6c11928c9b4f44cd6a329"},"schema_version":"1.0"},"canonical_sha256":"f4ff9f14bb9f3a13c4f0051336b082e3d079be25484437143a0d8c44a2769e61","source":{"kind":"arxiv","id":"1510.06492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06492","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06492v1","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06492","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"6T7Z6FF3T45B","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6T7Z6FF3T45BHRHQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6T7Z6FF3","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6T7Z6FF3T45BHRHQAUJTNMEC4P","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-22T05:49:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3430448a85ce0ae046f893bca6c02066a11d863496d19c1ecdb21e723b366345","abstract_canon_sha256":"f193f739adcb30fb068fd91edf9344adaf1673dfccf6c11928c9b4f44cd6a329"},"schema_version":"1.0"},"canonical_sha256":"f4ff9f14bb9f3a13c4f0051336b082e3d079be25484437143a0d8c44a2769e61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:31.169021Z","signature_b64":"ixJoOemaQveK7eP3vTs+1erKENBBnFBpj0JuQe1BB1tQWeQRaSOyU7L7afQuQ0liZu8Z4u/8vv2YUnHeyAVhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ff9f14bb9f3a13c4f0051336b082e3d079be25484437143a0d8c44a2769e61","last_reissued_at":"2026-05-18T01:26:31.168461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:31.168461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06492","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-18T01:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VTGVrli6MNRGQwnB+G3ksVpg5yi3nrNLxzoMgW+xqxNuERXOg/xQDGNfpM6j9hnDGnlu5htCydWTTCd4tsnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:42:07.031599Z"},"content_sha256":"5a79b28f6eca8ea8930a3025e2dc0e7775dab08249b07f587864e515f99f571d","schema_version":"1.0","event_id":"sha256:5a79b28f6eca8ea8930a3025e2dc0e7775dab08249b07f587864e515f99f571d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6T7Z6FF3T45BHRHQAUJTNMEC4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Shortest Path Kernel on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Fredrik D. Johansson, Linus Hermansson, Osamu Watanabe","submitted_at":"2015-10-22T05:49:31Z","abstract_excerpt":"We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification problem, we consider the task of classifying random graphs from two well-known families, by the number of clusters they contain. We verify empirically that the generalized shortest path kernel outperforms the original shortest path kernel on a number of datasets. We give a theoretical analysis for explaining our experimental results. In particular, we estimate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06492","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-18T01:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19GP2BCo3eH91S9XWD14kp1QaFrTN+OevgO8ITDbEtFwDLhV57uGWYzoGheChTZvZZZdX/QcYsSy098+pf14BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:42:07.032388Z"},"content_sha256":"387565c93d53e530db8d5bc531471e1c57c6eb3e6cf93749cad83368326e3e77","schema_version":"1.0","event_id":"sha256:387565c93d53e530db8d5bc531471e1c57c6eb3e6cf93749cad83368326e3e77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/bundle.json","state_url":"https://pith.science/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/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-31T18:42:07Z","links":{"resolver":"https://pith.science/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P","bundle":"https://pith.science/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/bundle.json","state":"https://pith.science/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T7Z6FF3T45BHRHQAUJTNMEC4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6T7Z6FF3T45BHRHQAUJTNMEC4P","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":"f193f739adcb30fb068fd91edf9344adaf1673dfccf6c11928c9b4f44cd6a329","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-22T05:49:31Z","title_canon_sha256":"3430448a85ce0ae046f893bca6c02066a11d863496d19c1ecdb21e723b366345"},"schema_version":"1.0","source":{"id":"1510.06492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06492","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06492v1","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06492","created_at":"2026-05-18T01:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"6T7Z6FF3T45B","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6T7Z6FF3T45BHRHQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6T7Z6FF3","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:387565c93d53e530db8d5bc531471e1c57c6eb3e6cf93749cad83368326e3e77","target":"graph","created_at":"2026-05-18T01:26:31Z","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 consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification problem, we consider the task of classifying random graphs from two well-known families, by the number of clusters they contain. We verify empirically that the generalized shortest path kernel outperforms the original shortest path kernel on a number of datasets. We give a theoretical analysis for explaining our experimental results. In particular, we estimate ","authors_text":"Fredrik D. Johansson, Linus Hermansson, Osamu Watanabe","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-22T05:49:31Z","title":"Generalized Shortest Path Kernel on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06492","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:5a79b28f6eca8ea8930a3025e2dc0e7775dab08249b07f587864e515f99f571d","target":"record","created_at":"2026-05-18T01:26:31Z","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":"f193f739adcb30fb068fd91edf9344adaf1673dfccf6c11928c9b4f44cd6a329","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-22T05:49:31Z","title_canon_sha256":"3430448a85ce0ae046f893bca6c02066a11d863496d19c1ecdb21e723b366345"},"schema_version":"1.0","source":{"id":"1510.06492","kind":"arxiv","version":1}},"canonical_sha256":"f4ff9f14bb9f3a13c4f0051336b082e3d079be25484437143a0d8c44a2769e61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4ff9f14bb9f3a13c4f0051336b082e3d079be25484437143a0d8c44a2769e61","first_computed_at":"2026-05-18T01:26:31.168461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:31.168461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ixJoOemaQveK7eP3vTs+1erKENBBnFBpj0JuQe1BB1tQWeQRaSOyU7L7afQuQ0liZu8Z4u/8vv2YUnHeyAVhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:31.169021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a79b28f6eca8ea8930a3025e2dc0e7775dab08249b07f587864e515f99f571d","sha256:387565c93d53e530db8d5bc531471e1c57c6eb3e6cf93749cad83368326e3e77"],"state_sha256":"4a6eabbc2fe69b1102b1f65db2f64a3a4c804ef2fca14bd342afd558f51102ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfKUl/vluuD14Nq6guzszjFl5OjzFCpykaHycmTO82D+3536WV5Flq6esPfDX7KHie+f0UzUpxlE4VslD+VdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:42:07.038289Z","bundle_sha256":"f3d737cd4065c12f190811bae304e6b8c47c3b09aded25c9ef543023b529b1f7"}}