{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H3WGISXLUFZHBBAJPWAAVFJMX4","short_pith_number":"pith:H3WGISXL","canonical_record":{"source":{"id":"1308.1575","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T14:00:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5601948c572f26a2bcdd85f261661559c6353b1480144110dc922cf453a34291","abstract_canon_sha256":"9078b772a1981b20dfcc844f2a34cb45f03c822809fb72d6fa8a6e8c67e445af"},"schema_version":"1.0"},"canonical_sha256":"3eec644aeba1727084097d800a952cbf1f8794eb1e3910f89b234402e593b757","source":{"kind":"arxiv","id":"1308.1575","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1575","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1575v3","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1575","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"H3WGISXLUFZH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H3WGISXLUFZHBBAJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H3WGISXL","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H3WGISXLUFZHBBAJPWAAVFJMX4","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1575","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T14:00:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5601948c572f26a2bcdd85f261661559c6353b1480144110dc922cf453a34291","abstract_canon_sha256":"9078b772a1981b20dfcc844f2a34cb45f03c822809fb72d6fa8a6e8c67e445af"},"schema_version":"1.0"},"canonical_sha256":"3eec644aeba1727084097d800a952cbf1f8794eb1e3910f89b234402e593b757","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.010701Z","signature_b64":"HR1taAMgE1doiukxCsgwoQzCSFvNwNBDFMnh1+VAamUsuZA9ICNpKaB6yhgTOb4LJ066RFRxAInqdWd6TLOEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eec644aeba1727084097d800a952cbf1f8794eb1e3910f89b234402e593b757","last_reissued_at":"2026-05-18T02:37:43.010216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.010216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1575","source_version":3,"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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5uG3rXL0ZxL7lD6MWeDP2F/FPmcHS1OzABEPUGC4Z/np5HgpF4NmeMoeS3nZEhGvN/3DyYEv4dXJQIAgIyWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:04:37.418467Z"},"content_sha256":"7b00fe19a8be46af7698a23970c7de5b59a57cf86ec8d461d5857e5058a0bf06","schema_version":"1.0","event_id":"sha256:7b00fe19a8be46af7698a23970c7de5b59a57cf86ec8d461d5857e5058a0bf06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H3WGISXLUFZHBBAJPWAAVFJMX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Kitty Meeks, Mark Jerrum","submitted_at":"2013-08-07T14:00:27Z","abstract_excerpt":"We introduce a class of parameterised counting problems on graphs, p-#Induced Subgraph With Property(\\Phi), which generalises a number of problems which have previously been studied. This paper focusses on the case in which \\Phi defines a family of graphs whose edge-minimal elements all have bounded treewidth; this includes the special case in which \\Phi describes the property of being connected. We show that exactly counting the number of connected induced k-vertex subgraphs in an n-vertex graph is #W[1]-hard, but on the other hand there exists an FPTRAS for the problem; more generally, we sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1575","kind":"arxiv","version":3},"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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICNszZTKZQBqlQ2+qX56+z7AUHiuOM6xAnXMtKVJ5+RAv2XTcxBMusM/bOECYCjeatWsyl8vvLxYIskQg4rnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:04:37.418815Z"},"content_sha256":"4b82a477d6274248bb4a9e73261114a5374ae4ce4dd6a4445e92ac118873fc99","schema_version":"1.0","event_id":"sha256:4b82a477d6274248bb4a9e73261114a5374ae4ce4dd6a4445e92ac118873fc99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/bundle.json","state_url":"https://pith.science/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/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-30T15:04:37Z","links":{"resolver":"https://pith.science/pith/H3WGISXLUFZHBBAJPWAAVFJMX4","bundle":"https://pith.science/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/bundle.json","state":"https://pith.science/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3WGISXLUFZHBBAJPWAAVFJMX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H3WGISXLUFZHBBAJPWAAVFJMX4","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":"9078b772a1981b20dfcc844f2a34cb45f03c822809fb72d6fa8a6e8c67e445af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T14:00:27Z","title_canon_sha256":"5601948c572f26a2bcdd85f261661559c6353b1480144110dc922cf453a34291"},"schema_version":"1.0","source":{"id":"1308.1575","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1575","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1575v3","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1575","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"H3WGISXLUFZH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H3WGISXLUFZHBBAJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H3WGISXL","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:4b82a477d6274248bb4a9e73261114a5374ae4ce4dd6a4445e92ac118873fc99","target":"graph","created_at":"2026-05-18T02:37:43Z","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 introduce a class of parameterised counting problems on graphs, p-#Induced Subgraph With Property(\\Phi), which generalises a number of problems which have previously been studied. This paper focusses on the case in which \\Phi defines a family of graphs whose edge-minimal elements all have bounded treewidth; this includes the special case in which \\Phi describes the property of being connected. We show that exactly counting the number of connected induced k-vertex subgraphs in an n-vertex graph is #W[1]-hard, but on the other hand there exists an FPTRAS for the problem; more generally, we sh","authors_text":"Kitty Meeks, Mark Jerrum","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T14:00:27Z","title":"The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1575","kind":"arxiv","version":3},"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:7b00fe19a8be46af7698a23970c7de5b59a57cf86ec8d461d5857e5058a0bf06","target":"record","created_at":"2026-05-18T02:37:43Z","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":"9078b772a1981b20dfcc844f2a34cb45f03c822809fb72d6fa8a6e8c67e445af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T14:00:27Z","title_canon_sha256":"5601948c572f26a2bcdd85f261661559c6353b1480144110dc922cf453a34291"},"schema_version":"1.0","source":{"id":"1308.1575","kind":"arxiv","version":3}},"canonical_sha256":"3eec644aeba1727084097d800a952cbf1f8794eb1e3910f89b234402e593b757","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3eec644aeba1727084097d800a952cbf1f8794eb1e3910f89b234402e593b757","first_computed_at":"2026-05-18T02:37:43.010216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.010216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HR1taAMgE1doiukxCsgwoQzCSFvNwNBDFMnh1+VAamUsuZA9ICNpKaB6yhgTOb4LJ066RFRxAInqdWd6TLOEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.010701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1575","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b00fe19a8be46af7698a23970c7de5b59a57cf86ec8d461d5857e5058a0bf06","sha256:4b82a477d6274248bb4a9e73261114a5374ae4ce4dd6a4445e92ac118873fc99"],"state_sha256":"97631ecd1e4acbf316b4b11359c17ca28b976ac3dd1790abbe05daa87315b3c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuSWGvZypu+EAdheA6izv07n4twBYPp9mQ774oIGzNXzXW6UGdvm+seYK/ho0TlgVzU7K/xQxpHCAaK9lkrCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:04:37.420771Z","bundle_sha256":"58130a2b91a4266ba9ec3b71b209e4fb00f8fdb311f620ac4974181eeee56ff2"}}