{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TKUAOIQXSLI4F3OJ22MRACZBNH","short_pith_number":"pith:TKUAOIQX","schema_version":"1.0","canonical_sha256":"9aa807221792d1c2edc9d699100b2169ed4aec92827a4cab6a710cc940845b88","source":{"kind":"arxiv","id":"2404.03423","version":1},"attestation_state":"computed","paper":{"title":"Spectral extremal graphs for fan graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Loujun Yu, Yongtao Li, Yuejian Peng","submitted_at":"2024-04-04T13:06:19Z","abstract_excerpt":"A well-known result of Nosal states that a graph $G$ with $m$ edges and $\\lambda(G) > \\sqrt{m}$ contains a triangle. Nikiforov [Combin. Probab. Comput. 11 (2002)] extended this result to cliques by showing that if $\\lambda (G) > \\sqrt{2m(1-1/r)}$, then $G$ contains a copy of $K_{r+1}$. Let $C_k^+$ be the graph obtained from a cycle $C_k$ by adding an edge to two vertices with distance two, and let $F_k$ be the friendship graph consisting of $k$ triangles that share a common vertex. Recently, Zhai, Lin and Shu [European J. Combin. 95 (2021)], Sun, Li and Wei [Discrete Math. 346 (2023)], and Li,"},"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":"2404.03423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-04T13:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"fd5e7ce04401ef9a455391feb9df6f7504223b402f7a28b53e8f2072893444f1","abstract_canon_sha256":"50f7df40ef00c62f6d5519f61eecb83fcba712d15fc823996c0d86f088d4f27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:25.606132Z","signature_b64":"n/acA+2L3K2KuvSUQdHn5raTgtcMMHnsLyXGR7Clff8QWQ5+6VN4uIf7THV2i9Qp9QKrZZ+skPwce9ApZjMUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aa807221792d1c2edc9d699100b2169ed4aec92827a4cab6a710cc940845b88","last_reissued_at":"2026-07-05T08:04:25.605670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:25.605670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral extremal graphs for fan graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Loujun Yu, Yongtao Li, Yuejian Peng","submitted_at":"2024-04-04T13:06:19Z","abstract_excerpt":"A well-known result of Nosal states that a graph $G$ with $m$ edges and $\\lambda(G) > \\sqrt{m}$ contains a triangle. Nikiforov [Combin. Probab. Comput. 11 (2002)] extended this result to cliques by showing that if $\\lambda (G) > \\sqrt{2m(1-1/r)}$, then $G$ contains a copy of $K_{r+1}$. Let $C_k^+$ be the graph obtained from a cycle $C_k$ by adding an edge to two vertices with distance two, and let $F_k$ be the friendship graph consisting of $k$ triangles that share a common vertex. Recently, Zhai, Lin and Shu [European J. Combin. 95 (2021)], Sun, Li and Wei [Discrete Math. 346 (2023)], and Li,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03423","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/2404.03423/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":"2404.03423","created_at":"2026-07-05T08:04:25.605724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03423v1","created_at":"2026-07-05T08:04:25.605724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03423","created_at":"2026-07-05T08:04:25.605724+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKUAOIQXSLI4","created_at":"2026-07-05T08:04:25.605724+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKUAOIQXSLI4F3OJ","created_at":"2026-07-05T08:04:25.605724+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKUAOIQX","created_at":"2026-07-05T08:04:25.605724+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13792","citing_title":"Spectral radius of graphs of given size with forbidden a fan graph $F_6$","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH","json":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH.json","graph_json":"https://pith.science/api/pith-number/TKUAOIQXSLI4F3OJ22MRACZBNH/graph.json","events_json":"https://pith.science/api/pith-number/TKUAOIQXSLI4F3OJ22MRACZBNH/events.json","paper":"https://pith.science/paper/TKUAOIQX"},"agent_actions":{"view_html":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH","download_json":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH.json","view_paper":"https://pith.science/paper/TKUAOIQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03423&json=true","fetch_graph":"https://pith.science/api/pith-number/TKUAOIQXSLI4F3OJ22MRACZBNH/graph.json","fetch_events":"https://pith.science/api/pith-number/TKUAOIQXSLI4F3OJ22MRACZBNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH/action/storage_attestation","attest_author":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH/action/author_attestation","sign_citation":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH/action/citation_signature","submit_replication":"https://pith.science/pith/TKUAOIQXSLI4F3OJ22MRACZBNH/action/replication_record"}},"created_at":"2026-07-05T08:04:25.605724+00:00","updated_at":"2026-07-05T08:04:25.605724+00:00"}