{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RWID3MGZH3SBNHTORZF2QLP4DD","short_pith_number":"pith:RWID3MGZ","canonical_record":{"source":{"id":"2301.05625","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-13T15:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"26efbd6d9c5bd18c6cee6d48b23867d80de44a0c4a6ee96784ac0cc055cfd295","abstract_canon_sha256":"20038c12e8ffab11d50a072d2931e10923825a1b7906180677455eb12758a764"},"schema_version":"1.0"},"canonical_sha256":"8d903db0d93ee4169e6e8e4ba82dfc18d3a572245c8a5dbaa1e87da9c5646ef4","source":{"kind":"arxiv","id":"2301.05625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05625","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05625v2","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05625","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWID3MGZH3SB","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"RWID3MGZH3SBNHTO","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"RWID3MGZ","created_at":"2026-07-05T11:06:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RWID3MGZH3SBNHTORZF2QLP4DD","target":"record","payload":{"canonical_record":{"source":{"id":"2301.05625","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-13T15:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"26efbd6d9c5bd18c6cee6d48b23867d80de44a0c4a6ee96784ac0cc055cfd295","abstract_canon_sha256":"20038c12e8ffab11d50a072d2931e10923825a1b7906180677455eb12758a764"},"schema_version":"1.0"},"canonical_sha256":"8d903db0d93ee4169e6e8e4ba82dfc18d3a572245c8a5dbaa1e87da9c5646ef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:18.592098Z","signature_b64":"Bg0jzgxtAzTryPJi70nxSRKZOUtcQtwbBiFSmgRZtQVSRJDVXfCfsbLhdXRkTRo13JdxTZGUSszuz/N1kBOXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d903db0d93ee4169e6e8e4ba82dfc18d3a572245c8a5dbaa1e87da9c5646ef4","last_reissued_at":"2026-07-05T11:06:18.591559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:18.591559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.05625","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-05T11:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iivVy5TUFJLfIcLOV8NsxgN76aDMn6lXgRyc1hiB7HzMNMgJLsBdn/JHZIM1HDJ+dYjC1wuNP2PQLaKih85sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:50:57.100152Z"},"content_sha256":"b6a469661f0b8d733f9cbe1b6ae793fa117d28f022cfcbe83b80f8c9eeaf0661","schema_version":"1.0","event_id":"sha256:b6a469661f0b8d733f9cbe1b6ae793fa117d28f022cfcbe83b80f8c9eeaf0661"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RWID3MGZH3SBNHTORZF2QLP4DD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problem with bounded matching number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinmin Hou, Yue Ma","submitted_at":"2023-01-13T15:51:24Z","abstract_excerpt":"For a graph $T$ and a set of graphs $\\mathcal{H}$, let $\\mbox{ex}(n,T,\\mathcal{H})$ denote the maximum number of copies of $T$ in an $n$-vertex $\\mathcal{H}$-free graph. Recently, Alon and Frankl~(arXiv2210.15076) determined the exact value of $\\mbox{ex}(n,K_2,\\{K_{k+1},M_{s+1}\\})$, where $K_{k+1}$ and $M_{s+1}$ are complete graph on $k+1$ vertices and matching of size $s+1$, respectively. Soon after, Gerbner~(arXiv2211.03272) continued the study by extending $K_{k+1}$ to general fixed graph $H$. In this paper, we continue the study of the function $\\mbox{ex}(n, T,\\{H,M_{s+1}\\})$ when $T=K_r$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05625","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/2301.05625/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-05T11:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bFqk2nb/PIIz5fDDrXDKRBvJ2whleYcdDBJV9/CwBLDehGOPD4Rxn2r2ifDVUKhMLat+J51arD18HzVZ/72DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:50:57.100679Z"},"content_sha256":"6b3c4f63110082ffbbbbf2d218975f4176adb0cae71266e71871075bbe2132d9","schema_version":"1.0","event_id":"sha256:6b3c4f63110082ffbbbbf2d218975f4176adb0cae71266e71871075bbe2132d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWID3MGZH3SBNHTORZF2QLP4DD/bundle.json","state_url":"https://pith.science/pith/RWID3MGZH3SBNHTORZF2QLP4DD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWID3MGZH3SBNHTORZF2QLP4DD/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-13T08:50:57Z","links":{"resolver":"https://pith.science/pith/RWID3MGZH3SBNHTORZF2QLP4DD","bundle":"https://pith.science/pith/RWID3MGZH3SBNHTORZF2QLP4DD/bundle.json","state":"https://pith.science/pith/RWID3MGZH3SBNHTORZF2QLP4DD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWID3MGZH3SBNHTORZF2QLP4DD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RWID3MGZH3SBNHTORZF2QLP4DD","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":"20038c12e8ffab11d50a072d2931e10923825a1b7906180677455eb12758a764","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-13T15:51:24Z","title_canon_sha256":"26efbd6d9c5bd18c6cee6d48b23867d80de44a0c4a6ee96784ac0cc055cfd295"},"schema_version":"1.0","source":{"id":"2301.05625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05625","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05625v2","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05625","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWID3MGZH3SB","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"RWID3MGZH3SBNHTO","created_at":"2026-07-05T11:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"RWID3MGZ","created_at":"2026-07-05T11:06:18Z"}],"graph_snapshots":[{"event_id":"sha256:6b3c4f63110082ffbbbbf2d218975f4176adb0cae71266e71871075bbe2132d9","target":"graph","created_at":"2026-07-05T11:06:18Z","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/2301.05625/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $T$ and a set of graphs $\\mathcal{H}$, let $\\mbox{ex}(n,T,\\mathcal{H})$ denote the maximum number of copies of $T$ in an $n$-vertex $\\mathcal{H}$-free graph. Recently, Alon and Frankl~(arXiv2210.15076) determined the exact value of $\\mbox{ex}(n,K_2,\\{K_{k+1},M_{s+1}\\})$, where $K_{k+1}$ and $M_{s+1}$ are complete graph on $k+1$ vertices and matching of size $s+1$, respectively. Soon after, Gerbner~(arXiv2211.03272) continued the study by extending $K_{k+1}$ to general fixed graph $H$. In this paper, we continue the study of the function $\\mbox{ex}(n, T,\\{H,M_{s+1}\\})$ when $T=K_r$ ","authors_text":"Xinmin Hou, Yue Ma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-13T15:51:24Z","title":"Generalized Tur\\'an problem with bounded matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05625","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:b6a469661f0b8d733f9cbe1b6ae793fa117d28f022cfcbe83b80f8c9eeaf0661","target":"record","created_at":"2026-07-05T11:06:18Z","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":"20038c12e8ffab11d50a072d2931e10923825a1b7906180677455eb12758a764","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-13T15:51:24Z","title_canon_sha256":"26efbd6d9c5bd18c6cee6d48b23867d80de44a0c4a6ee96784ac0cc055cfd295"},"schema_version":"1.0","source":{"id":"2301.05625","kind":"arxiv","version":2}},"canonical_sha256":"8d903db0d93ee4169e6e8e4ba82dfc18d3a572245c8a5dbaa1e87da9c5646ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d903db0d93ee4169e6e8e4ba82dfc18d3a572245c8a5dbaa1e87da9c5646ef4","first_computed_at":"2026-07-05T11:06:18.591559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:18.591559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bg0jzgxtAzTryPJi70nxSRKZOUtcQtwbBiFSmgRZtQVSRJDVXfCfsbLhdXRkTRo13JdxTZGUSszuz/N1kBOXBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:18.592098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.05625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6a469661f0b8d733f9cbe1b6ae793fa117d28f022cfcbe83b80f8c9eeaf0661","sha256:6b3c4f63110082ffbbbbf2d218975f4176adb0cae71266e71871075bbe2132d9"],"state_sha256":"21704f65dc4dac1ea2ea53a383484b15a7dbc66bcbffa3bc59957bf752caaf58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrEoPFD7woZp4Csl4Pd2EDNXx3vbLllkSZBTX5C/FtI2oRU8acTbNH7/7Poe1uY8ocfhCut1iMealdj5adVACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:50:57.106041Z","bundle_sha256":"d6343d7fc6769238214d781a75bc1b9e3ca0ac432458b31e891ba5791f96b7a1"}}