{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B56BPLM3LXD5FB57CZP6OO3UDE","short_pith_number":"pith:B56BPLM3","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"},"canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","source":{"kind":"arxiv","id":"2606.24878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24878","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24878v1","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24878","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"B56BPLM3LXD5","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"B56BPLM3LXD5FB57","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"B56BPLM3","created_at":"2026-06-24T01:15:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B56BPLM3LXD5FB57CZP6OO3UDE","target":"record","payload":{"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"},"canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","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"},"source_kind":"arxiv","source_id":"2606.24878","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-06-24T01:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJDmdzRZd+Cj+rbYLJGiUOXcb0AfmxPy2MyfZZ1xUpp3s7YLiLpMGjj25ql4hH9mWB3wwE/aXXRfbRO52deHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:21:34.202038Z"},"content_sha256":"d8b8ddb0e1d599a8d218f98bf54b0c9278864d40c92f4825d61ea1751eaf79f6","schema_version":"1.0","event_id":"sha256:d8b8ddb0e1d599a8d218f98bf54b0c9278864d40c92f4825d61ea1751eaf79f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B56BPLM3LXD5FB57CZP6OO3UDE","target":"graph","payload":{"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"},"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-06-24T01:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAKJYhDHV8el9/KW0HOxHC16iMTW3CYBfLjXq+8AkYupRHFsUwGEtwroBj8vkkD1dA7o8lyntUE+GT+Y0LeZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:21:34.202423Z"},"content_sha256":"31e8bcceb1abad4ffe041afd485bf9655ce0bb27268925296d5d6ff68b3d6d8a","schema_version":"1.0","event_id":"sha256:31e8bcceb1abad4ffe041afd485bf9655ce0bb27268925296d5d6ff68b3d6d8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/bundle.json","state_url":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B56BPLM3LXD5FB57CZP6OO3UDE/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-07-07T10:21:34Z","links":{"resolver":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE","bundle":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/bundle.json","state":"https://pith.science/pith/B56BPLM3LXD5FB57CZP6OO3UDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B56BPLM3LXD5FB57CZP6OO3UDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B56BPLM3LXD5FB57CZP6OO3UDE","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":"0a58f15cb7110076d5d3361fee665220329a242563a192202825905329e3340e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:55:10Z","title_canon_sha256":"54e1dc10720b089359f6b95256c83cf134e237e9248e3c6cd7dfd431071d7d5b"},"schema_version":"1.0","source":{"id":"2606.24878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24878","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24878v1","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24878","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"B56BPLM3LXD5","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"B56BPLM3LXD5FB57","created_at":"2026-06-24T01:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"B56BPLM3","created_at":"2026-06-24T01:15:45Z"}],"graph_snapshots":[{"event_id":"sha256:31e8bcceb1abad4ffe041afd485bf9655ce0bb27268925296d5d6ff68b3d6d8a","target":"graph","created_at":"2026-06-24T01:15:45Z","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/2606.24878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Varun Sivashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:55:10Z","title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24878","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:d8b8ddb0e1d599a8d218f98bf54b0c9278864d40c92f4825d61ea1751eaf79f6","target":"record","created_at":"2026-06-24T01:15:45Z","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":"0a58f15cb7110076d5d3361fee665220329a242563a192202825905329e3340e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:55:10Z","title_canon_sha256":"54e1dc10720b089359f6b95256c83cf134e237e9248e3c6cd7dfd431071d7d5b"},"schema_version":"1.0","source":{"id":"2606.24878","kind":"arxiv","version":1}},"canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f7c17ad9b5dc7d287bf165fe73b741919ee3d7dc1c8c3c1061ca0bcf4e7abca","first_computed_at":"2026-06-24T01:15:45.199557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:45.199557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMfiy7seQnXFiwRt5aa/pueoQIqU2jntfHOLdmJhr8po3tfR5ZBtotvZX31ShN9lA/GJaPZz6nq3F+BnZJEWDQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:45.199951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b8ddb0e1d599a8d218f98bf54b0c9278864d40c92f4825d61ea1751eaf79f6","sha256:31e8bcceb1abad4ffe041afd485bf9655ce0bb27268925296d5d6ff68b3d6d8a"],"state_sha256":"c60acf4c28d58e8364bf937a219ff1712fe683d80b119f6cd2ad9e605a6cdb6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oUbPUoPmqVnARv1ogWzYhs93PVwsFKQ1/BFBvGzKataMvPjixtOFyEhQarUlrBlrCeFVfqhtksnslTe5zFPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:21:34.204579Z","bundle_sha256":"fcc498cbb67e2e463d20bd3d25cad1d5e121331f56326781a57d0c7a92aaf68f"}}