{"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"}