{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RVUANX4D5CYKE6GQZ4MXBAF6MO","short_pith_number":"pith:RVUANX4D","schema_version":"1.0","canonical_sha256":"8d6806df83e8b0a278d0cf197080be63b816064320af89f3bfb2be4fb3460351","source":{"kind":"arxiv","id":"1802.08843","version":3},"attestation_state":"computed","paper":{"title":"On the sizes of $k$-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, Liqiong Xu, Yingzhi Tian","submitted_at":"2018-02-24T12:48:27Z","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 hypergraph $H'=(V',E')$ is called a subhypergraph of $H=(V,E)$ if $V'\\subseteq V$ and $E'\\subseteq E$. A $r$-uniform hypergraph $H=(V,E)$ is $k$-edge-maximal if every subhypergraph of $H$ has edge-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setminus"},"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":"1802.08843","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-24T12:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"aad22f91752ad3b19fec50ea99b79dc8c57138621bd55b73009f33e8fb097ac2","abstract_canon_sha256":"7df3f70d7f6075406da2ca72ed86561e28c02bb345d0a974be251f9cc7cec022"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:38.387441Z","signature_b64":"3O39GCThgjdmDyhEKK+i+pFrD3gAMa4rJdCjwyGl8cK0UP9s+or5H4WFEIP5++xT3lo2k5d0tH6Qj3MdGfZ6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6806df83e8b0a278d0cf197080be63b816064320af89f3bfb2be4fb3460351","last_reissued_at":"2026-05-18T00:10:38.386830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:38.386830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sizes of $k$-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, Liqiong Xu, Yingzhi Tian","submitted_at":"2018-02-24T12:48:27Z","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 hypergraph $H'=(V',E')$ is called a subhypergraph of $H=(V,E)$ if $V'\\subseteq V$ and $E'\\subseteq E$. A $r$-uniform hypergraph $H=(V,E)$ is $k$-edge-maximal if every subhypergraph of $H$ has edge-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setminus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08843","created_at":"2026-05-18T00:10:38.386924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08843v3","created_at":"2026-05-18T00:10:38.386924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08843","created_at":"2026-05-18T00:10:38.386924+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVUANX4D5CYK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVUANX4D5CYKE6GQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVUANX4D","created_at":"2026-05-18T12:32:50.500415+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/RVUANX4D5CYKE6GQZ4MXBAF6MO","json":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO.json","graph_json":"https://pith.science/api/pith-number/RVUANX4D5CYKE6GQZ4MXBAF6MO/graph.json","events_json":"https://pith.science/api/pith-number/RVUANX4D5CYKE6GQZ4MXBAF6MO/events.json","paper":"https://pith.science/paper/RVUANX4D"},"agent_actions":{"view_html":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO","download_json":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO.json","view_paper":"https://pith.science/paper/RVUANX4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08843&json=true","fetch_graph":"https://pith.science/api/pith-number/RVUANX4D5CYKE6GQZ4MXBAF6MO/graph.json","fetch_events":"https://pith.science/api/pith-number/RVUANX4D5CYKE6GQZ4MXBAF6MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO/action/storage_attestation","attest_author":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO/action/author_attestation","sign_citation":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO/action/citation_signature","submit_replication":"https://pith.science/pith/RVUANX4D5CYKE6GQZ4MXBAF6MO/action/replication_record"}},"created_at":"2026-05-18T00:10:38.386924+00:00","updated_at":"2026-05-18T00:10:38.386924+00:00"}