{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V4GDFWFQGPZIPTTGCBZYIKYZCX","short_pith_number":"pith:V4GDFWFQ","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"},"canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","source":{"kind":"arxiv","id":"1808.00455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00455","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00455v1","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00455","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"V4GDFWFQGPZI","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V4GDFWFQGPZIPTTG","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V4GDFWFQ","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V4GDFWFQGPZIPTTGCBZYIKYZCX","target":"record","payload":{"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"},"canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","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"},"source_kind":"arxiv","source_id":"1808.00455","source_version":1,"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qO/iwGvNAvLc+PZHG4AvF6VOJNGBYrUD56Uh34AYupr7AxpnT0a1Qe1WLh2o7WBSULtFQg+yGykHEtC5v5RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:33:53.302720Z"},"content_sha256":"0345598e3dbad1ec1658cc46d755b95a24601f2e2a94c8819cb66c82c4176c28","schema_version":"1.0","event_id":"sha256:0345598e3dbad1ec1658cc46d755b95a24601f2e2a94c8819cb66c82c4176c28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V4GDFWFQGPZIPTTGCBZYIKYZCX","target":"graph","payload":{"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"},"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oaXrjBCuIQV8V+blo0aAxKCK+ONVkG/WjHImNHtCqlkfkz+zBn3nqL7HQP6uRhM6hSM8wxPE+QvorWOls0X+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:33:53.303099Z"},"content_sha256":"4bf0e85136356fe44a7c895a11e31b95c6e7e4619d4a78fc27410db1c5f3ff28","schema_version":"1.0","event_id":"sha256:4bf0e85136356fe44a7c895a11e31b95c6e7e4619d4a78fc27410db1c5f3ff28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/bundle.json","state_url":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/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-02T17:33:53Z","links":{"resolver":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX","bundle":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/bundle.json","state":"https://pith.science/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4GDFWFQGPZIPTTGCBZYIKYZCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V4GDFWFQGPZIPTTGCBZYIKYZCX","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":"0f1926d382adcf7d479c629b02e03be39cf4aab88cb1f08dafa57d126cd335cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-01T03:40:20Z","title_canon_sha256":"23d4a8826966ac4e3601cc22528137423c7912087384e9fb81c92d915e768ec0"},"schema_version":"1.0","source":{"id":"1808.00455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00455","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00455v1","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00455","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"V4GDFWFQGPZI","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V4GDFWFQGPZIPTTG","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V4GDFWFQ","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4bf0e85136356fe44a7c895a11e31b95c6e7e4619d4a78fc27410db1c5f3ff28","target":"graph","created_at":"2026-05-18T00:09:05Z","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 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","authors_text":"Hong-Jian Lai, Jixiang Meng, Yingzhi Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-01T03:40:20Z","title":"On the sizes of vertex-$k$-maximal $r$-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00455","kind":"arxiv","version":1},"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:0345598e3dbad1ec1658cc46d755b95a24601f2e2a94c8819cb66c82c4176c28","target":"record","created_at":"2026-05-18T00:09:05Z","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":"0f1926d382adcf7d479c629b02e03be39cf4aab88cb1f08dafa57d126cd335cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-01T03:40:20Z","title_canon_sha256":"23d4a8826966ac4e3601cc22528137423c7912087384e9fb81c92d915e768ec0"},"schema_version":"1.0","source":{"id":"1808.00455","kind":"arxiv","version":1}},"canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af0c32d8b033f287ce661073842b1915c19ea397d60d41fabb615a50fabb36be","first_computed_at":"2026-05-18T00:09:05.234459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:05.234459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8wSFRC7lBFYPuAtcq/x9tdmR2Jg3yhGu+0DjIKPNkPczG7luXMwNkIxSZUhj7rDTgTJLRMmsb7LW4fpttiACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:05.234956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0345598e3dbad1ec1658cc46d755b95a24601f2e2a94c8819cb66c82c4176c28","sha256:4bf0e85136356fe44a7c895a11e31b95c6e7e4619d4a78fc27410db1c5f3ff28"],"state_sha256":"3ceb16becd0a1a6c070b585e289f96e3b12aa9ee607ba5e42bafbb4c917d20ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+iiLIz042YXU+QjV6VmIPKwF6tW1UzPfKzKHQEU/AtjDaDr2HRLtaz403P7mhiuOWIcjOM37vvMk/ohjDPWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:33:53.305389Z","bundle_sha256":"590c5bcb4f3dac5ec82f40fe0b083bb08b87369a72dcd763a20d26c9e3bc588e"}}