{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UAXP6VZ7DEBTJ4FIZZ7O4TG2QE","short_pith_number":"pith:UAXP6VZ7","schema_version":"1.0","canonical_sha256":"a02eff573f190334f0a8ce7eee4cda810cee5d8416f3a56034ae730854748ace","source":{"kind":"arxiv","id":"2503.14918","version":2},"attestation_state":"computed","paper":{"title":"Intersecting hypergraphs with large cover number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matija Buci\\'c, Vanshika Jain, Varun Sivashankar","submitted_at":"2025-03-19T05:53:07Z","abstract_excerpt":"In their famous 1974 paper introducing the local lemma, Erd\\H{o}s and Lov\\'asz posed a question-later referred by Erd\\H{o}s as one of his three favorite open problems: What is the minimum number of edges in an $r$-uniform, intersecting hypergraph with cover number $r$? This question was solved up to a constant factor in Kahn's remarkable 1994 paper. More recently, motivated by applications to Bollob\\'as' ''power of many colours'' problem, Alon, Buci\\'c, Christoph, and Krivelevich introduced a natural generalization by imposing a space constraint that limits the hypergraph to use only $n$ verti"},"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":"2503.14918","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T05:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"1fda5cd1a48a9a86c8c274b0086fb8bdfe3058f7ec7b732ba74036dcd0a06cbf","abstract_canon_sha256":"80b80d4fb22b5a7459ba8f1b400ed929a69253ae602688ce9996e696e1b861b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:58.072662Z","signature_b64":"W05HQjaid7J7gi9A6RSc/i45SU48sA937x2aL0L9hdan3yQfdbnxdugHYCpwQIpzJ3DEUNDiLRTbCPX8UHXGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a02eff573f190334f0a8ce7eee4cda810cee5d8416f3a56034ae730854748ace","last_reissued_at":"2026-07-05T10:48:58.072160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:58.072160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersecting hypergraphs with large cover number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matija Buci\\'c, Vanshika Jain, Varun Sivashankar","submitted_at":"2025-03-19T05:53:07Z","abstract_excerpt":"In their famous 1974 paper introducing the local lemma, Erd\\H{o}s and Lov\\'asz posed a question-later referred by Erd\\H{o}s as one of his three favorite open problems: What is the minimum number of edges in an $r$-uniform, intersecting hypergraph with cover number $r$? This question was solved up to a constant factor in Kahn's remarkable 1994 paper. More recently, motivated by applications to Bollob\\'as' ''power of many colours'' problem, Alon, Buci\\'c, Christoph, and Krivelevich introduced a natural generalization by imposing a space constraint that limits the hypergraph to use only $n$ verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14918","kind":"arxiv","version":2},"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/2503.14918/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":"2503.14918","created_at":"2026-07-05T10:48:58.072217+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14918v2","created_at":"2026-07-05T10:48:58.072217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14918","created_at":"2026-07-05T10:48:58.072217+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAXP6VZ7DEBT","created_at":"2026-07-05T10:48:58.072217+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAXP6VZ7DEBTJ4FI","created_at":"2026-07-05T10:48:58.072217+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAXP6VZ7","created_at":"2026-07-05T10:48:58.072217+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24878","citing_title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE","json":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE.json","graph_json":"https://pith.science/api/pith-number/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/graph.json","events_json":"https://pith.science/api/pith-number/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/events.json","paper":"https://pith.science/paper/UAXP6VZ7"},"agent_actions":{"view_html":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE","download_json":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE.json","view_paper":"https://pith.science/paper/UAXP6VZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14918&json=true","fetch_graph":"https://pith.science/api/pith-number/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/graph.json","fetch_events":"https://pith.science/api/pith-number/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/action/storage_attestation","attest_author":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/action/author_attestation","sign_citation":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/action/citation_signature","submit_replication":"https://pith.science/pith/UAXP6VZ7DEBTJ4FIZZ7O4TG2QE/action/replication_record"}},"created_at":"2026-07-05T10:48:58.072217+00:00","updated_at":"2026-07-05T10:48:58.072217+00:00"}