{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XWMGGTYEDI2T5JNXTLQWVAT6C4","short_pith_number":"pith:XWMGGTYE","canonical_record":{"source":{"id":"1807.00473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-02T05:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"e1f388da0f30fb4a917a91cadda7fcf9abe91ec9af077fd7e9a0ddcd9ea1c1c3","abstract_canon_sha256":"08ce5a6f09c6f220f4462b92982b0ecf0303d4e7a9fdd366be5075d3def6f163"},"schema_version":"1.0"},"canonical_sha256":"bd98634f041a353ea5b79ae16a827e17146f9d0e68e2a44b6fce1d367df5b585","source":{"kind":"arxiv","id":"1807.00473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00473","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00473v1","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00473","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"XWMGGTYEDI2T","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XWMGGTYEDI2T5JNX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XWMGGTYE","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XWMGGTYEDI2T5JNXTLQWVAT6C4","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-02T05:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"e1f388da0f30fb4a917a91cadda7fcf9abe91ec9af077fd7e9a0ddcd9ea1c1c3","abstract_canon_sha256":"08ce5a6f09c6f220f4462b92982b0ecf0303d4e7a9fdd366be5075d3def6f163"},"schema_version":"1.0"},"canonical_sha256":"bd98634f041a353ea5b79ae16a827e17146f9d0e68e2a44b6fce1d367df5b585","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:52.529333Z","signature_b64":"5bydg8q1l+JZ/vxF4SIcn9QV0Ic5xWea3djfsV2XmPOb8dq75tzIbXPMYv5UDU+Hpv3qD8dosRu7hlKGhLkqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd98634f041a353ea5b79ae16a827e17146f9d0e68e2a44b6fce1d367df5b585","last_reissued_at":"2026-05-18T00:11:52.528539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:52.528539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00473","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:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cq8uoUXLY5mJrXrw9MdRr9x7mSW6JomjXD7FhU65BotoHEWxtf1XSISkLfQfgwHNQciBTpYBCM8dgyr1HbKZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:14.442080Z"},"content_sha256":"95980c9d21c8225437a396c32605f017c1fe6d3132d2b4065c963557ca196f5e","schema_version":"1.0","event_id":"sha256:95980c9d21c8225437a396c32605f017c1fe6d3132d2b4065c963557ca196f5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XWMGGTYEDI2T5JNXTLQWVAT6C4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the vertex cover number of 3 uniform hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zhuo Diao","submitted_at":"2018-07-02T05:52:47Z","abstract_excerpt":"Given a hypergraph H(V;E), a set of vertices S in V is a vertex cover if every edge has at least a vertex in S. The vertex cover number is the minimum cardinality of a vertex cover, denoted by t(H). In this paper, we prove that for every 3 uniform connected hypergraph H(V;E), t(H)<=(2m+1)/3 holds on where m is the number of edges. Furthermore, the equality holds on if and only if H(V;E) is a hypertree with perfect matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00473","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:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOmeLmZwMGOLjYT/VMX8Hzmg+oftHn5UmVZeZOabTGzwCfmR/O9eEMk3stpWrdLMjEUgTKYiB0IQrCztevjoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:14.442764Z"},"content_sha256":"da3542f1846aa3dc80b70afa2faebdc36f6b903ccadb955b3c9698822807d5d6","schema_version":"1.0","event_id":"sha256:da3542f1846aa3dc80b70afa2faebdc36f6b903ccadb955b3c9698822807d5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/bundle.json","state_url":"https://pith.science/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/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-05-25T20:16:14Z","links":{"resolver":"https://pith.science/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4","bundle":"https://pith.science/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/bundle.json","state":"https://pith.science/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWMGGTYEDI2T5JNXTLQWVAT6C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XWMGGTYEDI2T5JNXTLQWVAT6C4","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":"08ce5a6f09c6f220f4462b92982b0ecf0303d4e7a9fdd366be5075d3def6f163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-02T05:52:47Z","title_canon_sha256":"e1f388da0f30fb4a917a91cadda7fcf9abe91ec9af077fd7e9a0ddcd9ea1c1c3"},"schema_version":"1.0","source":{"id":"1807.00473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00473","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00473v1","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00473","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"XWMGGTYEDI2T","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XWMGGTYEDI2T5JNX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XWMGGTYE","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:da3542f1846aa3dc80b70afa2faebdc36f6b903ccadb955b3c9698822807d5d6","target":"graph","created_at":"2026-05-18T00:11:52Z","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":"Given a hypergraph H(V;E), a set of vertices S in V is a vertex cover if every edge has at least a vertex in S. The vertex cover number is the minimum cardinality of a vertex cover, denoted by t(H). In this paper, we prove that for every 3 uniform connected hypergraph H(V;E), t(H)<=(2m+1)/3 holds on where m is the number of edges. Furthermore, the equality holds on if and only if H(V;E) is a hypertree with perfect matching.","authors_text":"Zhuo Diao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-02T05:52:47Z","title":"On the vertex cover number of 3 uniform hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00473","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:95980c9d21c8225437a396c32605f017c1fe6d3132d2b4065c963557ca196f5e","target":"record","created_at":"2026-05-18T00:11:52Z","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":"08ce5a6f09c6f220f4462b92982b0ecf0303d4e7a9fdd366be5075d3def6f163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-02T05:52:47Z","title_canon_sha256":"e1f388da0f30fb4a917a91cadda7fcf9abe91ec9af077fd7e9a0ddcd9ea1c1c3"},"schema_version":"1.0","source":{"id":"1807.00473","kind":"arxiv","version":1}},"canonical_sha256":"bd98634f041a353ea5b79ae16a827e17146f9d0e68e2a44b6fce1d367df5b585","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd98634f041a353ea5b79ae16a827e17146f9d0e68e2a44b6fce1d367df5b585","first_computed_at":"2026-05-18T00:11:52.528539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:52.528539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5bydg8q1l+JZ/vxF4SIcn9QV0Ic5xWea3djfsV2XmPOb8dq75tzIbXPMYv5UDU+Hpv3qD8dosRu7hlKGhLkqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:52.529333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95980c9d21c8225437a396c32605f017c1fe6d3132d2b4065c963557ca196f5e","sha256:da3542f1846aa3dc80b70afa2faebdc36f6b903ccadb955b3c9698822807d5d6"],"state_sha256":"d924941ef294aade42f96dc12d4098a46cb31e92d1e0a1af5e33bb318f3e51e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aI92uV3YiBb6qVvW2cUmgVaP2J+5syK0I538peigx1fWTwSoPdb3DARmTy3V6ZrwhigryIL7xHnP4GR9VR+DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:16:14.446232Z","bundle_sha256":"b0164517e61f7cd466857bba6a49423c0bcbeab45c0742337f846ba6b23169ee"}}