{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EUFGPPYF5ONBWZOCG3CJDNVNU2","short_pith_number":"pith:EUFGPPYF","schema_version":"1.0","canonical_sha256":"250a67bf05eb9a1b65c236c491b6ada6b1f6793801f8978d92cfc111e67119f7","source":{"kind":"arxiv","id":"1906.01812","version":4},"attestation_state":"computed","paper":{"title":"Tur\\'an number of disjoint triangles in 4-partite graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yi Zhao","submitted_at":"2019-06-05T03:46:27Z","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$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.01812","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T03:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"54076764ff53eb3ac52af40e484f2373feeb893197d951c440d5a0b178a6f644","abstract_canon_sha256":"e3de0e49864bd00b3c61e8459f62b59b27f1d073739caddee3a132a496ffc1c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:36.521549Z","signature_b64":"IrbPYj31xJv8EkTOV2Qxx1rpgL/TzZePka/XuOS2Rx3OBYB/FXUhmY4/+SSQv5ywJCBYGjEImR83nfE1VoV3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250a67bf05eb9a1b65c236c491b6ada6b1f6793801f8978d92cfc111e67119f7","last_reissued_at":"2026-07-05T03:33:36.521151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:36.521151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an number of disjoint triangles in 4-partite graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yi Zhao","submitted_at":"2019-06-05T03:46:27Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01812","kind":"arxiv","version":4},"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/1906.01812/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.01812","created_at":"2026-07-05T03:33:36.521213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01812v4","created_at":"2026-07-05T03:33:36.521213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01812","created_at":"2026-07-05T03:33:36.521213+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUFGPPYF5ONB","created_at":"2026-07-05T03:33:36.521213+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUFGPPYF5ONBWZOC","created_at":"2026-07-05T03:33:36.521213+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUFGPPYF","created_at":"2026-07-05T03:33:36.521213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05983","citing_title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2","json":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2.json","graph_json":"https://pith.science/api/pith-number/EUFGPPYF5ONBWZOCG3CJDNVNU2/graph.json","events_json":"https://pith.science/api/pith-number/EUFGPPYF5ONBWZOCG3CJDNVNU2/events.json","paper":"https://pith.science/paper/EUFGPPYF"},"agent_actions":{"view_html":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2","download_json":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2.json","view_paper":"https://pith.science/paper/EUFGPPYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01812&json=true","fetch_graph":"https://pith.science/api/pith-number/EUFGPPYF5ONBWZOCG3CJDNVNU2/graph.json","fetch_events":"https://pith.science/api/pith-number/EUFGPPYF5ONBWZOCG3CJDNVNU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2/action/storage_attestation","attest_author":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2/action/author_attestation","sign_citation":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2/action/citation_signature","submit_replication":"https://pith.science/pith/EUFGPPYF5ONBWZOCG3CJDNVNU2/action/replication_record"}},"created_at":"2026-07-05T03:33:36.521213+00:00","updated_at":"2026-07-05T03:33:36.521213+00:00"}