{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VRQQSXXFKY33AI3SBDX5PCSNGN","short_pith_number":"pith:VRQQSXXF","schema_version":"1.0","canonical_sha256":"ac61095ee55637b0237208efd78a4d33417d33229c7c646cb611992bac93db59","source":{"kind":"arxiv","id":"2309.09603","version":1},"attestation_state":"computed","paper":{"title":"Maximum cliques in a graph without disjoint given subgraph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gyori, Fangfang Zhang, Xiutao Zhu, Yaojun Chen","submitted_at":"2023-09-18T09:18:49Z","abstract_excerpt":"The generalized Tur\\'an number $\\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Methuku and Vizer [DM, 2019, 3130-3141] gave a lower bound for $\\ex(n,K_3,2C_5)$ and obtained the magnitude of $\\ex(n, K_s, kK_r)$. In this paper, we determine the exact value of $\\ex(n,K_3,2C_5)$ and described the unique extremal graph for large $n$. Moreover, we also determine the exact value of $\\ex(n,K_r,(k+1)K_r)$ which generalizes some known results."},"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":"2309.09603","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-18T09:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"5f764bb7be343abe1b71b372ff4559c9080ab81fb0c20636e182738ea4a52d67","abstract_canon_sha256":"b879b2501111633ed5ae5736a96408848a1e77ce27ddfbf5508c5b3389fee336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:41.758294Z","signature_b64":"+YWyjFICBS4C9pJwfCCuE7qnXhAcOfdDnHWGWeJf9vcKEUeHoST+Jxok3X7N0i+eIsIcWLpxUeJqnNqeo4EHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac61095ee55637b0237208efd78a4d33417d33229c7c646cb611992bac93db59","last_reissued_at":"2026-07-05T06:51:41.757866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:41.757866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum cliques in a graph without disjoint given subgraph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gyori, Fangfang Zhang, Xiutao Zhu, Yaojun Chen","submitted_at":"2023-09-18T09:18:49Z","abstract_excerpt":"The generalized Tur\\'an number $\\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Methuku and Vizer [DM, 2019, 3130-3141] gave a lower bound for $\\ex(n,K_3,2C_5)$ and obtained the magnitude of $\\ex(n, K_s, kK_r)$. In this paper, we determine the exact value of $\\ex(n,K_3,2C_5)$ and described the unique extremal graph for large $n$. Moreover, we also determine the exact value of $\\ex(n,K_r,(k+1)K_r)$ which generalizes some known results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09603","kind":"arxiv","version":1},"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/2309.09603/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":"2309.09603","created_at":"2026-07-05T06:51:41.757931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.09603v1","created_at":"2026-07-05T06:51:41.757931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09603","created_at":"2026-07-05T06:51:41.757931+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRQQSXXFKY33","created_at":"2026-07-05T06:51:41.757931+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRQQSXXFKY33AI3S","created_at":"2026-07-05T06:51:41.757931+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRQQSXXF","created_at":"2026-07-05T06:51:41.757931+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/VRQQSXXFKY33AI3SBDX5PCSNGN","json":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN.json","graph_json":"https://pith.science/api/pith-number/VRQQSXXFKY33AI3SBDX5PCSNGN/graph.json","events_json":"https://pith.science/api/pith-number/VRQQSXXFKY33AI3SBDX5PCSNGN/events.json","paper":"https://pith.science/paper/VRQQSXXF"},"agent_actions":{"view_html":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN","download_json":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN.json","view_paper":"https://pith.science/paper/VRQQSXXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.09603&json=true","fetch_graph":"https://pith.science/api/pith-number/VRQQSXXFKY33AI3SBDX5PCSNGN/graph.json","fetch_events":"https://pith.science/api/pith-number/VRQQSXXFKY33AI3SBDX5PCSNGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN/action/storage_attestation","attest_author":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN/action/author_attestation","sign_citation":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN/action/citation_signature","submit_replication":"https://pith.science/pith/VRQQSXXFKY33AI3SBDX5PCSNGN/action/replication_record"}},"created_at":"2026-07-05T06:51:41.757931+00:00","updated_at":"2026-07-05T06:51:41.757931+00:00"}