{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G6Y23UG3A2C4GPVETMY43GVYIO","short_pith_number":"pith:G6Y23UG3","schema_version":"1.0","canonical_sha256":"37b1add0db0685c33ea49b31cd9ab8438ebd6663fb329b39e87bba6438aec3a2","source":{"kind":"arxiv","id":"1807.05772","version":1},"attestation_state":"computed","paper":{"title":"Threshold functions for small subgraphs in simple graphs and multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernhard Gittenberger, Dani\\`ele Gardy, \\'Elie de Panafieu, Gwendal Collet, Vlady Ravelomanana","submitted_at":"2018-07-16T10:24:28Z","abstract_excerpt":"We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \\emph{patchworks} to describe the possible overlappings of copies of subgraphs. Furthermore, the proofs are based on analytic combinatorics to carry out asymptotic computations. The flexibility of our approach allows us to tackle a wide range of problems. We obtain the asymptotic number and the limiting distribution of the number of subgraphs which are isomorphic to a graph from a given set of graphs. The"},"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":"1807.05772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T10:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"8a4fec551e854be3557d3416aff7cd88d90a98645421827f7eef57f22a2a0f2e","abstract_canon_sha256":"748fef792a8634d68022773939f9bd449cd6874af5bd0ec5e04ca2b1b08c5d32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:42.585522Z","signature_b64":"rP+SYESUZgTqOQfTZRUObN3cRg/vkBmd7xDrqmu+KouSR0CuKlrRCPfl0m1LBi1/3LYoCDOvZlnCTd463CttDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b1add0db0685c33ea49b31cd9ab8438ebd6663fb329b39e87bba6438aec3a2","last_reissued_at":"2026-05-18T00:10:42.584835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:42.584835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold functions for small subgraphs in simple graphs and multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernhard Gittenberger, Dani\\`ele Gardy, \\'Elie de Panafieu, Gwendal Collet, Vlady Ravelomanana","submitted_at":"2018-07-16T10:24:28Z","abstract_excerpt":"We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \\emph{patchworks} to describe the possible overlappings of copies of subgraphs. Furthermore, the proofs are based on analytic combinatorics to carry out asymptotic computations. The flexibility of our approach allows us to tackle a wide range of problems. We obtain the asymptotic number and the limiting distribution of the number of subgraphs which are isomorphic to a graph from a given set of graphs. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05772","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":"1807.05772","created_at":"2026-05-18T00:10:42.584960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05772v1","created_at":"2026-05-18T00:10:42.584960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05772","created_at":"2026-05-18T00:10:42.584960+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6Y23UG3A2C4","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6Y23UG3A2C4GPVE","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6Y23UG3","created_at":"2026-05-18T12:32:25.280505+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/G6Y23UG3A2C4GPVETMY43GVYIO","json":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO.json","graph_json":"https://pith.science/api/pith-number/G6Y23UG3A2C4GPVETMY43GVYIO/graph.json","events_json":"https://pith.science/api/pith-number/G6Y23UG3A2C4GPVETMY43GVYIO/events.json","paper":"https://pith.science/paper/G6Y23UG3"},"agent_actions":{"view_html":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO","download_json":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO.json","view_paper":"https://pith.science/paper/G6Y23UG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05772&json=true","fetch_graph":"https://pith.science/api/pith-number/G6Y23UG3A2C4GPVETMY43GVYIO/graph.json","fetch_events":"https://pith.science/api/pith-number/G6Y23UG3A2C4GPVETMY43GVYIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO/action/storage_attestation","attest_author":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO/action/author_attestation","sign_citation":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO/action/citation_signature","submit_replication":"https://pith.science/pith/G6Y23UG3A2C4GPVETMY43GVYIO/action/replication_record"}},"created_at":"2026-05-18T00:10:42.584960+00:00","updated_at":"2026-05-18T00:10:42.584960+00:00"}