{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HFWL224FYWRJNENEKZ2DYYQIW6","short_pith_number":"pith:HFWL224F","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"},"canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","source":{"kind":"arxiv","id":"1608.05193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05193","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05193v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05193","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"HFWL224FYWRJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFWL224FYWRJNENE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFWL224F","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HFWL224FYWRJNENEKZ2DYYQIW6","target":"record","payload":{"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"},"canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","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"},"source_kind":"arxiv","source_id":"1608.05193","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-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt2rH7DdLsIy5lXcVtuqBfE+sMlnDbz084gVTUx9c/xCWIKlpDdhpnT578VH6H/YD7GJFd8ipfHlDPuBBrvIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:29.717134Z"},"content_sha256":"e2ef9bea0a0d768499aa23bc6be49125ab46246095fce88fb55316664d371b6d","schema_version":"1.0","event_id":"sha256:e2ef9bea0a0d768499aa23bc6be49125ab46246095fce88fb55316664d371b6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HFWL224FYWRJNENEKZ2DYYQIW6","target":"graph","payload":{"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"},"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-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bzz6iYVqVD2nLCGfFeRUgWMHJ+FemMuDftZduRgg1ORw7g92uo2eAXw4y9GburtPP2/pdnAhQVKylf/IzvSqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:29.717776Z"},"content_sha256":"a132f93cea1185d276908fdb0b4a72e2fa5693f8241ced4661467635c921f5cc","schema_version":"1.0","event_id":"sha256:a132f93cea1185d276908fdb0b4a72e2fa5693f8241ced4661467635c921f5cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/bundle.json","state_url":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFWL224FYWRJNENEKZ2DYYQIW6/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-06-11T17:18:29Z","links":{"resolver":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6","bundle":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/bundle.json","state":"https://pith.science/pith/HFWL224FYWRJNENEKZ2DYYQIW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFWL224FYWRJNENEKZ2DYYQIW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HFWL224FYWRJNENEKZ2DYYQIW6","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":"5110679ebaaced47fdef59fe6831a6054684dd5a9576f8479d3fad2989773d11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-18T07:22:03Z","title_canon_sha256":"7f55dd81efb5e83fe3dae6572dd413cc89e07469057bd07337c9ef77017fe663"},"schema_version":"1.0","source":{"id":"1608.05193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05193","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05193v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05193","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"HFWL224FYWRJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFWL224FYWRJNENE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFWL224F","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:a132f93cea1185d276908fdb0b4a72e2fa5693f8241ced4661467635c921f5cc","target":"graph","created_at":"2026-05-18T01:08:31Z","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 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","authors_text":"Dudley Stark, Nick Wormald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-18T07:22:03Z","title":"The probability of nonexistence of a subgraph in a moderately sparse random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05193","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:e2ef9bea0a0d768499aa23bc6be49125ab46246095fce88fb55316664d371b6d","target":"record","created_at":"2026-05-18T01:08:31Z","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":"5110679ebaaced47fdef59fe6831a6054684dd5a9576f8479d3fad2989773d11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-18T07:22:03Z","title_canon_sha256":"7f55dd81efb5e83fe3dae6572dd413cc89e07469057bd07337c9ef77017fe663"},"schema_version":"1.0","source":{"id":"1608.05193","kind":"arxiv","version":1}},"canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396cbd6b85c5a29691a456743c6208b7a7218600591fe94c886f9d9da35ea496","first_computed_at":"2026-05-18T01:08:31.647919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:31.647919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C+W668laVWas1z/cRBGO/wU91zqPGwsAYLc1km4yok8q1JdknY0UGq/j2wE/B2Kv5bzPVO/gDWI/w5Umm4KzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:31.648423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2ef9bea0a0d768499aa23bc6be49125ab46246095fce88fb55316664d371b6d","sha256:a132f93cea1185d276908fdb0b4a72e2fa5693f8241ced4661467635c921f5cc"],"state_sha256":"7f4b32580d6b95e294f19c52257d1464336b8849f73ff49655491b565b4ba16f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FHusZFOO8Jc1GgDhw5Hgoj0IE2GPITjGuq/9w4efT6uHoTF4A06dgpVKSQL0l4cjUU9oAc+OjtV+m6aeXe4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:18:29.721515Z","bundle_sha256":"b2ff90e3325af30e6355ba1380c0d59b95b5d7b721150daee089747dad2bc9e3"}}