{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JTUNHTJ6EJQPPAPEGLTOVPXLXG","short_pith_number":"pith:JTUNHTJ6","canonical_record":{"source":{"id":"1409.1314","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-04T03:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"b0dc0d5bb7f7c37d03b5d8dde6e3923bda56a93f137eeeac0a1fa572493bfd2f","abstract_canon_sha256":"c1976d99b12cb2da3ed2b5947d147a0f1ccabc9c552fc8cd9ccb56d78776b8eb"},"schema_version":"1.0"},"canonical_sha256":"4ce8d3cd3e2260f781e432e6eabeebb9a40420e71e33a99f99604e37f3a319cb","source":{"kind":"arxiv","id":"1409.1314","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1314","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1314v3","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1314","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"JTUNHTJ6EJQP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTUNHTJ6EJQPPAPE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTUNHTJ6","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JTUNHTJ6EJQPPAPEGLTOVPXLXG","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1314","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-04T03:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"b0dc0d5bb7f7c37d03b5d8dde6e3923bda56a93f137eeeac0a1fa572493bfd2f","abstract_canon_sha256":"c1976d99b12cb2da3ed2b5947d147a0f1ccabc9c552fc8cd9ccb56d78776b8eb"},"schema_version":"1.0"},"canonical_sha256":"4ce8d3cd3e2260f781e432e6eabeebb9a40420e71e33a99f99604e37f3a319cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:54.639508Z","signature_b64":"dcxzXIxF2OPlKPdqahoGtcOWe8Ah7yZIHVAngygBKZcxk9GuZ4iTBqiew5h8hyjglMtvjOsMAAesPZy3lTR3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce8d3cd3e2260f781e432e6eabeebb9a40420e71e33a99f99604e37f3a319cb","last_reissued_at":"2026-05-18T01:10:54.638939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:54.638939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1314","source_version":3,"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:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Qj5Avv6vmVUYtUCTs+g+a0NL8Cz5AnLtnNYSk+Wun5UAHm4ITZTBM6ghKrzcDHMgJJOB+fKufOGHRKZ9IjZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:26.003398Z"},"content_sha256":"62bcf4996acc95657a90ba5c0106ebe23c31a6d822ca123a4e753daf6b48d7cb","schema_version":"1.0","event_id":"sha256:62bcf4996acc95657a90ba5c0106ebe23c31a6d822ca123a4e753daf6b48d7cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JTUNHTJ6EJQPPAPEGLTOVPXLXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Vladimir Blinovsky","submitted_at":"2014-09-04T03:42:48Z","abstract_excerpt":"A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\\geq 3$, let $r= r(n)\\geq 3$ be an integer and let $\\boldsymbol{k} = (k_1,\\ldots, k_n)$ be a vector of nonnegative integers, where each $k_j = k_j(n)$ may depend on $n$. Let $M = M(n) = \\sum_{j=1}^n k_j$ for all $n\\geq 3$, and define the set $\\mathcal{I} = \\{ n\\geq 3 \\mid r(n) \\text{ divides } M(n)\\}$. We assume that $\\mathcal{I}$ is infinite, and perform asymptotics as $n$ tends to infinity along $\\mathcal{I}$. Our main resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1314","kind":"arxiv","version":3},"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:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBFkGS2S+NvrMKTwQkRQaobWwwma883/7IqyZdSyQRUjD71gTHy34ByB0QqfIrZCZfygdn+VB0W1EfTZGQwXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:26.004090Z"},"content_sha256":"c1541e084ba98432ffbabbd34fc122531aeeb22809121d8329d542f0a5b8cb63","schema_version":"1.0","event_id":"sha256:c1541e084ba98432ffbabbd34fc122531aeeb22809121d8329d542f0a5b8cb63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/bundle.json","state_url":"https://pith.science/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/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-08T19:02:26Z","links":{"resolver":"https://pith.science/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG","bundle":"https://pith.science/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/bundle.json","state":"https://pith.science/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTUNHTJ6EJQPPAPEGLTOVPXLXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JTUNHTJ6EJQPPAPEGLTOVPXLXG","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":"c1976d99b12cb2da3ed2b5947d147a0f1ccabc9c552fc8cd9ccb56d78776b8eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-04T03:42:48Z","title_canon_sha256":"b0dc0d5bb7f7c37d03b5d8dde6e3923bda56a93f137eeeac0a1fa572493bfd2f"},"schema_version":"1.0","source":{"id":"1409.1314","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1314","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1314v3","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1314","created_at":"2026-05-18T01:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"JTUNHTJ6EJQP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTUNHTJ6EJQPPAPE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTUNHTJ6","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c1541e084ba98432ffbabbd34fc122531aeeb22809121d8329d542f0a5b8cb63","target":"graph","created_at":"2026-05-18T01:10:54Z","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":"A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\\geq 3$, let $r= r(n)\\geq 3$ be an integer and let $\\boldsymbol{k} = (k_1,\\ldots, k_n)$ be a vector of nonnegative integers, where each $k_j = k_j(n)$ may depend on $n$. Let $M = M(n) = \\sum_{j=1}^n k_j$ for all $n\\geq 3$, and define the set $\\mathcal{I} = \\{ n\\geq 3 \\mid r(n) \\text{ divides } M(n)\\}$. We assume that $\\mathcal{I}$ is infinite, and perform asymptotics as $n$ tends to infinity along $\\mathcal{I}$. Our main resu","authors_text":"Catherine Greenhill, Vladimir Blinovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-04T03:42:48Z","title":"Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1314","kind":"arxiv","version":3},"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:62bcf4996acc95657a90ba5c0106ebe23c31a6d822ca123a4e753daf6b48d7cb","target":"record","created_at":"2026-05-18T01:10:54Z","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":"c1976d99b12cb2da3ed2b5947d147a0f1ccabc9c552fc8cd9ccb56d78776b8eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-04T03:42:48Z","title_canon_sha256":"b0dc0d5bb7f7c37d03b5d8dde6e3923bda56a93f137eeeac0a1fa572493bfd2f"},"schema_version":"1.0","source":{"id":"1409.1314","kind":"arxiv","version":3}},"canonical_sha256":"4ce8d3cd3e2260f781e432e6eabeebb9a40420e71e33a99f99604e37f3a319cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce8d3cd3e2260f781e432e6eabeebb9a40420e71e33a99f99604e37f3a319cb","first_computed_at":"2026-05-18T01:10:54.638939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:54.638939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dcxzXIxF2OPlKPdqahoGtcOWe8Ah7yZIHVAngygBKZcxk9GuZ4iTBqiew5h8hyjglMtvjOsMAAesPZy3lTR3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:54.639508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1314","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62bcf4996acc95657a90ba5c0106ebe23c31a6d822ca123a4e753daf6b48d7cb","sha256:c1541e084ba98432ffbabbd34fc122531aeeb22809121d8329d542f0a5b8cb63"],"state_sha256":"b6795b0b49238c1667f7e366684d17249cada622c950f52e3b43ee24062972b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdgjTyRHlNjSlZ02Zva0+hFwRKQO7OfOFQvz7mZosYcd0OPIjfHBdS4Nk3K11OVH4UC7XSUJms3CcaoaZOnjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:02:26.007989Z","bundle_sha256":"12b3fb33ffaee8ad332c31ff0016a3afbac725357c973f3b98c7f6d1fb3a59c4"}}