{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AJ7JKGK52DAQZ5MGDWD733QLRJ","short_pith_number":"pith:AJ7JKGK5","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"},"canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","source":{"kind":"arxiv","id":"2504.04836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04836","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04836v1","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04836","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7JKGK52DAQ","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7JKGK52DAQZ5MG","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7JKGK5","created_at":"2026-07-05T10:45:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AJ7JKGK52DAQZ5MGDWD733QLRJ","target":"record","payload":{"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"},"canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","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"},"source_kind":"arxiv","source_id":"2504.04836","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rs+cRuKh+CR1b9GoOdKytO3kaaEQZd0ToRg8BtuxvXaJzx1wgjRgeZ7uyPLqcUeM1Lu2Py/TjOvyOje0nlz/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:23:23.835661Z"},"content_sha256":"ed2dd8c9dca0f6b2ce5ba1b21aa8c75b6218fd19562611d42cee86ac8c9e4100","schema_version":"1.0","event_id":"sha256:ed2dd8c9dca0f6b2ce5ba1b21aa8c75b6218fd19562611d42cee86ac8c9e4100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AJ7JKGK52DAQZ5MGDWD733QLRJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SYkY1p1Ree4T98DCr88X4zCuLtPJm8/lb7Zr5DqlaY741G5viDWamaOSDz5u5dlkgGUojQfC6zqW6ogYOgGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:23:23.836189Z"},"content_sha256":"b4299c53cf5adcf8f5d30e6dfee0aef0b2a59d377eeeaccb1e16331d26f80608","schema_version":"1.0","event_id":"sha256:b4299c53cf5adcf8f5d30e6dfee0aef0b2a59d377eeeaccb1e16331d26f80608"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/bundle.json","state_url":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T20:23:23Z","links":{"resolver":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ","bundle":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/bundle.json","state":"https://pith.science/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJ7JKGK52DAQZ5MGDWD733QLRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AJ7JKGK52DAQZ5MGDWD733QLRJ","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":"5b779aed7604689535c7df2f7f0504f5276fb33e1c0feefd61c7a7f276cadb3b","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-04-07T08:46:55Z","title_canon_sha256":"60883e486c1e64aa899b2d3b51c52f00e7a222a97e3cabcacc0ede74f632f274"},"schema_version":"1.0","source":{"id":"2504.04836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04836","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04836v1","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04836","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7JKGK52DAQ","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7JKGK52DAQZ5MG","created_at":"2026-07-05T10:45:30Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7JKGK5","created_at":"2026-07-05T10:45:30Z"}],"graph_snapshots":[{"event_id":"sha256:b4299c53cf5adcf8f5d30e6dfee0aef0b2a59d377eeeaccb1e16331d26f80608","target":"graph","created_at":"2026-07-05T10:45:30Z","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/2504.04836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hareshkumar Jadav, Rahul Raut, Ranveer Singh, Sreekara Madyastha","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-04-07T08:46:55Z","title":"Strengthening Wilf's lower bound on clique number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04836","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:ed2dd8c9dca0f6b2ce5ba1b21aa8c75b6218fd19562611d42cee86ac8c9e4100","target":"record","created_at":"2026-07-05T10:45:30Z","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":"5b779aed7604689535c7df2f7f0504f5276fb33e1c0feefd61c7a7f276cadb3b","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-04-07T08:46:55Z","title_canon_sha256":"60883e486c1e64aa899b2d3b51c52f00e7a222a97e3cabcacc0ede74f632f274"},"schema_version":"1.0","source":{"id":"2504.04836","kind":"arxiv","version":1}},"canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"027e95195dd0c10cf5861d87fdee0b8a6fa765cd37f421fd868200faca57afa5","first_computed_at":"2026-07-05T10:45:30.533585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:45:30.533585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sadPMTYbJ0le2WFzIyohC9tZssdjBdl8fgO+s04J5aSFyXUl4eceFTbr4swPGsuu0Ifqj3p/siCrNISCUgYVDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:45:30.534020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.04836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed2dd8c9dca0f6b2ce5ba1b21aa8c75b6218fd19562611d42cee86ac8c9e4100","sha256:b4299c53cf5adcf8f5d30e6dfee0aef0b2a59d377eeeaccb1e16331d26f80608"],"state_sha256":"b7add7f71a482aa2bc9b1b3af92d5b13c74732d6520ec23f584d666c40e18948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPulFKa/QKwZLwUAjLkO0XM6wjKSHsjk200ww8xN5YNul6njGBZ/AdlofByBEZiTcP5CDa1/MqjPG6UnbmUvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:23:23.840474Z","bundle_sha256":"6219813bdd6d6d4fe99d04137396e0ddb0648ad21853a7c3574379ca62cc4666"}}