{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FDTBICA4JMAFIG72BUZDWCHZJ5","short_pith_number":"pith:FDTBICA4","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"},"canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","source":{"kind":"arxiv","id":"2411.13510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13510","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13510v1","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13510","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"FDTBICA4JMAF","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_16","alias_value":"FDTBICA4JMAFIG72","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_8","alias_value":"FDTBICA4","created_at":"2026-07-05T09:38:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FDTBICA4JMAFIG72BUZDWCHZJ5","target":"record","payload":{"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"},"canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","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"},"source_kind":"arxiv","source_id":"2411.13510","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-07-05T09:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mq8SGd/nQIh6KUzvCLujBp5/jhmiUF4R2/B0E2mlQLZ1CJe7+qYPLQZJHLZpN1dBrGt4GiPpUD90F6QQSwV+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T18:29:34.201911Z"},"content_sha256":"9850cc96b677897f554664ae72be73ef17ccd65fb42decef890919686e2aa70e","schema_version":"1.0","event_id":"sha256:9850cc96b677897f554664ae72be73ef17ccd65fb42decef890919686e2aa70e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FDTBICA4JMAFIG72BUZDWCHZJ5","target":"graph","payload":{"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"},"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-07-05T09:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqcj3WmHgolgFMTtME0qLqIFpbvUmc7dpqjoAY5neRsyzVWtLELgOCF5MUuvhI9X7zQkjNf/NrFcv7CH9I0TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T18:29:34.202571Z"},"content_sha256":"7c01edde0cdb63f6b39efb07edb85f92ea9220924d37b6a01b58b707554ac902","schema_version":"1.0","event_id":"sha256:7c01edde0cdb63f6b39efb07edb85f92ea9220924d37b6a01b58b707554ac902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/bundle.json","state_url":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/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-08-09T18:29:34Z","links":{"resolver":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5","bundle":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/bundle.json","state":"https://pith.science/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDTBICA4JMAFIG72BUZDWCHZJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FDTBICA4JMAFIG72BUZDWCHZJ5","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":"a812272c36ccec64e6a116a8ce926b4ab81b5fd6f69243c1138c0bb3e6e2b5dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T18:04:54Z","title_canon_sha256":"3109bcac8b592cc17f46bbbf03a355ac6337703977c65df24cbc63a1c7de7efd"},"schema_version":"1.0","source":{"id":"2411.13510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13510","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13510v1","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13510","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"FDTBICA4JMAF","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_16","alias_value":"FDTBICA4JMAFIG72","created_at":"2026-07-05T09:38:18Z"},{"alias_kind":"pith_short_8","alias_value":"FDTBICA4","created_at":"2026-07-05T09:38:18Z"}],"graph_snapshots":[{"event_id":"sha256:7c01edde0cdb63f6b39efb07edb85f92ea9220924d37b6a01b58b707554ac902","target":"graph","created_at":"2026-07-05T09:38:18Z","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/2411.13510/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T18:04:54Z","title":"Disjoint pairs in set systems and combinatorics of low rank matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13510","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:9850cc96b677897f554664ae72be73ef17ccd65fb42decef890919686e2aa70e","target":"record","created_at":"2026-07-05T09:38:18Z","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":"a812272c36ccec64e6a116a8ce926b4ab81b5fd6f69243c1138c0bb3e6e2b5dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T18:04:54Z","title_canon_sha256":"3109bcac8b592cc17f46bbbf03a355ac6337703977c65df24cbc63a1c7de7efd"},"schema_version":"1.0","source":{"id":"2411.13510","kind":"arxiv","version":1}},"canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e614081c4b00541bfa0d323b08f94f5f6391cc58131632973a2b1acb900098","first_computed_at":"2026-07-05T09:38:18.412915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:18.412915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AHZ/0YNtCKGRPkfJZ1ZMpmO4fX1cNnfCvnPYTswS8hAOdueA+vzLaefqrhyChabymLUTMV0AfwvVn6+wYvJRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:18.413397Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9850cc96b677897f554664ae72be73ef17ccd65fb42decef890919686e2aa70e","sha256:7c01edde0cdb63f6b39efb07edb85f92ea9220924d37b6a01b58b707554ac902"],"state_sha256":"15bc388beca8b02557f06ed8dc3b2de30092122f1a81cfd88bfd32d9e90a2e8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMGeP+hd2ZOjlTQLDjak3rfvl6io5sE6peZS0gaQEz9MKtBgmIuUJPDiw1u3uTVH10VHobVEDRRi/6QJI7CmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T18:29:34.206159Z","bundle_sha256":"73b8f3db9c215c31f9e7f46746496815689974a1e2a1848d0acf55a3d22f2edd"}}