{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WNWBILOS2XHTW36QYPGRC53NWA","short_pith_number":"pith:WNWBILOS","schema_version":"1.0","canonical_sha256":"b36c142dd2d5cf3b6fd0c3cd11776db032bcbe2224f62f579924c19e2c8ba029","source":{"kind":"arxiv","id":"1903.01872","version":1},"attestation_state":"computed","paper":{"title":"Fractional cross intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ritabrata Ray, Rogers Mathew, Shashank Srivastava","submitted_at":"2019-03-05T14:55:48Z","abstract_excerpt":"Let $\\mathcal{A}=\\{A_{1},...,A_{p}\\}$ and $\\mathcal{B}=\\{B_{1},...,B_{q}\\}$ be two families of subsets of $[n]$ such that for every $i\\in [p]$ and $j\\in [q]$, $|A_{i}\\cap B_{j}|= \\frac{c}{d}|B_{j}|$, where $\\frac{c}{d}\\in [0,1]$ is an irreducible fraction. We call such families \"$\\frac{c}{d}$-cross intersecting families\". In this paper, we find a tight upper bound for the product $|\\mathcal{A}||\\mathcal{B}|$ and characterize the cases when this bound is achieved for $\\frac{c}{d}=\\frac{1}{2}$. Also, we find a tight upper bound on $|\\mathcal{A}||\\mathcal{B}|$ when $\\mathcal{B}$ is $k$-uniform an"},"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":"1903.01872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T14:55:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d86a57588c610eb6730b313d121862b9b1655b633d284273c5253c6477028bd7","abstract_canon_sha256":"82b2b38baf5de300dc46abc08d4306dcdaeb3c09d4cf939701d41d4e2e8e0ec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.536071Z","signature_b64":"vQAdAFxHVMN/a8H/X22qzFajZR7bFl+A1ASH2kGsDW+8hEa4KLH/U4ODroE76nRij1e+CNzljXnTtDrRlJgXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36c142dd2d5cf3b6fd0c3cd11776db032bcbe2224f62f579924c19e2c8ba029","last_reissued_at":"2026-05-17T23:51:59.535660Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.535660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional cross intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ritabrata Ray, Rogers Mathew, Shashank Srivastava","submitted_at":"2019-03-05T14:55:48Z","abstract_excerpt":"Let $\\mathcal{A}=\\{A_{1},...,A_{p}\\}$ and $\\mathcal{B}=\\{B_{1},...,B_{q}\\}$ be two families of subsets of $[n]$ such that for every $i\\in [p]$ and $j\\in [q]$, $|A_{i}\\cap B_{j}|= \\frac{c}{d}|B_{j}|$, where $\\frac{c}{d}\\in [0,1]$ is an irreducible fraction. We call such families \"$\\frac{c}{d}$-cross intersecting families\". In this paper, we find a tight upper bound for the product $|\\mathcal{A}||\\mathcal{B}|$ and characterize the cases when this bound is achieved for $\\frac{c}{d}=\\frac{1}{2}$. Also, we find a tight upper bound on $|\\mathcal{A}||\\mathcal{B}|$ when $\\mathcal{B}$ is $k$-uniform an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01872","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":""},"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":"1903.01872","created_at":"2026-05-17T23:51:59.535721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01872v1","created_at":"2026-05-17T23:51:59.535721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01872","created_at":"2026-05-17T23:51:59.535721+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNWBILOS2XHT","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNWBILOS2XHTW36Q","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNWBILOS","created_at":"2026-05-18T12:33:30.264802+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/WNWBILOS2XHTW36QYPGRC53NWA","json":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA.json","graph_json":"https://pith.science/api/pith-number/WNWBILOS2XHTW36QYPGRC53NWA/graph.json","events_json":"https://pith.science/api/pith-number/WNWBILOS2XHTW36QYPGRC53NWA/events.json","paper":"https://pith.science/paper/WNWBILOS"},"agent_actions":{"view_html":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA","download_json":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA.json","view_paper":"https://pith.science/paper/WNWBILOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01872&json=true","fetch_graph":"https://pith.science/api/pith-number/WNWBILOS2XHTW36QYPGRC53NWA/graph.json","fetch_events":"https://pith.science/api/pith-number/WNWBILOS2XHTW36QYPGRC53NWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA/action/storage_attestation","attest_author":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA/action/author_attestation","sign_citation":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA/action/citation_signature","submit_replication":"https://pith.science/pith/WNWBILOS2XHTW36QYPGRC53NWA/action/replication_record"}},"created_at":"2026-05-17T23:51:59.535721+00:00","updated_at":"2026-05-17T23:51:59.535721+00:00"}