{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:33NANWECSTGUGLHNJR5EODSIW3","short_pith_number":"pith:33NANWEC","schema_version":"1.0","canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","source":{"kind":"arxiv","id":"2507.00812","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'{a}n density of tight cycles minus one edge in the $\\ell_2$-norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou, Jinghua Deng, Levente Bodn\\'ar, Xizhi Liu","submitted_at":"2025-07-01T14:43:42Z","abstract_excerpt":"The $3$-uniform tight $\\ell$-cycle minus one edge $C_{\\ell}^{3-}$ is the $3$-graph on $\\ell$ vertices consisting of $\\ell-1$ consecutive triples in the cyclic order. We show that for every integer $\\ell \\ge 5$ satisfying $\\ell\\not\\equiv 0\\pmod3$, every $C_{\\ell}^{3-}$-free $3$-graph whose $\\ell_2$-norm, that is, the sum of codegree squares, is close to the maximum must be structurally close to the iterative blowup of a single triple. This confirms a conjecture of Balogh--Clemen--Lidick\\'{y}~[Surveys in combinatorics 2022, 21-63] in a stronger form."},"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":"2507.00812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-01T14:43:42Z","cross_cats_sorted":[],"title_canon_sha256":"01036a148ccdb52b8506485df62a0e91c1b8420841ee479e244764dacf77d86a","abstract_canon_sha256":"abdf57c73803130916f48877bf91635c44c22ebe86facb7851f59de988ed124a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:14.882585Z","signature_b64":"NVTjn9os02rVX+MrrfYf7IDhIczx2yaVO2CkNOyNJvbwVByUj6OhMBbmgqIaX7MCrTN6a791a3Psg3ENt3DPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","last_reissued_at":"2026-07-05T11:30:14.882165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:14.882165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'{a}n density of tight cycles minus one edge in the $\\ell_2$-norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou, Jinghua Deng, Levente Bodn\\'ar, Xizhi Liu","submitted_at":"2025-07-01T14:43:42Z","abstract_excerpt":"The $3$-uniform tight $\\ell$-cycle minus one edge $C_{\\ell}^{3-}$ is the $3$-graph on $\\ell$ vertices consisting of $\\ell-1$ consecutive triples in the cyclic order. We show that for every integer $\\ell \\ge 5$ satisfying $\\ell\\not\\equiv 0\\pmod3$, every $C_{\\ell}^{3-}$-free $3$-graph whose $\\ell_2$-norm, that is, the sum of codegree squares, is close to the maximum must be structurally close to the iterative blowup of a single triple. This confirms a conjecture of Balogh--Clemen--Lidick\\'{y}~[Surveys in combinatorics 2022, 21-63] in a stronger form."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00812","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/2507.00812/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":"2507.00812","created_at":"2026-07-05T11:30:14.882226+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00812v1","created_at":"2026-07-05T11:30:14.882226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00812","created_at":"2026-07-05T11:30:14.882226+00:00"},{"alias_kind":"pith_short_12","alias_value":"33NANWECSTGU","created_at":"2026-07-05T11:30:14.882226+00:00"},{"alias_kind":"pith_short_16","alias_value":"33NANWECSTGUGLHN","created_at":"2026-07-05T11:30:14.882226+00:00"},{"alias_kind":"pith_short_8","alias_value":"33NANWEC","created_at":"2026-07-05T11:30:14.882226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02110","citing_title":"On cliques in hypergraphs under bounded $(j,p)$-norm","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11049","citing_title":"A note on the $t$-partite link problem of F\\\"uredi","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3","json":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3.json","graph_json":"https://pith.science/api/pith-number/33NANWECSTGUGLHNJR5EODSIW3/graph.json","events_json":"https://pith.science/api/pith-number/33NANWECSTGUGLHNJR5EODSIW3/events.json","paper":"https://pith.science/paper/33NANWEC"},"agent_actions":{"view_html":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3","download_json":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3.json","view_paper":"https://pith.science/paper/33NANWEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00812&json=true","fetch_graph":"https://pith.science/api/pith-number/33NANWECSTGUGLHNJR5EODSIW3/graph.json","fetch_events":"https://pith.science/api/pith-number/33NANWECSTGUGLHNJR5EODSIW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/action/storage_attestation","attest_author":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/action/author_attestation","sign_citation":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/action/citation_signature","submit_replication":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/action/replication_record"}},"created_at":"2026-07-05T11:30:14.882226+00:00","updated_at":"2026-07-05T11:30:14.882226+00:00"}