{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:S5DHMHPYTIQXRCBIQRKTY5N5L7","short_pith_number":"pith:S5DHMHPY","schema_version":"1.0","canonical_sha256":"9746761df89a2178882884553c75bd5fef4a3dcb79cce19705fba90312e886d6","source":{"kind":"arxiv","id":"2104.12171","version":1},"attestation_state":"computed","paper":{"title":"On a theorem of Nosal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"V. Nikiforov","submitted_at":"2021-04-25T14:22:17Z","abstract_excerpt":"Let $G$ be a graph with $m$ edges and spectral radius $\\lambda_{1}$. Let $bk\\left( G\\right) $ stand for the maximal number of triangles with a common edge in $G$.\n  In 1970 Nosal proved that if $\\lambda_{1}^{2}>m,$ then $G$ contains a triangle. In this paper we show that the same premise implies that \\[ bk\\left( G\\right) >\\frac{1}{12}\\sqrt[4]{m}. \\] This result settles a conjecture of Zhai, Lin, and Shu.\n  Write $\\lambda_{2}$ for the second largest eigenvalue of $G$. Recently, Lin, Ning, and Wu showed that if $G$ is a triangle-free graph of order at least three, then \\[ \\lambda_{1}^{2}+\\lambda"},"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":"2104.12171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-25T14:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"28c9ed51731fbfc71af9d084c587cfeb93914db26b9cf576b09055c3f4337c2f","abstract_canon_sha256":"c32587f9380a376ca4bb9c14fd0061d86e0cce39a57d48c25a66056de34c66d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:54.236593Z","signature_b64":"eL7wWnWsgR0yUOw8Yqm0ySdKYETdQWv28u7ixXRT4U+NKDXu3Pae/mq6okouZdjLKHJeNWLnmrHzg7+Llq0NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9746761df89a2178882884553c75bd5fef4a3dcb79cce19705fba90312e886d6","last_reissued_at":"2026-07-05T02:34:54.236190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:54.236190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a theorem of Nosal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"V. Nikiforov","submitted_at":"2021-04-25T14:22:17Z","abstract_excerpt":"Let $G$ be a graph with $m$ edges and spectral radius $\\lambda_{1}$. Let $bk\\left( G\\right) $ stand for the maximal number of triangles with a common edge in $G$.\n  In 1970 Nosal proved that if $\\lambda_{1}^{2}>m,$ then $G$ contains a triangle. In this paper we show that the same premise implies that \\[ bk\\left( G\\right) >\\frac{1}{12}\\sqrt[4]{m}. \\] This result settles a conjecture of Zhai, Lin, and Shu.\n  Write $\\lambda_{2}$ for the second largest eigenvalue of $G$. Recently, Lin, Ning, and Wu showed that if $G$ is a triangle-free graph of order at least three, then \\[ \\lambda_{1}^{2}+\\lambda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12171","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/2104.12171/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":"2104.12171","created_at":"2026-07-05T02:34:54.236254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12171v1","created_at":"2026-07-05T02:34:54.236254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12171","created_at":"2026-07-05T02:34:54.236254+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5DHMHPYTIQX","created_at":"2026-07-05T02:34:54.236254+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5DHMHPYTIQXRCBI","created_at":"2026-07-05T02:34:54.236254+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5DHMHPY","created_at":"2026-07-05T02:34:54.236254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01073","citing_title":"An edge-spectral supersaturation of Mubayi's theorem for color-critical graphs","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26614","citing_title":"Spectral Sidorenko inequalities and edge-spectral supersaturation","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2508.14366","citing_title":"More on Nosal's spectral theorem: Books and $4$-cycles","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7","json":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7.json","graph_json":"https://pith.science/api/pith-number/S5DHMHPYTIQXRCBIQRKTY5N5L7/graph.json","events_json":"https://pith.science/api/pith-number/S5DHMHPYTIQXRCBIQRKTY5N5L7/events.json","paper":"https://pith.science/paper/S5DHMHPY"},"agent_actions":{"view_html":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7","download_json":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7.json","view_paper":"https://pith.science/paper/S5DHMHPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12171&json=true","fetch_graph":"https://pith.science/api/pith-number/S5DHMHPYTIQXRCBIQRKTY5N5L7/graph.json","fetch_events":"https://pith.science/api/pith-number/S5DHMHPYTIQXRCBIQRKTY5N5L7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7/action/storage_attestation","attest_author":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7/action/author_attestation","sign_citation":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7/action/citation_signature","submit_replication":"https://pith.science/pith/S5DHMHPYTIQXRCBIQRKTY5N5L7/action/replication_record"}},"created_at":"2026-07-05T02:34:54.236254+00:00","updated_at":"2026-07-05T02:34:54.236254+00:00"}