{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IBPUUBCSOSOA4D2LVDBDAXQXXG","short_pith_number":"pith:IBPUUBCS","schema_version":"1.0","canonical_sha256":"405f4a0452749c0e0f4ba8c2305e17b990b601b152889451bf9b7e820dee65cd","source":{"kind":"arxiv","id":"2509.03851","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.03851","created_at":"2026-07-05T12:04:47.917641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.03851v1","created_at":"2026-07-05T12:04:47.917641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03851","created_at":"2026-07-05T12:04:47.917641+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBPUUBCSOSOA","created_at":"2026-07-05T12:04:47.917641+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBPUUBCSOSOA4D2L","created_at":"2026-07-05T12:04:47.917641+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBPUUBCS","created_at":"2026-07-05T12:04:47.917641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG","json":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG.json","graph_json":"https://pith.science/api/pith-number/IBPUUBCSOSOA4D2LVDBDAXQXXG/graph.json","events_json":"https://pith.science/api/pith-number/IBPUUBCSOSOA4D2LVDBDAXQXXG/events.json","paper":"https://pith.science/paper/IBPUUBCS"},"agent_actions":{"view_html":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG","download_json":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG.json","view_paper":"https://pith.science/paper/IBPUUBCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.03851&json=true","fetch_graph":"https://pith.science/api/pith-number/IBPUUBCSOSOA4D2LVDBDAXQXXG/graph.json","fetch_events":"https://pith.science/api/pith-number/IBPUUBCSOSOA4D2LVDBDAXQXXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/action/storage_attestation","attest_author":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/action/author_attestation","sign_citation":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/action/citation_signature","submit_replication":"https://pith.science/pith/IBPUUBCSOSOA4D2LVDBDAXQXXG/action/replication_record"}},"created_at":"2026-07-05T12:04:47.917641+00:00","updated_at":"2026-07-05T12:04:47.917641+00:00"}