{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HIJ3NBWPH3GLPA27CU6VOH64QZ","short_pith_number":"pith:HIJ3NBWP","canonical_record":{"source":{"id":"1903.12082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T16:04:45Z","cross_cats_sorted":[],"title_canon_sha256":"4e36cf982e79346949466215a5b0c45446b56cca32f76e248e192d31f69299bf","abstract_canon_sha256":"19f5a482d77e91783b9e107da3cd6064d5944602918ed0b27e7a0c9aee706e83"},"schema_version":"1.0"},"canonical_sha256":"3a13b686cf3eccb7835f153d571fdc866167b8bd904dc51c4f02a322dcd5024b","source":{"kind":"arxiv","id":"1903.12082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12082","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12082v3","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12082","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"HIJ3NBWPH3GL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIJ3NBWPH3GLPA27","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIJ3NBWP","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HIJ3NBWPH3GLPA27CU6VOH64QZ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T16:04:45Z","cross_cats_sorted":[],"title_canon_sha256":"4e36cf982e79346949466215a5b0c45446b56cca32f76e248e192d31f69299bf","abstract_canon_sha256":"19f5a482d77e91783b9e107da3cd6064d5944602918ed0b27e7a0c9aee706e83"},"schema_version":"1.0"},"canonical_sha256":"3a13b686cf3eccb7835f153d571fdc866167b8bd904dc51c4f02a322dcd5024b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:20.052671Z","signature_b64":"z6aNXcgMoVGXpD86ov5o+jZ2XSxZLDTQ9nojBjG3SLaKjJwtvZxnIPDEnOtO43dkQWGeLjhPQPZ3JhzWQSwJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a13b686cf3eccb7835f153d571fdc866167b8bd904dc51c4f02a322dcd5024b","last_reissued_at":"2026-05-17T23:45:20.052119Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:20.052119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12082","source_version":3,"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:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh3g0duQ53GZgoV3cGALC+n0yWavVn1teJjflT1HAN3HihO3n3Rx3vNeCOXhpA4hq/n8tp4j9CqLLtIpJf24DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:01.309448Z"},"content_sha256":"1bcbd475a8a0c56b5c1010441db1dc6c1ea709816d2b389c37703cbaa130db68","schema_version":"1.0","event_id":"sha256:1bcbd475a8a0c56b5c1010441db1dc6c1ea709816d2b389c37703cbaa130db68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HIJ3NBWPH3GLPA27CU6VOH64QZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the cover Tur\\'an 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-03-28T16:04:45Z","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$. For a graph $G=(V,E)$, a hypergraph $\\mathcal{H}$ is called a Berge-$G$, denoted by $BG$, if there exists a bijection $f: E(G) \\to E(\\mathcal{H})$ such that for every $e \\in E(G)$, $e \\subseteq f(e)$. In this paper, we define a variant of Tur\\'an number in hypergraphs, namely the cover Tur\\'an number, denoted as $\\hat{ex}_R(n, G)$, as the maximum number of edges in the shadow graph of a Berge-$G$ free $R$-graph on $n$ vertices. We show a gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12082","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"},"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:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hq63Cn8RiNcr5cAOA3Ton/ZH3zWce+3XlS3kMG5qpRgk4syugyydWdZhYEwNkCM4t/6c9IFni88XBVjtMiJ5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:01.309791Z"},"content_sha256":"737dbfc42c15a1ff4a1aefca0b0c01d0c3cfe0d662fec70837738adcee14d4a9","schema_version":"1.0","event_id":"sha256:737dbfc42c15a1ff4a1aefca0b0c01d0c3cfe0d662fec70837738adcee14d4a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/bundle.json","state_url":"https://pith.science/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/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-04T18:04:01Z","links":{"resolver":"https://pith.science/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ","bundle":"https://pith.science/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/bundle.json","state":"https://pith.science/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIJ3NBWPH3GLPA27CU6VOH64QZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HIJ3NBWPH3GLPA27CU6VOH64QZ","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":"19f5a482d77e91783b9e107da3cd6064d5944602918ed0b27e7a0c9aee706e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T16:04:45Z","title_canon_sha256":"4e36cf982e79346949466215a5b0c45446b56cca32f76e248e192d31f69299bf"},"schema_version":"1.0","source":{"id":"1903.12082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12082","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12082v3","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12082","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"HIJ3NBWPH3GL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIJ3NBWPH3GLPA27","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIJ3NBWP","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:737dbfc42c15a1ff4a1aefca0b0c01d0c3cfe0d662fec70837738adcee14d4a9","target":"graph","created_at":"2026-05-17T23:45:20Z","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$. For a graph $G=(V,E)$, a hypergraph $\\mathcal{H}$ is called a Berge-$G$, denoted by $BG$, if there exists a bijection $f: E(G) \\to E(\\mathcal{H})$ such that for every $e \\in E(G)$, $e \\subseteq f(e)$. In this paper, we define a variant of Tur\\'an number in hypergraphs, namely the cover Tur\\'an number, denoted as $\\hat{ex}_R(n, G)$, as the maximum number of edges in the shadow graph of a Berge-$G$ free $R$-graph on $n$ vertices. We show a gen","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-03-28T16:04:45Z","title":"On the cover Tur\\'an number of Berge hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12082","kind":"arxiv","version":3},"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:1bcbd475a8a0c56b5c1010441db1dc6c1ea709816d2b389c37703cbaa130db68","target":"record","created_at":"2026-05-17T23:45:20Z","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":"19f5a482d77e91783b9e107da3cd6064d5944602918ed0b27e7a0c9aee706e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T16:04:45Z","title_canon_sha256":"4e36cf982e79346949466215a5b0c45446b56cca32f76e248e192d31f69299bf"},"schema_version":"1.0","source":{"id":"1903.12082","kind":"arxiv","version":3}},"canonical_sha256":"3a13b686cf3eccb7835f153d571fdc866167b8bd904dc51c4f02a322dcd5024b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a13b686cf3eccb7835f153d571fdc866167b8bd904dc51c4f02a322dcd5024b","first_computed_at":"2026-05-17T23:45:20.052119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:20.052119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z6aNXcgMoVGXpD86ov5o+jZ2XSxZLDTQ9nojBjG3SLaKjJwtvZxnIPDEnOtO43dkQWGeLjhPQPZ3JhzWQSwJAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:20.052671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bcbd475a8a0c56b5c1010441db1dc6c1ea709816d2b389c37703cbaa130db68","sha256:737dbfc42c15a1ff4a1aefca0b0c01d0c3cfe0d662fec70837738adcee14d4a9"],"state_sha256":"615b34e9ee98c2c1da94e2421191a98de972be86b37f78ec3b9962c416ece41d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pA5ih3tDnjqdDD0f4Z+ldNIj7bLKQ273Xef47To6dvgYQ7KD+CfXZ/9FhT5PiBTkuEhz4ABDKNwGT4KpVgvfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:04:01.311655Z","bundle_sha256":"9ab538b5346c13ef8864758b9634147fb91e789f26607b5dadc2a7eb3606f221"}}