{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LEV62YAISNUATIIKWBWY6B73O5","short_pith_number":"pith:LEV62YAI","schema_version":"1.0","canonical_sha256":"592bed6008936809a10ab06d8f07fb775441bc011c5cde1dccac2cbcdc976e2d","source":{"kind":"arxiv","id":"1904.11285","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.11285","created_at":"2026-05-17T23:47:45.291423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11285v1","created_at":"2026-05-17T23:47:45.291423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11285","created_at":"2026-05-17T23:47:45.291423+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEV62YAISNUA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEV62YAISNUATIIK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEV62YAI","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5","json":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5.json","graph_json":"https://pith.science/api/pith-number/LEV62YAISNUATIIKWBWY6B73O5/graph.json","events_json":"https://pith.science/api/pith-number/LEV62YAISNUATIIKWBWY6B73O5/events.json","paper":"https://pith.science/paper/LEV62YAI"},"agent_actions":{"view_html":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5","download_json":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5.json","view_paper":"https://pith.science/paper/LEV62YAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11285&json=true","fetch_graph":"https://pith.science/api/pith-number/LEV62YAISNUATIIKWBWY6B73O5/graph.json","fetch_events":"https://pith.science/api/pith-number/LEV62YAISNUATIIKWBWY6B73O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/action/storage_attestation","attest_author":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/action/author_attestation","sign_citation":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/action/citation_signature","submit_replication":"https://pith.science/pith/LEV62YAISNUATIIKWBWY6B73O5/action/replication_record"}},"created_at":"2026-05-17T23:47:45.291423+00:00","updated_at":"2026-05-17T23:47:45.291423+00:00"}