{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XRYUR5EA3T5FTUNSS3BHEQAF6B","short_pith_number":"pith:XRYUR5EA","schema_version":"1.0","canonical_sha256":"bc7148f480dcfa59d1b296c2724005f04d3d2a78e7c3a207335d258b58d13dd0","source":{"kind":"arxiv","id":"1610.00777","version":2},"attestation_state":"computed","paper":{"title":"Tur\\'an numbers of vertex-disjoint cliques in $r$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kapilow, Anna Schenfisch, Jessica De Silva, Kristin Heysse, Michael Young","submitted_at":"2016-10-03T22:42:40Z","abstract_excerpt":"For two graphs $G$ and $H$, the Tur\\'{a}n number $ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Tur\\'{a}n numbers $ex(K_{m,n},kK_2)$ for all $k\\geq 1$ [7]. In this paper we will determine the Tur\\'{a}n numbers $ex(K_{a_1,\\ldots,a_r},kK_r)$ for all $r\\geq 3$ and $k\\geq 1$."},"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":"1610.00777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T22:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"2d0cfac6d21887a2294febbe1ad2f362a1bbc5ab3ffefae9baee3f40f3d052ee","abstract_canon_sha256":"e8e8a8ffe932a0eafef3f4776ef1625bc2a2746f5350259f9aceac66d5c4f693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:03.784506Z","signature_b64":"aIVNbmI47XITtNGKb6ZEQrm3Yct5KLr6bKDWiMOT4AfXNWDmBj4N5M3ET1JokGJ8ERegiUSO3KkHmY94q+QpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7148f480dcfa59d1b296c2724005f04d3d2a78e7c3a207335d258b58d13dd0","last_reissued_at":"2026-05-18T00:36:03.783936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:03.783936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an numbers of vertex-disjoint cliques in $r$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kapilow, Anna Schenfisch, Jessica De Silva, Kristin Heysse, Michael Young","submitted_at":"2016-10-03T22:42:40Z","abstract_excerpt":"For two graphs $G$ and $H$, the Tur\\'{a}n number $ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Tur\\'{a}n numbers $ex(K_{m,n},kK_2)$ for all $k\\geq 1$ [7]. In this paper we will determine the Tur\\'{a}n numbers $ex(K_{a_1,\\ldots,a_r},kK_r)$ for all $r\\geq 3$ and $k\\geq 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00777","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.00777","created_at":"2026-05-18T00:36:03.784010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00777v2","created_at":"2026-05-18T00:36:03.784010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00777","created_at":"2026-05-18T00:36:03.784010+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRYUR5EA3T5F","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRYUR5EA3T5FTUNS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRYUR5EA","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B","json":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B.json","graph_json":"https://pith.science/api/pith-number/XRYUR5EA3T5FTUNSS3BHEQAF6B/graph.json","events_json":"https://pith.science/api/pith-number/XRYUR5EA3T5FTUNSS3BHEQAF6B/events.json","paper":"https://pith.science/paper/XRYUR5EA"},"agent_actions":{"view_html":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B","download_json":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B.json","view_paper":"https://pith.science/paper/XRYUR5EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00777&json=true","fetch_graph":"https://pith.science/api/pith-number/XRYUR5EA3T5FTUNSS3BHEQAF6B/graph.json","fetch_events":"https://pith.science/api/pith-number/XRYUR5EA3T5FTUNSS3BHEQAF6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B/action/storage_attestation","attest_author":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B/action/author_attestation","sign_citation":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B/action/citation_signature","submit_replication":"https://pith.science/pith/XRYUR5EA3T5FTUNSS3BHEQAF6B/action/replication_record"}},"created_at":"2026-05-18T00:36:03.784010+00:00","updated_at":"2026-05-18T00:36:03.784010+00:00"}