{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DXQEOQTPDHKLOXROG6FDJWNCOM","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":"b958a39402eee4947231f00c774aabb6badf300429ba9a32f5fccba257e7c7f0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T11:27:17Z","title_canon_sha256":"587e4bfe7b0a555870d2429cbcefc7c8e066b1bd6e5c881c7f355e8f531d844f"},"schema_version":"1.0","source":{"id":"1707.05186","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05186","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05186v2","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05186","created_at":"2026-05-18T00:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"DXQEOQTPDHKL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXQEOQTPDHKLOXRO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXQEOQTP","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:b41304c0f0b0ba1c7e01890bd37a166c1d8a71e0e4fe2cc7591afc22073408e0","target":"graph","created_at":"2026-05-18T00:34:41Z","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":"In this paper we show that for any graph $H$ of order $m$ and any graph $G$ of order $n$ and maximum degree $\\Delta$ one can compute the number of subsets $S$ of $V(G)$ that induces a graph isomorphic to $H $in time $O(c^m\\cdot n)$ for some constant $c = c(\\Delta) > 0$. This is essentially best possible.","authors_text":"Guus Regts, Viresh Patel","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T11:27:17Z","title":"Computing the number of induced copies of a fixed graph in a bounded degree graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05186","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:d5cbcd91b60d0be0c5e08426feab5ee9cb9eab5e9d1dfb5f7cac8ac7f9c24947","target":"record","created_at":"2026-05-18T00:34:41Z","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":"b958a39402eee4947231f00c774aabb6badf300429ba9a32f5fccba257e7c7f0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T11:27:17Z","title_canon_sha256":"587e4bfe7b0a555870d2429cbcefc7c8e066b1bd6e5c881c7f355e8f531d844f"},"schema_version":"1.0","source":{"id":"1707.05186","kind":"arxiv","version":2}},"canonical_sha256":"1de047426f19d4b75e2e378a34d9a2730d13026dba4bd55c34d110a0300dbeda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de047426f19d4b75e2e378a34d9a2730d13026dba4bd55c34d110a0300dbeda","first_computed_at":"2026-05-18T00:34:41.382276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:41.382276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vTocFTfAJkaNbJs/ylgsuPvp/0hmO9XQ81ph0H2Gn9qHJVguyNgvTFCX6+3XH42GNXUdGPbaPQL/RRdLx3i/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:41.382928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05186","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5cbcd91b60d0be0c5e08426feab5ee9cb9eab5e9d1dfb5f7cac8ac7f9c24947","sha256:b41304c0f0b0ba1c7e01890bd37a166c1d8a71e0e4fe2cc7591afc22073408e0"],"state_sha256":"852fc1524aae5dacc3ff647227963ee6796322000ec58f90d52346f0243cf169"}