{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7CGFGDCX367JO2LUA4MQA6GSMR","short_pith_number":"pith:7CGFGDCX","schema_version":"1.0","canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","source":{"kind":"arxiv","id":"1705.01595","version":1},"attestation_state":"computed","paper":{"title":"Homomorphisms Are a Good Basis for Counting Small Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Holger Dell, Radu Curticapean","submitted_at":"2017-05-03T19:47:33Z","abstract_excerpt":"We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lov\\'asz show that many interesting quantities have this form, including, for fixed graphs $H$, the number of $H$-copies (induced or not) in an input graph $G$, and the number of homomorphisms from $H$ to $G$.\n  Using the framework of graph motif parameters, we obtain faster algorithms for counting subgraph copies of fixed graphs $H$ in host graphs $G$: For graphs $H$ on $k$ edges, we show how to count subgraph copies of $H$ in time $k^{O(k"},"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":"1705.01595","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T19:47:33Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a4be88dc427d1cd7f35f909beb1700d0b1bac03e921d7a1f75b72d38412eb8a5","abstract_canon_sha256":"a62c4dc13ac7b66ef35bf49a3124d7d74f18ba7963242ee9f0dfde5946d8dac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.580784Z","signature_b64":"bIFeh/UQF4k2pznDAGXHTgHQuAldu5HorNCHf/Yn8TXY13D1W4Y36HZOIY6IW8DfoG1StBw2Igexql+1H02uDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","last_reissued_at":"2026-05-18T00:45:04.580344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.580344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homomorphisms Are a Good Basis for Counting Small Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Holger Dell, Radu Curticapean","submitted_at":"2017-05-03T19:47:33Z","abstract_excerpt":"We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lov\\'asz show that many interesting quantities have this form, including, for fixed graphs $H$, the number of $H$-copies (induced or not) in an input graph $G$, and the number of homomorphisms from $H$ to $G$.\n  Using the framework of graph motif parameters, we obtain faster algorithms for counting subgraph copies of fixed graphs $H$ in host graphs $G$: For graphs $H$ on $k$ edges, we show how to count subgraph copies of $H$ in time $k^{O(k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01595","kind":"arxiv","version":1},"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":"1705.01595","created_at":"2026-05-18T00:45:04.580413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01595v1","created_at":"2026-05-18T00:45:04.580413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01595","created_at":"2026-05-18T00:45:04.580413+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CGFGDCX367J","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CGFGDCX367JO2LU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CGFGDCX","created_at":"2026-05-18T12:31:03.183658+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/7CGFGDCX367JO2LUA4MQA6GSMR","json":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR.json","graph_json":"https://pith.science/api/pith-number/7CGFGDCX367JO2LUA4MQA6GSMR/graph.json","events_json":"https://pith.science/api/pith-number/7CGFGDCX367JO2LUA4MQA6GSMR/events.json","paper":"https://pith.science/paper/7CGFGDCX"},"agent_actions":{"view_html":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR","download_json":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR.json","view_paper":"https://pith.science/paper/7CGFGDCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01595&json=true","fetch_graph":"https://pith.science/api/pith-number/7CGFGDCX367JO2LUA4MQA6GSMR/graph.json","fetch_events":"https://pith.science/api/pith-number/7CGFGDCX367JO2LUA4MQA6GSMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/action/storage_attestation","attest_author":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/action/author_attestation","sign_citation":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/action/citation_signature","submit_replication":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/action/replication_record"}},"created_at":"2026-05-18T00:45:04.580413+00:00","updated_at":"2026-05-18T00:45:04.580413+00:00"}