{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IE2NQYYDOYNCLLHBW4UMFQNGPC","short_pith_number":"pith:IE2NQYYD","schema_version":"1.0","canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","source":{"kind":"arxiv","id":"1908.06333","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Fang Tian","submitted_at":"2019-08-17T18:47:55Z","abstract_excerpt":"For $n\\geq 3$, let $r=r(n)\\geq 3$ be an integer. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear $r$-uniform hypergraphs on $n\\to\\infty$ vertices is determined asymptotically when the number of edges is $m(n)=o(r^{-3}n^{ \\frac32})$. As one application, we find the probability of linearity for the independent-edge model of random $r$-uniform hypergraph when the expected number of edges is $o(r^{-3}n^{ \\frac32})$. We also find the probability that a random $r$-uniform lin"},"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":"1908.06333","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-17T18:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"ab255bdfd40f2514d65098ba5f57b895cb163a6ade5e1c2e7729b5eac60b3a5b","abstract_canon_sha256":"ea2d0f832f8fc41f5099f6b37c12a568ac3196291bda16dd4a6ba857def08968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:14.677151Z","signature_b64":"6w4WTnCY66rmxGYBiSeXtoIvUv85CBgT1m65SA3ooSCt9ydV0JAmFoEglMzBIeBrF436h8DGOPmCickie9tuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","last_reissued_at":"2026-07-04T23:58:14.676804Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:14.676804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Fang Tian","submitted_at":"2019-08-17T18:47:55Z","abstract_excerpt":"For $n\\geq 3$, let $r=r(n)\\geq 3$ be an integer. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear $r$-uniform hypergraphs on $n\\to\\infty$ vertices is determined asymptotically when the number of edges is $m(n)=o(r^{-3}n^{ \\frac32})$. As one application, we find the probability of linearity for the independent-edge model of random $r$-uniform hypergraph when the expected number of edges is $o(r^{-3}n^{ \\frac32})$. We also find the probability that a random $r$-uniform lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06333/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06333","created_at":"2026-07-04T23:58:14.676856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06333v1","created_at":"2026-07-04T23:58:14.676856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06333","created_at":"2026-07-04T23:58:14.676856+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE2NQYYDOYNC","created_at":"2026-07-04T23:58:14.676856+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE2NQYYDOYNCLLHB","created_at":"2026-07-04T23:58:14.676856+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE2NQYYD","created_at":"2026-07-04T23:58:14.676856+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/IE2NQYYDOYNCLLHBW4UMFQNGPC","json":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC.json","graph_json":"https://pith.science/api/pith-number/IE2NQYYDOYNCLLHBW4UMFQNGPC/graph.json","events_json":"https://pith.science/api/pith-number/IE2NQYYDOYNCLLHBW4UMFQNGPC/events.json","paper":"https://pith.science/paper/IE2NQYYD"},"agent_actions":{"view_html":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC","download_json":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC.json","view_paper":"https://pith.science/paper/IE2NQYYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06333&json=true","fetch_graph":"https://pith.science/api/pith-number/IE2NQYYDOYNCLLHBW4UMFQNGPC/graph.json","fetch_events":"https://pith.science/api/pith-number/IE2NQYYDOYNCLLHBW4UMFQNGPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/action/storage_attestation","attest_author":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/action/author_attestation","sign_citation":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/action/citation_signature","submit_replication":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/action/replication_record"}},"created_at":"2026-07-04T23:58:14.676856+00:00","updated_at":"2026-07-04T23:58:14.676856+00:00"}