{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SMM6QKTUIQ2ZIIK4R6MMAFN6OE","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":"22b284b2f18e84f37e6f65e99031915c31200aee5d1d251bc9e9409f01658586","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-25T09:51:54Z","title_canon_sha256":"867574f8b3eda2512fb216411f5f7cf5dc5c6f41d2e968a8ee50d5f5f1b670db"},"schema_version":"1.0","source":{"id":"2412.18853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18853","created_at":"2026-07-05T09:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18853v1","created_at":"2026-07-05T09:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18853","created_at":"2026-07-05T09:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"SMM6QKTUIQ2Z","created_at":"2026-07-05T09:54:11Z"},{"alias_kind":"pith_short_16","alias_value":"SMM6QKTUIQ2ZIIK4","created_at":"2026-07-05T09:54:11Z"},{"alias_kind":"pith_short_8","alias_value":"SMM6QKTU","created_at":"2026-07-05T09:54:11Z"}],"graph_snapshots":[{"event_id":"sha256:9b000c965e1248c20f043d85828f6ff7c1c60a839f484356f16554052bc9986c","target":"graph","created_at":"2026-07-05T09:54:11Z","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/2412.18853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Mei Lu, Xiamiao Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-25T09:51:54Z","title":"Generalized Tur\\'an problems for a matching and long cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18853","kind":"arxiv","version":1},"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:7bfc40c9bc066fc82d708b5491ba11fe3d88a6a7cead679cfe7d97bd0e22b94e","target":"record","created_at":"2026-07-05T09:54:11Z","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":"22b284b2f18e84f37e6f65e99031915c31200aee5d1d251bc9e9409f01658586","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-25T09:51:54Z","title_canon_sha256":"867574f8b3eda2512fb216411f5f7cf5dc5c6f41d2e968a8ee50d5f5f1b670db"},"schema_version":"1.0","source":{"id":"2412.18853","kind":"arxiv","version":1}},"canonical_sha256":"9319e82a74443594215c8f98c015be7138a9dd952530da8c5868138059ecc2e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9319e82a74443594215c8f98c015be7138a9dd952530da8c5868138059ecc2e4","first_computed_at":"2026-07-05T09:54:11.932323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:11.932323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXNvf2t8bP8rySGupkuwF05hhiNVAKl7RBwN9TlCuDIUDF75ynCHfR+xyblhODdjkWCJ4OHjXbdjUsEEIg5CCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:11.932778Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.18853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bfc40c9bc066fc82d708b5491ba11fe3d88a6a7cead679cfe7d97bd0e22b94e","sha256:9b000c965e1248c20f043d85828f6ff7c1c60a839f484356f16554052bc9986c"],"state_sha256":"964f022be394b2c4413daa24bb9431c53fc692f4e78096aff9119219aa075a14"}