{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QASDNPGQKUKU2345PFRPIU423H","short_pith_number":"pith:QASDNPGQ","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"},"canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","source":{"kind":"arxiv","id":"2410.12338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12338","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12338v1","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12338","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"QASDNPGQKUKU","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"QASDNPGQKUKU2345","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"QASDNPGQ","created_at":"2026-07-05T09:21:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QASDNPGQKUKU2345PFRPIU423H","target":"record","payload":{"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"},"canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","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"},"source_kind":"arxiv","source_id":"2410.12338","source_version":1,"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:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQbuPQIMfvdwQs7HFoLZP98cpRcOffPU3gD/6i1W4cTl7R07/Lz65dwfE73OLOmA/FlMIPsRSTm3eDzxPa7VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:20:34.358793Z"},"content_sha256":"f29a01a52648cf12dafc411c6f8f3e5f14deb6446c19509a107f4fe5ab3603d7","schema_version":"1.0","event_id":"sha256:f29a01a52648cf12dafc411c6f8f3e5f14deb6446c19509a107f4fe5ab3603d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QASDNPGQKUKU2345PFRPIU423H","target":"graph","payload":{"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"},"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:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0EIlaBTKORhg4xuZbSYf+GWcc/+Nc1cZSnrssVdcjNvz7KQWM+MJbIOpaZzHBXbTJ68qq1i1EZhOwkdzf/KBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:20:34.359361Z"},"content_sha256":"314bce81f2ca0c01e3e134fe125d99b9038e066f55884fc059d3ef97c6f1bf5b","schema_version":"1.0","event_id":"sha256:314bce81f2ca0c01e3e134fe125d99b9038e066f55884fc059d3ef97c6f1bf5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/bundle.json","state_url":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QASDNPGQKUKU2345PFRPIU423H/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-13T05:20:34Z","links":{"resolver":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H","bundle":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/bundle.json","state":"https://pith.science/pith/QASDNPGQKUKU2345PFRPIU423H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QASDNPGQKUKU2345PFRPIU423H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QASDNPGQKUKU2345PFRPIU423H","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":"cf2ccfbfaf4b8c51b9747a999270f0f598e0f5495c71c5396bc9db4bb41490d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T07:59:10Z","title_canon_sha256":"4dc823a0ea60a138949fee81e1c74b404fc619b770ab599f687e54a8d1659b17"},"schema_version":"1.0","source":{"id":"2410.12338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12338","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12338v1","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12338","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"QASDNPGQKUKU","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"QASDNPGQKUKU2345","created_at":"2026-07-05T09:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"QASDNPGQ","created_at":"2026-07-05T09:21:17Z"}],"graph_snapshots":[{"event_id":"sha256:314bce81f2ca0c01e3e134fe125d99b9038e066f55884fc059d3ef97c6f1bf5b","target":"graph","created_at":"2026-07-05T09:21:17Z","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/2410.12338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Liying Kang, Yisai Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T07:59:10Z","title":"On generalized Tur\\'an problems with bounded matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12338","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:f29a01a52648cf12dafc411c6f8f3e5f14deb6446c19509a107f4fe5ab3603d7","target":"record","created_at":"2026-07-05T09:21:17Z","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":"cf2ccfbfaf4b8c51b9747a999270f0f598e0f5495c71c5396bc9db4bb41490d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-16T07:59:10Z","title_canon_sha256":"4dc823a0ea60a138949fee81e1c74b404fc619b770ab599f687e54a8d1659b17"},"schema_version":"1.0","source":{"id":"2410.12338","kind":"arxiv","version":1}},"canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"802436bcd055154d6f9d7962f4539ad9f050bd9028fd13431413ae48137b1a51","first_computed_at":"2026-07-05T09:21:17.694886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:17.694886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gSpP9JbgtfkPAgeHW1sUOjpDyxt8BR8hPEoVSJga8n5QQL2/Uckszovlr31aXYKEjKZCqN4ZeZ5qbRRCmrKODQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:17.695309Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.12338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29a01a52648cf12dafc411c6f8f3e5f14deb6446c19509a107f4fe5ab3603d7","sha256:314bce81f2ca0c01e3e134fe125d99b9038e066f55884fc059d3ef97c6f1bf5b"],"state_sha256":"10cf18c3dc5c06d3273ae77c93d5169db5c28ba8cbc3c62c74fb79a5c1ec901f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6CF1gMXb5b01qfCHaOQuUwj+eZgPtL5od/5ZjmCigeJHPyUGn6wPHyv+4CoPw9L8DoQtZQdu36Vyg0L+fT8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:20:34.365625Z","bundle_sha256":"65b78dcf6414c8d2d459a16709c54c26563eb36c21424b363d5ce9d80b7445e4"}}