{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7CGFGDCX367JO2LUA4MQA6GSMR","short_pith_number":"pith:7CGFGDCX","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"},"canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","source":{"kind":"arxiv","id":"1705.01595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01595","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01595v1","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01595","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"7CGFGDCX367J","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CGFGDCX367JO2LU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CGFGDCX","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7CGFGDCX367JO2LUA4MQA6GSMR","target":"record","payload":{"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"},"canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","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"},"source_kind":"arxiv","source_id":"1705.01595","source_version":1,"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-18T00:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLMTbpYC722nvjxh/cu00tuOacKLjgXRaD+SmYXZpBa/bxNXy/K3ahXzLGJjtJNjmQYqZZOOw5QDBlWbOfuuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:23:20.126702Z"},"content_sha256":"f96be4b2608cd2ae8f42e838b99f1428bb1bb78ac1797ccb2e8982372c6303ff","schema_version":"1.0","event_id":"sha256:f96be4b2608cd2ae8f42e838b99f1428bb1bb78ac1797ccb2e8982372c6303ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7CGFGDCX367JO2LUA4MQA6GSMR","target":"graph","payload":{"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"},"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-18T00:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ako6HAPgJtaJHsY1KEvTQ/AroSgCR819kHRGTYax6pVuRIqr5DxTIgKWxpVLw9O92RxqPmSV2h9c1z676MMzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:23:20.127356Z"},"content_sha256":"40565a7fb1087d5a7623034fd04d8ba8bb663aaac1464cc49f49e0f452d8a2d9","schema_version":"1.0","event_id":"sha256:40565a7fb1087d5a7623034fd04d8ba8bb663aaac1464cc49f49e0f452d8a2d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/bundle.json","state_url":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CGFGDCX367JO2LUA4MQA6GSMR/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-05-30T05:23:20Z","links":{"resolver":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR","bundle":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/bundle.json","state":"https://pith.science/pith/7CGFGDCX367JO2LUA4MQA6GSMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CGFGDCX367JO2LUA4MQA6GSMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7CGFGDCX367JO2LUA4MQA6GSMR","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":"a62c4dc13ac7b66ef35bf49a3124d7d74f18ba7963242ee9f0dfde5946d8dac2","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T19:47:33Z","title_canon_sha256":"a4be88dc427d1cd7f35f909beb1700d0b1bac03e921d7a1f75b72d38412eb8a5"},"schema_version":"1.0","source":{"id":"1705.01595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01595","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01595v1","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01595","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"7CGFGDCX367J","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CGFGDCX367JO2LU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CGFGDCX","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:40565a7fb1087d5a7623034fd04d8ba8bb663aaac1464cc49f49e0f452d8a2d9","target":"graph","created_at":"2026-05-18T00:45:04Z","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 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","authors_text":"D\\'aniel Marx, Holger Dell, Radu Curticapean","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T19:47:33Z","title":"Homomorphisms Are a Good Basis for Counting Small Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01595","kind":"arxiv","version":1},"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:f96be4b2608cd2ae8f42e838b99f1428bb1bb78ac1797ccb2e8982372c6303ff","target":"record","created_at":"2026-05-18T00:45:04Z","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":"a62c4dc13ac7b66ef35bf49a3124d7d74f18ba7963242ee9f0dfde5946d8dac2","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-05-03T19:47:33Z","title_canon_sha256":"a4be88dc427d1cd7f35f909beb1700d0b1bac03e921d7a1f75b72d38412eb8a5"},"schema_version":"1.0","source":{"id":"1705.01595","kind":"arxiv","version":1}},"canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f88c530c57dfbe97697407190078d26446d371ed5c2a70e6cbe672dc486f945b","first_computed_at":"2026-05-18T00:45:04.580344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:04.580344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bIFeh/UQF4k2pznDAGXHTgHQuAldu5HorNCHf/Yn8TXY13D1W4Y36HZOIY6IW8DfoG1StBw2Igexql+1H02uDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:04.580784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f96be4b2608cd2ae8f42e838b99f1428bb1bb78ac1797ccb2e8982372c6303ff","sha256:40565a7fb1087d5a7623034fd04d8ba8bb663aaac1464cc49f49e0f452d8a2d9"],"state_sha256":"27cb2f37a2c75992103aeae50bad0a7a39383e2305fdb8a5d091a345294a7fd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUxBviCkWd4w+O3JrVuNbitbOyXQsIXbcD2C2DqNxOIZrUoteI/Si9E44F5m9ed9ht/hs93Xn5acMBapfcGjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:23:20.130797Z","bundle_sha256":"a15e5de9d3798204ed78329a7fc8e8f2e48c9de976c47263b48cf3085c6b2d6e"}}