{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JG4TXANE53XUZAIJ37QF22FOMH","short_pith_number":"pith:JG4TXANE","schema_version":"1.0","canonical_sha256":"49b93b81a4eeef4c8109dfe05d68ae61e95e23b874748c9d9e554fafa3b4ac7c","source":{"kind":"arxiv","id":"2410.20832","version":4},"attestation_state":"computed","paper":{"title":"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-10-28T08:29:41Z","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. Its extensions to $3$-uniform hypergraphs without the generalized triangle $F_5 = \\{abc, abd, cde\\}$ have been explored in several previous works such as~\\cite{LMR23unif,HLZ24}, demonstrating the existence of $\\varepsilon > 0$ such that for large $n$, every $n$-vertex $F_5$-free $3$-graph with minimum degree greater than $(1/9-\\varepsilon) n^2$ must be $3$-partite.\n  We determine the optimal value for $\\varepsilon$ by show"},"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":"2410.20832","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-28T08:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"a51a6065f33b1fcd5195fa5818f9ba84cd821e3fcab4806f458e12227825f78d","abstract_canon_sha256":"b56fbd719b84af201ddbc4296d9a49daafd6441b93b673d79d0853651a779bdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:56.935993Z","signature_b64":"fHPEw7v/LptfXydgIWp9HPVqY15pvuY4rs6et7iPc4zVPEbBBrwQxd1E7PF2VVRV7i80IJf3oEp1y3jn2/rYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49b93b81a4eeef4c8109dfe05d68ae61e95e23b874748c9d9e554fafa3b4ac7c","last_reissued_at":"2026-07-05T09:28:56.935453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:56.935453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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-10-28T08:29:41Z","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. Its extensions to $3$-uniform hypergraphs without the generalized triangle $F_5 = \\{abc, abd, cde\\}$ have been explored in several previous works such as~\\cite{LMR23unif,HLZ24}, demonstrating the existence of $\\varepsilon > 0$ such that for large $n$, every $n$-vertex $F_5$-free $3$-graph with minimum degree greater than $(1/9-\\varepsilon) n^2$ must be $3$-partite.\n  We determine the optimal value for $\\varepsilon$ by show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20832","kind":"arxiv","version":4},"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/2410.20832/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":"2410.20832","created_at":"2026-07-05T09:28:56.935532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20832v4","created_at":"2026-07-05T09:28:56.935532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20832","created_at":"2026-07-05T09:28:56.935532+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG4TXANE53XU","created_at":"2026-07-05T09:28:56.935532+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG4TXANE53XUZAIJ","created_at":"2026-07-05T09:28:56.935532+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG4TXANE","created_at":"2026-07-05T09:28:56.935532+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/JG4TXANE53XUZAIJ37QF22FOMH","json":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH.json","graph_json":"https://pith.science/api/pith-number/JG4TXANE53XUZAIJ37QF22FOMH/graph.json","events_json":"https://pith.science/api/pith-number/JG4TXANE53XUZAIJ37QF22FOMH/events.json","paper":"https://pith.science/paper/JG4TXANE"},"agent_actions":{"view_html":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH","download_json":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH.json","view_paper":"https://pith.science/paper/JG4TXANE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20832&json=true","fetch_graph":"https://pith.science/api/pith-number/JG4TXANE53XUZAIJ37QF22FOMH/graph.json","fetch_events":"https://pith.science/api/pith-number/JG4TXANE53XUZAIJ37QF22FOMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH/action/storage_attestation","attest_author":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH/action/author_attestation","sign_citation":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH/action/citation_signature","submit_replication":"https://pith.science/pith/JG4TXANE53XUZAIJ37QF22FOMH/action/replication_record"}},"created_at":"2026-07-05T09:28:56.935532+00:00","updated_at":"2026-07-05T09:28:56.935532+00:00"}