{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AXUOATJ3HQOZ4WHCHBL6ODECCQ","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":"51166793f2bf4b4121096628874998723eb9fbb48e61d2c0338457f4c4b4eb58","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-04-23T18:16:07Z","title_canon_sha256":"a518beac3d9b0bc0437a97ef43bb6c6502235e04f9e26d5a9fc0f1d21be44ac6"},"schema_version":"1.0","source":{"id":"1904.10479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10479","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10479v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10479","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"AXUOATJ3HQOZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AXUOATJ3HQOZ4WHC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AXUOATJ3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:b6495d48b1743eb1fde0a8db3582d7d64c5fb8e78aa358b0a4ade8bb733b8b6b","target":"graph","created_at":"2026-05-17T23:47:53Z","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 study the problem #IndSub(P) of counting all induced subgraphs of size k in a graph G that satisfy the property P. This problem was introduced by Jerrum and Meeks and shown to be #W[1]-hard when parameterized by k for some families of properties P including, among others, connectivity [JCSS 15] and even- or oddness of the number of edges [Combinatorica 17]. Very recently [IPEC 18], two of the authors introduced a novel technique for the complexity analysis of #IndSub(P), inspired by the \"topological approach to evasiveness\" of Kahn, Saks and Sturtevant [FOCS 83] and the framework of graph m","authors_text":"Johannes Schmitt, Julian D\\\"orfler, Marc Roth, Philip Wellnitz","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-04-23T18:16:07Z","title":"Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10479","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:620f348b92bd0cf6433e08dfa31d878f0c8921e5647aa59e62c5b21529e84e03","target":"record","created_at":"2026-05-17T23:47:53Z","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":"51166793f2bf4b4121096628874998723eb9fbb48e61d2c0338457f4c4b4eb58","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-04-23T18:16:07Z","title_canon_sha256":"a518beac3d9b0bc0437a97ef43bb6c6502235e04f9e26d5a9fc0f1d21be44ac6"},"schema_version":"1.0","source":{"id":"1904.10479","kind":"arxiv","version":1}},"canonical_sha256":"05e8e04d3b3c1d9e58e23857e70c8214386d86c4bcfd4662c62f002181d9adf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05e8e04d3b3c1d9e58e23857e70c8214386d86c4bcfd4662c62f002181d9adf2","first_computed_at":"2026-05-17T23:47:53.590204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.590204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vgVNVw/7S4KN3YNFpWVxL7GhHv0mrAZkA/nGWTVFQ6OdeRJFeWxuuvbMPI8BbGI7BH2UfMG3S/bOUPeE4O79CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.590736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:620f348b92bd0cf6433e08dfa31d878f0c8921e5647aa59e62c5b21529e84e03","sha256:b6495d48b1743eb1fde0a8db3582d7d64c5fb8e78aa358b0a4ade8bb733b8b6b"],"state_sha256":"589a807ef6947c86bd3b5559a191f9b27192752b9a1eef458b3dba35336c045f"}