{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZBPUY4V2VJYVLAYLHOEEYKMDF7","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":"c022a43f855784471bdcdf6665795f3a138f30a9374cebc72f68b09c3f551c65","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-24T15:34:17Z","title_canon_sha256":"e96e5dec90ed9ad85454c72161f99e8f95409a9d5ac853a530edb4783fd7e669"},"schema_version":"1.0","source":{"id":"1402.5857","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5857","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5857v2","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5857","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZBPUY4V2VJYV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBPUY4V2VJYVLAYL","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBPUY4V2","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:63c8c624c7e07feb8d0952902b0c8fc64dae1588984e5a1f044fcaf91b5eb316","target":"graph","created_at":"2026-05-18T02:00:02Z","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":"Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of these subgraphs in some sense; here, we prove a number of hardness results for the situation in which this bounded treewidth condition does not hold, resulting in dichotomies for some special cases of the general subgraph counting problem. The p","authors_text":"Kitty Meeks","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-24T15:34:17Z","title":"The challenges of unbounded treewidth in parameterised subgraph counting problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5857","kind":"arxiv","version":2},"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:2b879fd08b277a4542b81a9c883eb162b700777155e7fb637424e060a0765bf1","target":"record","created_at":"2026-05-18T02:00:02Z","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":"c022a43f855784471bdcdf6665795f3a138f30a9374cebc72f68b09c3f551c65","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-24T15:34:17Z","title_canon_sha256":"e96e5dec90ed9ad85454c72161f99e8f95409a9d5ac853a530edb4783fd7e669"},"schema_version":"1.0","source":{"id":"1402.5857","kind":"arxiv","version":2}},"canonical_sha256":"c85f4c72baaa7155830b3b884c29832ffaf4476ab2b5bd47fbc80525ea92bbe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85f4c72baaa7155830b3b884c29832ffaf4476ab2b5bd47fbc80525ea92bbe4","first_computed_at":"2026-05-18T02:00:02.706055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:02.706055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6A1y4n20CzQTiWo/ElbTEIDkhwyj5qWGOUexCbXqEAiYoJkLU9MoJx4godqWANBukcGqSY7MyyZlVwAuNFh0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:02.706540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5857","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b879fd08b277a4542b81a9c883eb162b700777155e7fb637424e060a0765bf1","sha256:63c8c624c7e07feb8d0952902b0c8fc64dae1588984e5a1f044fcaf91b5eb316"],"state_sha256":"4dc2dbebfd4521398aefb1adcdc1aec2651e65a073f3abc5f25555e10d425b51"}