{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:A4YNCYAR3NUN5K2AUJFYHKHUMZ","short_pith_number":"pith:A4YNCYAR","schema_version":"1.0","canonical_sha256":"0730d16011db68deab40a24b83a8f46648cd5d591c6c6f0775cd1f57687c5765","source":{"kind":"arxiv","id":"2606.19717","version":1},"attestation_state":"computed","paper":{"title":"Counting triangles in graphs with no wheels of order at least five","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Chunyang Dou, Xing Peng","submitted_at":"2026-06-18T02:33:02Z","abstract_excerpt":"For a family of graphs $\\mathcal F$, a graph $G$ is said to be $\\mathcal F$-free if it contains no member of $\\mathcal F$ as a subgraph. A wheel graph $W_k$ is a graph on $k+1$ vertices formed by joining a new vertex to all vertices of a $k$-cycle. Given an integer $k\\ge 3$, we consider the problem of determining the maximum number of triangles in a $W_{\\geq k}$-free graph, where $W_{\\geq k}=\\{W_\\ell: \\ell \\geq k\\}$. The case $k=3$ was raised by Gallai, who proposed a conjecture for this case (see Erd\\H{o}s [5]. Gallai's conjecture was disproved by Zhou [17] and independently by F\\\"uredi, Goem"},"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":"2606.19717","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T02:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"4d9b009b6490eb9bd187ee0f812094871ea046a41cec787651c9d027685856a9","abstract_canon_sha256":"a23dffdf7b311f5aa1a436add8521bf559c7e18853d011d4a759fc268ee78adb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:33.170857Z","signature_b64":"OItZ9j1FWvkkbID811zZCr3oSeG6xf/hB4vHMbJg9RJH1Csjcm+qcannGX+VoZRTF9ZsRgRTmBP6KO+goFMSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0730d16011db68deab40a24b83a8f46648cd5d591c6c6f0775cd1f57687c5765","last_reissued_at":"2026-06-19T16:12:33.170423Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:33.170423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting triangles in graphs with no wheels of order at least five","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Chunyang Dou, Xing Peng","submitted_at":"2026-06-18T02:33:02Z","abstract_excerpt":"For a family of graphs $\\mathcal F$, a graph $G$ is said to be $\\mathcal F$-free if it contains no member of $\\mathcal F$ as a subgraph. A wheel graph $W_k$ is a graph on $k+1$ vertices formed by joining a new vertex to all vertices of a $k$-cycle. Given an integer $k\\ge 3$, we consider the problem of determining the maximum number of triangles in a $W_{\\geq k}$-free graph, where $W_{\\geq k}=\\{W_\\ell: \\ell \\geq k\\}$. The case $k=3$ was raised by Gallai, who proposed a conjecture for this case (see Erd\\H{o}s [5]. Gallai's conjecture was disproved by Zhou [17] and independently by F\\\"uredi, Goem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19717","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/2606.19717/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":"2606.19717","created_at":"2026-06-19T16:12:33.170483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19717v1","created_at":"2026-06-19T16:12:33.170483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19717","created_at":"2026-06-19T16:12:33.170483+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4YNCYAR3NUN","created_at":"2026-06-19T16:12:33.170483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4YNCYAR3NUN5K2A","created_at":"2026-06-19T16:12:33.170483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4YNCYAR","created_at":"2026-06-19T16:12:33.170483+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/A4YNCYAR3NUN5K2AUJFYHKHUMZ","json":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ.json","graph_json":"https://pith.science/api/pith-number/A4YNCYAR3NUN5K2AUJFYHKHUMZ/graph.json","events_json":"https://pith.science/api/pith-number/A4YNCYAR3NUN5K2AUJFYHKHUMZ/events.json","paper":"https://pith.science/paper/A4YNCYAR"},"agent_actions":{"view_html":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ","download_json":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ.json","view_paper":"https://pith.science/paper/A4YNCYAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19717&json=true","fetch_graph":"https://pith.science/api/pith-number/A4YNCYAR3NUN5K2AUJFYHKHUMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/A4YNCYAR3NUN5K2AUJFYHKHUMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ/action/storage_attestation","attest_author":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ/action/author_attestation","sign_citation":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ/action/citation_signature","submit_replication":"https://pith.science/pith/A4YNCYAR3NUN5K2AUJFYHKHUMZ/action/replication_record"}},"created_at":"2026-06-19T16:12:33.170483+00:00","updated_at":"2026-06-19T16:12:33.170483+00:00"}