{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HFWL224FYWRJNENEKZ2DYYQIW6","short_pith_number":"pith:HFWL224F","schema_version":"1.0","canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","source":{"kind":"arxiv","id":"1608.05193","version":1},"attestation_state":"computed","paper":{"title":"The probability of nonexistence of a subgraph in a moderately sparse random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dudley Stark, Nick Wormald","submitted_at":"2016-08-18T07:22:03Z","abstract_excerpt":"We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph $G_0$ in the common random graph models ${\\cal G}(n,m)$ and ${\\cal G}(n,p)$. Our results apply when the average degrees of the random graphs are below the threshold at which each edge is included in a copy of $G_0$. This extends an argument given earlier by the second author for $G_0=K_3$ with a more restricted range of average degree. For all strictly balanced subgraphs $G_0$, our results gives much information on the distribution of the number of copies of $G_0$ that are not in large \"cl"},"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":"1608.05193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-18T07:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"7f55dd81efb5e83fe3dae6572dd413cc89e07469057bd07337c9ef77017fe663","abstract_canon_sha256":"5110679ebaaced47fdef59fe6831a6054684dd5a9576f8479d3fad2989773d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:31.648423Z","signature_b64":"C+W668laVWas1z/cRBGO/wU91zqPGwsAYLc1km4yok8q1JdknY0UGq/j2wE/B2Kv5bzPVO/gDWI/w5Umm4KzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","last_reissued_at":"2026-05-18T01:08:31.647919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:31.647919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The probability of nonexistence of a subgraph in a moderately sparse random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dudley Stark, Nick Wormald","submitted_at":"2016-08-18T07:22:03Z","abstract_excerpt":"We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph $G_0$ in the common random graph models ${\\cal G}(n,m)$ and ${\\cal G}(n,p)$. Our results apply when the average degrees of the random graphs are below the threshold at which each edge is included in a copy of $G_0$. This extends an argument given earlier by the second author for $G_0=K_3$ with a more restricted range of average degree. For all strictly balanced subgraphs $G_0$, our results gives much information on the distribution of the number of copies of $G_0$ that are not in large \"cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05193","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":"1608.05193","created_at":"2026-05-18T01:08:31.647985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05193v1","created_at":"2026-05-18T01:08:31.647985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05193","created_at":"2026-05-18T01:08:31.647985+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFWL224FYWRJ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFWL224FYWRJNENE","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFWL224F","created_at":"2026-05-18T12:30:19.053100+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/HFWL224FYWRJNENEKZ2DYYQIW6","json":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6.json","graph_json":"https://pith.science/api/pith-number/HFWL224FYWRJNENEKZ2DYYQIW6/graph.json","events_json":"https://pith.science/api/pith-number/HFWL224FYWRJNENEKZ2DYYQIW6/events.json","paper":"https://pith.science/paper/HFWL224F"},"agent_actions":{"view_html":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6","download_json":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6.json","view_paper":"https://pith.science/paper/HFWL224F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05193&json=true","fetch_graph":"https://pith.science/api/pith-number/HFWL224FYWRJNENEKZ2DYYQIW6/graph.json","fetch_events":"https://pith.science/api/pith-number/HFWL224FYWRJNENEKZ2DYYQIW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/action/storage_attestation","attest_author":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/action/author_attestation","sign_citation":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/action/citation_signature","submit_replication":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/action/replication_record"}},"created_at":"2026-05-18T01:08:31.647985+00:00","updated_at":"2026-05-18T01:08:31.647985+00:00"}