{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SMM6QKTUIQ2ZIIK4R6MMAFN6OE","short_pith_number":"pith:SMM6QKTU","schema_version":"1.0","canonical_sha256":"9319e82a74443594215c8f98c015be7138a9dd952530da8c5868138059ecc2e4","source":{"kind":"arxiv","id":"2412.18853","version":1},"attestation_state":"computed","paper":{"title":"Generalized Tur\\'an problems for a matching and long cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Xiamiao Zhao","submitted_at":"2024-12-25T09:51:54Z","abstract_excerpt":"Let $\\mathscr{F}$ be a family of graphs. A graph $G$ is $\\mathscr{F}$-free if $G$ does not contain any $F\\in \\mathcal{F}$ as a subgraph. The general Tur\\'an number, denoted by $ex(n, H,\\mathscr{F})$, is the maximum number of copies of $H$ in an $n$-vertex $\\mathscr{F}$-free graph. Then $ex(n, K_2,\\mathscr{F})$, also denote by $ex(n, \\mathscr{F})$, is the Tur\\'an number. Recently, Alon and Frankl determined the exact value of $ex(n, \\{K_{k},M_{s+1}\\})$, where $K_{k}$ and $M_{s+1}$ are a complete graph on $k $ vertices and a matching of size $s +1$, respectively. Then many results were obtained "},"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":"2412.18853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-25T09:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"867574f8b3eda2512fb216411f5f7cf5dc5c6f41d2e968a8ee50d5f5f1b670db","abstract_canon_sha256":"22b284b2f18e84f37e6f65e99031915c31200aee5d1d251bc9e9409f01658586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:11.932778Z","signature_b64":"VXNvf2t8bP8rySGupkuwF05hhiNVAKl7RBwN9TlCuDIUDF75ynCHfR+xyblhODdjkWCJ4OHjXbdjUsEEIg5CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9319e82a74443594215c8f98c015be7138a9dd952530da8c5868138059ecc2e4","last_reissued_at":"2026-07-05T09:54:11.932323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:11.932323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problems for a matching and long cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Xiamiao Zhao","submitted_at":"2024-12-25T09:51:54Z","abstract_excerpt":"Let $\\mathscr{F}$ be a family of graphs. A graph $G$ is $\\mathscr{F}$-free if $G$ does not contain any $F\\in \\mathcal{F}$ as a subgraph. The general Tur\\'an number, denoted by $ex(n, H,\\mathscr{F})$, is the maximum number of copies of $H$ in an $n$-vertex $\\mathscr{F}$-free graph. Then $ex(n, K_2,\\mathscr{F})$, also denote by $ex(n, \\mathscr{F})$, is the Tur\\'an number. Recently, Alon and Frankl determined the exact value of $ex(n, \\{K_{k},M_{s+1}\\})$, where $K_{k}$ and $M_{s+1}$ are a complete graph on $k $ vertices and a matching of size $s +1$, respectively. Then many results were obtained "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18853","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/2412.18853/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":"2412.18853","created_at":"2026-07-05T09:54:11.932390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18853v1","created_at":"2026-07-05T09:54:11.932390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18853","created_at":"2026-07-05T09:54:11.932390+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMM6QKTUIQ2Z","created_at":"2026-07-05T09:54:11.932390+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMM6QKTUIQ2ZIIK4","created_at":"2026-07-05T09:54:11.932390+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMM6QKTU","created_at":"2026-07-05T09:54:11.932390+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":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE","json":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE.json","graph_json":"https://pith.science/api/pith-number/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/graph.json","events_json":"https://pith.science/api/pith-number/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/events.json","paper":"https://pith.science/paper/SMM6QKTU"},"agent_actions":{"view_html":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE","download_json":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE.json","view_paper":"https://pith.science/paper/SMM6QKTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18853&json=true","fetch_graph":"https://pith.science/api/pith-number/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/graph.json","fetch_events":"https://pith.science/api/pith-number/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/action/storage_attestation","attest_author":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/action/author_attestation","sign_citation":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/action/citation_signature","submit_replication":"https://pith.science/pith/SMM6QKTUIQ2ZIIK4R6MMAFN6OE/action/replication_record"}},"created_at":"2026-07-05T09:54:11.932390+00:00","updated_at":"2026-07-05T09:54:11.932390+00:00"}