{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OWK3FFFVUZK3SVKICJMZBUEKXT","short_pith_number":"pith:OWK3FFFV","canonical_record":{"source":{"id":"1310.6524","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-24T08:20:01Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e9c12736a99d7dc0bfb2dfe341eada754ea448c70a7e0098a30c2944766a7927","abstract_canon_sha256":"4163b07c4bb89b7c02c3eaab85dbf990c949a679acd63eabbd00dff11b128f7a"},"schema_version":"1.0"},"canonical_sha256":"7595b294b5a655b95548125990d08abcc03479efcf3ef50608d1bd9441d596ba","source":{"kind":"arxiv","id":"1310.6524","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6524","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6524v5","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6524","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"OWK3FFFVUZK3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OWK3FFFVUZK3SVKI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OWK3FFFV","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OWK3FFFVUZK3SVKICJMZBUEKXT","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6524","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-24T08:20:01Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e9c12736a99d7dc0bfb2dfe341eada754ea448c70a7e0098a30c2944766a7927","abstract_canon_sha256":"4163b07c4bb89b7c02c3eaab85dbf990c949a679acd63eabbd00dff11b128f7a"},"schema_version":"1.0"},"canonical_sha256":"7595b294b5a655b95548125990d08abcc03479efcf3ef50608d1bd9441d596ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:59.658160Z","signature_b64":"HaXyxiQBLATag6KODm2QsU1QN9zYqT4ERZWVdR6iZMzpUofU1IjIcQOgo8uxL63eQNDaut5AZjHhs2/+qbH3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7595b294b5a655b95548125990d08abcc03479efcf3ef50608d1bd9441d596ba","last_reissued_at":"2026-05-18T02:41:59.657755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:59.657755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6524","source_version":5,"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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/4ERCTrot1r82cHLTsv2U4DkD6d9dQgqJrKsu7NS2Op+1ezS0KTG5OId8lPPe2xsI6jaKfLBAC1C0cewqOlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:05:40.457811Z"},"content_sha256":"cc0af4eb7ccaa98bc1d86b92ac8083c4125d7b547d0905129b49e71de53908a9","schema_version":"1.0","event_id":"sha256:cc0af4eb7ccaa98bc1d86b92ac8083c4125d7b547d0905129b49e71de53908a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OWK3FFFVUZK3SVKICJMZBUEKXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some hard families of parameterised counting problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Kitty Meeks, Mark Jerrum","submitted_at":"2013-10-24T08:20:01Z","abstract_excerpt":"We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]-complete; here we substantially generalise some of these existing results by proving hardness for two large families of such problems. We demonstrate that it is #W[1]-hard to count the number of k-vertex subgraphs having any property where the number of distinct edge-densities of labelled subgraphs that satisfy the property is o(k^2). In the special case that the property in question depends only on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6524","kind":"arxiv","version":5},"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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPmYkZ+egm4p8EhmjZ9oOmrSJFwTQUc/twg2u+RBSIJU3D+pzsCsSAKwSExRGUftQj1pK0EMXXpgoC3goYoUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:05:40.458158Z"},"content_sha256":"4e9d9a0542fdd679ca19f98431e1669ef3befa00fee428ec5456e80cea723953","schema_version":"1.0","event_id":"sha256:4e9d9a0542fdd679ca19f98431e1669ef3befa00fee428ec5456e80cea723953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/bundle.json","state_url":"https://pith.science/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/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-30T16:05:40Z","links":{"resolver":"https://pith.science/pith/OWK3FFFVUZK3SVKICJMZBUEKXT","bundle":"https://pith.science/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/bundle.json","state":"https://pith.science/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWK3FFFVUZK3SVKICJMZBUEKXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OWK3FFFVUZK3SVKICJMZBUEKXT","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":"4163b07c4bb89b7c02c3eaab85dbf990c949a679acd63eabbd00dff11b128f7a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-24T08:20:01Z","title_canon_sha256":"e9c12736a99d7dc0bfb2dfe341eada754ea448c70a7e0098a30c2944766a7927"},"schema_version":"1.0","source":{"id":"1310.6524","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6524","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6524v5","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6524","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"OWK3FFFVUZK3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OWK3FFFVUZK3SVKI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OWK3FFFV","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:4e9d9a0542fdd679ca19f98431e1669ef3befa00fee428ec5456e80cea723953","target":"graph","created_at":"2026-05-18T02:41:59Z","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 parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]-complete; here we substantially generalise some of these existing results by proving hardness for two large families of such problems. We demonstrate that it is #W[1]-hard to count the number of k-vertex subgraphs having any property where the number of distinct edge-densities of labelled subgraphs that satisfy the property is o(k^2). In the special case that the property in question depends only on","authors_text":"Kitty Meeks, Mark Jerrum","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-24T08:20:01Z","title":"Some hard families of parameterised counting problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6524","kind":"arxiv","version":5},"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:cc0af4eb7ccaa98bc1d86b92ac8083c4125d7b547d0905129b49e71de53908a9","target":"record","created_at":"2026-05-18T02:41:59Z","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":"4163b07c4bb89b7c02c3eaab85dbf990c949a679acd63eabbd00dff11b128f7a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-24T08:20:01Z","title_canon_sha256":"e9c12736a99d7dc0bfb2dfe341eada754ea448c70a7e0098a30c2944766a7927"},"schema_version":"1.0","source":{"id":"1310.6524","kind":"arxiv","version":5}},"canonical_sha256":"7595b294b5a655b95548125990d08abcc03479efcf3ef50608d1bd9441d596ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7595b294b5a655b95548125990d08abcc03479efcf3ef50608d1bd9441d596ba","first_computed_at":"2026-05-18T02:41:59.657755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:59.657755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HaXyxiQBLATag6KODm2QsU1QN9zYqT4ERZWVdR6iZMzpUofU1IjIcQOgo8uxL63eQNDaut5AZjHhs2/+qbH3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:59.658160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6524","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc0af4eb7ccaa98bc1d86b92ac8083c4125d7b547d0905129b49e71de53908a9","sha256:4e9d9a0542fdd679ca19f98431e1669ef3befa00fee428ec5456e80cea723953"],"state_sha256":"51542ffd142c06c9c678fc50bebdc539ff87ebd109890ab8ef9da364e87b7f86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX///g2ybIW+Bj1FwXrNJdLVZ9j7a7el7bhjV0gggShbPPduMBdXMfwBP8khD56x/WzUcqUOJPXCbLHzVjPwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T16:05:40.460108Z","bundle_sha256":"15529bd22c7b42ee3b2df58f2d9149caab50efe17bffd0aaff2359f22811acc6"}}