{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZMVHSYKQDVNEZVI4HYGN66FFHV","short_pith_number":"pith:ZMVHSYKQ","canonical_record":{"source":{"id":"1908.05983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T14:17:20Z","cross_cats_sorted":[],"title_canon_sha256":"2942131f964d400634122d8a42d065b1bd64a88fcd7ecf0cd15d29288cbc0939","abstract_canon_sha256":"f6819bf31772a63e665dcf0d85cf68c7e0a697cf6d8baec6386b98bbd9b5dbbe"},"schema_version":"1.0"},"canonical_sha256":"cb2a7961501d5a4cd51c3e0cdf78a53d678d4af37f5fcf86670a60a3689947a1","source":{"kind":"arxiv","id":"1908.05983","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05983","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05983v3","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05983","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZMVHSYKQDVNE","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZMVHSYKQDVNEZVI4","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZMVHSYKQ","created_at":"2026-07-05T01:48:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZMVHSYKQDVNEZVI4HYGN66FFHV","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T14:17:20Z","cross_cats_sorted":[],"title_canon_sha256":"2942131f964d400634122d8a42d065b1bd64a88fcd7ecf0cd15d29288cbc0939","abstract_canon_sha256":"f6819bf31772a63e665dcf0d85cf68c7e0a697cf6d8baec6386b98bbd9b5dbbe"},"schema_version":"1.0"},"canonical_sha256":"cb2a7961501d5a4cd51c3e0cdf78a53d678d4af37f5fcf86670a60a3689947a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:42.159016Z","signature_b64":"2grTJGOgIxodBTC6P/fmHnlW3RALnF6I9pXH7m5eHGqfSJXW8EBKz8O2VEoPxS5qVl7ILINyKYlfbIu5AOzCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2a7961501d5a4cd51c3e0cdf78a53d678d4af37f5fcf86670a60a3689947a1","last_reissued_at":"2026-07-05T01:48:42.158595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:42.158595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05983","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-07-05T01:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zk4GNI4FQ6VLqCLs457gvPYGCqdwzkcddftqJt3UeKDAt59N/VDzlsPgU9yj7W4InREZm4L5pfnHYiARvWsHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:15:47.714443Z"},"content_sha256":"ae304c637040877eaedbf05d02a344be615264eb5b81be9c29f3135f4ffd1568","schema_version":"1.0","event_id":"sha256:ae304c637040877eaedbf05d02a344be615264eb5b81be9c29f3135f4ffd1568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZMVHSYKQDVNEZVI4HYGN66FFHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erica L.L. Liu, Jian Wang","submitted_at":"2019-08-16T14:17:20Z","abstract_excerpt":"For two $s$-uniform hypergraphs $H$ and $F$, the Tur\\'{a}n number $ex_s(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Let $s, r, k, n_1, \\ldots, n_r$ be integers satisfying $2\\leq s\\leq r$ and $n_1\\leq n_2\\leq \\cdots\\leq n_r$. De Silva, Heysse and Young determined $ex_2(K_{n_1, \\ldots, n_r}, kK_2)$ and De Silva, Heysse, Kapilow, Schenfisch and Young determined $ex_2(K_{n_1, \\ldots, n_r},kK_r)$. In this paper, as a generalization of these results, we consider three Tur\\'{a}n-type problems for $k$ disjoint cliques in $r$-partite $s$-uniform hypergraphs. First, we consider "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05983","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05983/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzccfiuMVBlX6p7nC9VFgrMFgBt0qG69l2Dp9ClAVdWu+L6tPfg95+lpQXkFtm5v1pKEEe4rm5Vr7xGw6IETBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:15:47.715001Z"},"content_sha256":"9cd59c39494d47c2bdb001c2b44c311fd0af717a6cbec95d8fbff0cb29494559","schema_version":"1.0","event_id":"sha256:9cd59c39494d47c2bdb001c2b44c311fd0af717a6cbec95d8fbff0cb29494559"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/bundle.json","state_url":"https://pith.science/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/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-08-16T04:15:47Z","links":{"resolver":"https://pith.science/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV","bundle":"https://pith.science/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/bundle.json","state":"https://pith.science/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMVHSYKQDVNEZVI4HYGN66FFHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZMVHSYKQDVNEZVI4HYGN66FFHV","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":"f6819bf31772a63e665dcf0d85cf68c7e0a697cf6d8baec6386b98bbd9b5dbbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T14:17:20Z","title_canon_sha256":"2942131f964d400634122d8a42d065b1bd64a88fcd7ecf0cd15d29288cbc0939"},"schema_version":"1.0","source":{"id":"1908.05983","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05983","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05983v3","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05983","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZMVHSYKQDVNE","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZMVHSYKQDVNEZVI4","created_at":"2026-07-05T01:48:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZMVHSYKQ","created_at":"2026-07-05T01:48:42Z"}],"graph_snapshots":[{"event_id":"sha256:9cd59c39494d47c2bdb001c2b44c311fd0af717a6cbec95d8fbff0cb29494559","target":"graph","created_at":"2026-07-05T01:48:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05983/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For two $s$-uniform hypergraphs $H$ and $F$, the Tur\\'{a}n number $ex_s(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Let $s, r, k, n_1, \\ldots, n_r$ be integers satisfying $2\\leq s\\leq r$ and $n_1\\leq n_2\\leq \\cdots\\leq n_r$. De Silva, Heysse and Young determined $ex_2(K_{n_1, \\ldots, n_r}, kK_2)$ and De Silva, Heysse, Kapilow, Schenfisch and Young determined $ex_2(K_{n_1, \\ldots, n_r},kK_r)$. In this paper, as a generalization of these results, we consider three Tur\\'{a}n-type problems for $k$ disjoint cliques in $r$-partite $s$-uniform hypergraphs. First, we consider ","authors_text":"Erica L.L. Liu, Jian Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05983","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:ae304c637040877eaedbf05d02a344be615264eb5b81be9c29f3135f4ffd1568","target":"record","created_at":"2026-07-05T01:48:42Z","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":"f6819bf31772a63e665dcf0d85cf68c7e0a697cf6d8baec6386b98bbd9b5dbbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T14:17:20Z","title_canon_sha256":"2942131f964d400634122d8a42d065b1bd64a88fcd7ecf0cd15d29288cbc0939"},"schema_version":"1.0","source":{"id":"1908.05983","kind":"arxiv","version":3}},"canonical_sha256":"cb2a7961501d5a4cd51c3e0cdf78a53d678d4af37f5fcf86670a60a3689947a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb2a7961501d5a4cd51c3e0cdf78a53d678d4af37f5fcf86670a60a3689947a1","first_computed_at":"2026-07-05T01:48:42.158595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:48:42.158595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2grTJGOgIxodBTC6P/fmHnlW3RALnF6I9pXH7m5eHGqfSJXW8EBKz8O2VEoPxS5qVl7ILINyKYlfbIu5AOzCCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:48:42.159016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05983","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae304c637040877eaedbf05d02a344be615264eb5b81be9c29f3135f4ffd1568","sha256:9cd59c39494d47c2bdb001c2b44c311fd0af717a6cbec95d8fbff0cb29494559"],"state_sha256":"b3143bf14fdbb4893037d33339be81b5ea555a973ed776790c15efe4d2ebf16d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78i8s8nZPJZnePsm9Z/rRIHV0VFIEr0aFFddoTT3vMdEhQ9I4u4BzKMBT0OLFB5PN+N/sMhsl0HNJVSCdhCaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:15:47.719858Z","bundle_sha256":"c03982988492989eb82b6a0e65c43f0b9f484ecda56eba4c7fc1827a5e582ba1"}}