{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B56BPLM3LXD5FB57CZP6OO3UDE","short_pith_number":"pith:B56BPLM3","schema_version":"1.0","canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","source":{"kind":"arxiv","id":"2606.24878","version":1},"attestation_state":"computed","paper":{"title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Varun Sivashankar","submitted_at":"2026-06-23T17:55:10Z","abstract_excerpt":"Let $g(r)$ be the minimum number of edges in an $r$-uniform intersecting hypergraph with cover number $r$. Erd\\H{o}s and Lov\\'asz proved the lower bound $g(r)\\ge 8r/3-3$. We first give a completely elementary proof that $g(r)\\ge 3r-4$. We then build on the same approach and apply Kahn's small-codegree hypergraph edge-colouring theorem to improve this to $g(r)\\ge (61/20-o(1))r$. To the best of our knowledge, this is the first improvement over the Erd\\H{o}s-Lov\\'asz lower bound in about fifty years."},"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":"2606.24878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"54e1dc10720b089359f6b95256c83cf134e237e9248e3c6cd7dfd431071d7d5b","abstract_canon_sha256":"0a58f15cb7110076d5d3361fee665220329a242563a192202825905329e3340e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:45.199951Z","signature_b64":"YMfiy7seQnXFiwRt5aa/pueoQIqU2jntfHOLdmJhr8po3tfR5ZBtotvZX31ShN9lA/GJaPZz6nq3F+BnZJEWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","last_reissued_at":"2026-06-24T01:15:45.199557Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:45.199557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Varun Sivashankar","submitted_at":"2026-06-23T17:55:10Z","abstract_excerpt":"Let $g(r)$ be the minimum number of edges in an $r$-uniform intersecting hypergraph with cover number $r$. Erd\\H{o}s and Lov\\'asz proved the lower bound $g(r)\\ge 8r/3-3$. We first give a completely elementary proof that $g(r)\\ge 3r-4$. We then build on the same approach and apply Kahn's small-codegree hypergraph edge-colouring theorem to improve this to $g(r)\\ge (61/20-o(1))r$. To the best of our knowledge, this is the first improvement over the Erd\\H{o}s-Lov\\'asz lower bound in about fifty years."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24878","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/2606.24878/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":"2606.24878","created_at":"2026-06-24T01:15:45.199619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24878v1","created_at":"2026-06-24T01:15:45.199619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24878","created_at":"2026-06-24T01:15:45.199619+00:00"},{"alias_kind":"pith_short_12","alias_value":"B56BPLM3LXD5","created_at":"2026-06-24T01:15:45.199619+00:00"},{"alias_kind":"pith_short_16","alias_value":"B56BPLM3LXD5FB57","created_at":"2026-06-24T01:15:45.199619+00:00"},{"alias_kind":"pith_short_8","alias_value":"B56BPLM3","created_at":"2026-06-24T01:15:45.199619+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/B56BPLM3LXD5FB57CZP6OO3UDE","json":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE.json","graph_json":"https://pith.science/api/pith-number/B56BPLM3LXD5FB57CZP6OO3UDE/graph.json","events_json":"https://pith.science/api/pith-number/B56BPLM3LXD5FB57CZP6OO3UDE/events.json","paper":"https://pith.science/paper/B56BPLM3"},"agent_actions":{"view_html":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE","download_json":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE.json","view_paper":"https://pith.science/paper/B56BPLM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24878&json=true","fetch_graph":"https://pith.science/api/pith-number/B56BPLM3LXD5FB57CZP6OO3UDE/graph.json","fetch_events":"https://pith.science/api/pith-number/B56BPLM3LXD5FB57CZP6OO3UDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/action/storage_attestation","attest_author":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/action/author_attestation","sign_citation":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/action/citation_signature","submit_replication":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/action/replication_record"}},"created_at":"2026-06-24T01:15:45.199619+00:00","updated_at":"2026-06-24T01:15:45.199619+00:00"}