{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TRINDCWAFBAVPKJ3TWXNGX45X7","short_pith_number":"pith:TRINDCWA","schema_version":"1.0","canonical_sha256":"9c50d18ac0284157a93b9daed35f9dbfe63ebd80745c02cc37b329426e14b6e6","source":{"kind":"arxiv","id":"2408.03122","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph Extensions of Spectral Tur\\'an Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Wang, Lele Liu, Liying Kang, Zhenyu Ni","submitted_at":"2024-08-06T11:53:30Z","abstract_excerpt":"The spectral Tur\\'an theorem states that the $k$-partite Tur\\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result is known to be stronger than the classical Tur\\'an theorem. In this paper, we consider hypergraph extensions of spectral Tur\\'an theorem. For $k\\geq r\\geq 2$, let $H_{k+1}^{(r)}$ be the $r$-uniform hypergraph obtained from $K_{k+1}$ by enlarging each edge with a new set of $(r-2)$ vertices. Let $F_{k+1}^{(r)}$ be the $r$-uniform hypergraph with edges: $\\{1,2,"},"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":"2408.03122","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-06T11:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"266fefedec1d06708227dd2d3321abed11e5c4591ec34d4ce418fa690711570a","abstract_canon_sha256":"2225c5ac099945ba3d0cb4f5ce789677d233f5bd2f503f51c8df3c306dc28c6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:46.065708Z","signature_b64":"kkyuKRYjdsEvxyVMTfADnRG1sSowTZSdaP3XZxdqVPS73198Fs0nTD7WJXB15EAPDz4YvATToGR19GGviFb2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c50d18ac0284157a93b9daed35f9dbfe63ebd80745c02cc37b329426e14b6e6","last_reissued_at":"2026-07-05T08:52:46.065160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:46.065160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Extensions of Spectral Tur\\'an Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Wang, Lele Liu, Liying Kang, Zhenyu Ni","submitted_at":"2024-08-06T11:53:30Z","abstract_excerpt":"The spectral Tur\\'an theorem states that the $k$-partite Tur\\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result is known to be stronger than the classical Tur\\'an theorem. In this paper, we consider hypergraph extensions of spectral Tur\\'an theorem. For $k\\geq r\\geq 2$, let $H_{k+1}^{(r)}$ be the $r$-uniform hypergraph obtained from $K_{k+1}$ by enlarging each edge with a new set of $(r-2)$ vertices. Let $F_{k+1}^{(r)}$ be the $r$-uniform hypergraph with edges: $\\{1,2,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03122","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/2408.03122/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":"2408.03122","created_at":"2026-07-05T08:52:46.065225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03122v1","created_at":"2026-07-05T08:52:46.065225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03122","created_at":"2026-07-05T08:52:46.065225+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRINDCWAFBAV","created_at":"2026-07-05T08:52:46.065225+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRINDCWAFBAVPKJ3","created_at":"2026-07-05T08:52:46.065225+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRINDCWA","created_at":"2026-07-05T08:52:46.065225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08468","citing_title":"Spectral Radius Conditions for 3-Uniform Intersecting Families","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7","json":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7.json","graph_json":"https://pith.science/api/pith-number/TRINDCWAFBAVPKJ3TWXNGX45X7/graph.json","events_json":"https://pith.science/api/pith-number/TRINDCWAFBAVPKJ3TWXNGX45X7/events.json","paper":"https://pith.science/paper/TRINDCWA"},"agent_actions":{"view_html":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7","download_json":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7.json","view_paper":"https://pith.science/paper/TRINDCWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03122&json=true","fetch_graph":"https://pith.science/api/pith-number/TRINDCWAFBAVPKJ3TWXNGX45X7/graph.json","fetch_events":"https://pith.science/api/pith-number/TRINDCWAFBAVPKJ3TWXNGX45X7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7/action/storage_attestation","attest_author":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7/action/author_attestation","sign_citation":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7/action/citation_signature","submit_replication":"https://pith.science/pith/TRINDCWAFBAVPKJ3TWXNGX45X7/action/replication_record"}},"created_at":"2026-07-05T08:52:46.065225+00:00","updated_at":"2026-07-05T08:52:46.065225+00:00"}