{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FDTBICA4JMAFIG72BUZDWCHZJ5","short_pith_number":"pith:FDTBICA4","schema_version":"1.0","canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","source":{"kind":"arxiv","id":"2411.13510","version":1},"attestation_state":"computed","paper":{"title":"Disjoint pairs in set systems and combinatorics of low rank matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","submitted_at":"2024-11-20T18:04:54Z","abstract_excerpt":"We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries.\n  - More than 40 years ago, Daykin and Erd\\H{o}s asked for the maximum number of disjoint pairs of sets in a family $F\\subseteq 2^{[n]}$ of size $2^{(1/2+\\delta)n}$ and conjectured it contains at most $o(|F|^2)$ such pairs. This was proven by Alon and Frankl in 1985. In this paper we completely resolve this problem, proving an optimal dependence of the number of disjoint pairs on the size of family $F$. We also prove the 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":"2411.13510","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T18:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"3109bcac8b592cc17f46bbbf03a355ac6337703977c65df24cbc63a1c7de7efd","abstract_canon_sha256":"a812272c36ccec64e6a116a8ce926b4ab81b5fd6f69243c1138c0bb3e6e2b5dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:18.413397Z","signature_b64":"AHZ/0YNtCKGRPkfJZ1ZMpmO4fX1cNnfCvnPYTswS8hAOdueA+vzLaefqrhyChabymLUTMV0AfwvVn6+wYvJRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","last_reissued_at":"2026-07-05T09:38:18.412915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:18.412915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint pairs in set systems and combinatorics of low rank matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","submitted_at":"2024-11-20T18:04:54Z","abstract_excerpt":"We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries.\n  - More than 40 years ago, Daykin and Erd\\H{o}s asked for the maximum number of disjoint pairs of sets in a family $F\\subseteq 2^{[n]}$ of size $2^{(1/2+\\delta)n}$ and conjectured it contains at most $o(|F|^2)$ such pairs. This was proven by Alon and Frankl in 1985. In this paper we completely resolve this problem, proving an optimal dependence of the number of disjoint pairs on the size of family $F$. We also prove the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13510","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/2411.13510/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":"2411.13510","created_at":"2026-07-05T09:38:18.412984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13510v1","created_at":"2026-07-05T09:38:18.412984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13510","created_at":"2026-07-05T09:38:18.412984+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDTBICA4JMAF","created_at":"2026-07-05T09:38:18.412984+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDTBICA4JMAFIG72","created_at":"2026-07-05T09:38:18.412984+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDTBICA4","created_at":"2026-07-05T09:38:18.412984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05661","citing_title":"Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5","json":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5.json","graph_json":"https://pith.science/api/pith-number/FDTBICA4JMAFIG72BUZDWCHZJ5/graph.json","events_json":"https://pith.science/api/pith-number/FDTBICA4JMAFIG72BUZDWCHZJ5/events.json","paper":"https://pith.science/paper/FDTBICA4"},"agent_actions":{"view_html":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5","download_json":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5.json","view_paper":"https://pith.science/paper/FDTBICA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13510&json=true","fetch_graph":"https://pith.science/api/pith-number/FDTBICA4JMAFIG72BUZDWCHZJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/FDTBICA4JMAFIG72BUZDWCHZJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/action/storage_attestation","attest_author":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/action/author_attestation","sign_citation":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/action/citation_signature","submit_replication":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/action/replication_record"}},"created_at":"2026-07-05T09:38:18.412984+00:00","updated_at":"2026-07-05T09:38:18.412984+00:00"}