{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MZ5DEYIP7M52R2S6TXMDLTPD4Y","short_pith_number":"pith:MZ5DEYIP","schema_version":"1.0","canonical_sha256":"667a32610ffb3ba8ea5e9dd835cde3e60e42d46014e8f1bd7a7c8cd188acf7be","source":{"kind":"arxiv","id":"2407.19341","version":1},"attestation_state":"computed","paper":{"title":"Bollob\\'as-Nikiforov Conjecture for graphs with not so many triangles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hitesh Kumar, Shivaramakrishna Pragada","submitted_at":"2024-07-27T21:11:29Z","abstract_excerpt":"Bollob\\'as and Nikiforov conjectured that for any graph $G \\neq K_n$ with $m$ edges \\[ \\lambda_1^2+\\lambda_2^2\\le \\bigg( 1-\\frac{1}{\\omega(G)}\\bigg)2m\\] where $\\lambda_1$ and $\\lambda_2$ denote the two largest eigenvalues of the adjacency matrix $A(G)$, and $\\omega$ denotes the clique number of $G$. This conjecture was recently verified for triangle-free graphs by Lin, Ning and Wu and for regular graphs by Zhang. Elphick, Wocjan and Linz proposed a generalization of this conjecture. In this note, we verify this generalized conjecture for the family of graphs on $m$ edges, which contain at most"},"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":"2407.19341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-27T21:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"4e1df6cb35458b43a93e5a7ee15de7fd0988fc37d8cee18681420e5160884c3f","abstract_canon_sha256":"d0b46f6230984961c8bd0313c3e31d47f580e49bb1532a5aa9ff9e239c3688e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:38.613085Z","signature_b64":"q3B9a1ehxfRQCAXSsihYbRg8W7vZcnKv7jB6yQua0EvAXzGgoxkeI1MT6JvgdCArqHUKfk8qg3kvRx+RZW8hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"667a32610ffb3ba8ea5e9dd835cde3e60e42d46014e8f1bd7a7c8cd188acf7be","last_reissued_at":"2026-07-05T08:49:38.612642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:38.612642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bollob\\'as-Nikiforov Conjecture for graphs with not so many triangles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hitesh Kumar, Shivaramakrishna Pragada","submitted_at":"2024-07-27T21:11:29Z","abstract_excerpt":"Bollob\\'as and Nikiforov conjectured that for any graph $G \\neq K_n$ with $m$ edges \\[ \\lambda_1^2+\\lambda_2^2\\le \\bigg( 1-\\frac{1}{\\omega(G)}\\bigg)2m\\] where $\\lambda_1$ and $\\lambda_2$ denote the two largest eigenvalues of the adjacency matrix $A(G)$, and $\\omega$ denotes the clique number of $G$. This conjecture was recently verified for triangle-free graphs by Lin, Ning and Wu and for regular graphs by Zhang. Elphick, Wocjan and Linz proposed a generalization of this conjecture. In this note, we verify this generalized conjecture for the family of graphs on $m$ edges, which contain at most"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19341","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/2407.19341/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":"2407.19341","created_at":"2026-07-05T08:49:38.612704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.19341v1","created_at":"2026-07-05T08:49:38.612704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19341","created_at":"2026-07-05T08:49:38.612704+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZ5DEYIP7M52","created_at":"2026-07-05T08:49:38.612704+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZ5DEYIP7M52R2S6","created_at":"2026-07-05T08:49:38.612704+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZ5DEYIP","created_at":"2026-07-05T08:49:38.612704+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08184","citing_title":"Conic programming to understand sums of squares of eigenvalues of graphs","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y","json":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y.json","graph_json":"https://pith.science/api/pith-number/MZ5DEYIP7M52R2S6TXMDLTPD4Y/graph.json","events_json":"https://pith.science/api/pith-number/MZ5DEYIP7M52R2S6TXMDLTPD4Y/events.json","paper":"https://pith.science/paper/MZ5DEYIP"},"agent_actions":{"view_html":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y","download_json":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y.json","view_paper":"https://pith.science/paper/MZ5DEYIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.19341&json=true","fetch_graph":"https://pith.science/api/pith-number/MZ5DEYIP7M52R2S6TXMDLTPD4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/MZ5DEYIP7M52R2S6TXMDLTPD4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y/action/storage_attestation","attest_author":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y/action/author_attestation","sign_citation":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y/action/citation_signature","submit_replication":"https://pith.science/pith/MZ5DEYIP7M52R2S6TXMDLTPD4Y/action/replication_record"}},"created_at":"2026-07-05T08:49:38.612704+00:00","updated_at":"2026-07-05T08:49:38.612704+00:00"}