{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:33NANWECSTGUGLHNJR5EODSIW3","short_pith_number":"pith:33NANWEC","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"},"canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","source":{"kind":"arxiv","id":"2507.00812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00812","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00812v1","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00812","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"33NANWECSTGU","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_16","alias_value":"33NANWECSTGUGLHN","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_8","alias_value":"33NANWEC","created_at":"2026-07-05T11:30:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:33NANWECSTGUGLHNJR5EODSIW3","target":"record","payload":{"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"},"canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","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"},"source_kind":"arxiv","source_id":"2507.00812","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CP0BbCKyw+NXiDiDncTCVA+cuyzV29fH2Mmb+EmoNbuVKKBBjt/hXiicSCAVY++3UyYoWmEJT/+OQIzY9CDtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:21:15.220094Z"},"content_sha256":"915473ce03b9b4b5df6049b5942568b14812166cfdc921cdd7c1d064fa80b8b2","schema_version":"1.0","event_id":"sha256:915473ce03b9b4b5df6049b5942568b14812166cfdc921cdd7c1d064fa80b8b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:33NANWECSTGUGLHNJR5EODSIW3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dz+wf0nByjUxgK95xmqoZp5bW6oxo39dFnwczbRv99QCC5Dx7S5fCzOfdilhTzcxYNR59nVkxKldX17xVXwEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:21:15.221170Z"},"content_sha256":"906f3a1094a2b026f221dd36961f247f5a02342feefd01270bb93d1188524087","schema_version":"1.0","event_id":"sha256:906f3a1094a2b026f221dd36961f247f5a02342feefd01270bb93d1188524087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/bundle.json","state_url":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33NANWECSTGUGLHNJR5EODSIW3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T19:21:15Z","links":{"resolver":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3","bundle":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/bundle.json","state":"https://pith.science/pith/33NANWECSTGUGLHNJR5EODSIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33NANWECSTGUGLHNJR5EODSIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:33NANWECSTGUGLHNJR5EODSIW3","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":"abdf57c73803130916f48877bf91635c44c22ebe86facb7851f59de988ed124a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-01T14:43:42Z","title_canon_sha256":"01036a148ccdb52b8506485df62a0e91c1b8420841ee479e244764dacf77d86a"},"schema_version":"1.0","source":{"id":"2507.00812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00812","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00812v1","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00812","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"33NANWECSTGU","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_16","alias_value":"33NANWECSTGUGLHN","created_at":"2026-07-05T11:30:14Z"},{"alias_kind":"pith_short_8","alias_value":"33NANWEC","created_at":"2026-07-05T11:30:14Z"}],"graph_snapshots":[{"event_id":"sha256:906f3a1094a2b026f221dd36961f247f5a02342feefd01270bb93d1188524087","target":"graph","created_at":"2026-07-05T11:30:14Z","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/2507.00812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Hongbin Zhao, Jianfeng Hou, Jinghua Deng, Levente Bodn\\'ar, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-01T14:43:42Z","title":"Tur\\'{a}n density of tight cycles minus one edge in the $\\ell_2$-norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00812","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:915473ce03b9b4b5df6049b5942568b14812166cfdc921cdd7c1d064fa80b8b2","target":"record","created_at":"2026-07-05T11:30:14Z","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":"abdf57c73803130916f48877bf91635c44c22ebe86facb7851f59de988ed124a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-01T14:43:42Z","title_canon_sha256":"01036a148ccdb52b8506485df62a0e91c1b8420841ee479e244764dacf77d86a"},"schema_version":"1.0","source":{"id":"2507.00812","kind":"arxiv","version":1}},"canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deda06d88294cd432ced4c7a470e48b6d15f2f3d8b8f46aa5ab7d8c93b0d3294","first_computed_at":"2026-07-05T11:30:14.882165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:14.882165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NVTjn9os02rVX+MrrfYf7IDhIczx2yaVO2CkNOyNJvbwVByUj6OhMBbmgqIaX7MCrTN6a791a3Psg3ENt3DPBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:14.882585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.00812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:915473ce03b9b4b5df6049b5942568b14812166cfdc921cdd7c1d064fa80b8b2","sha256:906f3a1094a2b026f221dd36961f247f5a02342feefd01270bb93d1188524087"],"state_sha256":"02f925410e9f6ab148c9da08cf1dc4cbd51fa6bad11137fca61905a7f91628d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBGwnHZQFOLWh0vUCaWTLoeUs20+WsC8ZpUzX3yl9820u3Qway4vW3+wjHRKnE7oS22SDil4xyhuVUXq1bokCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:21:15.228051Z","bundle_sha256":"d348ba04d0c86f105038957f26265254178a4024c785ed0cbe20264bf1cb2e2d"}}