{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:C66HELRZSPDLXFZDJTSVA56X7O","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":"27c37128545977fe4900a73c5385acadcb64c2bd979525d4058002bc8508be1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-16T09:43:08Z","title_canon_sha256":"fd527480d0f9e3e3a9e35b391368375ea9a3e630e4eff33b40f9291592b84d31"},"schema_version":"1.0","source":{"id":"2409.10129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10129","created_at":"2026-07-05T09:07:35Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10129v1","created_at":"2026-07-05T09:07:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10129","created_at":"2026-07-05T09:07:35Z"},{"alias_kind":"pith_short_12","alias_value":"C66HELRZSPDL","created_at":"2026-07-05T09:07:35Z"},{"alias_kind":"pith_short_16","alias_value":"C66HELRZSPDLXFZD","created_at":"2026-07-05T09:07:35Z"},{"alias_kind":"pith_short_8","alias_value":"C66HELRZ","created_at":"2026-07-05T09:07:35Z"}],"graph_snapshots":[{"event_id":"sha256:4ae8cc000c79689dcde2524ec1043c72958c79657380f652c45b6eb58b8b4a67","target":"graph","created_at":"2026-07-05T09:07:35Z","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/2409.10129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{H}$ be a family of graphs. The generalized Tur\\'an number $ex(n, K_r, \\mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\\mathcal{H}$-free graph. In this paper, we determine the value of $ex(n, K_r, \\{P_k, K_m \\} )$ for sufficiently large $n$ with an exceptional case, and characterize all corresponding extremal graphs, which generalizes and strengthens the results of Katona and Xiao [EJC, 2024] on $ex(n, K_2, \\{P_k, K_m \\} )$. For the exceptional case, we obtain a tight upper bound for $ex(n, K_r, \\{P_k, K_m \\} )$ that confirms a conjecture on $e","authors_text":"Xiaona Fang, Xiutao Zhu, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-16T09:43:08Z","title":"Generalized Tur\\'an problem for a path and a clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10129","kind":"arxiv","version":1},"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:2da75f057a543bc3ebd1c2a113845954e0708bd64c60300cf6e7c123c17f9fc4","target":"record","created_at":"2026-07-05T09:07:35Z","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":"27c37128545977fe4900a73c5385acadcb64c2bd979525d4058002bc8508be1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-16T09:43:08Z","title_canon_sha256":"fd527480d0f9e3e3a9e35b391368375ea9a3e630e4eff33b40f9291592b84d31"},"schema_version":"1.0","source":{"id":"2409.10129","kind":"arxiv","version":1}},"canonical_sha256":"17bc722e3993c6bb97234ce55077d7fba63159f2ae4e93035fa90d1f6fdba994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17bc722e3993c6bb97234ce55077d7fba63159f2ae4e93035fa90d1f6fdba994","first_computed_at":"2026-07-05T09:07:35.469078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:07:35.469078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9OtAoOAukv3ph8AE5iDplNMCuR593BSF68F9+MQknTSM8p+6+MPSP4pj6WI4/aSTWTQxByZ1KE3eQ5GhdnqpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:07:35.469542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2da75f057a543bc3ebd1c2a113845954e0708bd64c60300cf6e7c123c17f9fc4","sha256:4ae8cc000c79689dcde2524ec1043c72958c79657380f652c45b6eb58b8b4a67"],"state_sha256":"485385197c2ca43ea37997c51b7f029fafa61f076d135ad69a952e0ef4bcc8ba"}