{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3U52CHX5BO7KXMZBR5SUOBJHLN","short_pith_number":"pith:3U52CHX5","canonical_record":{"source":{"id":"1901.09058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T19:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"dc7825495b20a15b1b207928041c809761ccd369a1baedb1caeaff33b1ddf4d5","abstract_canon_sha256":"58a3976cdafe747c4c591f4d38eb905d878f5400f75e73e8af31232556d6cb7a"},"schema_version":"1.0"},"canonical_sha256":"dd3ba11efd0bbeabb3218f654705275b4950d4e33f492617ef84e1dcd7d173bb","source":{"kind":"arxiv","id":"1901.09058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09058","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09058v1","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09058","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"3U52CHX5BO7K","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3U52CHX5BO7KXMZB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3U52CHX5","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3U52CHX5BO7KXMZBR5SUOBJHLN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T19:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"dc7825495b20a15b1b207928041c809761ccd369a1baedb1caeaff33b1ddf4d5","abstract_canon_sha256":"58a3976cdafe747c4c591f4d38eb905d878f5400f75e73e8af31232556d6cb7a"},"schema_version":"1.0"},"canonical_sha256":"dd3ba11efd0bbeabb3218f654705275b4950d4e33f492617ef84e1dcd7d173bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:30.630053Z","signature_b64":"mLhDgqbK3Am/Qt/CqPYk/Z83x46QLNdnY/Wd6VJ1Tx5/AOpYYdlEguA4l2ofm6UamFLHD/UHR5wlJURlJQ2kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd3ba11efd0bbeabb3218f654705275b4950d4e33f492617ef84e1dcd7d173bb","last_reissued_at":"2026-05-17T23:55:30.629334Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:30.629334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09058","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-17T23:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VLn6hmKwDZer+4JStAGC65PvkwSSvrPKjYBdVEKadkRti0jIaUHtoeiZ3r/yUwFQG+fAEHrQqWSY5fEQLB7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:59:30.286195Z"},"content_sha256":"3232ee158c53305ebe16a31ff6a2b6dbbfe036c2cfb80f0efc438e2dd0355384","schema_version":"1.0","event_id":"sha256:3232ee158c53305ebe16a31ff6a2b6dbbfe036c2cfb80f0efc438e2dd0355384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3U52CHX5BO7KXMZBR5SUOBJHLN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the cover Ramsey number of Berge hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Zhiyu Wang","submitted_at":"2019-01-25T19:25:56Z","abstract_excerpt":"For a fixed set of positive integers $R$, we say $\\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. An $R$-graph $\\mathcal{H}$ is \\emph{covering} if every vertex pair of $\\mathcal{H}$ is contained in some hyperedge. For a graph $G=(V,E)$, a hypergraph $\\mathcal{H}$ is called a \\textit{Berge}-$G$, denoted by $BG$, if there exists an injection $f: E(G) \\to E(\\mathcal{H})$ such that for every $e \\in E(G)$, $e \\subseteq f(e)$. In this note, we define a new type of Ramsey number, namely the \\emph{cover Ramsey number}, denoted as $\\hat{R}^R(BG_1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09058","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-17T23:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gb5RA1pDb+JO6R43yihY8UIR1cWdCP3PW1sPyqdhW2yxGzf8A3zG3QvBuMHvmciaQILUim4ppDNXUpRfVoImAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:59:30.286932Z"},"content_sha256":"bcd0f04a08ed606ac639f56ccd7c6159a2de3cc8ca09da8b77f32879b5d85409","schema_version":"1.0","event_id":"sha256:bcd0f04a08ed606ac639f56ccd7c6159a2de3cc8ca09da8b77f32879b5d85409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/bundle.json","state_url":"https://pith.science/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/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-05T03:59:30Z","links":{"resolver":"https://pith.science/pith/3U52CHX5BO7KXMZBR5SUOBJHLN","bundle":"https://pith.science/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/bundle.json","state":"https://pith.science/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3U52CHX5BO7KXMZBR5SUOBJHLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3U52CHX5BO7KXMZBR5SUOBJHLN","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":"58a3976cdafe747c4c591f4d38eb905d878f5400f75e73e8af31232556d6cb7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T19:25:56Z","title_canon_sha256":"dc7825495b20a15b1b207928041c809761ccd369a1baedb1caeaff33b1ddf4d5"},"schema_version":"1.0","source":{"id":"1901.09058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09058","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09058v1","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09058","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"3U52CHX5BO7K","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3U52CHX5BO7KXMZB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3U52CHX5","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:bcd0f04a08ed606ac639f56ccd7c6159a2de3cc8ca09da8b77f32879b5d85409","target":"graph","created_at":"2026-05-17T23:55:30Z","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":"For a fixed set of positive integers $R$, we say $\\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. An $R$-graph $\\mathcal{H}$ is \\emph{covering} if every vertex pair of $\\mathcal{H}$ is contained in some hyperedge. For a graph $G=(V,E)$, a hypergraph $\\mathcal{H}$ is called a \\textit{Berge}-$G$, denoted by $BG$, if there exists an injection $f: E(G) \\to E(\\mathcal{H})$ such that for every $e \\in E(G)$, $e \\subseteq f(e)$. In this note, we define a new type of Ramsey number, namely the \\emph{cover Ramsey number}, denoted as $\\hat{R}^R(BG_1","authors_text":"Linyuan Lu, Zhiyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T19:25:56Z","title":"On the cover Ramsey number of Berge hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09058","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:3232ee158c53305ebe16a31ff6a2b6dbbfe036c2cfb80f0efc438e2dd0355384","target":"record","created_at":"2026-05-17T23:55:30Z","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":"58a3976cdafe747c4c591f4d38eb905d878f5400f75e73e8af31232556d6cb7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T19:25:56Z","title_canon_sha256":"dc7825495b20a15b1b207928041c809761ccd369a1baedb1caeaff33b1ddf4d5"},"schema_version":"1.0","source":{"id":"1901.09058","kind":"arxiv","version":1}},"canonical_sha256":"dd3ba11efd0bbeabb3218f654705275b4950d4e33f492617ef84e1dcd7d173bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3ba11efd0bbeabb3218f654705275b4950d4e33f492617ef84e1dcd7d173bb","first_computed_at":"2026-05-17T23:55:30.629334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:30.629334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLhDgqbK3Am/Qt/CqPYk/Z83x46QLNdnY/Wd6VJ1Tx5/AOpYYdlEguA4l2ofm6UamFLHD/UHR5wlJURlJQ2kDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:30.630053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3232ee158c53305ebe16a31ff6a2b6dbbfe036c2cfb80f0efc438e2dd0355384","sha256:bcd0f04a08ed606ac639f56ccd7c6159a2de3cc8ca09da8b77f32879b5d85409"],"state_sha256":"2dde39734ac9134d03b9f46af4daf35108dedd5e0936e3c5fe6e395c9e3715d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VwyIwsG1AoQ10YQy2993dIUprWpNc6FoxleP/p3gFQzZmuxWXm3rK+n0fCexcdJK4umStHsucdEsB8BiP2BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:59:30.290504Z","bundle_sha256":"2b534b2151f5ee9af368b4433d1bedead354fdfc3a7815fdbe16ecfb5a97effe"}}