{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LVEKODK5PP6PJI65YU7LGCNHMJ","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":"8744b21fdd6a6cebf8cb79735eaf93157a0f4d126568f140a1838280413d068d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:59:19Z","title_canon_sha256":"f259bb1b06178f8937c61d478e7efa8fbac4d2b6c813827d6b0de285e6fff086"},"schema_version":"1.0","source":{"id":"1407.2929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2929","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2929v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2929","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"LVEKODK5PP6P","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LVEKODK5PP6PJI65","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LVEKODK5","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:8cefc5db7189fb17be9d233ba0dd409aa78cc75354e7dc9f8ed500baf07a18a5","target":"graph","created_at":"2026-05-18T02: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":"For a class $\\mathcal{H}$ of graphs, #Sub$(\\mathcal{H})$ is the counting problem that, given a graph $H\\in \\mathcal{H}$ and an arbitrary graph $G$, asks for the number of subgraphs of $G$ isomorphic to $H$. It is known that if $\\mathcal{H}$ has bounded vertex-cover number (equivalently, the size of the maximum matching in $\\mathcal{H}$ is bounded), then #Sub$(\\mathcal{H})$ is polynomial-time solvable. We complement this result with a corresponding lower bound: if $\\mathcal{H}$ is any recursively enumerable class of graphs with unbounded vertex-cover number, then #Sub$(\\mathcal{H})$ is #W[1]-ha","authors_text":"D\\'aniel Marx, Radu Curticapean","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:59:19Z","title":"Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2929","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:3ae6cf1bcd342d9f94629d6f29c8881f300113c6acd9a41a2cd3b436b8b81913","target":"record","created_at":"2026-05-18T02: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":"8744b21fdd6a6cebf8cb79735eaf93157a0f4d126568f140a1838280413d068d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-10T19:59:19Z","title_canon_sha256":"f259bb1b06178f8937c61d478e7efa8fbac4d2b6c813827d6b0de285e6fff086"},"schema_version":"1.0","source":{"id":"1407.2929","kind":"arxiv","version":1}},"canonical_sha256":"5d48a70d5d7bfcf4a3ddc53eb309a762609b646defee37d446f5069feaec7b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d48a70d5d7bfcf4a3ddc53eb309a762609b646defee37d446f5069feaec7b9b","first_computed_at":"2026-05-18T02:47:53.380647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:53.380647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/ZcvgEXWpmqEkLRfaiqHgI8G/+q6u9vfDDkrvqGZZ5LHZb+WUArPsroI93/B+3yTdVV13dQb8RGsapjcpChAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:53.381217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae6cf1bcd342d9f94629d6f29c8881f300113c6acd9a41a2cd3b436b8b81913","sha256:8cefc5db7189fb17be9d233ba0dd409aa78cc75354e7dc9f8ed500baf07a18a5"],"state_sha256":"f5edfa1ab8bc7d1796af4fa233983a644c2171b975c9fb2c7dce60780893f9ca"}