{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YV2MCS3FKI3Y2PRLW74CRQHK27","short_pith_number":"pith:YV2MCS3F","canonical_record":{"source":{"id":"1109.4554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-21T15:22:19Z","cross_cats_sorted":[],"title_canon_sha256":"68f94ea95c707f7fa60076ccb24223d19cc5275fb3a4b6af1ab6b4d9537ffd9f","abstract_canon_sha256":"df6e3282c6b34d25181a44944a5f0ec0b85ce7d85be7f5bd950eee1d561e07ae"},"schema_version":"1.0"},"canonical_sha256":"c574c14b6552378d3e2bb7f828c0ead7f76a32ecf4cf10811d00c8783fe23d25","source":{"kind":"arxiv","id":"1109.4554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4554","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4554v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4554","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"YV2MCS3FKI3Y","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YV2MCS3FKI3Y2PRL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YV2MCS3F","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YV2MCS3FKI3Y2PRLW74CRQHK27","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-21T15:22:19Z","cross_cats_sorted":[],"title_canon_sha256":"68f94ea95c707f7fa60076ccb24223d19cc5275fb3a4b6af1ab6b4d9537ffd9f","abstract_canon_sha256":"df6e3282c6b34d25181a44944a5f0ec0b85ce7d85be7f5bd950eee1d561e07ae"},"schema_version":"1.0"},"canonical_sha256":"c574c14b6552378d3e2bb7f828c0ead7f76a32ecf4cf10811d00c8783fe23d25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.388071Z","signature_b64":"pU5p68a/Jy14CkrLFXsKnQeB466lZo9lID2y0xkncSYc6w5qTa6tdWXvwtxdF1ZTdf0t1iDoVYXPJUkkXwDxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c574c14b6552378d3e2bb7f828c0ead7f76a32ecf4cf10811d00c8783fe23d25","last_reissued_at":"2026-05-18T02:21:36.387649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.387649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4554","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SabhpqWyvPPkYQqygxKCotnIBJ08LAQ7WrNhRqu9vzyokBoU3S+LXC9dPqpyIgW5DgLyQO5m5uXQ/wIdftRtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:56.341822Z"},"content_sha256":"ecf0d1baa17f08de724b2d69635b44b4342828d6d4faa7fcd4874c320ce22bd9","schema_version":"1.0","event_id":"sha256:ecf0d1baa17f08de724b2d69635b44b4342828d6d4faa7fcd4874c320ce22bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YV2MCS3FKI3Y2PRLW74CRQHK27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Paul Bonsma","submitted_at":"2011-09-21T15:22:19Z","abstract_excerpt":"The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After a sequence of improvements, the current best algorithm for planar graphs is a linear time algorithm by Dorn (STACS '10), with complexity $2^{O(k)} O(n)$.\n  We generalize this result, by giving an algorithm of the same complexity for graphs that can be embedded in surfaces of bounded genus. At the same time, we simplify the algorithm and analysis. The key to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4554","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89iz/O6rdzCT9/Rl+RXig3gnLM09WZ9m+OjtQvFS0U1keqg9d5x11BH+zN/Wj/4zYhZqcViWEJ06virJ4/EiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:56.342196Z"},"content_sha256":"2639441494b10523b40e4ec2d997e33f6fea2d33a268d882b04a0f57349a04be","schema_version":"1.0","event_id":"sha256:2639441494b10523b40e4ec2d997e33f6fea2d33a268d882b04a0f57349a04be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/bundle.json","state_url":"https://pith.science/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/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-28T21:59:56Z","links":{"resolver":"https://pith.science/pith/YV2MCS3FKI3Y2PRLW74CRQHK27","bundle":"https://pith.science/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/bundle.json","state":"https://pith.science/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YV2MCS3FKI3Y2PRLW74CRQHK27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YV2MCS3FKI3Y2PRLW74CRQHK27","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":"df6e3282c6b34d25181a44944a5f0ec0b85ce7d85be7f5bd950eee1d561e07ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-21T15:22:19Z","title_canon_sha256":"68f94ea95c707f7fa60076ccb24223d19cc5275fb3a4b6af1ab6b4d9537ffd9f"},"schema_version":"1.0","source":{"id":"1109.4554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4554","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4554v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4554","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"YV2MCS3FKI3Y","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YV2MCS3FKI3Y2PRL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YV2MCS3F","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:2639441494b10523b40e4ec2d997e33f6fea2d33a268d882b04a0f57349a04be","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After a sequence of improvements, the current best algorithm for planar graphs is a linear time algorithm by Dorn (STACS '10), with complexity $2^{O(k)} O(n)$.\n  We generalize this result, by giving an algorithm of the same complexity for graphs that can be embedded in surfaces of bounded genus. At the same time, we simplify the algorithm and analysis. The key to ","authors_text":"Paul Bonsma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-21T15:22:19Z","title":"Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4554","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:ecf0d1baa17f08de724b2d69635b44b4342828d6d4faa7fcd4874c320ce22bd9","target":"record","created_at":"2026-05-18T02:21:36Z","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":"df6e3282c6b34d25181a44944a5f0ec0b85ce7d85be7f5bd950eee1d561e07ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-21T15:22:19Z","title_canon_sha256":"68f94ea95c707f7fa60076ccb24223d19cc5275fb3a4b6af1ab6b4d9537ffd9f"},"schema_version":"1.0","source":{"id":"1109.4554","kind":"arxiv","version":1}},"canonical_sha256":"c574c14b6552378d3e2bb7f828c0ead7f76a32ecf4cf10811d00c8783fe23d25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c574c14b6552378d3e2bb7f828c0ead7f76a32ecf4cf10811d00c8783fe23d25","first_computed_at":"2026-05-18T02:21:36.387649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.387649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pU5p68a/Jy14CkrLFXsKnQeB466lZo9lID2y0xkncSYc6w5qTa6tdWXvwtxdF1ZTdf0t1iDoVYXPJUkkXwDxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.388071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecf0d1baa17f08de724b2d69635b44b4342828d6d4faa7fcd4874c320ce22bd9","sha256:2639441494b10523b40e4ec2d997e33f6fea2d33a268d882b04a0f57349a04be"],"state_sha256":"ffe8932936b05bee228dffe49d486ca683fa89b3f5d4ab1c067cf7037d4b3892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EHTMXeos3xb2oRDBUjvfLFccuA/hcL/Nxx7IgVJSjxVUadiTQevNkaffnu7015hko7ccuVmeMN5siOgmbgfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:59:56.345574Z","bundle_sha256":"3330793123197ba3a51f014dfaa7413192918746650279c1e97cf650d3b7d012"}}