{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AJ7JKGK52DAQZ5MGDWD733QLRJ","short_pith_number":"pith:AJ7JKGK5","schema_version":"1.0","canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","source":{"kind":"arxiv","id":"2504.04836","version":1},"attestation_state":"computed","paper":{"title":"Strengthening Wilf's lower bound on clique number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hareshkumar Jadav, Rahul Raut, Ranveer Singh, Sreekara Madyastha","submitted_at":"2025-04-07T08:46:55Z","abstract_excerpt":"Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\\frac{n}{n - \\lambda_{1}} \\leq \\omega$, where $\\lambda_1$ is the largest eigenvalue of the adjacency matrix $A(G)$, $n$ is the number of vertices in $G$, and $\\omega$ is the clique number of $G$. Strengthening this bound, Elphick and Wocjan proposed a conjecture in 2018, which is stated as follows: $\\frac{n}{n - \\sqrt{s^{+}}} \\leq \\omega$, where $s^+ = \\sum_{\\lambda_{i} > 0"},"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":"2504.04836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-04-07T08:46:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"60883e486c1e64aa899b2d3b51c52f00e7a222a97e3cabcacc0ede74f632f274","abstract_canon_sha256":"5b779aed7604689535c7df2f7f0504f5276fb33e1c0feefd61c7a7f276cadb3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:30.534020Z","signature_b64":"sadPMTYbJ0le2WFzIyohC9tZssdjBdl8fgO+s04J5aSFyXUl4eceFTbr4swPGsuu0Ifqj3p/siCrNISCUgYVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","last_reissued_at":"2026-07-05T10:45:30.533585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:30.533585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strengthening Wilf's lower bound on clique number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hareshkumar Jadav, Rahul Raut, Ranveer Singh, Sreekara Madyastha","submitted_at":"2025-04-07T08:46:55Z","abstract_excerpt":"Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\\frac{n}{n - \\lambda_{1}} \\leq \\omega$, where $\\lambda_1$ is the largest eigenvalue of the adjacency matrix $A(G)$, $n$ is the number of vertices in $G$, and $\\omega$ is the clique number of $G$. Strengthening this bound, Elphick and Wocjan proposed a conjecture in 2018, which is stated as follows: $\\frac{n}{n - \\sqrt{s^{+}}} \\leq \\omega$, where $s^+ = \\sum_{\\lambda_{i} > 0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04836","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/2504.04836/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":"2504.04836","created_at":"2026-07-05T10:45:30.533635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04836v1","created_at":"2026-07-05T10:45:30.533635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04836","created_at":"2026-07-05T10:45:30.533635+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJ7JKGK52DAQ","created_at":"2026-07-05T10:45:30.533635+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJ7JKGK52DAQZ5MG","created_at":"2026-07-05T10:45:30.533635+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJ7JKGK5","created_at":"2026-07-05T10:45:30.533635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ","json":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ.json","graph_json":"https://pith.science/api/pith-number/AJ7JKGK52DAQZ5MGDWD733QLRJ/graph.json","events_json":"https://pith.science/api/pith-number/AJ7JKGK52DAQZ5MGDWD733QLRJ/events.json","paper":"https://pith.science/paper/AJ7JKGK5"},"agent_actions":{"view_html":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ","download_json":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ.json","view_paper":"https://pith.science/paper/AJ7JKGK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04836&json=true","fetch_graph":"https://pith.science/api/pith-number/AJ7JKGK52DAQZ5MGDWD733QLRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AJ7JKGK52DAQZ5MGDWD733QLRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/action/storage_attestation","attest_author":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/action/author_attestation","sign_citation":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/action/citation_signature","submit_replication":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/action/replication_record"}},"created_at":"2026-07-05T10:45:30.533635+00:00","updated_at":"2026-07-05T10:45:30.533635+00:00"}