{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PXIQLDPWQNYVKYZNVJHJ7B4VAA","short_pith_number":"pith:PXIQLDPW","schema_version":"1.0","canonical_sha256":"7dd1058df6837155632daa4e9f87950011a4525c0a3234678f84392fa54c00a5","source":{"kind":"arxiv","id":"2105.05062","version":1},"attestation_state":"computed","paper":{"title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jasper Slusallek, Karl Bringmann","submitted_at":"2021-05-11T14:12:43Z","abstract_excerpt":"The Subgraph Isomorphism problem is of considerable importance in computer science. We examine the problem when the pattern graph H is of bounded treewidth, as occurs in a variety of applications. This problem has a well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon, Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$. While there are pattern graphs known for which Subgraph Isomorphism can be solved in an improved running time of $O(n^{tw(H)+1-\\varepsilon})$ or even faster (e.g. for $k$-cliques), it is not known whether such improvements are"},"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":"2105.05062","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-11T14:12:43Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"68ecadd820f9f41e99ec737599abd411ba1e35c3a8f1592895e5663b9ee9f33e","abstract_canon_sha256":"577f59aaefbe0066267f93620e4757f107e8a0ec0297b2ed0d8edccdc2f10e89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:27.724343Z","signature_b64":"fTt3JFV15uXU1amjPAooBtOH0rZTfwMBhO8lDl7dLybxYfnLShAfMQaPLc7/RMmArDsMPHdTOAKzwJDUagVKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dd1058df6837155632daa4e9f87950011a4525c0a3234678f84392fa54c00a5","last_reissued_at":"2026-07-05T02:39:27.723871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:27.723871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jasper Slusallek, Karl Bringmann","submitted_at":"2021-05-11T14:12:43Z","abstract_excerpt":"The Subgraph Isomorphism problem is of considerable importance in computer science. We examine the problem when the pattern graph H is of bounded treewidth, as occurs in a variety of applications. This problem has a well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon, Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$. While there are pattern graphs known for which Subgraph Isomorphism can be solved in an improved running time of $O(n^{tw(H)+1-\\varepsilon})$ or even faster (e.g. for $k$-cliques), it is not known whether such improvements are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05062","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.05062/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.05062","created_at":"2026-07-05T02:39:27.723946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.05062v1","created_at":"2026-07-05T02:39:27.723946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05062","created_at":"2026-07-05T02:39:27.723946+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXIQLDPWQNYV","created_at":"2026-07-05T02:39:27.723946+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXIQLDPWQNYVKYZN","created_at":"2026-07-05T02:39:27.723946+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXIQLDPW","created_at":"2026-07-05T02:39:27.723946+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22300","citing_title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA","json":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA.json","graph_json":"https://pith.science/api/pith-number/PXIQLDPWQNYVKYZNVJHJ7B4VAA/graph.json","events_json":"https://pith.science/api/pith-number/PXIQLDPWQNYVKYZNVJHJ7B4VAA/events.json","paper":"https://pith.science/paper/PXIQLDPW"},"agent_actions":{"view_html":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA","download_json":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA.json","view_paper":"https://pith.science/paper/PXIQLDPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.05062&json=true","fetch_graph":"https://pith.science/api/pith-number/PXIQLDPWQNYVKYZNVJHJ7B4VAA/graph.json","fetch_events":"https://pith.science/api/pith-number/PXIQLDPWQNYVKYZNVJHJ7B4VAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA/action/storage_attestation","attest_author":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA/action/author_attestation","sign_citation":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA/action/citation_signature","submit_replication":"https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA/action/replication_record"}},"created_at":"2026-07-05T02:39:27.723946+00:00","updated_at":"2026-07-05T02:39:27.723946+00:00"}