{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LEV62YAISNUATIIKWBWY6B73O5","short_pith_number":"pith:LEV62YAI","canonical_record":{"source":{"id":"1904.11285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T12:11:02Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"349f31e57df075e20f27b75ec498b775311d9df72d540da533552c25d3f64346","abstract_canon_sha256":"34008a04abc2bf3b1b79090d0f734363ba784649fbcfcebabf5338a3b24a6c13"},"schema_version":"1.0"},"canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","source":{"kind":"arxiv","id":"1904.11285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11285","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11285v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11285","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"LEV62YAISNUA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LEV62YAISNUATIIK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LEV62YAI","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LEV62YAISNUATIIKWBWY6B73O5","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T12:11:02Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"349f31e57df075e20f27b75ec498b775311d9df72d540da533552c25d3f64346","abstract_canon_sha256":"34008a04abc2bf3b1b79090d0f734363ba784649fbcfcebabf5338a3b24a6c13"},"schema_version":"1.0"},"canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:45.291906Z","signature_b64":"rpTEBvBxXqN3P2llBNLlYcfFNfiog/Mg0biqZ+QFrQsl94kCjRB/x1p65hcRYAC07zEJ+WemBlp/iplglFszDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","last_reissued_at":"2026-05-17T23:47:45.291296Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:45.291296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11285","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-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kNkNo8CUeg/jZmuyCue9ZRafYqghUou5AkrEfgFI+2NRu3BYgF1eqpSfls3ZCIJlXOpzpRIQecofZ2Eb3bUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:45.904358Z"},"content_sha256":"b68ff1ca3432796e1195f1f04b3b4a79c8be1c44eb0284de9804b3edb6daf468","schema_version":"1.0","event_id":"sha256:b68ff1ca3432796e1195f1f04b3b4a79c8be1c44eb0284de9804b3edb6daf468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LEV62YAISNUATIIKWBWY6B73O5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof","submitted_at":"2019-04-25T12:11:02Z","abstract_excerpt":"We present an algorithm that takes as input an $n$-vertex planar graph $G$ and a $k$-vertex pattern graph $P$, and computes the number of (induced) copies of $P$ in $G$ in $2^{O(k/\\log k)}n^{O(1)}$ time. If $P$ is a matching, independent set, or connected bounded maximum degree graph, the runtime reduces to $2^{\\tilde{O}(\\sqrt{k})}n^{O(1)}$.\n  While our algorithm counts all copies of $P$, it also improves the fastest algorithms that only detect copies of $P$. Before our work, no $2^{O(k/\\log k)}n^{O(1)}$ time algorithms for detecting unrestricted patterns $P$ were known, and by a result of Bod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11285","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-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kJht8srfAudhJTvgQKP0HcelFArE6swQi6OEn5h582iLRFHe29XXngfHJKBoR4nN7m2dzitpBqLMgJ4WkkFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:45.904721Z"},"content_sha256":"8727eb826462c3c2476c9c8e00c839d421bf0a4705066e948b5ccd3fe521e2a7","schema_version":"1.0","event_id":"sha256:8727eb826462c3c2476c9c8e00c839d421bf0a4705066e948b5ccd3fe521e2a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/bundle.json","state_url":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEV62YAISNUATIIKWBWY6B73O5/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-06-05T18:47:45Z","links":{"resolver":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5","bundle":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/bundle.json","state":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEV62YAISNUATIIKWBWY6B73O5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LEV62YAISNUATIIKWBWY6B73O5","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":"34008a04abc2bf3b1b79090d0f734363ba784649fbcfcebabf5338a3b24a6c13","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T12:11:02Z","title_canon_sha256":"349f31e57df075e20f27b75ec498b775311d9df72d540da533552c25d3f64346"},"schema_version":"1.0","source":{"id":"1904.11285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11285","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11285v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11285","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"LEV62YAISNUA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LEV62YAISNUATIIK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LEV62YAI","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8727eb826462c3c2476c9c8e00c839d421bf0a4705066e948b5ccd3fe521e2a7","target":"graph","created_at":"2026-05-17T23:47:45Z","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 present an algorithm that takes as input an $n$-vertex planar graph $G$ and a $k$-vertex pattern graph $P$, and computes the number of (induced) copies of $P$ in $G$ in $2^{O(k/\\log k)}n^{O(1)}$ time. If $P$ is a matching, independent set, or connected bounded maximum degree graph, the runtime reduces to $2^{\\tilde{O}(\\sqrt{k})}n^{O(1)}$.\n  While our algorithm counts all copies of $P$, it also improves the fastest algorithms that only detect copies of $P$. Before our work, no $2^{O(k/\\log k)}n^{O(1)}$ time algorithms for detecting unrestricted patterns $P$ were known, and by a result of Bod","authors_text":"Jesper Nederlof","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T12:11:02Z","title":"Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11285","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:b68ff1ca3432796e1195f1f04b3b4a79c8be1c44eb0284de9804b3edb6daf468","target":"record","created_at":"2026-05-17T23:47:45Z","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":"34008a04abc2bf3b1b79090d0f734363ba784649fbcfcebabf5338a3b24a6c13","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-25T12:11:02Z","title_canon_sha256":"349f31e57df075e20f27b75ec498b775311d9df72d540da533552c25d3f64346"},"schema_version":"1.0","source":{"id":"1904.11285","kind":"arxiv","version":1}},"canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","first_computed_at":"2026-05-17T23:47:45.291296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:45.291296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpTEBvBxXqN3P2llBNLlYcfFNfiog/Mg0biqZ+QFrQsl94kCjRB/x1p65hcRYAC07zEJ+WemBlp/iplglFszDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:45.291906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b68ff1ca3432796e1195f1f04b3b4a79c8be1c44eb0284de9804b3edb6daf468","sha256:8727eb826462c3c2476c9c8e00c839d421bf0a4705066e948b5ccd3fe521e2a7"],"state_sha256":"5d8247a0b8380dff506eb8b057c5f10c955dc2b327926d8f6ef9948485834821"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"in9mgHvjYuJYnFkusCKVErYUmSp1M/hLlWMatwQKISKBfyk//GwGjzGvb5RDbFT+dSFXH8cmFhn+2wGarr3lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:47:45.907162Z","bundle_sha256":"757d871cfa9e76935d846377bfe57aa04891024f56a4d1dcdcefb2601d25b24b"}}