{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZANDASPW3SAORL7MFE3MVD4RL5","short_pith_number":"pith:ZANDASPW","schema_version":"1.0","canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","source":{"kind":"arxiv","id":"2411.17322","version":2},"attestation_state":"computed","paper":{"title":"Tur\\'an numbers of cycles plus a general graph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunyang Dou, Fu-Tao Hu, Xing Peng","submitted_at":"2024-11-26T11:10:27Z","abstract_excerpt":"For a family of graphs $\\cal F$, a graph $G$ is $\\cal F$-free if it does not contain a member of $\\cal F$ as a subgraph. The Tur\\'an number $\\textrm{ex}(n,{\\cal F})$ is the maximum number of edges in an $n$-vertex graph which is $\\cal F$-free. Let ${\\cal C}_{\\geq k}$ be the set of cycles with length at least $k$. In this paper, we investigate the Tur\\'an number of $\\{{\\cal C}_{\\geq k}, F\\}$ for a general graph $F$. To be precise, we determine $\\textrm{ex}(n, \\{{\\cal C}_{\\geq k}, F\\})$ apart from a constant additive term, where $F$ either is a 2-connected nonbipartite graph or is a 2-connected "},"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":"2411.17322","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"cc26a8744fad5f4fe6f0056289ade350ff805e6fb74f5d07bdc4d92df9055406","abstract_canon_sha256":"0fa7cc5726d59068953faddebfede227caf49e74ad5305e6293ad5882329403c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:57.707767Z","signature_b64":"i1d/F82LZm0/0iiylluGMxKzbw4wh4CMEmNU3ErMT5CDvqkvpVa84edqSb87Kndk73VIe19LsaGKROMKrZZHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","last_reissued_at":"2026-07-05T09:47:57.707284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:57.707284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an numbers of cycles plus a general graph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunyang Dou, Fu-Tao Hu, Xing Peng","submitted_at":"2024-11-26T11:10:27Z","abstract_excerpt":"For a family of graphs $\\cal F$, a graph $G$ is $\\cal F$-free if it does not contain a member of $\\cal F$ as a subgraph. The Tur\\'an number $\\textrm{ex}(n,{\\cal F})$ is the maximum number of edges in an $n$-vertex graph which is $\\cal F$-free. Let ${\\cal C}_{\\geq k}$ be the set of cycles with length at least $k$. In this paper, we investigate the Tur\\'an number of $\\{{\\cal C}_{\\geq k}, F\\}$ for a general graph $F$. To be precise, we determine $\\textrm{ex}(n, \\{{\\cal C}_{\\geq k}, F\\})$ apart from a constant additive term, where $F$ either is a 2-connected nonbipartite graph or is a 2-connected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17322","kind":"arxiv","version":2},"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/2411.17322/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":"2411.17322","created_at":"2026-07-05T09:47:57.707361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17322v2","created_at":"2026-07-05T09:47:57.707361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17322","created_at":"2026-07-05T09:47:57.707361+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZANDASPW3SAO","created_at":"2026-07-05T09:47:57.707361+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZANDASPW3SAORL7M","created_at":"2026-07-05T09:47:57.707361+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZANDASPW","created_at":"2026-07-05T09:47:57.707361+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":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5","json":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5.json","graph_json":"https://pith.science/api/pith-number/ZANDASPW3SAORL7MFE3MVD4RL5/graph.json","events_json":"https://pith.science/api/pith-number/ZANDASPW3SAORL7MFE3MVD4RL5/events.json","paper":"https://pith.science/paper/ZANDASPW"},"agent_actions":{"view_html":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5","download_json":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5.json","view_paper":"https://pith.science/paper/ZANDASPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17322&json=true","fetch_graph":"https://pith.science/api/pith-number/ZANDASPW3SAORL7MFE3MVD4RL5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZANDASPW3SAORL7MFE3MVD4RL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/action/storage_attestation","attest_author":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/action/author_attestation","sign_citation":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/action/citation_signature","submit_replication":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/action/replication_record"}},"created_at":"2026-07-05T09:47:57.707361+00:00","updated_at":"2026-07-05T09:47:57.707361+00:00"}