{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CBAORTZIMJVSYXSNFHM6ELQJJL","short_pith_number":"pith:CBAORTZI","schema_version":"1.0","canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","source":{"kind":"arxiv","id":"1807.01920","version":1},"attestation_state":"computed","paper":{"title":"Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johannes Schmitt, Marc Roth","submitted_at":"2018-07-05T09:51:21Z","abstract_excerpt":"We investigate the problem $\\#\\mathsf{IndSub}(\\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be $\\#\\mathrm{W[1]}$-hard for some families of properties which include, among others, (dis)connectedness [JCSS 15] and even- or oddness of the number of edges [Combinatorica 17]. Using the recent framework of graph motif parameters due to Curticapean, Dell and Marx [STOC 17], we discover that for monotone properties $\\Phi$, the problem $\\#\\mathsf{IndSub}(\\Phi)$ is hard for $"},"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":"1807.01920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-07-05T09:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"ce2d38103de1125a22c75f41421d6c85ad49174032868bd7fcac14f2afbc9f48","abstract_canon_sha256":"d980b862c880acef172926a798997065cccc90e0a1a0799add53fe4af3e005b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:24.705935Z","signature_b64":"WlKf7as7Y6JHttCOWSQhKXaifnztTTk2uMhdqwdgoUFrOjCv1dI1C9h+EPgKrOpyjWvvGBMiGPWnsU/DNUB8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","last_reissued_at":"2026-05-18T00:11:24.705500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:24.705500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johannes Schmitt, Marc Roth","submitted_at":"2018-07-05T09:51:21Z","abstract_excerpt":"We investigate the problem $\\#\\mathsf{IndSub}(\\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be $\\#\\mathrm{W[1]}$-hard for some families of properties which include, among others, (dis)connectedness [JCSS 15] and even- or oddness of the number of edges [Combinatorica 17]. Using the recent framework of graph motif parameters due to Curticapean, Dell and Marx [STOC 17], we discover that for monotone properties $\\Phi$, the problem $\\#\\mathsf{IndSub}(\\Phi)$ is hard for $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01920","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":"1807.01920","created_at":"2026-05-18T00:11:24.705558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01920v1","created_at":"2026-05-18T00:11:24.705558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01920","created_at":"2026-05-18T00:11:24.705558+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBAORTZIMJVS","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBAORTZIMJVSYXSN","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBAORTZI","created_at":"2026-05-18T12:32:16.446611+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/CBAORTZIMJVSYXSNFHM6ELQJJL","json":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL.json","graph_json":"https://pith.science/api/pith-number/CBAORTZIMJVSYXSNFHM6ELQJJL/graph.json","events_json":"https://pith.science/api/pith-number/CBAORTZIMJVSYXSNFHM6ELQJJL/events.json","paper":"https://pith.science/paper/CBAORTZI"},"agent_actions":{"view_html":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL","download_json":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL.json","view_paper":"https://pith.science/paper/CBAORTZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01920&json=true","fetch_graph":"https://pith.science/api/pith-number/CBAORTZIMJVSYXSNFHM6ELQJJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CBAORTZIMJVSYXSNFHM6ELQJJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/action/storage_attestation","attest_author":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/action/author_attestation","sign_citation":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/action/citation_signature","submit_replication":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/action/replication_record"}},"created_at":"2026-05-18T00:11:24.705558+00:00","updated_at":"2026-05-18T00:11:24.705558+00:00"}