{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DXQEOQTPDHKLOXROG6FDJWNCOM","short_pith_number":"pith:DXQEOQTP","schema_version":"1.0","canonical_sha256":"1de047426f19d4b75e2e378a34d9a2730d13026dba4bd55c34d110a0300dbeda","source":{"kind":"arxiv","id":"1707.05186","version":2},"attestation_state":"computed","paper":{"title":"Computing the number of induced copies of a fixed graph in a bounded degree graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Guus Regts, Viresh Patel","submitted_at":"2017-07-14T11:27:17Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.05186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T11:27:17Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"587e4bfe7b0a555870d2429cbcefc7c8e066b1bd6e5c881c7f355e8f531d844f","abstract_canon_sha256":"b958a39402eee4947231f00c774aabb6badf300429ba9a32f5fccba257e7c7f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:41.382928Z","signature_b64":"vTocFTfAJkaNbJs/ylgsuPvp/0hmO9XQ81ph0H2Gn9qHJVguyNgvTFCX6+3XH42GNXUdGPbaPQL/RRdLx3i/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de047426f19d4b75e2e378a34d9a2730d13026dba4bd55c34d110a0300dbeda","last_reissued_at":"2026-05-18T00:34:41.382276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:41.382276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the number of induced copies of a fixed graph in a bounded degree graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Guus Regts, Viresh Patel","submitted_at":"2017-07-14T11:27:17Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05186","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.05186","created_at":"2026-05-18T00:34:41.382392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05186v2","created_at":"2026-05-18T00:34:41.382392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05186","created_at":"2026-05-18T00:34:41.382392+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXQEOQTPDHKL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXQEOQTPDHKLOXRO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXQEOQTP","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM","json":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM.json","graph_json":"https://pith.science/api/pith-number/DXQEOQTPDHKLOXROG6FDJWNCOM/graph.json","events_json":"https://pith.science/api/pith-number/DXQEOQTPDHKLOXROG6FDJWNCOM/events.json","paper":"https://pith.science/paper/DXQEOQTP"},"agent_actions":{"view_html":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM","download_json":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM.json","view_paper":"https://pith.science/paper/DXQEOQTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05186&json=true","fetch_graph":"https://pith.science/api/pith-number/DXQEOQTPDHKLOXROG6FDJWNCOM/graph.json","fetch_events":"https://pith.science/api/pith-number/DXQEOQTPDHKLOXROG6FDJWNCOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM/action/storage_attestation","attest_author":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM/action/author_attestation","sign_citation":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM/action/citation_signature","submit_replication":"https://pith.science/pith/DXQEOQTPDHKLOXROG6FDJWNCOM/action/replication_record"}},"created_at":"2026-05-18T00:34:41.382392+00:00","updated_at":"2026-05-18T00:34:41.382392+00:00"}