{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C66HELRZSPDLXFZDJTSVA56X7O","short_pith_number":"pith:C66HELRZ","schema_version":"1.0","canonical_sha256":"17bc722e3993c6bb97234ce55077d7fba63159f2ae4e93035fa90d1f6fdba994","source":{"kind":"arxiv","id":"2409.10129","version":1},"attestation_state":"computed","paper":{"title":"Generalized Tur\\'an problem for a path and a clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaona Fang, Xiutao Zhu, Yaojun Chen","submitted_at":"2024-09-16T09:43:08Z","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"},"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":"2409.10129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-16T09:43:08Z","cross_cats_sorted":[],"title_canon_sha256":"fd527480d0f9e3e3a9e35b391368375ea9a3e630e4eff33b40f9291592b84d31","abstract_canon_sha256":"27c37128545977fe4900a73c5385acadcb64c2bd979525d4058002bc8508be1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:35.469542Z","signature_b64":"9OtAoOAukv3ph8AE5iDplNMCuR593BSF68F9+MQknTSM8p+6+MPSP4pj6WI4/aSTWTQxByZ1KE3eQ5GhdnqpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17bc722e3993c6bb97234ce55077d7fba63159f2ae4e93035fa90d1f6fdba994","last_reissued_at":"2026-07-05T09:07:35.469078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:35.469078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problem for a path and a clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaona Fang, Xiutao Zhu, Yaojun Chen","submitted_at":"2024-09-16T09:43:08Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10129","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/2409.10129/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":"2409.10129","created_at":"2026-07-05T09:07:35.469134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.10129v1","created_at":"2026-07-05T09:07:35.469134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10129","created_at":"2026-07-05T09:07:35.469134+00:00"},{"alias_kind":"pith_short_12","alias_value":"C66HELRZSPDL","created_at":"2026-07-05T09:07:35.469134+00:00"},{"alias_kind":"pith_short_16","alias_value":"C66HELRZSPDLXFZD","created_at":"2026-07-05T09:07:35.469134+00:00"},{"alias_kind":"pith_short_8","alias_value":"C66HELRZ","created_at":"2026-07-05T09:07:35.469134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17322","citing_title":"Tur\\'an numbers of cycles plus a general graph","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O","json":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O.json","graph_json":"https://pith.science/api/pith-number/C66HELRZSPDLXFZDJTSVA56X7O/graph.json","events_json":"https://pith.science/api/pith-number/C66HELRZSPDLXFZDJTSVA56X7O/events.json","paper":"https://pith.science/paper/C66HELRZ"},"agent_actions":{"view_html":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O","download_json":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O.json","view_paper":"https://pith.science/paper/C66HELRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.10129&json=true","fetch_graph":"https://pith.science/api/pith-number/C66HELRZSPDLXFZDJTSVA56X7O/graph.json","fetch_events":"https://pith.science/api/pith-number/C66HELRZSPDLXFZDJTSVA56X7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O/action/storage_attestation","attest_author":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O/action/author_attestation","sign_citation":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O/action/citation_signature","submit_replication":"https://pith.science/pith/C66HELRZSPDLXFZDJTSVA56X7O/action/replication_record"}},"created_at":"2026-07-05T09:07:35.469134+00:00","updated_at":"2026-07-05T09:07:35.469134+00:00"}