{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FSXZNSC73ZZHK5WQOCU2NJSNOB","short_pith_number":"pith:FSXZNSC7","schema_version":"1.0","canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","source":{"kind":"arxiv","id":"1804.01026","version":1},"attestation_state":"computed","paper":{"title":"On set systems without a simplex-cluster and the Junta method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noam Lifshitz","submitted_at":"2018-04-03T15:10:56Z","abstract_excerpt":"A family $\\{A_{0},\\ldots,A_{d}\\}$ of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$ is called a simplex-cluster if $A_{0}\\cap\\cdots\\cap A_{d}=\\varnothing$, $|A_{0}\\cup\\cdots\\cup A_{d}|\\le2k$, and the intersection of any $d$ of the sets in $\\{A_{0},\\ldots,A_{d}\\}$ is nonempty. In 2006, Keevash and Mubayi conjectured that for any $d+1\\le k\\le\\frac{d}{d+1}n$, the largest family of $k$-element subsets of $[n]$ that does not contain a simplex-cluster is the family of all $k$-subsets that contain a given element. We prove the conjecture for all $k\\ge\\zeta n$ for an arbitrarily small $\\zeta>0$, provid"},"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":"1804.01026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"5d7d8314da8c662389e3f54e95d88a3470ff8d438b4b0ccd92074b4fcddb9d81","abstract_canon_sha256":"46d6aa7cb72b56eb086c31e90b8d5feb795260da8427261f36e8280ed0426d49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.516651Z","signature_b64":"Bx62iWJkkOq2qp/oYfV7NHKlrRGr9hrdrkesvn43RyRvB0YN5/7MoKFm1fRluphm2BvFbrKX7fmmLw9zHkvsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","last_reissued_at":"2026-05-18T00:19:31.516182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.516182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On set systems without a simplex-cluster and the Junta method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noam Lifshitz","submitted_at":"2018-04-03T15:10:56Z","abstract_excerpt":"A family $\\{A_{0},\\ldots,A_{d}\\}$ of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$ is called a simplex-cluster if $A_{0}\\cap\\cdots\\cap A_{d}=\\varnothing$, $|A_{0}\\cup\\cdots\\cup A_{d}|\\le2k$, and the intersection of any $d$ of the sets in $\\{A_{0},\\ldots,A_{d}\\}$ is nonempty. In 2006, Keevash and Mubayi conjectured that for any $d+1\\le k\\le\\frac{d}{d+1}n$, the largest family of $k$-element subsets of $[n]$ that does not contain a simplex-cluster is the family of all $k$-subsets that contain a given element. We prove the conjecture for all $k\\ge\\zeta n$ for an arbitrarily small $\\zeta>0$, provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01026","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":"1804.01026","created_at":"2026-05-18T00:19:31.516250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01026v1","created_at":"2026-05-18T00:19:31.516250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01026","created_at":"2026-05-18T00:19:31.516250+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSXZNSC73ZZH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSXZNSC73ZZHK5WQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSXZNSC7","created_at":"2026-05-18T12:32:25.280505+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/FSXZNSC73ZZHK5WQOCU2NJSNOB","json":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB.json","graph_json":"https://pith.science/api/pith-number/FSXZNSC73ZZHK5WQOCU2NJSNOB/graph.json","events_json":"https://pith.science/api/pith-number/FSXZNSC73ZZHK5WQOCU2NJSNOB/events.json","paper":"https://pith.science/paper/FSXZNSC7"},"agent_actions":{"view_html":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB","download_json":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB.json","view_paper":"https://pith.science/paper/FSXZNSC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01026&json=true","fetch_graph":"https://pith.science/api/pith-number/FSXZNSC73ZZHK5WQOCU2NJSNOB/graph.json","fetch_events":"https://pith.science/api/pith-number/FSXZNSC73ZZHK5WQOCU2NJSNOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/action/storage_attestation","attest_author":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/action/author_attestation","sign_citation":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/action/citation_signature","submit_replication":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/action/replication_record"}},"created_at":"2026-05-18T00:19:31.516250+00:00","updated_at":"2026-05-18T00:19:31.516250+00:00"}