{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RVZGKN7FQXROAMYSJRPGW3GXOE","short_pith_number":"pith:RVZGKN7F","schema_version":"1.0","canonical_sha256":"8d726537e585e2e033124c5e6b6cd77104eb44e8b835dd91446ea3b7febc07b1","source":{"kind":"arxiv","id":"2401.17219","version":4},"attestation_state":"computed","paper":{"title":"A criterion for Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s type theorems and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou, Xizhi Liu","submitted_at":"2024-01-30T18:05:11Z","abstract_excerpt":"The classical Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s Theorem states that for $\\ell\\ge 2$, every $n$-vertex $K_{\\ell+1}$-free graph with minimum degree greater than $\\frac{3\\ell-4}{3\\ell-1}n$ must be $\\ell$-partite. We establish a simple criterion for $r$-graphs, $r \\geq 2$, to exhibit an Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s type property, also known as degree-stability. This leads to a classification of most previously studied hypergraph families with this property. An immediate application of this result, combined with a general theorem by Keevash--Lenz--Mubayi, solves the spectral Tur\\'{a}n problems"},"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":"2401.17219","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-30T18:05:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ad560b3ec55c4fc9cee5b50488515f8489ba8ec0f9174b83eea74154d6008d8f","abstract_canon_sha256":"4f7879533d61efc32c471edadbb3bb0acf417234b1be02858f92ce8ab4abe9f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:12.168871Z","signature_b64":"B+nhCZJwdOYpvJjwWPChxq499brrM2jLAz7GVb0Knp6eIcGFev5XwNtc6sS6CqHBUAOF5mGqDt+2q8tY7RRLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d726537e585e2e033124c5e6b6cd77104eb44e8b835dd91446ea3b7febc07b1","last_reissued_at":"2026-07-05T08:21:12.168393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:12.168393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A criterion for Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s type theorems and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou, Xizhi Liu","submitted_at":"2024-01-30T18:05:11Z","abstract_excerpt":"The classical Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s Theorem states that for $\\ell\\ge 2$, every $n$-vertex $K_{\\ell+1}$-free graph with minimum degree greater than $\\frac{3\\ell-4}{3\\ell-1}n$ must be $\\ell$-partite. We establish a simple criterion for $r$-graphs, $r \\geq 2$, to exhibit an Andr\\'{a}sfai--Erd\\H{o}s--S\\'{o}s type property, also known as degree-stability. This leads to a classification of most previously studied hypergraph families with this property. An immediate application of this result, combined with a general theorem by Keevash--Lenz--Mubayi, solves the spectral Tur\\'{a}n problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.17219","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/2401.17219/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":"2401.17219","created_at":"2026-07-05T08:21:12.168449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.17219v4","created_at":"2026-07-05T08:21:12.168449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.17219","created_at":"2026-07-05T08:21:12.168449+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVZGKN7FQXRO","created_at":"2026-07-05T08:21:12.168449+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVZGKN7FQXROAMYS","created_at":"2026-07-05T08:21:12.168449+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVZGKN7F","created_at":"2026-07-05T08:21:12.168449+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21689","citing_title":"Spectral generalized Tur\\'{a}n problems","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE","json":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE.json","graph_json":"https://pith.science/api/pith-number/RVZGKN7FQXROAMYSJRPGW3GXOE/graph.json","events_json":"https://pith.science/api/pith-number/RVZGKN7FQXROAMYSJRPGW3GXOE/events.json","paper":"https://pith.science/paper/RVZGKN7F"},"agent_actions":{"view_html":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE","download_json":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE.json","view_paper":"https://pith.science/paper/RVZGKN7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.17219&json=true","fetch_graph":"https://pith.science/api/pith-number/RVZGKN7FQXROAMYSJRPGW3GXOE/graph.json","fetch_events":"https://pith.science/api/pith-number/RVZGKN7FQXROAMYSJRPGW3GXOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE/action/storage_attestation","attest_author":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE/action/author_attestation","sign_citation":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE/action/citation_signature","submit_replication":"https://pith.science/pith/RVZGKN7FQXROAMYSJRPGW3GXOE/action/replication_record"}},"created_at":"2026-07-05T08:21:12.168449+00:00","updated_at":"2026-07-05T08:21:12.168449+00:00"}