{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VXA3FS2XDN7VPTUEUYZW3HUPKJ","short_pith_number":"pith:VXA3FS2X","schema_version":"1.0","canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","source":{"kind":"arxiv","id":"2110.12708","version":2},"attestation_state":"computed","paper":{"title":"Maximal $3$-wise intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Lund, Casey Tompkins, Ce Chen, Haoran Luo, J\\'ozsef Balogh, Kevin Hendrey, Tuan Tran","submitted_at":"2021-10-25T07:40:16Z","abstract_excerpt":"A family $\\mathcal{F}$ on ground set $[n]:=\\{1,2,\\ldots, n\\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\\mathcal{F}$ has non-empty intersection, and no other set can be added to $\\mathcal{F}$ while maintaining this property. In 1974, Erd\\H{o}s and Kleitman asked for the minimum size of a maximal $k$-wise intersecting family. We answer their question for $k=3$ and sufficiently large $n$. We show that the unique minimum family is obtained by partitioning the ground set $[n]$ into two sets $A$ and $B$ with almost equal sizes and taking the family consisting of a"},"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":"2110.12708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"3e83fd575c192fa5b7b2685814f7fb36f3ed9fd7e869c923cc05aedc266b5cd8","abstract_canon_sha256":"cc9087ac70c28f0db89b5014a48e33c7fc9c2c867e04b434418d3a3cfc2fe58c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:25.438647Z","signature_b64":"XevvzUPNhD2vfGZyezM6F6UOkJGle6+bYLG8oAVtUV9BTDDgulnV+xSpiHmpt1TFiGlrDAba1rVvtcH8uxuBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","last_reissued_at":"2026-07-05T05:45:25.438196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:25.438196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal $3$-wise intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Lund, Casey Tompkins, Ce Chen, Haoran Luo, J\\'ozsef Balogh, Kevin Hendrey, Tuan Tran","submitted_at":"2021-10-25T07:40:16Z","abstract_excerpt":"A family $\\mathcal{F}$ on ground set $[n]:=\\{1,2,\\ldots, n\\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\\mathcal{F}$ has non-empty intersection, and no other set can be added to $\\mathcal{F}$ while maintaining this property. In 1974, Erd\\H{o}s and Kleitman asked for the minimum size of a maximal $k$-wise intersecting family. We answer their question for $k=3$ and sufficiently large $n$. We show that the unique minimum family is obtained by partitioning the ground set $[n]$ into two sets $A$ and $B$ with almost equal sizes and taking the family consisting of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12708","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/2110.12708/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":"2110.12708","created_at":"2026-07-05T05:45:25.438255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.12708v2","created_at":"2026-07-05T05:45:25.438255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12708","created_at":"2026-07-05T05:45:25.438255+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXA3FS2XDN7V","created_at":"2026-07-05T05:45:25.438255+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXA3FS2XDN7VPTUE","created_at":"2026-07-05T05:45:25.438255+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXA3FS2X","created_at":"2026-07-05T05:45:25.438255+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/VXA3FS2XDN7VPTUEUYZW3HUPKJ","json":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ.json","graph_json":"https://pith.science/api/pith-number/VXA3FS2XDN7VPTUEUYZW3HUPKJ/graph.json","events_json":"https://pith.science/api/pith-number/VXA3FS2XDN7VPTUEUYZW3HUPKJ/events.json","paper":"https://pith.science/paper/VXA3FS2X"},"agent_actions":{"view_html":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ","download_json":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ.json","view_paper":"https://pith.science/paper/VXA3FS2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.12708&json=true","fetch_graph":"https://pith.science/api/pith-number/VXA3FS2XDN7VPTUEUYZW3HUPKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VXA3FS2XDN7VPTUEUYZW3HUPKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/action/storage_attestation","attest_author":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/action/author_attestation","sign_citation":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/action/citation_signature","submit_replication":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/action/replication_record"}},"created_at":"2026-07-05T05:45:25.438255+00:00","updated_at":"2026-07-05T05:45:25.438255+00:00"}