{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IBPUUBCSOSOA4D2LVDBDAXQXXG","short_pith_number":"pith:IBPUUBCS","canonical_record":{"source":{"id":"2509.03851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T03:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"6384af3dc53503d7ff4ecb0efaddf336d8a9dbeab2161a0cfd6a13ba21623ecf","abstract_canon_sha256":"c66af8bc9a45bf0d28c61d26ca04846677de429fcef892f7f296ad9007084c3d"},"schema_version":"1.0"},"canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","source":{"kind":"arxiv","id":"2509.03851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03851","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03851v1","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03851","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"IBPUUBCSOSOA","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"IBPUUBCSOSOA4D2L","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"IBPUUBCS","created_at":"2026-07-05T12:04:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IBPUUBCSOSOA4D2LVDBDAXQXXG","target":"record","payload":{"canonical_record":{"source":{"id":"2509.03851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T03:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"6384af3dc53503d7ff4ecb0efaddf336d8a9dbeab2161a0cfd6a13ba21623ecf","abstract_canon_sha256":"c66af8bc9a45bf0d28c61d26ca04846677de429fcef892f7f296ad9007084c3d"},"schema_version":"1.0"},"canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:47.918113Z","signature_b64":"/gaStn/yGXVCZq3Vemh/x5VvJrRm+go9cL9UsDkPUGC3BqQlDeqiZmq2QQP8ZPKuKaRvK8pLOS3ucdC6UyzfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","last_reissued_at":"2026-07-05T12:04:47.917579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:47.917579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.03851","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-05T12:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmER8eIZa7/H/ho0ZivUIMB1IpXoYShF9F220DJ/qnut8QM28+IHPcH8R9puqWHxLcVebadXadTqY1vByKRlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:08:13.837598Z"},"content_sha256":"296f2e4ca339bdbff5a941fed5c3d08f68d2c918e27d892240b60cb6e016f274","schema_version":"1.0","event_id":"sha256:296f2e4ca339bdbff5a941fed5c3d08f68d2c918e27d892240b60cb6e016f274"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IBPUUBCSOSOA4D2LVDBDAXQXXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized Tur\\'an number for K_3 in graphs without suspensions of a path on five vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doudou Hei, Xinmin Hou, Yue Ma","submitted_at":"2025-09-04T03:26:40Z","abstract_excerpt":"Given graphs $H$ and $F$, the generalized Tur\\'an number $\\ex(n, H, F)$ is defined as\n  the maximum number of copies of $H$ in an $n$-vertex graph that contains no copy of $F$.\n  The suspension $\\widehat{F}$ of a graph $F$ is\n  obtained by adding a new vertex that is adjacent to every vertex of $F$.\n  Mubayi and Mukherjee (2023, DM) conjectured that $\\ex(n, K_3, \\widehat{P_k})=\\left\\lfloor \\frac{k-2}{2}\\right\\rfloor \\cdot \\frac{n^2}{8}+o(n^2)$, where $P_k$ is a\n  path on $k\\ge 4$ vertices. Using the triangle removal\n  lemma, they verified this conjecture for $k=4,5,6$.\n  Later, Mukherjee (2024"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03851","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/2509.03851/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-05T12:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50cSctDwbPIIPB5pA+JXqmNKLUmJB12rDY3YvuG00brxqHJFMif/9sN04zZXDKT5JunifIuLVQwC9y7fF57YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:08:13.838093Z"},"content_sha256":"945ce2ad59fc9f8576e6c0a6c8720b9f8e293c7fdbc2bcc6cc3789e789a3441c","schema_version":"1.0","event_id":"sha256:945ce2ad59fc9f8576e6c0a6c8720b9f8e293c7fdbc2bcc6cc3789e789a3441c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/bundle.json","state_url":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/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-08T11:08:13Z","links":{"resolver":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG","bundle":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/bundle.json","state":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IBPUUBCSOSOA4D2LVDBDAXQXXG","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":"c66af8bc9a45bf0d28c61d26ca04846677de429fcef892f7f296ad9007084c3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T03:26:40Z","title_canon_sha256":"6384af3dc53503d7ff4ecb0efaddf336d8a9dbeab2161a0cfd6a13ba21623ecf"},"schema_version":"1.0","source":{"id":"2509.03851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03851","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03851v1","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03851","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"IBPUUBCSOSOA","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"IBPUUBCSOSOA4D2L","created_at":"2026-07-05T12:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"IBPUUBCS","created_at":"2026-07-05T12:04:47Z"}],"graph_snapshots":[{"event_id":"sha256:945ce2ad59fc9f8576e6c0a6c8720b9f8e293c7fdbc2bcc6cc3789e789a3441c","target":"graph","created_at":"2026-07-05T12:04:47Z","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/2509.03851/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given graphs $H$ and $F$, the generalized Tur\\'an number $\\ex(n, H, F)$ is defined as\n  the maximum number of copies of $H$ in an $n$-vertex graph that contains no copy of $F$.\n  The suspension $\\widehat{F}$ of a graph $F$ is\n  obtained by adding a new vertex that is adjacent to every vertex of $F$.\n  Mubayi and Mukherjee (2023, DM) conjectured that $\\ex(n, K_3, \\widehat{P_k})=\\left\\lfloor \\frac{k-2}{2}\\right\\rfloor \\cdot \\frac{n^2}{8}+o(n^2)$, where $P_k$ is a\n  path on $k\\ge 4$ vertices. Using the triangle removal\n  lemma, they verified this conjecture for $k=4,5,6$.\n  Later, Mukherjee (2024","authors_text":"Doudou Hei, Xinmin Hou, Yue Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T03:26:40Z","title":"The generalized Tur\\'an number for K_3 in graphs without suspensions of a path on five vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03851","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:296f2e4ca339bdbff5a941fed5c3d08f68d2c918e27d892240b60cb6e016f274","target":"record","created_at":"2026-07-05T12:04:47Z","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":"c66af8bc9a45bf0d28c61d26ca04846677de429fcef892f7f296ad9007084c3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T03:26:40Z","title_canon_sha256":"6384af3dc53503d7ff4ecb0efaddf336d8a9dbeab2161a0cfd6a13ba21623ecf"},"schema_version":"1.0","source":{"id":"2509.03851","kind":"arxiv","version":1}},"canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","first_computed_at":"2026-07-05T12:04:47.917579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:47.917579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gaStn/yGXVCZq3Vemh/x5VvJrRm+go9cL9UsDkPUGC3BqQlDeqiZmq2QQP8ZPKuKaRvK8pLOS3ucdC6UyzfDg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:47.918113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.03851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:296f2e4ca339bdbff5a941fed5c3d08f68d2c918e27d892240b60cb6e016f274","sha256:945ce2ad59fc9f8576e6c0a6c8720b9f8e293c7fdbc2bcc6cc3789e789a3441c"],"state_sha256":"978b9f2862875d6d0ded1208a5c6745bbf5b7aeec7882c555b0bc313ac7156bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqP//AAXc50OH6m53SPiVXDjVShVRinjstZZ/wj69KXHVaq6d5FzGWfGVLVlraHSQrC7QV5+afqhmdyU9Ca3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:08:13.842769Z","bundle_sha256":"8237ab68f860cd1e512fdf4347d561fe43c21cabe0153cd0fd7fda05d9825765"}}