{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CBAORTZIMJVSYXSNFHM6ELQJJL","short_pith_number":"pith:CBAORTZI","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"},"canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","source":{"kind":"arxiv","id":"1807.01920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01920","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01920v1","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01920","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"CBAORTZIMJVS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CBAORTZIMJVSYXSN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CBAORTZI","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CBAORTZIMJVSYXSNFHM6ELQJJL","target":"record","payload":{"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"},"canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","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"},"source_kind":"arxiv","source_id":"1807.01920","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4BDy15htatk0Ak1CaTO4zhbot7mnNZTRz/lObDg8qUPD+n+pLlUHV3Of5WCA0MgUbUbxitM4MVx0w3xEexbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:08:17.747294Z"},"content_sha256":"576faaa95b85b88b52267db8b073ed03c86874d87b98308e7bf0c246282ffbda","schema_version":"1.0","event_id":"sha256:576faaa95b85b88b52267db8b073ed03c86874d87b98308e7bf0c246282ffbda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CBAORTZIMJVSYXSNFHM6ELQJJL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zB1hR/2D6hhAmC6ONl8sBBWaeXL0jgqE3Bf/roDTEgsiVJQWCfbulwmjXrj7CuKDHX+GoahRYodMkv+1JVmWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:08:17.747977Z"},"content_sha256":"71367d587497f7ebfcd6f013e81dbf9506135c0faa89e20c6b706b28b3b56c07","schema_version":"1.0","event_id":"sha256:71367d587497f7ebfcd6f013e81dbf9506135c0faa89e20c6b706b28b3b56c07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/bundle.json","state_url":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T09:08:17Z","links":{"resolver":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL","bundle":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/bundle.json","state":"https://pith.science/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBAORTZIMJVSYXSNFHM6ELQJJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CBAORTZIMJVSYXSNFHM6ELQJJL","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":"d980b862c880acef172926a798997065cccc90e0a1a0799add53fe4af3e005b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-07-05T09:51:21Z","title_canon_sha256":"ce2d38103de1125a22c75f41421d6c85ad49174032868bd7fcac14f2afbc9f48"},"schema_version":"1.0","source":{"id":"1807.01920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01920","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01920v1","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01920","created_at":"2026-05-18T00:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"CBAORTZIMJVS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CBAORTZIMJVSYXSN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CBAORTZI","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:71367d587497f7ebfcd6f013e81dbf9506135c0faa89e20c6b706b28b3b56c07","target":"graph","created_at":"2026-05-18T00:11:24Z","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 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 $","authors_text":"Johannes Schmitt, Marc Roth","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-07-05T09:51:21Z","title":"Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01920","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:576faaa95b85b88b52267db8b073ed03c86874d87b98308e7bf0c246282ffbda","target":"record","created_at":"2026-05-18T00:11:24Z","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":"d980b862c880acef172926a798997065cccc90e0a1a0799add53fe4af3e005b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-07-05T09:51:21Z","title_canon_sha256":"ce2d38103de1125a22c75f41421d6c85ad49174032868bd7fcac14f2afbc9f48"},"schema_version":"1.0","source":{"id":"1807.01920","kind":"arxiv","version":1}},"canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1040e8cf28626b2c5e4d29d9e22e094aebbc0eda62038e97f270ff910229be20","first_computed_at":"2026-05-18T00:11:24.705500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:24.705500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlKf7as7Y6JHttCOWSQhKXaifnztTTk2uMhdqwdgoUFrOjCv1dI1C9h+EPgKrOpyjWvvGBMiGPWnsU/DNUB8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:24.705935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576faaa95b85b88b52267db8b073ed03c86874d87b98308e7bf0c246282ffbda","sha256:71367d587497f7ebfcd6f013e81dbf9506135c0faa89e20c6b706b28b3b56c07"],"state_sha256":"1352029659fd2ded7c88f2cef83aeab338b4563fc17b7cb23aef61a20d3a080e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvO1pAwwcn3mzSGgLMA/5/l9bngwogHRQxQylYka3QhbnvVdcggjN+9DSjmrozYouFu1iFA9hgQ0LDpuNLZOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:08:17.751503Z","bundle_sha256":"723702a48447a20aa3a382a0c96fd8de13bd01b85f243e61127de6def221634f"}}