{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UIYVTPJK7WNHMNVZ5HAKFLDYLC","short_pith_number":"pith:UIYVTPJK","schema_version":"1.0","canonical_sha256":"a23159bd2afd9a7636b9e9c0a2ac7858bde1301de2f5e25f2abbb819f4e7b640","source":{"kind":"arxiv","id":"2411.07090","version":2},"attestation_state":"computed","paper":{"title":"Positive codegree Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s theorem for the generalized triangle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Sijie Ren, Xizhi Liu","submitted_at":"2024-11-11T16:12:09Z","abstract_excerpt":"The celebrated Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s Theorem from 1974 shows that every $n$-vertex triangle-free graph with minimum degree greater than $2n/5$ must be bipartite.\n  We establish a positive codegree extension of this result for the $r$-uniform generalized triangle $\\mathrm{T}_{r} = \\left\\{\\{1,\\ldots, r-1,r\\}, \\{1,\\ldots, r-1,r+1\\},\\{r,r+1, \\ldots, 2r-1\\}\\right\\}$$\\colon$ For every $n \\ge (r-1)(2r+1)/2$, if $\\mathcal{H}$ is an $n$-vertex $\\mathrm{T}_{r}$-free $r$-uniform hypergraph in which each $(r-1)$-tuple of vertices is contained in either zero edges or more than $2n/(2r+1)$ edges"},"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":"2411.07090","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-11T16:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"2e6542be431578bca266976e29a3a0ee8471361c2e57d367538f528f3f550245","abstract_canon_sha256":"004be0fd674ddffe78dc0d6e8ad2e5b29255579e990a79072aeeaa8bbbc759c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:22.967647Z","signature_b64":"Yuv+nGY7tBqRBNmkO9FvzUGYrRisZ3PQ5EY1mXzvZa0IMsA2H5YWWORgx7MZGvQRixLDzHv0qQr+5xDdwUwPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a23159bd2afd9a7636b9e9c0a2ac7858bde1301de2f5e25f2abbb819f4e7b640","last_reissued_at":"2026-07-05T09:34:22.967114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:22.967114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive codegree Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s theorem for the generalized triangle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Sijie Ren, Xizhi Liu","submitted_at":"2024-11-11T16:12:09Z","abstract_excerpt":"The celebrated Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s Theorem from 1974 shows that every $n$-vertex triangle-free graph with minimum degree greater than $2n/5$ must be bipartite.\n  We establish a positive codegree extension of this result for the $r$-uniform generalized triangle $\\mathrm{T}_{r} = \\left\\{\\{1,\\ldots, r-1,r\\}, \\{1,\\ldots, r-1,r+1\\},\\{r,r+1, \\ldots, 2r-1\\}\\right\\}$$\\colon$ For every $n \\ge (r-1)(2r+1)/2$, if $\\mathcal{H}$ is an $n$-vertex $\\mathrm{T}_{r}$-free $r$-uniform hypergraph in which each $(r-1)$-tuple of vertices is contained in either zero edges or more than $2n/(2r+1)$ edges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07090","kind":"arxiv","version":2},"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/2411.07090/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":"2411.07090","created_at":"2026-07-05T09:34:22.967170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07090v2","created_at":"2026-07-05T09:34:22.967170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07090","created_at":"2026-07-05T09:34:22.967170+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIYVTPJK7WNH","created_at":"2026-07-05T09:34:22.967170+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIYVTPJK7WNHMNVZ","created_at":"2026-07-05T09:34:22.967170+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIYVTPJK","created_at":"2026-07-05T09:34:22.967170+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/UIYVTPJK7WNHMNVZ5HAKFLDYLC","json":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC.json","graph_json":"https://pith.science/api/pith-number/UIYVTPJK7WNHMNVZ5HAKFLDYLC/graph.json","events_json":"https://pith.science/api/pith-number/UIYVTPJK7WNHMNVZ5HAKFLDYLC/events.json","paper":"https://pith.science/paper/UIYVTPJK"},"agent_actions":{"view_html":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC","download_json":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC.json","view_paper":"https://pith.science/paper/UIYVTPJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07090&json=true","fetch_graph":"https://pith.science/api/pith-number/UIYVTPJK7WNHMNVZ5HAKFLDYLC/graph.json","fetch_events":"https://pith.science/api/pith-number/UIYVTPJK7WNHMNVZ5HAKFLDYLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC/action/storage_attestation","attest_author":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC/action/author_attestation","sign_citation":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC/action/citation_signature","submit_replication":"https://pith.science/pith/UIYVTPJK7WNHMNVZ5HAKFLDYLC/action/replication_record"}},"created_at":"2026-07-05T09:34:22.967170+00:00","updated_at":"2026-07-05T09:34:22.967170+00:00"}