{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AXUOATJ3HQOZ4WHCHBL6ODECCQ","short_pith_number":"pith:AXUOATJ3","schema_version":"1.0","canonical_sha256":"05e8e04d3b3c1d9e58e23857e70c8214386d86c4bcfd4662c62f002181d9adf2","source":{"kind":"arxiv","id":"1904.10479","version":1},"attestation_state":"computed","paper":{"title":"Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Johannes Schmitt, Julian D\\\"orfler, Marc Roth, Philip Wellnitz","submitted_at":"2019-04-23T18:16:07Z","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"},"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.10479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-04-23T18:16:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a518beac3d9b0bc0437a97ef43bb6c6502235e04f9e26d5a9fc0f1d21be44ac6","abstract_canon_sha256":"51166793f2bf4b4121096628874998723eb9fbb48e61d2c0338457f4c4b4eb58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.590736Z","signature_b64":"vgVNVw/7S4KN3YNFpWVxL7GhHv0mrAZkA/nGWTVFQ6OdeRJFeWxuuvbMPI8BbGI7BH2UfMG3S/bOUPeE4O79CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e8e04d3b3c1d9e58e23857e70c8214386d86c4bcfd4662c62f002181d9adf2","last_reissued_at":"2026-05-17T23:47:53.590204Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.590204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Johannes Schmitt, Julian D\\\"orfler, Marc Roth, Philip Wellnitz","submitted_at":"2019-04-23T18:16:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10479","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.10479","created_at":"2026-05-17T23:47:53.590295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10479v1","created_at":"2026-05-17T23:47:53.590295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10479","created_at":"2026-05-17T23:47:53.590295+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXUOATJ3HQOZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXUOATJ3HQOZ4WHC","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXUOATJ3","created_at":"2026-05-18T12:33:12.712433+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/AXUOATJ3HQOZ4WHCHBL6ODECCQ","json":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ.json","graph_json":"https://pith.science/api/pith-number/AXUOATJ3HQOZ4WHCHBL6ODECCQ/graph.json","events_json":"https://pith.science/api/pith-number/AXUOATJ3HQOZ4WHCHBL6ODECCQ/events.json","paper":"https://pith.science/paper/AXUOATJ3"},"agent_actions":{"view_html":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ","download_json":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ.json","view_paper":"https://pith.science/paper/AXUOATJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10479&json=true","fetch_graph":"https://pith.science/api/pith-number/AXUOATJ3HQOZ4WHCHBL6ODECCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AXUOATJ3HQOZ4WHCHBL6ODECCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ/action/storage_attestation","attest_author":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ/action/author_attestation","sign_citation":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ/action/citation_signature","submit_replication":"https://pith.science/pith/AXUOATJ3HQOZ4WHCHBL6ODECCQ/action/replication_record"}},"created_at":"2026-05-17T23:47:53.590295+00:00","updated_at":"2026-05-17T23:47:53.590295+00:00"}