{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OTZYPVREOWLYZRYIFPWH66N7ZA","short_pith_number":"pith:OTZYPVRE","canonical_record":{"source":{"id":"1410.3375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T16:08:35Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"7f9ff4432eb4f97ac23dd459148ea81a3e935b1830d1e73efb43542bd5ebe420","abstract_canon_sha256":"e3be942e7e7fc9486f4349e08b1e60639fb6bae61af1ec8b30b55f5fa1b7b2ee"},"schema_version":"1.0"},"canonical_sha256":"74f387d62475978cc7082bec7f79bfc81d1890af2345d3a8d05cff926185f215","source":{"kind":"arxiv","id":"1410.3375","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3375","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3375v2","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3375","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"OTZYPVREOWLY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTZYPVREOWLYZRYI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTZYPVRE","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OTZYPVREOWLYZRYIFPWH66N7ZA","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T16:08:35Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"7f9ff4432eb4f97ac23dd459148ea81a3e935b1830d1e73efb43542bd5ebe420","abstract_canon_sha256":"e3be942e7e7fc9486f4349e08b1e60639fb6bae61af1ec8b30b55f5fa1b7b2ee"},"schema_version":"1.0"},"canonical_sha256":"74f387d62475978cc7082bec7f79bfc81d1890af2345d3a8d05cff926185f215","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:03.710693Z","signature_b64":"6BETUiZJPYRjoT2gjFr+SmPEthbDXJCaCdQVPubDLH9meyN9+LPWqgoPrwAb6CwytVlng7k2TvurZ9RgZOtKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74f387d62475978cc7082bec7f79bfc81d1890af2345d3a8d05cff926185f215","last_reissued_at":"2026-05-18T01:31:03.710048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:03.710048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3375","source_version":2,"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-18T01:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NEm7sAvp4Yvk4/+64mwvbPqeT/iUPbBH0Ddzxcb/zsd3a8vjLas5DIwsD51+cp7zh9RWGF4JWMDEkOfJ0QzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:39:05.658903Z"},"content_sha256":"ee298f2552d15587d83a7f257fb5d895a3b0a5add70a6fcdaab5712b9a8e4eed","schema_version":"1.0","event_id":"sha256:ee298f2552d15587d83a7f257fb5d895a3b0a5add70a6fcdaab5712b9a8e4eed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OTZYPVREOWLYZRYIFPWH66N7ZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The parameterised complexity of counting even and odd induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Kitty Meeks, Mark Jerrum","submitted_at":"2014-10-13T16:08:35Z","abstract_excerpt":"We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges. We demonstrate that both problems are #W[1]-hard when parameterised by k, in fact proving a somewhat stronger result about counting subgraphs with a property that only holds for some subset of k-vertex subgraphs which have an even (respectively odd) number of edges. On the other hand, we show that the problems of counting even and odd k-vertex induced subgr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3375","kind":"arxiv","version":2},"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-18T01:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKbKPltnSdXFcy9sFee3uBot5wJ8AZWo8vIdRSpVyBwyinhcTr1lsM5JrBEY0vhBJtWli63vkE/K5LC/26AtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:39:05.659248Z"},"content_sha256":"b4768f0ef561e8601c01ca1434d67b83417503f81ac30eddbcecfa1e3fece080","schema_version":"1.0","event_id":"sha256:b4768f0ef561e8601c01ca1434d67b83417503f81ac30eddbcecfa1e3fece080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/bundle.json","state_url":"https://pith.science/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/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-30T19:39:05Z","links":{"resolver":"https://pith.science/pith/OTZYPVREOWLYZRYIFPWH66N7ZA","bundle":"https://pith.science/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/bundle.json","state":"https://pith.science/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTZYPVREOWLYZRYIFPWH66N7ZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OTZYPVREOWLYZRYIFPWH66N7ZA","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":"e3be942e7e7fc9486f4349e08b1e60639fb6bae61af1ec8b30b55f5fa1b7b2ee","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T16:08:35Z","title_canon_sha256":"7f9ff4432eb4f97ac23dd459148ea81a3e935b1830d1e73efb43542bd5ebe420"},"schema_version":"1.0","source":{"id":"1410.3375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3375","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3375v2","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3375","created_at":"2026-05-18T01:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"OTZYPVREOWLY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTZYPVREOWLYZRYI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTZYPVRE","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b4768f0ef561e8601c01ca1434d67b83417503f81ac30eddbcecfa1e3fece080","target":"graph","created_at":"2026-05-18T01:31:03Z","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 consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges. We demonstrate that both problems are #W[1]-hard when parameterised by k, in fact proving a somewhat stronger result about counting subgraphs with a property that only holds for some subset of k-vertex subgraphs which have an even (respectively odd) number of edges. On the other hand, we show that the problems of counting even and odd k-vertex induced subgr","authors_text":"Kitty Meeks, Mark Jerrum","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T16:08:35Z","title":"The parameterised complexity of counting even and odd induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3375","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:ee298f2552d15587d83a7f257fb5d895a3b0a5add70a6fcdaab5712b9a8e4eed","target":"record","created_at":"2026-05-18T01:31:03Z","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":"e3be942e7e7fc9486f4349e08b1e60639fb6bae61af1ec8b30b55f5fa1b7b2ee","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T16:08:35Z","title_canon_sha256":"7f9ff4432eb4f97ac23dd459148ea81a3e935b1830d1e73efb43542bd5ebe420"},"schema_version":"1.0","source":{"id":"1410.3375","kind":"arxiv","version":2}},"canonical_sha256":"74f387d62475978cc7082bec7f79bfc81d1890af2345d3a8d05cff926185f215","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74f387d62475978cc7082bec7f79bfc81d1890af2345d3a8d05cff926185f215","first_computed_at":"2026-05-18T01:31:03.710048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:03.710048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6BETUiZJPYRjoT2gjFr+SmPEthbDXJCaCdQVPubDLH9meyN9+LPWqgoPrwAb6CwytVlng7k2TvurZ9RgZOtKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:03.710693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee298f2552d15587d83a7f257fb5d895a3b0a5add70a6fcdaab5712b9a8e4eed","sha256:b4768f0ef561e8601c01ca1434d67b83417503f81ac30eddbcecfa1e3fece080"],"state_sha256":"f8893dbf271a9244bddfea3e64e6c4f3f63835e35f4d808eda4b2a4a3f4cf9ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0MAJ3CuSUCyXAwhlH7q0Eit7yRfWnDGizAfYLZiPmuC7q6YwenI7Hmr5C+qLJSi2qVdnTmJwonigfN1UC1FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:39:05.661145Z","bundle_sha256":"14607108590ace184772849eccae111db015ac1872a43d769b534f4d219e94da"}}