{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IE2NQYYDOYNCLLHBW4UMFQNGPC","short_pith_number":"pith:IE2NQYYD","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"},"canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","source":{"kind":"arxiv","id":"1908.06333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06333","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06333v1","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06333","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"IE2NQYYDOYNC","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_16","alias_value":"IE2NQYYDOYNCLLHB","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_8","alias_value":"IE2NQYYD","created_at":"2026-07-04T23:58:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IE2NQYYDOYNCLLHBW4UMFQNGPC","target":"record","payload":{"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"},"canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","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"},"source_kind":"arxiv","source_id":"1908.06333","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-07-04T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOl16tzly0cuN+xZzCp7Q9GaBey0Rxcp/CyFWA+C3XZMC2y6IgXQC+2EFim2xkS9v7d1dX1TaHNhHq/oV1ulDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:49:30.803135Z"},"content_sha256":"1c44a6e1f30c18350ba691ae61e1a6ac4442cfa5a6f3dbb95741e0c0eb551542","schema_version":"1.0","event_id":"sha256:1c44a6e1f30c18350ba691ae61e1a6ac4442cfa5a6f3dbb95741e0c0eb551542"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IE2NQYYDOYNCLLHBW4UMFQNGPC","target":"graph","payload":{"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"},"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-07-04T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7Uwplqw0rJqBkfnnVqR3zsQsgJq5kaSeNDR8Vw0eDkN6diUMkQFMJiZxA0zi5w3Frr8+mb6l/Vqsg9SfoBeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:49:30.803996Z"},"content_sha256":"3ada753af5a579da555f69faf927c99346b6080e6ab6e49c7b7885489dd8d00d","schema_version":"1.0","event_id":"sha256:3ada753af5a579da555f69faf927c99346b6080e6ab6e49c7b7885489dd8d00d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/bundle.json","state_url":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/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-08-16T05:49:30Z","links":{"resolver":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC","bundle":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/bundle.json","state":"https://pith.science/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IE2NQYYDOYNCLLHBW4UMFQNGPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IE2NQYYDOYNCLLHBW4UMFQNGPC","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":"ea2d0f832f8fc41f5099f6b37c12a568ac3196291bda16dd4a6ba857def08968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-17T18:47:55Z","title_canon_sha256":"ab255bdfd40f2514d65098ba5f57b895cb163a6ade5e1c2e7729b5eac60b3a5b"},"schema_version":"1.0","source":{"id":"1908.06333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06333","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06333v1","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06333","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"IE2NQYYDOYNC","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_16","alias_value":"IE2NQYYDOYNCLLHB","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_8","alias_value":"IE2NQYYD","created_at":"2026-07-04T23:58:14Z"}],"graph_snapshots":[{"event_id":"sha256:3ada753af5a579da555f69faf927c99346b6080e6ab6e49c7b7885489dd8d00d","target":"graph","created_at":"2026-07-04T23:58:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Brendan D. McKay, Fang Tian","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06333","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:1c44a6e1f30c18350ba691ae61e1a6ac4442cfa5a6f3dbb95741e0c0eb551542","target":"record","created_at":"2026-07-04T23:58:14Z","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":"ea2d0f832f8fc41f5099f6b37c12a568ac3196291bda16dd4a6ba857def08968","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-17T18:47:55Z","title_canon_sha256":"ab255bdfd40f2514d65098ba5f57b895cb163a6ade5e1c2e7729b5eac60b3a5b"},"schema_version":"1.0","source":{"id":"1908.06333","kind":"arxiv","version":1}},"canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4134d86303761a25ace1b728c2c1a6789bcb6ce273ce726d7aae6e2425db54ea","first_computed_at":"2026-07-04T23:58:14.676804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:14.676804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6w4WTnCY66rmxGYBiSeXtoIvUv85CBgT1m65SA3ooSCt9ydV0JAmFoEglMzBIeBrF436h8DGOPmCickie9tuBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:14.677151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c44a6e1f30c18350ba691ae61e1a6ac4442cfa5a6f3dbb95741e0c0eb551542","sha256:3ada753af5a579da555f69faf927c99346b6080e6ab6e49c7b7885489dd8d00d"],"state_sha256":"5cc1b973846f49813baaec1d9e18b421b07f303980712bae8698da71129a0eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2pHAD02ybjvf+uyAOxSqcIW0b0dyZ2sKlgHW0px9NhV3itwv8WLrtZOBzrMo0I6njFlUZyZqPeyY8Kc5DGhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:49:30.809506Z","bundle_sha256":"17105d5594ce06c0ca70b10f3b9b79502e31e35d7598f085c50b985fbd82b120"}}