{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ESOI57OI7I2KFM4WLAX23326JM","short_pith_number":"pith:ESOI57OI","canonical_record":{"source":{"id":"1805.11425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T03:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"39122d4871ab416d1f49cab855c90e225099186a929ab2ef4c3141834b8140c8","abstract_canon_sha256":"4f2412ab0fe25026ce76553e9e1189b53d09fc59a5ee4ebf644b9f3b94c3ce8f"},"schema_version":"1.0"},"canonical_sha256":"249c8efdc8fa34a2b396582fadef5e4b385aa5e5d36e8f1e90f4a72ef5ea39e0","source":{"kind":"arxiv","id":"1805.11425","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11425","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11425v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11425","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ESOI57OI7I2K","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ESOI57OI7I2KFM4W","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ESOI57OI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ESOI57OI7I2KFM4WLAX23326JM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T03:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"39122d4871ab416d1f49cab855c90e225099186a929ab2ef4c3141834b8140c8","abstract_canon_sha256":"4f2412ab0fe25026ce76553e9e1189b53d09fc59a5ee4ebf644b9f3b94c3ce8f"},"schema_version":"1.0"},"canonical_sha256":"249c8efdc8fa34a2b396582fadef5e4b385aa5e5d36e8f1e90f4a72ef5ea39e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.676255Z","signature_b64":"1brnayivDdaDnzbeUPgYqgU6aiic9c3MA9fcfVYXwLnjKgCNfB0s+NL/ZLg/At+fpseEl1yXPY+Bbl+hWGHGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249c8efdc8fa34a2b396582fadef5e4b385aa5e5d36e8f1e90f4a72ef5ea39e0","last_reissued_at":"2026-05-18T00:10:16.675780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.675780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11425","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RbkzC+dJSYGQRpEyXcLlzb8cO53mXU/H6ZBLOX3GEW8FxSnMO7zXMYnun9UzALSws6gWv7mXZzPk16SotekCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:39:00.813672Z"},"content_sha256":"df4258e0322c3527da61434f3d21353efdfb140872d9ecfc253f71a3ee0ca004","schema_version":"1.0","event_id":"sha256:df4258e0322c3527da61434f3d21353efdfb140872d9ecfc253f71a3ee0ca004"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ESOI57OI7I2KFM4WLAX23326JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the sizes of $(k,l)$-edge-maximal $r$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong-Jian Lai, Jixiang Meng, Murong Xu, Yingzhi Tian","submitted_at":"2018-05-28T03:27:52Z","abstract_excerpt":"Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all $r$-subsets of $V$, then $H$ is a complete $r$-uniform hypergraph, denoted by $K_n^r$, where $n=|V|$. A $r$-uniform hypergraph $H=(V,E)$ is $(k,l)$-edge-maximal if every subhypergraph $H'$ of $H$ with $|V(H')|\\geq l$ has edge-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setminus E(H)$, $H+e$ contains at least one subhypergraph $H''$ with $|V(H'')|\\geq "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11425","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"udelQHu5UKAUhwZcfsALs/Kgo++SsrgvaPLIHAeuDNFH5UoWdnp1HTc+jROcdhNWX4XqImTacumJfFVPwAo9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:39:00.814010Z"},"content_sha256":"6d986494bdc9297cf201ed883f1ba0e893924831ed2b1c4b322cc40d559c21af","schema_version":"1.0","event_id":"sha256:6d986494bdc9297cf201ed883f1ba0e893924831ed2b1c4b322cc40d559c21af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESOI57OI7I2KFM4WLAX23326JM/bundle.json","state_url":"https://pith.science/pith/ESOI57OI7I2KFM4WLAX23326JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESOI57OI7I2KFM4WLAX23326JM/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-03T01:39:00Z","links":{"resolver":"https://pith.science/pith/ESOI57OI7I2KFM4WLAX23326JM","bundle":"https://pith.science/pith/ESOI57OI7I2KFM4WLAX23326JM/bundle.json","state":"https://pith.science/pith/ESOI57OI7I2KFM4WLAX23326JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESOI57OI7I2KFM4WLAX23326JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ESOI57OI7I2KFM4WLAX23326JM","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":"4f2412ab0fe25026ce76553e9e1189b53d09fc59a5ee4ebf644b9f3b94c3ce8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T03:27:52Z","title_canon_sha256":"39122d4871ab416d1f49cab855c90e225099186a929ab2ef4c3141834b8140c8"},"schema_version":"1.0","source":{"id":"1805.11425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11425","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11425v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11425","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ESOI57OI7I2K","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ESOI57OI7I2KFM4W","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ESOI57OI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:6d986494bdc9297cf201ed883f1ba0e893924831ed2b1c4b322cc40d559c21af","target":"graph","created_at":"2026-05-18T00:10:16Z","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":"Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all $r$-subsets of $V$, then $H$ is a complete $r$-uniform hypergraph, denoted by $K_n^r$, where $n=|V|$. A $r$-uniform hypergraph $H=(V,E)$ is $(k,l)$-edge-maximal if every subhypergraph $H'$ of $H$ with $|V(H')|\\geq l$ has edge-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setminus E(H)$, $H+e$ contains at least one subhypergraph $H''$ with $|V(H'')|\\geq ","authors_text":"Hong-Jian Lai, Jixiang Meng, Murong Xu, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T03:27:52Z","title":"On the sizes of $(k,l)$-edge-maximal $r$-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11425","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:df4258e0322c3527da61434f3d21353efdfb140872d9ecfc253f71a3ee0ca004","target":"record","created_at":"2026-05-18T00:10:16Z","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":"4f2412ab0fe25026ce76553e9e1189b53d09fc59a5ee4ebf644b9f3b94c3ce8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-28T03:27:52Z","title_canon_sha256":"39122d4871ab416d1f49cab855c90e225099186a929ab2ef4c3141834b8140c8"},"schema_version":"1.0","source":{"id":"1805.11425","kind":"arxiv","version":2}},"canonical_sha256":"249c8efdc8fa34a2b396582fadef5e4b385aa5e5d36e8f1e90f4a72ef5ea39e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"249c8efdc8fa34a2b396582fadef5e4b385aa5e5d36e8f1e90f4a72ef5ea39e0","first_computed_at":"2026-05-18T00:10:16.675780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.675780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1brnayivDdaDnzbeUPgYqgU6aiic9c3MA9fcfVYXwLnjKgCNfB0s+NL/ZLg/At+fpseEl1yXPY+Bbl+hWGHGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.676255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df4258e0322c3527da61434f3d21353efdfb140872d9ecfc253f71a3ee0ca004","sha256:6d986494bdc9297cf201ed883f1ba0e893924831ed2b1c4b322cc40d559c21af"],"state_sha256":"2d1298608ffff3a044e616dbdd843137bc13a39be7a0fab22f26d4599c86f269"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JpgM4zCUFGKMsO5i3C8UouoJG7f5umrWU1JF38vJDjIaUrF68iIs9wH1s+d7V5G6ShLDK8wy1ngy2ULzHY5OAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:39:00.816064Z","bundle_sha256":"e98d893d817487f4037880ca54f8a9a2d519659a2b87d7d2560cf0b225c80406"}}