{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N5MRUXQEEMQ3LQUNEOIKRXT2HP","short_pith_number":"pith:N5MRUXQE","canonical_record":{"source":{"id":"1511.04739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-15T17:56:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"92145809d35542f61c979e36521f242704580f898e976e01c8c080083a737465","abstract_canon_sha256":"37599cad7735518905c4400e7fe099d44f25cc3fbf3569619af83a7bc2fa4178"},"schema_version":"1.0"},"canonical_sha256":"6f591a5e042321b5c28d2390a8de7a3be18fd8c5445ecaa33e8b9e90dda7d1e8","source":{"kind":"arxiv","id":"1511.04739","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04739","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04739v2","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04739","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"N5MRUXQEEMQ3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5MRUXQEEMQ3LQUN","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5MRUXQE","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N5MRUXQEEMQ3LQUNEOIKRXT2HP","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-15T17:56:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"92145809d35542f61c979e36521f242704580f898e976e01c8c080083a737465","abstract_canon_sha256":"37599cad7735518905c4400e7fe099d44f25cc3fbf3569619af83a7bc2fa4178"},"schema_version":"1.0"},"canonical_sha256":"6f591a5e042321b5c28d2390a8de7a3be18fd8c5445ecaa33e8b9e90dda7d1e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:44.095551Z","signature_b64":"plvTe+Z21JtumAki3nsdMSL7BZKXNJYdRIMULdomnu1XyVuBBiaSontxo/8QxqvUjFebDWimSgt1tedboqBNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f591a5e042321b5c28d2390a8de7a3be18fd8c5445ecaa33e8b9e90dda7d1e8","last_reissued_at":"2026-05-18T00:01:44.095036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:44.095036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04739","source_version":2,"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:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByuINrMeD15FsI6qYULWYyMIniJuISE77mcyGS6Y/jHooES2DOZk5qKDPj78j4wrs5DRPAKU3ODNOgaxHx32Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:30:48.894989Z"},"content_sha256":"86fbc2ed9edb3872aaef6762e19a40ea7686d9966ee401d2ac915a51eaf205ec","schema_version":"1.0","event_id":"sha256:86fbc2ed9edb3872aaef6762e19a40ea7686d9966ee401d2ac915a51eaf205ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N5MRUXQEEMQ3LQUNEOIKRXT2HP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting dense connected hypergraphs via the probabilistic method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Oliver Riordan","submitted_at":"2015-11-15T17:56:47Z","abstract_excerpt":"In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]=\\{1,2,\\ldots,n\\}$ with $m$ edges, whenever $n\\to\\infty$ and $n-1\\le m=m(n)\\le \\binom{n}{2}$. We give an asymptotic formula for the number $C_r(n,m)$ of connected $r$-uniform hypergraphs on $[n]$ with $m$ edges, whenever $r\\ge 3$ is fixed and $m=m(n)$ with $m/n\\to\\infty$, i.e., the average degree tends to infinity. This complements recent results of Behrisch, Coja-Oghlan and Kang (the case $m=n/(r-1)+\\Theta(n)$) and the present authors (the case $m=n/(r-1)+o(n)$, i.e., `nullity' or `excess' "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04739","kind":"arxiv","version":2},"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:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UyOqXuq2m40kr7S2v5ylwqPuAB14xVq06yZ9b4tG6JkAsrvHYDxTF5iEZXfzYVPRfC+8EH6yNRWhYvDImSZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:30:48.895347Z"},"content_sha256":"3a93eff67bc0be66f8924aab582668896ba197e070beb9828bfba161309ab857","schema_version":"1.0","event_id":"sha256:3a93eff67bc0be66f8924aab582668896ba197e070beb9828bfba161309ab857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/bundle.json","state_url":"https://pith.science/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/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-02T05:30:48Z","links":{"resolver":"https://pith.science/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP","bundle":"https://pith.science/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/bundle.json","state":"https://pith.science/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5MRUXQEEMQ3LQUNEOIKRXT2HP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N5MRUXQEEMQ3LQUNEOIKRXT2HP","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":"37599cad7735518905c4400e7fe099d44f25cc3fbf3569619af83a7bc2fa4178","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-15T17:56:47Z","title_canon_sha256":"92145809d35542f61c979e36521f242704580f898e976e01c8c080083a737465"},"schema_version":"1.0","source":{"id":"1511.04739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04739","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04739v2","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04739","created_at":"2026-05-18T00:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"N5MRUXQEEMQ3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5MRUXQEEMQ3LQUN","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5MRUXQE","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:3a93eff67bc0be66f8924aab582668896ba197e070beb9828bfba161309ab857","target":"graph","created_at":"2026-05-18T00:01:44Z","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":"In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]=\\{1,2,\\ldots,n\\}$ with $m$ edges, whenever $n\\to\\infty$ and $n-1\\le m=m(n)\\le \\binom{n}{2}$. We give an asymptotic formula for the number $C_r(n,m)$ of connected $r$-uniform hypergraphs on $[n]$ with $m$ edges, whenever $r\\ge 3$ is fixed and $m=m(n)$ with $m/n\\to\\infty$, i.e., the average degree tends to infinity. This complements recent results of Behrisch, Coja-Oghlan and Kang (the case $m=n/(r-1)+\\Theta(n)$) and the present authors (the case $m=n/(r-1)+o(n)$, i.e., `nullity' or `excess' ","authors_text":"B\\'ela Bollob\\'as, Oliver Riordan","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-15T17:56:47Z","title":"Counting dense connected hypergraphs via the probabilistic method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04739","kind":"arxiv","version":2},"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:86fbc2ed9edb3872aaef6762e19a40ea7686d9966ee401d2ac915a51eaf205ec","target":"record","created_at":"2026-05-18T00:01:44Z","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":"37599cad7735518905c4400e7fe099d44f25cc3fbf3569619af83a7bc2fa4178","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-15T17:56:47Z","title_canon_sha256":"92145809d35542f61c979e36521f242704580f898e976e01c8c080083a737465"},"schema_version":"1.0","source":{"id":"1511.04739","kind":"arxiv","version":2}},"canonical_sha256":"6f591a5e042321b5c28d2390a8de7a3be18fd8c5445ecaa33e8b9e90dda7d1e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f591a5e042321b5c28d2390a8de7a3be18fd8c5445ecaa33e8b9e90dda7d1e8","first_computed_at":"2026-05-18T00:01:44.095036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:44.095036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"plvTe+Z21JtumAki3nsdMSL7BZKXNJYdRIMULdomnu1XyVuBBiaSontxo/8QxqvUjFebDWimSgt1tedboqBNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:44.095551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86fbc2ed9edb3872aaef6762e19a40ea7686d9966ee401d2ac915a51eaf205ec","sha256:3a93eff67bc0be66f8924aab582668896ba197e070beb9828bfba161309ab857"],"state_sha256":"dffd8c15315253eca12e040789cb8c2c20583573716c8c8ef3b5413f52e77dd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3r5XO1VxAVLP6GcrvvnI1kUIoDIX7vCK9CVUI7pYTPuvyr7uSgBiTdFX0r7YRhmxidsTu0RayFHeJRSNq1YTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:30:48.897417Z","bundle_sha256":"82363c21c06fe3a04ff8141db82690c3a252e7ee9d239d46fc8f2067851a8868"}}