{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V4GDFWFQGPZIPTTGCBZYIKYZCX","short_pith_number":"pith:V4GDFWFQ","schema_version":"1.0","canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","source":{"kind":"arxiv","id":"1808.00455","version":1},"attestation_state":"computed","paper":{"title":"On the sizes of vertex-$k$-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, Yingzhi Tian","submitted_at":"2018-08-01T03:40:20Z","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 vertex-$k$-maximal if every subhypergraph of $H$ has vertex-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setm"},"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":"1808.00455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-01T03:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"23d4a8826966ac4e3601cc22528137423c7912087384e9fb81c92d915e768ec0","abstract_canon_sha256":"0f1926d382adcf7d479c629b02e03be39cf4aab88cb1f08dafa57d126cd335cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.234956Z","signature_b64":"q8wSFRC7lBFYPuAtcq/x9tdmR2Jg3yhGu+0DjIKPNkPczG7luXMwNkIxSZUhj7rDTgTJLRMmsb7LW4fpttiACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","last_reissued_at":"2026-05-18T00:09:05.234459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.234459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sizes of vertex-$k$-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, Yingzhi Tian","submitted_at":"2018-08-01T03:40:20Z","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 vertex-$k$-maximal if every subhypergraph of $H$ has vertex-connectivity at most $k$, but for any edge $e\\in E(K_n^r)\\setm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00455","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":""},"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":"1808.00455","created_at":"2026-05-18T00:09:05.234530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00455v1","created_at":"2026-05-18T00:09:05.234530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00455","created_at":"2026-05-18T00:09:05.234530+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4GDFWFQGPZI","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4GDFWFQGPZIPTTG","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4GDFWFQ","created_at":"2026-05-18T12:32:56.356000+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/V4GDFWFQGPZIPTTGCBZYIKYZCX","json":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX.json","graph_json":"https://pith.science/api/pith-number/V4GDFWFQGPZIPTTGCBZYIKYZCX/graph.json","events_json":"https://pith.science/api/pith-number/V4GDFWFQGPZIPTTGCBZYIKYZCX/events.json","paper":"https://pith.science/paper/V4GDFWFQ"},"agent_actions":{"view_html":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX","download_json":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX.json","view_paper":"https://pith.science/paper/V4GDFWFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00455&json=true","fetch_graph":"https://pith.science/api/pith-number/V4GDFWFQGPZIPTTGCBZYIKYZCX/graph.json","fetch_events":"https://pith.science/api/pith-number/V4GDFWFQGPZIPTTGCBZYIKYZCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/action/storage_attestation","attest_author":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/action/author_attestation","sign_citation":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/action/citation_signature","submit_replication":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/action/replication_record"}},"created_at":"2026-05-18T00:09:05.234530+00:00","updated_at":"2026-05-18T00:09:05.234530+00:00"}