{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TRINDCWAFBAVPKJ3TWXNGX45X7","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":"2225c5ac099945ba3d0cb4f5ce789677d233f5bd2f503f51c8df3c306dc28c6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-06T11:53:30Z","title_canon_sha256":"266fefedec1d06708227dd2d3321abed11e5c4591ec34d4ce418fa690711570a"},"schema_version":"1.0","source":{"id":"2408.03122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03122","created_at":"2026-07-05T08:52:46Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03122v1","created_at":"2026-07-05T08:52:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03122","created_at":"2026-07-05T08:52:46Z"},{"alias_kind":"pith_short_12","alias_value":"TRINDCWAFBAV","created_at":"2026-07-05T08:52:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRINDCWAFBAVPKJ3","created_at":"2026-07-05T08:52:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRINDCWA","created_at":"2026-07-05T08:52:46Z"}],"graph_snapshots":[{"event_id":"sha256:a6c844fe13b4de00e3766ab1be96559d254a837dc780194f78f301346c1f6870","target":"graph","created_at":"2026-07-05T08:52:46Z","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/2408.03122/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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,","authors_text":"Jing Wang, Lele Liu, Liying Kang, Zhenyu Ni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-06T11:53:30Z","title":"Hypergraph Extensions of Spectral Tur\\'an Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03122","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:35bc92f50a9ad27729df353822f4b7b410c6dbcd88ede69e52aeb978af152e95","target":"record","created_at":"2026-07-05T08:52:46Z","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":"2225c5ac099945ba3d0cb4f5ce789677d233f5bd2f503f51c8df3c306dc28c6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-06T11:53:30Z","title_canon_sha256":"266fefedec1d06708227dd2d3321abed11e5c4591ec34d4ce418fa690711570a"},"schema_version":"1.0","source":{"id":"2408.03122","kind":"arxiv","version":1}},"canonical_sha256":"9c50d18ac0284157a93b9daed35f9dbfe63ebd80745c02cc37b329426e14b6e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c50d18ac0284157a93b9daed35f9dbfe63ebd80745c02cc37b329426e14b6e6","first_computed_at":"2026-07-05T08:52:46.065160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:52:46.065160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kkyuKRYjdsEvxyVMTfADnRG1sSowTZSdaP3XZxdqVPS73198Fs0nTD7WJXB15EAPDz4YvATToGR19GGviFb2AA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:52:46.065708Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.03122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35bc92f50a9ad27729df353822f4b7b410c6dbcd88ede69e52aeb978af152e95","sha256:a6c844fe13b4de00e3766ab1be96559d254a837dc780194f78f301346c1f6870"],"state_sha256":"a73ae871613837fb7fb060fa217f9db9efff5116e48618a4c24a4b72fcf92a71"}