{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUFGPPYF5ONBWZOCG3CJDNVNU2","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":"e3de0e49864bd00b3c61e8459f62b59b27f1d073739caddee3a132a496ffc1c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T03:46:27Z","title_canon_sha256":"54076764ff53eb3ac52af40e484f2373feeb893197d951c440d5a0b178a6f644"},"schema_version":"1.0","source":{"id":"1906.01812","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01812","created_at":"2026-07-05T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01812v4","created_at":"2026-07-05T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01812","created_at":"2026-07-05T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"EUFGPPYF5ONB","created_at":"2026-07-05T03:33:36Z"},{"alias_kind":"pith_short_16","alias_value":"EUFGPPYF5ONBWZOC","created_at":"2026-07-05T03:33:36Z"},{"alias_kind":"pith_short_8","alias_value":"EUFGPPYF","created_at":"2026-07-05T03:33:36Z"}],"graph_snapshots":[{"event_id":"sha256:9b45876b1a2f76848bd2072611e9f1ceb4319af3b6a0dbf58a7ef680db52bec7","target":"graph","created_at":"2026-07-05T03:33:36Z","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/1906.01812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $k\\ge 2$ and $n_1\\ge n_2\\ge n_3\\ge n_4$ be integers such that $n_4$ is sufficiently larger than $k$. We determine the maximum number of edges of a 4-partite graph with parts of sizes $n_1,\\dots, n_4$ that does not contain $k$ vertex-disjoint triangles. For any $r> t\\ge 3$, we give a conjecture on the maximum number of edges of an $r$-partite graph that does not contain $k$ vertex-disjoint cliques $K_t$.","authors_text":"Jie Han, Yi Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T03:46:27Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01812","kind":"arxiv","version":4},"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:8683a865cf0684037b741667159902e4283feedb3008f47051b6c3263de90b24","target":"record","created_at":"2026-07-05T03:33:36Z","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":"e3de0e49864bd00b3c61e8459f62b59b27f1d073739caddee3a132a496ffc1c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T03:46:27Z","title_canon_sha256":"54076764ff53eb3ac52af40e484f2373feeb893197d951c440d5a0b178a6f644"},"schema_version":"1.0","source":{"id":"1906.01812","kind":"arxiv","version":4}},"canonical_sha256":"250a67bf05eb9a1b65c236c491b6ada6b1f6793801f8978d92cfc111e67119f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"250a67bf05eb9a1b65c236c491b6ada6b1f6793801f8978d92cfc111e67119f7","first_computed_at":"2026-07-05T03:33:36.521151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:33:36.521151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IrbPYj31xJv8EkTOV2Qxx1rpgL/TzZePka/XuOS2Rx3OBYB/FXUhmY4/+SSQv5ywJCBYGjEImR83nfE1VoV3BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:33:36.521549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01812","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8683a865cf0684037b741667159902e4283feedb3008f47051b6c3263de90b24","sha256:9b45876b1a2f76848bd2072611e9f1ceb4319af3b6a0dbf58a7ef680db52bec7"],"state_sha256":"13459da09c858ae65d2291010dec7ac1207bc2894dcb81e51ac3d60e53b7e6da"}