{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZANDASPW3SAORL7MFE3MVD4RL5","short_pith_number":"pith:ZANDASPW","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"},"canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","source":{"kind":"arxiv","id":"2411.17322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17322","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17322v2","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17322","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZANDASPW3SAO","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"ZANDASPW3SAORL7M","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"ZANDASPW","created_at":"2026-07-05T09:47:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZANDASPW3SAORL7MFE3MVD4RL5","target":"record","payload":{"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"},"canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","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"},"source_kind":"arxiv","source_id":"2411.17322","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sexxKwuRMVj+FstiC8zFVaIXrQWP4lGZCSesuEhAEggDtJfx1D5wSbLU7DqmdP5uaDTiZKjYdCj3o+6l6YDYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:25:36.864721Z"},"content_sha256":"301993225d9e313b18e4cbea87cd85910e1d70ed169f7c6c104c03c4eb437645","schema_version":"1.0","event_id":"sha256:301993225d9e313b18e4cbea87cd85910e1d70ed169f7c6c104c03c4eb437645"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZANDASPW3SAORL7MFE3MVD4RL5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VGqFCmLdgcaij7TMdJTl3fysG5gxh30nzFQ5PYrGZ73f482avqJh14VC53RGmEz2RCxXmUWWWzCGD3ffT5bOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:25:36.865634Z"},"content_sha256":"2817226371bed49f2aff2558d03a26f1697aac1bf98193b73c98e6375fb0fbf7","schema_version":"1.0","event_id":"sha256:2817226371bed49f2aff2558d03a26f1697aac1bf98193b73c98e6375fb0fbf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/bundle.json","state_url":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZANDASPW3SAORL7MFE3MVD4RL5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T23:25:36Z","links":{"resolver":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5","bundle":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/bundle.json","state":"https://pith.science/pith/ZANDASPW3SAORL7MFE3MVD4RL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZANDASPW3SAORL7MFE3MVD4RL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZANDASPW3SAORL7MFE3MVD4RL5","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":"0fa7cc5726d59068953faddebfede227caf49e74ad5305e6293ad5882329403c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:10:27Z","title_canon_sha256":"cc26a8744fad5f4fe6f0056289ade350ff805e6fb74f5d07bdc4d92df9055406"},"schema_version":"1.0","source":{"id":"2411.17322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17322","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17322v2","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17322","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZANDASPW3SAO","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"ZANDASPW3SAORL7M","created_at":"2026-07-05T09:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"ZANDASPW","created_at":"2026-07-05T09:47:57Z"}],"graph_snapshots":[{"event_id":"sha256:2817226371bed49f2aff2558d03a26f1697aac1bf98193b73c98e6375fb0fbf7","target":"graph","created_at":"2026-07-05T09:47:57Z","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/2411.17322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chunyang Dou, Fu-Tao Hu, Xing Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:10:27Z","title":"Tur\\'an numbers of cycles plus a general graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17322","kind":"arxiv","version":2},"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:301993225d9e313b18e4cbea87cd85910e1d70ed169f7c6c104c03c4eb437645","target":"record","created_at":"2026-07-05T09:47:57Z","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":"0fa7cc5726d59068953faddebfede227caf49e74ad5305e6293ad5882329403c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:10:27Z","title_canon_sha256":"cc26a8744fad5f4fe6f0056289ade350ff805e6fb74f5d07bdc4d92df9055406"},"schema_version":"1.0","source":{"id":"2411.17322","kind":"arxiv","version":2}},"canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c81a3049f6dc80e8afec2936ca8f915f68deebabc1ee93f8ac6d00976051a080","first_computed_at":"2026-07-05T09:47:57.707284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:57.707284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i1d/F82LZm0/0iiylluGMxKzbw4wh4CMEmNU3ErMT5CDvqkvpVa84edqSb87Kndk73VIe19LsaGKROMKrZZHCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:57.707767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:301993225d9e313b18e4cbea87cd85910e1d70ed169f7c6c104c03c4eb437645","sha256:2817226371bed49f2aff2558d03a26f1697aac1bf98193b73c98e6375fb0fbf7"],"state_sha256":"849ba60ad8f165737b3976920e486c577e90ae570c18605cda60811eec4c1c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFrRPTrF/gEhP6Z32aX90iP0lRm9GX6WN9P5dwMBzRb3JjhQp+K3YKv5AAGz0oYzvQ8drJz41rxiyPIb8Y/NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:25:36.871772Z","bundle_sha256":"98154beb951bb6781b8d2f9dced89a137160a5adc76f56b5fe8b73fc7a06fbcd"}}