{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S2GEC35MI5BRSRDWVR5AL4FBMV","short_pith_number":"pith:S2GEC35M","schema_version":"1.0","canonical_sha256":"968c416fac4743194476ac7a05f0a16548e25fac707d195e4055ffa4d861b4b9","source":{"kind":"arxiv","id":"1812.00537","version":2},"attestation_state":"computed","paper":{"title":"A generalization of the Bollob\\'as set pairs inequality","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacques Verstraete, Jason O'Neill","submitted_at":"2018-12-03T03:18:32Z","abstract_excerpt":"The Bollob\\'as set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \\geq k \\geq t \\geq 2$, we consider a collection of $k$ families $\\mathcal{A}_i: 1 \\leq i \\leq k$ where $\\mathcal{A}_i = \\{ A_{i,j} \\subset [n] : j \\in [n] \\}$ so that $A_{1, i_1} \\cap \\cdots \\cap A_{k,i_k} \\neq \\emptyset $ if and only if there are at least $t$ distinct indices $i_1,i_2,\\dots,i_k$. Via a natural connection to a hypergraph covering problem, we give bounds on the maximum size $\\beta_{k,t}(n)$ of the families with ground set $[n]$."},"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":"1812.00537","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-12-03T03:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"4f1a386f1532975b4f99494750e93084b59a93be87b36c07e07a0ba4494ca190","abstract_canon_sha256":"123c8e21ef9c3de6b4c4965116a0a79cee1d2f3890bc7ee433ee00c11bb2ae7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:22.283903Z","signature_b64":"sKAlJtJ0ecnzd119oUWLt668RQFpcDxidrvdk2r3m7yZsE8QG+EVsTbZr8I9JVkEs9kB1GPorar0ST7JeyMRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"968c416fac4743194476ac7a05f0a16548e25fac707d195e4055ffa4d861b4b9","last_reissued_at":"2026-07-05T01:08:22.283460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:22.283460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of the Bollob\\'as set pairs inequality","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacques Verstraete, Jason O'Neill","submitted_at":"2018-12-03T03:18:32Z","abstract_excerpt":"The Bollob\\'as set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \\geq k \\geq t \\geq 2$, we consider a collection of $k$ families $\\mathcal{A}_i: 1 \\leq i \\leq k$ where $\\mathcal{A}_i = \\{ A_{i,j} \\subset [n] : j \\in [n] \\}$ so that $A_{1, i_1} \\cap \\cdots \\cap A_{k,i_k} \\neq \\emptyset $ if and only if there are at least $t$ distinct indices $i_1,i_2,\\dots,i_k$. Via a natural connection to a hypergraph covering problem, we give bounds on the maximum size $\\beta_{k,t}(n)$ of the families with ground set $[n]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00537","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/1812.00537/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":"1812.00537","created_at":"2026-07-05T01:08:22.283521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00537v2","created_at":"2026-07-05T01:08:22.283521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00537","created_at":"2026-07-05T01:08:22.283521+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2GEC35MI5BR","created_at":"2026-07-05T01:08:22.283521+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2GEC35MI5BRSRDW","created_at":"2026-07-05T01:08:22.283521+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2GEC35M","created_at":"2026-07-05T01:08:22.283521+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/S2GEC35MI5BRSRDWVR5AL4FBMV","json":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV.json","graph_json":"https://pith.science/api/pith-number/S2GEC35MI5BRSRDWVR5AL4FBMV/graph.json","events_json":"https://pith.science/api/pith-number/S2GEC35MI5BRSRDWVR5AL4FBMV/events.json","paper":"https://pith.science/paper/S2GEC35M"},"agent_actions":{"view_html":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV","download_json":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV.json","view_paper":"https://pith.science/paper/S2GEC35M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00537&json=true","fetch_graph":"https://pith.science/api/pith-number/S2GEC35MI5BRSRDWVR5AL4FBMV/graph.json","fetch_events":"https://pith.science/api/pith-number/S2GEC35MI5BRSRDWVR5AL4FBMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV/action/storage_attestation","attest_author":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV/action/author_attestation","sign_citation":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV/action/citation_signature","submit_replication":"https://pith.science/pith/S2GEC35MI5BRSRDWVR5AL4FBMV/action/replication_record"}},"created_at":"2026-07-05T01:08:22.283521+00:00","updated_at":"2026-07-05T01:08:22.283521+00:00"}