{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QASDNPGQKUKU2345PFRPIU423H","short_pith_number":"pith:QASDNPGQ","schema_version":"1.0","canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","source":{"kind":"arxiv","id":"2410.12338","version":1},"attestation_state":"computed","paper":{"title":"On generalized Tur\\'an problems with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Liying Kang, Yisai Xue","submitted_at":"2024-10-16T07:59:10Z","abstract_excerpt":"The generalized Tur\\'an number $\\mathrm{ex}(n, H, \\mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \\in \\mathcal{F}$. Alon and Frankl initiated the study of Tur\\'an problems with a bounded matching number.In this paper, we establish stability results for generalized Tur\\'an problems with bounded matching number.Using the stability results, we provide exact values of $\\ex(n,K_r,\\{F,M_{s+1}\\})$ for $F$ being any non-bipartite graph or a path on $k$ vertices."},"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":"2410.12338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T07:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"4dc823a0ea60a138949fee81e1c74b404fc619b770ab599f687e54a8d1659b17","abstract_canon_sha256":"cf2ccfbfaf4b8c51b9747a999270f0f598e0f5495c71c5396bc9db4bb41490d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:17.695309Z","signature_b64":"gSpP9JbgtfkPAgeHW1sUOjpDyxt8BR8hPEoVSJga8n5QQL2/Uckszovlr31aXYKEjKZCqN4ZeZ5qbRRCmrKODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","last_reissued_at":"2026-07-05T09:21:17.694886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:17.694886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On generalized Tur\\'an problems with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Liying Kang, Yisai Xue","submitted_at":"2024-10-16T07:59:10Z","abstract_excerpt":"The generalized Tur\\'an number $\\mathrm{ex}(n, H, \\mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \\in \\mathcal{F}$. Alon and Frankl initiated the study of Tur\\'an problems with a bounded matching number.In this paper, we establish stability results for generalized Tur\\'an problems with bounded matching number.Using the stability results, we provide exact values of $\\ex(n,K_r,\\{F,M_{s+1}\\})$ for $F$ being any non-bipartite graph or a path on $k$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12338","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/2410.12338/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":"2410.12338","created_at":"2026-07-05T09:21:17.694950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.12338v1","created_at":"2026-07-05T09:21:17.694950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12338","created_at":"2026-07-05T09:21:17.694950+00:00"},{"alias_kind":"pith_short_12","alias_value":"QASDNPGQKUKU","created_at":"2026-07-05T09:21:17.694950+00:00"},{"alias_kind":"pith_short_16","alias_value":"QASDNPGQKUKU2345","created_at":"2026-07-05T09:21:17.694950+00:00"},{"alias_kind":"pith_short_8","alias_value":"QASDNPGQ","created_at":"2026-07-05T09:21:17.694950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12014","citing_title":"Spectral extremal problems for degenerate graphs","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H","json":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H.json","graph_json":"https://pith.science/api/pith-number/QASDNPGQKUKU2345PFRPIU423H/graph.json","events_json":"https://pith.science/api/pith-number/QASDNPGQKUKU2345PFRPIU423H/events.json","paper":"https://pith.science/paper/QASDNPGQ"},"agent_actions":{"view_html":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H","download_json":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H.json","view_paper":"https://pith.science/paper/QASDNPGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.12338&json=true","fetch_graph":"https://pith.science/api/pith-number/QASDNPGQKUKU2345PFRPIU423H/graph.json","fetch_events":"https://pith.science/api/pith-number/QASDNPGQKUKU2345PFRPIU423H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/action/storage_attestation","attest_author":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/action/author_attestation","sign_citation":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/action/citation_signature","submit_replication":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/action/replication_record"}},"created_at":"2026-07-05T09:21:17.694950+00:00","updated_at":"2026-07-05T09:21:17.694950+00:00"}