{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A4YNCYAR3NUN5K2AUJFYHKHUMZ","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":"a23dffdf7b311f5aa1a436add8521bf559c7e18853d011d4a759fc268ee78adb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T02:33:02Z","title_canon_sha256":"4d9b009b6490eb9bd187ee0f812094871ea046a41cec787651c9d027685856a9"},"schema_version":"1.0","source":{"id":"2606.19717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19717","created_at":"2026-06-19T16:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19717v1","created_at":"2026-06-19T16:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19717","created_at":"2026-06-19T16:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"A4YNCYAR3NUN","created_at":"2026-06-19T16:12:33Z"},{"alias_kind":"pith_short_16","alias_value":"A4YNCYAR3NUN5K2A","created_at":"2026-06-19T16:12:33Z"},{"alias_kind":"pith_short_8","alias_value":"A4YNCYAR","created_at":"2026-06-19T16:12:33Z"}],"graph_snapshots":[{"event_id":"sha256:4387bb983961420a2d355022c04e36b2bce0007a4badaa4d5b438b5420a48809","target":"graph","created_at":"2026-06-19T16:12:33Z","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/2606.19717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bo Ning, Chunyang Dou, Xing Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T02:33:02Z","title":"Counting triangles in graphs with no wheels of order at least five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19717","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:f43f557b30c965258c23e03411a392198960621b8e147cf5c57de3b9ed3dc5c0","target":"record","created_at":"2026-06-19T16:12:33Z","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":"a23dffdf7b311f5aa1a436add8521bf559c7e18853d011d4a759fc268ee78adb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T02:33:02Z","title_canon_sha256":"4d9b009b6490eb9bd187ee0f812094871ea046a41cec787651c9d027685856a9"},"schema_version":"1.0","source":{"id":"2606.19717","kind":"arxiv","version":1}},"canonical_sha256":"0730d16011db68deab40a24b83a8f46648cd5d591c6c6f0775cd1f57687c5765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0730d16011db68deab40a24b83a8f46648cd5d591c6c6f0775cd1f57687c5765","first_computed_at":"2026-06-19T16:12:33.170423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:33.170423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OItZ9j1FWvkkbID811zZCr3oSeG6xf/hB4vHMbJg9RJH1Csjcm+qcannGX+VoZRTF9ZsRgRTmBP6KO+goFMSBQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:33.170857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f43f557b30c965258c23e03411a392198960621b8e147cf5c57de3b9ed3dc5c0","sha256:4387bb983961420a2d355022c04e36b2bce0007a4badaa4d5b438b5420a48809"],"state_sha256":"3880b1fbf21a044e3eed885164370b0c9af8bc9ac88c485d0a777a7cb196b1e8"}