{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GDVBDKAZHS4OCKG7CMFZD5R7GU","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":"493f6513a411d96f5250d05f8130366fc4a5fd8bb8b317482462e208ae5216ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T12:50:18Z","title_canon_sha256":"f139dcffe9a75d13811f864728c0982e0aa14b1413dee550422e87f4b344a85a"},"schema_version":"1.0","source":{"id":"2605.17430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17430","created_at":"2026-05-20T00:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17430v1","created_at":"2026-05-20T00:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17430","created_at":"2026-05-20T00:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"GDVBDKAZHS4O","created_at":"2026-05-20T00:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"GDVBDKAZHS4OCKG7","created_at":"2026-05-20T00:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"GDVBDKAZ","created_at":"2026-05-20T00:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:6b2e2831312071e97cfc9c504819a2002682c1025aa09a09d875fb263d429d0b","target":"graph","created_at":"2026-05-20T00:03:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We resolve the remaining case C_4^Δ, demonstrating that this is the only counterexample to their conjecture."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The validity of the conjecture for all previously confirmed cases (P_k^Δ for k≥4 and C_k^Δ for k≥5) and the standard definition of the graph expansion F^Δ as replacing each edge by a triangle."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Resolves the remaining C_4^Δ case of the conjecture on maximum triangles in graphs without P_k^Δ or C_k^Δ for k≥4, showing it is the only counterexample."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The expansion of the 4-cycle is the only counterexample to a conjecture on the maximum number of triangles in graphs avoiding expanded paths and cycles."}],"snapshot_sha256":"1715c2182cffca5ef4217f126d4263e3df98b4e8624a3d39e84c2a51e786e3e4"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"46a4e99f4cfc5ed11fecd0d15aa3b1affd36e4f82b5cb89aff6221bb06b967ef"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:01:27.696573Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.605190Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.730763Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.678092Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17430/integrity.json","findings":[],"snapshot_sha256":"1e551f857514a8aa8741400c18ddfea8d55ab65e3b492e481c5eae2dc24c6256","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The expansion $F^{\\triangle}$ of a graph $F$ is the graph obtained from $F$ by replacing each edge with a triangle. Lv \\etal proposed a conjecture on the maximum number of triangles in a graph without $P_k^{\\triangle}$ or $C_k^{\\triangle}$ for every $k \\ge 4$. Their conjecture was confirmed in previous work for $P_k^{\\triangle}$ when $k \\ge 4$ and $C_k^{\\triangle}$ when $k \\ge 5$. In this note, we resolve the remaining case $C_4^{\\triangle}$, demonstrating that this is the only counterexample to their conjecture.","authors_text":"Jialei Song, Long-tu Yuan, Qi Wu","cross_cats":[],"headline":"The expansion of the 4-cycle is the only counterexample to a conjecture on the maximum number of triangles in graphs avoiding expanded paths and cycles.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T12:50:18Z","title":"Triangles in graphs without the expansion of $4$-cycle"},"references":{"count":11,"internal_anchors":0,"resolved_work":11,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"N. Alon and C. Shikhelman. ManyTcopies inH-free graphs.J. Combin. Theory Ser. B, 121:146–172, 2016. 2","work_id":"edf56659-8c96-4675-85b1-4979e5d89d4b","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"P. Erd˝ os. On the number of complete subgraphs contained in certain graphs.Magyar Tud. Akad. Mat. Kutat´ o Int. K¨ ozl., 7:459–464, 1962. 2","work_id":"4ea16ec3-92c4-46e5-b7a4-f4d7172a90cb","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"D. Gerbner and B. Patk´ os. Generalized Tur´ an results for intersecting cliques.Discrete Math., 347(1):113710, 2024. 2","work_id":"1e5835fe-e08e-4fdd-b7ce-8c9568472fbe","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A. Kostochka, D. Mubayi, and J. Verstra¨ ete. Tur´ an problems and shadows I: Paths and cycles.J. Combin. Theory Ser. A, 129:57–79, 2015. 2, 3","work_id":"7af2a8f8-2fa1-4df0-b802-a239ab7adcec","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A. Kostochka, D. Mubayi, and J. Verstra¨ ete. Tur´ an problems and shadows II: Trees. J. Combin. Theory Ser. B, 122:457–478, 2017. 2 8","work_id":"0a8ac9fe-9f9a-42d6-bba8-5f9b97901df0","year":2017}],"snapshot_sha256":"5f61a45918d452bf4ede5fdcbdb1cd9e2a735a53a38a4126f73448604448e3f4"},"source":{"id":"2605.17430","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:52:34.479223Z","id":"f1f8e99f-e94b-4c28-b114-d3ac71adf2db","model_set":{"reader":"grok-4.3"},"one_line_summary":"Resolves the remaining C_4^Δ case of the conjecture on maximum triangles in graphs without P_k^Δ or C_k^Δ for k≥4, showing it is the only counterexample.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The expansion of the 4-cycle is the only counterexample to a conjecture on the maximum number of triangles in graphs avoiding expanded paths and cycles.","strongest_claim":"We resolve the remaining case C_4^Δ, demonstrating that this is the only counterexample to their conjecture.","weakest_assumption":"The validity of the conjecture for all previously confirmed cases (P_k^Δ for k≥4 and C_k^Δ for k≥5) and the standard definition of the graph expansion F^Δ as replacing each edge by a triangle."}},"verdict_id":"f1f8e99f-e94b-4c28-b114-d3ac71adf2db"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:65267fcc8c0da7a0f288440a492e1adbd60796c1ce442e700d860912e61a952d","target":"record","created_at":"2026-05-20T00:03:58Z","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":"493f6513a411d96f5250d05f8130366fc4a5fd8bb8b317482462e208ae5216ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T12:50:18Z","title_canon_sha256":"f139dcffe9a75d13811f864728c0982e0aa14b1413dee550422e87f4b344a85a"},"schema_version":"1.0","source":{"id":"2605.17430","kind":"arxiv","version":1}},"canonical_sha256":"30ea11a8193cb8e128df130b91f63f35349cccbf49614a346e2e25c08c4687ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30ea11a8193cb8e128df130b91f63f35349cccbf49614a346e2e25c08c4687ee","first_computed_at":"2026-05-20T00:03:58.112200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:58.112200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzFVoaSX78ZBqK4DQOJRt3JH8qNUA779k01txO5nclHkwDCyxM7+AZPj+1QK27ilUT4NcPTzXVMFzLnOPvkjBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:58.112932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65267fcc8c0da7a0f288440a492e1adbd60796c1ce442e700d860912e61a952d","sha256:6b2e2831312071e97cfc9c504819a2002682c1025aa09a09d875fb263d429d0b"],"state_sha256":"2b3bc291f8de6e9a8fd8227ecc28f1c6dba17fb92b2bc0deedb3d284b8c9742d"}